MOEA/D for flowshop scheduling problems

Author

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

Author_Institution

Dept. of Inf. Manage., Yuan-Ze Univ., Jhongli

fYear

2008

fDate

1-6 June 2008

Firstpage

1433

Lastpage

1438

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.

Keywords

Pareto optimisation; evolutionary computation; flow shop scheduling; NSGA II; SPEA 2; benchmark flowshop-scheduling instances; decomposition methods; multiobjective evolutionary algorithms; Chebyshev approximation; Engineering management; Evolutionary computation; Industrial engineering; Information management; Mathematical programming; Pareto optimization; Quality management; Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-1822-0

Electronic_ISBN

978-1-4244-1823-7

Type

conf

DOI

10.1109/CEC.2008.4630982

Filename

4630982