Comparison between MOEA/D and NSGA-II on the multi-objective travelling salesman problem

Wei Peng; Qingfu Zhang; Hui Li

doi:10.1007/978-3-540-88051-6_14

Comparison between MOEA/D and NSGA-II on the multi-objective travelling salesman problem

Wei Peng
, Qingfu Zhang
, Hui Li

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

75 Scopus citations

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.

Original language	English
Title of host publication	Multi-Objective Memetic Algorithms
Editors	Chi-Keong Goh, Kay Chen Tan, Yew-Soon Ong
Pages	309-324
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-540-88051-6_14
State	Published - 2009
Externally published	Yes

Publication series

Name	Studies in Computational Intelligence
Volume	171
ISSN (Print)	1860-949X

Access to Document

10.1007/978-3-540-88051-6_14

Cite this

@inbook{5ee650d4a5b947989a163ed89a3834d9,

title = "Comparison between MOEA/D and NSGA-II on the multi-objective travelling salesman problem",

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.",

author = "Wei Peng and Qingfu Zhang and Hui Li",

year = "2009",

doi = "10.1007/978-3-540-88051-6\_14",

language = "英语",

isbn = "9783540880509",

series = "Studies in Computational Intelligence",

pages = "309--324",

editor = "Chi-Keong Goh and Tan, \{Kay Chen\} and Yew-Soon Ong",

booktitle = "Multi-Objective Memetic Algorithms",

}

TY - CHAP

T1 - Comparison between MOEA/D and NSGA-II on the multi-objective travelling salesman problem

AU - Peng, Wei

AU - Zhang, Qingfu

AU - Li, Hui

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/58149236790

U2 - 10.1007/978-3-540-88051-6_14

DO - 10.1007/978-3-540-88051-6_14

M3 - 章节

AN - SCOPUS:58149236790

SN - 9783540880509

T3 - Studies in Computational Intelligence

SP - 309

EP - 324

BT - Multi-Objective Memetic Algorithms

A2 - Goh, Chi-Keong

A2 - Tan, Kay Chen

A2 - Ong, Yew-Soon

ER -

Comparison between MOEA/D and NSGA-II on the multi-objective travelling salesman problem

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this