Random-key cuckoo search for the travelling salesman problem

Ouaarab, Aziz, Ahiod, Belaïd and Yang, Xin-She ORCID: https://orcid.org/0000-0001-8231-5556 (2015) Random-key cuckoo search for the travelling salesman problem. Soft Computing, 19 (4). pp. 1099-1106. ISSN 1432-7643

PDF - Final accepted version (with author's formatting)
Download (204kB) | Preview


Combinatorial optimization problems are typically NP-hard, and thus very challenging to solve. In this paper, we present the random key cuckoo search (RKCS) algorithm for solving the famous Travelling Salesman Problem (TSP). We used a simplified random-key encoding scheme to pass from a continuous space (real numbers) to a combinatorial space. We also consider the displacement of a solution in both spaces using L\'evy flights. The performance of the proposed RKCS is tested against a set of benchmarks of symmetric TSP from the well-known TSPLIB library. The results of the tests show that RKCS is superior to some other metaheuristic algorithms.

Item Type: Article
Additional Information: First published online: 10 June 2014
Research Areas: A. > School of Science and Technology > Design Engineering and Mathematics
Item ID: 19285
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/s00500-014-1322-9
Useful Links:
Depositing User: Xin-She Yang
Date Deposited: 14 Apr 2016 12:56
Last Modified: 11 Jun 2019 09:43
URI: https://eprints.mdx.ac.uk/id/eprint/19285

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year