An effective method for solving multiple travelling salesman problem based on NSGA-II

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

Full description

Bibliographic Details
Main Authors: Yang Shuai, Shao Yunfeng, Zhang Kai
Format: Article
Language:English
Published: Taylor & Francis Group 2019-11-01
Series:Systems Science & Control Engineering
Subjects:
Online Access:http://dx.doi.org/10.1080/21642583.2019.1674220
id doaj-b6776137b0e5444f84d14bb21bb1da8a
record_format Article
spelling doaj-b6776137b0e5444f84d14bb21bb1da8a2020-11-25T01:15:21ZengTaylor & Francis GroupSystems Science & Control Engineering2164-25832019-11-017210811610.1080/21642583.2019.16742201674220An effective method for solving multiple travelling salesman problem based on NSGA-IIYang Shuai0Shao Yunfeng1Zhang Kai2Wuhan University of Science and TechnologyWuhan University of Science and TechnologyWuhan University of Science and TechnologyIn 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.http://dx.doi.org/10.1080/21642583.2019.1674220multi-objective evolutionary algorithmmultiple travelling salesman problemnsga-ii
collection DOAJ
language English
format Article
sources DOAJ
author Yang Shuai
Shao Yunfeng
Zhang Kai
spellingShingle Yang Shuai
Shao Yunfeng
Zhang Kai
An effective method for solving multiple travelling salesman problem based on NSGA-II
Systems Science & Control Engineering
multi-objective evolutionary algorithm
multiple travelling salesman problem
nsga-ii
author_facet Yang Shuai
Shao Yunfeng
Zhang Kai
author_sort Yang Shuai
title An effective method for solving multiple travelling salesman problem based on NSGA-II
title_short An effective method for solving multiple travelling salesman problem based on NSGA-II
title_full An effective method for solving multiple travelling salesman problem based on NSGA-II
title_fullStr An effective method for solving multiple travelling salesman problem based on NSGA-II
title_full_unstemmed An effective method for solving multiple travelling salesman problem based on NSGA-II
title_sort effective method for solving multiple travelling salesman problem based on nsga-ii
publisher Taylor & Francis Group
series Systems Science & Control Engineering
issn 2164-2583
publishDate 2019-11-01
description 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.
topic multi-objective evolutionary algorithm
multiple travelling salesman problem
nsga-ii
url http://dx.doi.org/10.1080/21642583.2019.1674220
work_keys_str_mv AT yangshuai aneffectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
AT shaoyunfeng aneffectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
AT zhangkai aneffectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
AT yangshuai effectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
AT shaoyunfeng effectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
AT zhangkai effectivemethodforsolvingmultipletravellingsalesmanproblembasedonnsgaii
_version_ 1725153790854692864