Skip to main content
SpringerLink
Log in

Random-key cuckoo search for the travelling salesman problem

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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évy 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–154

    Article  MATH  Google Scholar 

  • Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308

    Article  Google Scholar 

  • Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138

    Article  Google Scholar 

  • Chen H, Li S, Tang Z (2011) Hybrid gravitational search algorithm with random-key encoding scheme combined with simulated annealing. Int J Comput Sci Netw Secur 11:208–217

    MATH  Google Scholar 

  • Cirasella J, Johnson DS, McGeoch LA, Zhang W (2001) The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In: Algorithm engineering and experimentation. Springer, Berlin, pp 32–59

  • Croes G (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812

    Article  MathSciNet  Google Scholar 

  • Davendra D (2010) Traveling salesman problem, theory and applications. InTech

  • Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer, Berlin

    MATH  Google Scholar 

  • Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston

    MATH  Google Scholar 

  • Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, Chichester

    MATH  Google Scholar 

  • Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. J Oper Res Soc 26(4):717–733

  • Mohamad A, Zain AM, Bazin NEN, Udin A (2013) Cuckoo search algorithm for optimization problems—a literature review. Appl Mech Mater 421:502–506

    Article  Google Scholar 

  • Mohamad A, Zain AM, Bazin NEN, Udin A (2013), A process prediction model based on cuckoo algorithm for abrasive waterjet machining. J Intell Manuf. doi:10.1007/s10845-013-0853-8

  • Ouaarab A, Ahiod B, Yang XS (2014) Improved and discrete cuckoo search for solving the travelling salesman problem. In: Cuckoo search and firefly algorithm. Springer, Berlin, pp 63–84

  • Ouyang X, Zhou Y, Luo Q, Chen H (2013) A novel discrete cuckoo search algorithm for spherical traveling salesman problem. Appl Math 7(2):777–784

  • Payne RB (2005) The cuckoos, vol 15. Oxford University Press, Oxford

    Google Scholar 

  • Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin

    Google Scholar 

  • Reinelt G (1995) Tsplib95. Interdisziplinäres Zentrum für Wissenschaftliches Rechnen (IWR), Heidelberg

  • Samanlioglu F, Kurz MB, Ferrell WG, Tangudu S (2007) A hybrid random-key genetic algorithm for a symmetric travelling salesman problem. Int J Oper Res 2(1):47–63

  • Shlesinger MF, Zaslavsky GM, Frisch U (1995) Lévy flights and related topics in physics. In: Levy flights and related topics in physics, vol 450

  • Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38–53

    Article  MATH  MathSciNet  Google Scholar 

  • Yang XS (2010) Engineering Optimization: an introduction with metaheuristic applications. Wiley, USA

    Book  Google Scholar 

  • Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, UK

    Google Scholar 

  • Yang XS (2013) Cuckoo search and firefly algorithm: theory and applications. Springer, Berlin

    Google Scholar 

  • Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World Congress on Nature and biologically inspired computing, 2009. NaBIC 2009, pp 210–214. IEEE

  • Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330–343

    MATH  Google Scholar 

  • Yang XS, Deb S (2013) Multiobjective cuckoo search for design optimization. Comput Oper Res 40:1616–1624

    Article  MathSciNet  Google Scholar 

  • Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithms. Neural Comput Appl 23:2051–2057

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRIT, Associated Unit to the CNRST (URAC) No 29, Mohammed V-Agdal University, B.P. 1014, Rabat, Morocco

    Aziz Ouaarab & Belaïd Ahiod

  2. School of Science and Technology, Middlesex University, The Burroughs, London, NW4 4BT, UK

    Xin-She Yang

Authors
  1. Aziz Ouaarab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Belaïd Ahiod
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xin-She Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aziz Ouaarab.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ouaarab, A., Ahiod, B. & Yang, XS. Random-key cuckoo search for the travelling salesman problem. Soft Comput 19, 1099–1106 (2015). https://doi.org/10.1007/s00500-014-1322-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1322-9

Keywords

Search

Navigation