Welcome to the InfoSci Platform
Reference Hub1
An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem

An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem

Anbang Wang, Lihong Guo, Yuan Chen, Junjie Wang, Luo Liu, Yuanzhang Song
Copyright: © 2021 |Volume: 15 |Issue: 4 |Pages: 26
ISSN: 1557-3958|EISSN: 1557-3966|EISBN13: 9781799859857|DOI: 10.4018/IJCINI.20211001.oa17
Cite Article Cite Article

MLA

Wang, Anbang, et al. "An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem." IJCINI vol.15, no.4 2021: pp.1-26. http://doi.org/10.4018/IJCINI.20211001.oa17

APA

Wang, A., Guo, L., Chen, Y., Wang, J., Liu, L., & Song, Y. (2021). An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 15(4), 1-26. http://doi.org/10.4018/IJCINI.20211001.oa17

Chicago

Wang, Anbang, et al. "An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 15, no.4: 1-26. http://doi.org/10.4018/IJCINI.20211001.oa17

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization. It has assumed significance in operations research and theoretical computer science. The problem was first formulated in 1930 and since then, has been one of the most extensively studied problems in optimization. In fact, it is used as a benchmark for many optimization methods. This paper represents a new method to addressing TSP using an improved version of cuckoo search (CS) with Stud (SCS) crossover operator. In SCS method, similar to genetic operators used in various metaheuristic algorithms, a Stud crossover operator that is originated from classical Stud genetic algorithm, is introduced into the CS with the aim of improving its effectiveness and reliability while dealing with TSP. Various test functions had been used to test this approach, and used subsequently to find the shortest path for Chinese TSP (CTSP). Experimental results presented clearly demonstrates SCS as a viable and attractive addition to the portfolio of swarm intelligence techniques.