An effective method for solving multiple travelling salesman problem based on NSGA-II
Authors:
Open Access
- 11 October 2019
- journal article
- research article
- Published by Taylor & Francis in Systems Science & Control Engineering
- Vol. 7 (2) , 108-116
Abstract
In this paper, an effective multi-objective evolutionary algorithm is proposed to solve the multiple travelling salesman problem. In order to obtain minimum total visited distance and minimum range between all salesmen, some novel representation, crossover and mutation operators are designed to enhance the local and global search behaviours, then NSGA-II framework is applied to find well-convergent and well-diversity non-dominated solutions. The proposed algorithm is compared with several state-of-the-art approaches, and the comparison results show the proposed algorithm is effective and efficient to solve the multiple travelling salesman problems.Keywords
This publication has 10 references indexed in Scilit:
- Area Allocation Algorithm for Multiple UAVs Area Coverage Based on Clustering and Graph MethodIFAC-PapersOnLine, 2015
- MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColonyIEEE Transactions on Cybernetics, 2013
- Introduction2007
- A new approach to solving the multiple traveling salesperson problem using genetic algorithmsEuropean Journal of Operational Research, 2006
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlinesInternational Journal of Production Economics, 2001
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel ComplexEuropean Journal of Operational Research, 2000
- A genetic algorithm for service level based vehicle schedulingEuropean Journal of Operational Research, 1996
- Computer-Assisted School Bus SchedulingManagement Science, 1972
- Printing Press Scheduling for Multi-Edition PeriodicalsManagement Science, 1970