MOEA/D for flowshop scheduling problems

Pei Chann Chang; Shih Hsin Chen; Qingfu Zhang; Jun Lin Lin

doi:10.1109/CEC.2008.4630982

MOEA/D for flowshop scheduling problems

Pei Chann Chang, Shih Hsin Chen, Qingfu Zhang, Jun Lin Lin

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

84 Citations (Scopus)

Abstract

Many multiobjective evolutionary algorithms are based Pareto domination, among them NSGA II and SPEA 2 are two very popular ones. MOEA/D is a very recent multiobjective evolutionary algorithm using decomposition. In this paper, we implement MOEA/D for multi-objective flowshop scheduling problems. We study the replacement strategy of neighboring solutions, the determination of the reference point, and compare different decomposition methods. Experimental results demonstrate that MOEA/D outperforms NSGA II and SPEA 2 significantly for the 2-objective and 3-objective benchmark flowshop-scheduling instances. © 2008 IEEE.

Original language	English
Title of host publication	2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages	1433-1438
DOIs	https://doi.org/10.1109/CEC.2008.4630982
Publication status	Published - 2008
Externally published	Yes
Event	2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong Convention and Exhibition Centre, Hong Kong, China Duration: 1 Jun 2008 → 6 Jun 2008

Conference

Conference	2008 IEEE Congress on Evolutionary Computation, CEC 2008
Country/Territory	China
City	Hong Kong
Period	1/06/08 → 6/06/08

Access Output

10.1109/CEC.2008.4630982

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{9a4fcba22320421d8cf406c05b3179c3,

title = "MOEA/D for flowshop scheduling problems",

abstract = "Many multiobjective evolutionary algorithms are based Pareto domination, among them NSGA II and SPEA 2 are two very popular ones. MOEA/D is a very recent multiobjective evolutionary algorithm using decomposition. In this paper, we implement MOEA/D for multi-objective flowshop scheduling problems. We study the replacement strategy of neighboring solutions, the determination of the reference point, and compare different decomposition methods. Experimental results demonstrate that MOEA/D outperforms NSGA II and SPEA 2 significantly for the 2-objective and 3-objective benchmark flowshop-scheduling instances. {\textcopyright} 2008 IEEE.",

author = "Chang, {Pei Chann} and Chen, {Shih Hsin} and Qingfu Zhang and Lin, {Jun Lin}",

year = "2008",

doi = "10.1109/CEC.2008.4630982",

language = "English",

isbn = "9781424418237",

pages = "1433--1438",

booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

note = "2008 IEEE Congress on Evolutionary Computation, CEC 2008 ; Conference date: 01-06-2008 Through 06-06-2008",

}

TY - GEN

T1 - MOEA/D for flowshop scheduling problems

AU - Chang, Pei Chann

AU - Chen, Shih Hsin

AU - Zhang, Qingfu

AU - Lin, Jun Lin

PY - 2008

Y1 - 2008

N2 - Many multiobjective evolutionary algorithms are based Pareto domination, among them NSGA II and SPEA 2 are two very popular ones. MOEA/D is a very recent multiobjective evolutionary algorithm using decomposition. In this paper, we implement MOEA/D for multi-objective flowshop scheduling problems. We study the replacement strategy of neighboring solutions, the determination of the reference point, and compare different decomposition methods. Experimental results demonstrate that MOEA/D outperforms NSGA II and SPEA 2 significantly for the 2-objective and 3-objective benchmark flowshop-scheduling instances. © 2008 IEEE.

AB - Many multiobjective evolutionary algorithms are based Pareto domination, among them NSGA II and SPEA 2 are two very popular ones. MOEA/D is a very recent multiobjective evolutionary algorithm using decomposition. In this paper, we implement MOEA/D for multi-objective flowshop scheduling problems. We study the replacement strategy of neighboring solutions, the determination of the reference point, and compare different decomposition methods. Experimental results demonstrate that MOEA/D outperforms NSGA II and SPEA 2 significantly for the 2-objective and 3-objective benchmark flowshop-scheduling instances. © 2008 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=55749105522&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-55749105522&origin=recordpage

U2 - 10.1109/CEC.2008.4630982

DO - 10.1109/CEC.2008.4630982

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424418237

SP - 1433

EP - 1438

BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

T2 - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

Y2 - 1 June 2008 through 6 June 2008

ER -

MOEA/D for flowshop scheduling problems

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this