A modified two-part wolf pack search algorithm for the multiple traveling salesmen problem

Yongbo Chen, Zhenyue Jia, Xiaolin Ai, Di Yang, Jianqiao Yu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)

Abstract

This paper proposes a modified two-part wolf pack search (MTWPS) algorithm updated by the two-part individual encoding approach as well as the transposition and extension (TE) operation for the multiple travelling salesmen problem (MTSP). Firstly, the two-part individual encoding approach is introduced into the original WPS algorithm for MTSP, which is named the two-part wolf pack search (TWPS) algorithm, to minimize the size of the problem search space. Secondly, the analysis of the convergence rate performance is presented to illustrate the reasonability of the maximum terminal generation of the novel TWPS algorithm deeply. Then, based on the definition of the global reachability, the TWPS algorithm is modified by the TE operation further, which can greatly enhance the search ability of the TWPS algorithm.

Original languageEnglish
Pages (from-to)714-725
Number of pages12
JournalApplied Soft Computing
Volume61
DOIs
Publication statusPublished - Dec 2017
Externally publishedYes

Fingerprint

Dive into the research topics of 'A modified two-part wolf pack search algorithm for the multiple traveling salesmen problem'. Together they form a unique fingerprint.

Cite this