Peng, Wei and Zhang, Qingfu and Li, Hui (2009) Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem. Studies in Computational Intelligence, 171. pp. 309-324. DOI https://doi.org/10.1007/978-3-540-88051-6_14
Peng, Wei and Zhang, Qingfu and Li, Hui (2009) Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem. Studies in Computational Intelligence, 171. pp. 309-324. DOI https://doi.org/10.1007/978-3-540-88051-6_14
Peng, Wei and Zhang, Qingfu and Li, Hui (2009) Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem. Studies in Computational Intelligence, 171. pp. 309-324. DOI https://doi.org/10.1007/978-3-540-88051-6_14
Abstract
Most multiobjective evolutionary algorithms are based on Pareto dominance for measuring the quality of solutions during their search, among them NSGA-II is well-known. A very few algorithms are based on decomposition and implicitly or explicitly try to optimize aggregations of the objectives. MOEA/D is a very recent such an algorithm. One of the major advantages of MOEA/D is that it is very easy to design local search operator within it using well-developed single-objective optimization algorithms. This chapter compares the performance of MOEA/D and NSGA-II on the multiobjective travelling salesman problem and studies the effect of local search on the performance of MOEA/D. © 2009 Springer-Verlag Berlin Heidelberg.
| Item Type: | Article |
|---|---|
| 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:50 |
| Last Modified: | 24 Oct 2024 21:45 |
| URI: | http://repository.essex.ac.uk/id/eprint/1982 |