Guidance in evolutionary multi-objective optimization

被引:230
作者
Branke, J [1 ]
Kaussler, T [1 ]
Schmeck, H [1 ]
机构
[1] Univ Karlsruhe, Inst AIFB, D-76128 Karlsruhe, Germany
关键词
evolutionary algorithm; multiple objectives; Pareto optimal; preferences; guidance;
D O I
10.1016/S0965-9978(00)00110-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many real world design problems involve multiple, usually conflicting optimization criteria. Often, it is very difficult to weight the criteria exactly before alternatives are known. Multi-Objective Evolutionary Algorithms based on the principle of Pareto optimality are designed to explore the complete set of non-dominated solutions, which then allows the user to choose among many alternatives. However, although it is very difficult to exactly define the weighting of different optimization criteria, usually the user has some notion as to what range of weightings might be reasonable. In this paper, we present a novel, simple, and intuitive way to integrate the user's preference into the evolutionary algorithm by allowing to define linear maximum and minimum trade-off functions. On a number of test problems we show that the proposed algorithm efficiently guides the population towards the interesting region, allowing a faster convergence and a better coverage of this area of the Pareto optimal front. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:499 / 507
页数:9
相关论文
共 7 条
[1]  
Srinivas N., 1994, Evolutionary Computation, V2, P221, DOI 10.1162/evco.1994.2.3.221
[2]  
Todd DS, 1999, GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P1738
[3]  
Van Veldhuizen DA, 2000, EVOL COMPUT, V8, P125, DOI 10.1162/106365600568158
[4]  
[No title captured]
[5]  
[No title captured]
[6]  
[No title captured]
[7]  
[No title captured]