Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem

DOI10.1007/978-3-540-88051-6_14zbMath1160.90679OpenAlexW29472711MaRDI QIDQ3627797

Qingfu Zhang, Hui Li, Wei Peng

Publication date: 13 May 2009

Published in: Multi-Objective Memetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88051-6_14

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems ⋮ Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems ⋮ A variable neighborhood MOEA/D for multiobjective test task scheduling problem ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ Using an outward selective pressure for improving the search quality of the MOEA/D algorithm ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• Nonlinear multiobjective optimization
• Multiobjective evolutionary algorithms and applications.

This page was built for publication: Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem