Multi-objective optimization using genetic algorithms: A tutorial

被引:2335
作者
Konak, Abdullah
Coit, David W.
Smith, Alice E.
机构
[1] Rutgers State Univ, Dept Ind & Syst Engn, Piscataway, NJ 08855 USA
[2] Auburn Univ, Dept Ind & Syst Engn, Auburn, AL 36849 USA
关键词
D O I
10.1016/j.ress.2005.11.018
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Multi-objective formulations are realistic models for many complex engineering optimization problems. In many real-life problems, objectives under consideration conflict with each other, and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other objectives. A reasonable solution to a multi-objective problem is to investigate a set of solutions, each of which satisfies the objectives at an acceptable level without being dominated by any other solution. In this paper, an overview and tutorial is presented describing genetic algorithms (GA) developed specifically for problems with multiple objectives. They differ primarily from traditional GA by using specialized fitness functions and introducing methods to promote solution diversity. (C) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码:992 / 1007
页数:16
相关论文
共 64 条
[1]  
[Anonymous], 2000, PARETO ENVELOPE BASE
[2]  
[Anonymous], 1975, Ann Arbor
[3]  
[Anonymous], 1999, SURVEY CONSTRAINT HA
[4]  
[Anonymous], 1995, P 1995 IEEE INT C EV
[5]  
[Anonymous], 1987, GENETIC ALGORITHMS T
[6]  
[Anonymous], 2001, P GEN EV COMP C
[7]  
[Anonymous], 1993, MULTIOBJECTIVE GENET
[8]  
Coello C. A. C., 1999, Knowledge and Information Systems, V1, P269
[9]  
Coello C.A.C., 1999, P 1999 C EV COMP CEC
[10]   Constraint-handling in genetic algorithms through the use of dominance-based tournament selection [J].
Coello, CAC ;
Montes, EM .
ADVANCED ENGINEERING INFORMATICS, 2002, 16 (03) :193-203