郭晓芳;李和成
【期刊名称】《计算机应用》 【年(卷),期】2015(000)0z1
【摘 要】For a class of bilevel programming problems with interval coefficients, in which the upper-level problem is linear, whereas the lower-level problem is a linear fractional program, a genetic algorithm was presented by taking the coefficient intervals as the searching space. Firstly, individuals could be gotten by encoding the lower-level objective coefficients such that the original problem could be transformed into certain bilevel programs for each encoded individual; in addition, the optimality results were used to solve these certain problems; finally, the best and the worst solutions could be obtained by evolving the
coefficients of the lower level objective. The simulation results show that the proposed algorithm is feasible and efficient.%针对一类上层为线性规划、下层为线性分式规划的区间系数双层规划问题,提出了一种基于系数取值区间搜索的遗传算法。首先,对下层目标系数进行个体编码,使得对每一编码个体,原问题被转化为确定的双层规划问题;其次,利用分式规划的最优性条件求解得到确定性问题;最后,算法通过不断进化下层目标系数找到最好最优解和最差最优解。数值仿真结果表明,该算法是可行并有效的。 【总页数】4页(P98-100,109) 【作 者】郭晓芳;李和成
【作者单位】青海师范大学 数学系,西宁810008;青海师范大学 数学系,西宁810008
【正文语种】中 文 【中图分类】TP18 【相关文献】
1.求解一类非线性双层规划问题的改进层次型遗传算法 [J], 苏凯;牛玉广 2.一类区间系数二次双层规划问题的遗传算法 [J], 李向东;李和成 3.一类区间系数线性双层规划问题的遗传算法 [J], 樊扬扬;李和成 4.基于可信度法求解区间双层线性规划问题 [J], 任爱红
5.一类带区间系数的分式双层规划问题的遗传算法 [J], 郭晓芳;李向东;;
因版权原因,仅展示原文概要,查看原文内容请购买
因篇幅问题不能全部显示,请点此查看更多更全内容
Copyright © 2019- igbc.cn 版权所有 湘ICP备2023023988号-5
违法及侵权请联系:TEL:199 1889 7713 E-MAIL:2724546146@qq.com
本站由北京市万商天勤律师事务所王兴未律师提供法律服务