A real-coded chicken swarm optimisation algorithm for solving travelling salesman problem
by Min Lin; Yuhang Yang; Yiwen Zhong; Juan Lin
International Journal of Computing Science and Mathematics (IJCSM), Vol. 17, No. 2, 2023

Abstract: Chicken swarm optimisation (CSO) algorithm, which is inspired by the hierarchal structure and the behaviours of the chicken flock, was first presented for continuous optimisation problems. The paper proposes a real-coded scheme of CSO algorithm (RCCSO) to solve travelling salesman problem (TSP). In the RCCSO algorithm, each position vector represents a visiting sequence of cities. In a position vector, each dimension represents a city and is coded with a real number. The integer part of the real number represents the index number of the city, and the decimal part denotes the visiting order of the city. Using this coding scheme, the discrete neighbourhood of TSP is converted into a continuous neighbourhood. Two repair operators, relocation operator and replacement operator, are designed to guarantee that position vector is always a valid solution of TSP. Finally, the RCCSO algorithm is compared with many different types of intelligent optimisation algorithms. Experimental results prove that the RCCSO algorithm can find the shortest path more quickly and effectively on most TSP datasets.

Online publication date: Wed, 03-May-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com