The Performance of a New Version of MOEA/D on CEC09 Unconstrained MOP Test Instances

被引:463
作者
Zhang, Qingfu [1 ]
Liu, Wudong [1 ]
Li, Hui [2 ]
机构
[1] Univ Essex, Sch Comp Sci & Elect Engn, Colchester CO4 3SQ, Essex, England
[2] Univ Nottingham, Dept Comp Sci, Nottingham NG8 1BB, England
来源
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5 | 2009年
关键词
MOEA/D; Test problems; Multiobjective optimization; GENETIC LOCAL SEARCH; ALGORITHM;
D O I
10.1109/CEC.2009.4982949
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes the idea of MOEA/D and proposes a strategy for allocating the computational resource to different subproblems in MOEA/D. The new version of MOEA/D has been tested on all the CEC09 unconstrained MOP test instances.
引用
收藏
页码:203 / +
页数:5
相关论文
共 15 条
  • [1] [Anonymous], CES489 U ESS SCH COM
  • [2] MOEA/D for Flowshop Scheduling Problems
    Chang, Pei Chann
    Chen, Shih Hsin
    Zhang, Qingfu
    Lin, Jun Lin
    [J]. 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1433 - +
  • [3] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [4] Hughes EJ, 2003, IEEE C EVOL COMPUTAT, P2678
  • [5] A multi-objective genetic local search algorithm and its application to flowshop scheduling
    Ishibuchi, H
    Murata, T
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 1998, 28 (03): : 392 - 403
  • [6] Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
    Ishibuchi, H
    Yoshida, T
    Murata, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) : 204 - 223
  • [7] ISHIBUCHI H, 2009, P 5 INT C DEV EV MUL
  • [9] Knowles J., 1999, P 1999 C EV COMP CEC, V1, P98, DOI DOI 10.1109/CEC.1999.781913
  • [10] LI H, 2009, IEEE T EVOL IN PRESS