首页> 外文会议>International Conference on Automation, Mechanical Control and Computational Engineering >A Genetic Algorithm for Solving a Class of Multi-objective Bilevel Programming Problems
【24h】

A Genetic Algorithm for Solving a Class of Multi-objective Bilevel Programming Problems

机译:一种求解一类多目标贝韦尔编程问题的遗传算法

获取原文

摘要

At present, most of the researches on bilevel programming problems are focused on single objective cases. This paper discusses a bilevel programming problem with upper level multi-objective optimization. In order to solve the problem efficiently, we present a genetic algorithm using interpolation. This method does not require solving lower optimization problem frequently. In the proposed algorithm, firstly, the interpolation functions are adopted to approximate lower level solution functions. As a result, the original problem can be approximated by a single-level multi-objective programming. In addition, the corresponding interpolation functions are updated such that these functions can approximate the lower level solution function very well. Finally, the multi-objective programming is solved for obtaining an optimal solution set of the original problem. The simulation on two examples indicates the proposed algorithm is effective and feasible.
机译:目前,大多数关于Bilevel编程问题的研究都集中在单身客观案件上。本文讨论了具有上层多目标优化的双层编程问题。为了有效地解决问题,我们呈现了使用插值的遗传算法。该方法通常不需要频繁解决较低的优化问题。在所提出的算法中,首先,采用插值函数来近似较低级别解决方案函数。结果,原始问题可以通过单级多客目标编程来近似。另外,更新相应的插值函数,使得这些功能可以很好地近似较低级别的解决方案。最后,解决了多目标编程,用于获得原始问题的最佳解决方案集。两个示例的仿真表示所提出的算法是有效和可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号