期刊
ENGINEERING OPTIMIZATION
卷 46, 期 3, 页码 361-376出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/0305215X.2013.772601
关键词
co-evolutionary algorithm; bilevel programming problems; approximate solutions; optimal solutions
资金
- National Natural Science Foundation of China [61065009]
- Natural Science Foundation of Qinghai Province [2011-z-756]
The bilevel programming problem involves two optimization problems, which is hierarchical, strongly NP-hard and very challenging for most existing optimization approaches. An efficient universal co-evolutionary algorithm is developed in this article to deal with various bilevel programming problems. In the proposed algorithm, evolutionary algorithms are used to explore the leader's and the follower's decision-making spaces interactively. Unlike other existing approaches, in the suggested procedure the follower's problem is solved in two phases. First, an evolutionary algorithm is run for a few generations to obtain an approximation of lower level solutions. In the second phase, from all approximate solutions obtained above, only a small number of good points are selected and evolved again by a newly designed multi-criteria evolutionary algorithm. The technique refines some candidate solutions and can efficiently reduce the computational cost of obtaining feasible solutions. Proof-of-principle experiments demonstrate the efficiency of the proposed approach.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据