Skip to main content
Erschienen in: Soft Computing 4/2015

01.04.2015 | Methodologies and Application

Random-key cuckoo search for the travelling salesman problem

verfasst von: Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang

Erschienen in: Soft Computing | Ausgabe 4/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–154CrossRefMATH Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–154CrossRefMATH
Zurück zum Zitat Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308CrossRef Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308CrossRef
Zurück zum Zitat Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138CrossRef Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in Dobe Ju/’hoansi foraging patterns. Hum Ecol 35(1):129–138CrossRef
Zurück zum Zitat 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–217MATH 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–217MATH
Zurück zum Zitat 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 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
Zurück zum Zitat Davendra D (2010) Traveling salesman problem, theory and applications. InTech Davendra D (2010) Traveling salesman problem, theory and applications. InTech
Zurück zum Zitat Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer, BerlinMATH Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer, BerlinMATH
Zurück zum Zitat Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co., BostonMATH Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co., BostonMATH
Zurück zum Zitat Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, ChichesterMATH Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, ChichesterMATH
Zurück zum Zitat Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. J Oper Res Soc 26(4):717–733 Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. J Oper Res Soc 26(4):717–733
Zurück zum Zitat Mohamad A, Zain AM, Bazin NEN, Udin A (2013) Cuckoo search algorithm for optimization problems—a literature review. Appl Mech Mater 421:502–506CrossRef Mohamad A, Zain AM, Bazin NEN, Udin A (2013) Cuckoo search algorithm for optimization problems—a literature review. Appl Mech Mater 421:502–506CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Payne RB (2005) The cuckoos, vol 15. Oxford University Press, Oxford Payne RB (2005) The cuckoos, vol 15. Oxford University Press, Oxford
Zurück zum Zitat Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin
Zurück zum Zitat Reinelt G (1995) Tsplib95. Interdisziplinäres Zentrum für Wissenschaftliches Rechnen (IWR), Heidelberg Reinelt G (1995) Tsplib95. Interdisziplinäres Zentrum für Wissenschaftliches Rechnen (IWR), Heidelberg
Zurück zum Zitat 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 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
Zurück zum Zitat 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 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
Zurück zum Zitat Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38–53CrossRefMATHMathSciNet Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38–53CrossRefMATHMathSciNet
Zurück zum Zitat Yang XS (2010) Engineering Optimization: an introduction with metaheuristic applications. Wiley, USACrossRef Yang XS (2010) Engineering Optimization: an introduction with metaheuristic applications. Wiley, USACrossRef
Zurück zum Zitat Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, UK Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, UK
Zurück zum Zitat Yang XS (2013) Cuckoo search and firefly algorithm: theory and applications. Springer, Berlin Yang XS (2013) Cuckoo search and firefly algorithm: theory and applications. Springer, Berlin
Zurück zum Zitat 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 (2009) Cuckoo search via lévy flights. In: World Congress on Nature and biologically inspired computing, 2009. NaBIC 2009, pp 210–214. IEEE
Zurück zum Zitat Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330–343MATH Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330–343MATH
Zurück zum Zitat Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithms. Neural Comput Appl 23:2051–2057CrossRef Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithms. Neural Comput Appl 23:2051–2057CrossRef
Metadaten
Titel
Random-key cuckoo search for the travelling salesman problem
verfasst von
Aziz Ouaarab
Belaïd Ahiod
Xin-She Yang
Publikationsdatum
01.04.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 4/2015
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-014-1322-9

Weitere Artikel der Ausgabe 4/2015

Soft Computing 4/2015 Zur Ausgabe

Premium Partner