【作者】 李和成； 王宇平；

【Author】 Li Hecheng~1,Yuping Wang~2 1.Department of Mathematics,Qinghai Normal University,Xining 810008,China 2.School of Computer Science and Technology,Xidian University,Xi’an 710071,China

【机构】 青海师范大学数学系； 西安电子科技大学计算机学院；

【摘要】 利用线性双层规划的最优性条件,提出了一个基于极点搜索的遗传算法.首先,利用线性约束条件编码个体并计算约束域的顶点;其次,构造了一个简化的线性规划来验证顶点的可行性并区分可行点和不可行点;最后,通过算例演示了算法的可行性和有效性.更多还原

【Abstract】 Based on the optimization conditions of linear bilevel programming,a genetic algorithm using vertex searching is proposed.Firstly,individuals are encoded by selecting some constraints,and by which the corresponding vertices of constraint region are computed.Secondly,a simplified linear programming is constructed to verify whether a point is bilevel feasible,as a result,feasible points can be identified from infeasible points.Finally,an example is solved to illustrate that the proposed algorithm is feasible and efficient.更多还原