A Hybrid Evolutionary Algorithm for Multiobjective Optimization

被引:0
作者
Ahn, Chang Wook [2 ]
Kim, Hyun-Tae [2 ]
Kim, Yehoon [3 ]
An, Jinung [1 ]
机构
[1] Daegu Gyeongbuk Inst Sci & Technol, Pragmat Appl Robot Inst, Taegu, South Korea
[2] Sungkyunkwan Univ, Sch Informat & Commun Engn, Suwon 440746, South Korea
[3] Korea Adv Inst & Technol, Elect Engn, Daedeok Innopolis, South Korea
来源
2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS | 2009年
关键词
multiobjective optimization; evolutionary algorithm; weighted fitness; local search; proximity; diversity; GENETIC ALGORITHM; LOCAL SEARCH;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a hybrid evolutionary algorithm that efficiently solves multiobjective optimization problems. The idea is to bring the strength of adaptive local search (ALS) to bear upon the realm of multiobjective evolutionary optimization. The ALS is developed by harmonizing a weighted fitness policy with a restricted mutation: it applies mutation only to a set of superior individuals in accordance with the weighted fitness values. It economizes search time and efficiently traverses the problem space in the vicinity of the most-likely and least-crowded solutions. Thus, it helps achieve higher proximity and better diversity of nondominated solutions. Empirical results support the effectiveness of the proposed approach.
引用
收藏
页码:19 / +
页数:2
相关论文
共 9 条
[1]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[2]   A multi-objective genetic local search algorithm and its application to flowshop scheduling [J].
Ishibuchi, H ;
Murata, T .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 1998, 28 (03) :392-403
[3]  
Ishibuchi H, 2003, LECT NOTES COMPUT SC, V2723, P1065
[4]   Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling [J].
Ishibuchi, H ;
Yoshida, T ;
Murata, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :204-223
[5]  
Leung KS, 2003, LECT NOTES COMPUT SC, V2723, P1160
[6]  
Li H, 2004, LECT NOTES COMPUT SC, V3004, P145
[7]  
SRINIVAS N, 1995, EVOLUTIONARY COMPUTA, V3, P221
[8]   Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach [J].
Zitzler, E ;
Thiele, L .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 1999, 3 (04) :257-271
[9]  
Zitzler E., 2001, TIK-Rep. 103