Hybrid evolutionary algorithms for the Multiobjective Traveling Salesman Problem

作者：

Highlights：

• The multiobjective TSP is solved using three hybrid evolutionary algorithms.

• Two of them are based on Differential Evolution, the third one is based on NSGA II.

• All algorithms are used in a hybridized form with a VNS algorithm.

• The algorithms solve 2–5 objective functions TSP.

• Comparisons between all algorithms were performed on a set of benchmark instances.

摘要

•The multiobjective TSP is solved using three hybrid evolutionary algorithms.•Two of them are based on Differential Evolution, the third one is based on NSGA II.•All algorithms are used in a hybridized form with a VNS algorithm.•The algorithms solve 2–5 objective functions TSP.•Comparisons between all algorithms were performed on a set of benchmark instances.

论文关键词：Multiobjective Differential Evolution,NSGA II,Multiobjective Traveling Salesman Problem,VNS

论文评审过程：Received 25 May 2014, Revised 23 July 2015, Accepted 23 July 2015, Available online 30 July 2015, Version of Record 6 September 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.07.051