Chang, Pei Chann and Chen, Shih Hsin and Zhang, Qingfu and Lin, Jun Lin (2008) MOEA/D for flowshop scheduling problems. In: 2008 IEEE Congress on Evolutionary Computation (CEC), 2008-06-01 - 2008-06-06.
Chang, Pei Chann and Chen, Shih Hsin and Zhang, Qingfu and Lin, Jun Lin (2008) MOEA/D for flowshop scheduling problems. In: 2008 IEEE Congress on Evolutionary Computation (CEC), 2008-06-01 - 2008-06-06.
Chang, Pei Chann and Chen, Shih Hsin and Zhang, Qingfu and Lin, Jun Lin (2008) MOEA/D for flowshop scheduling problems. In: 2008 IEEE Congress on Evolutionary Computation (CEC), 2008-06-01 - 2008-06-06.
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Published proceedings: 2008 IEEE Congress on Evolutionary Computation, CEC 2008 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 15 Aug 2012 14:26 |
| Last Modified: | 24 Oct 2024 21:45 |
| URI: | http://repository.essex.ac.uk/id/eprint/1980 |