The MOEA/D algorithm with gaussian neighbourhoods for the multiobjective travelling salesman problem
AbstractIn this paper the MOEA/D-G algorithm is proposed which is a modification of the MOEA/D algorithm using Gaussian distributions to determine the probability with which neighbours of a given subproblem are selected as parents of new specimens assigned to this subproblem. The proposed method is applied to the Multiobjective Travelling Salesman Problem (MOTSP). Solutions found by the MOEA/D-G algorithm have a better quality than those found by the original MOEA/D version. Also, given equal computation time, all versions of the MOEA/D outperform the NSGA-II algorithm
|Publication size in sheets||0.3|
|Book||Bosman Peter (eds.): Proceedings of the Genetic and Evolutionary Computation Conferenc (GECCO'17 Companion), 2017, Association for Computing Machinery, ISBN 978-1-4503-4939-0, 1893 p.|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.