Random-key cuckoo search for the travelling salesman problem
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469997 | ||
| 003 | CHVBK | ||
| 005 | 20210128100325.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150401xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1322-9 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1322-9 | ||
| 245 | 0 | 0 | |a Random-key cuckoo search for the travelling salesman problem |h [Elektronische Daten] |c [Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang] |
| 520 | 3 | |a 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. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Nature-inspired metaheuristic |2 nationallicence | |
| 690 | 7 | |a Cuckoo search |2 nationallicence | |
| 690 | 7 | |a Lévy flights |2 nationallicence | |
| 690 | 7 | |a Random key |2 nationallicence | |
| 690 | 7 | |a Combinatorial optimization |2 nationallicence | |
| 690 | 7 | |a Travelling salesman problem |2 nationallicence | |
| 700 | 1 | |a Ouaarab |D Aziz |u LRIT, Associated Unit to the CNRST (URAC) No 29, Mohammed V-Agdal University, B.P. 1014, Rabat, Morocco |4 aut | |
| 700 | 1 | |a Ahiod |D Belaïd |u LRIT, Associated Unit to the CNRST (URAC) No 29, Mohammed V-Agdal University, B.P. 1014, Rabat, Morocco |4 aut | |
| 700 | 1 | |a Yang |D Xin-She |u School of Science and Technology, Middlesex University, The Burroughs, NW4 4BT, London, UK |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/4(2015-04-01), 1099-1106 |x 1432-7643 |q 19:4<1099 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1322-9 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1322-9 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ouaarab |D Aziz |u LRIT, Associated Unit to the CNRST (URAC) No 29, Mohammed V-Agdal University, B.P. 1014, Rabat, Morocco |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ahiod |D Belaïd |u LRIT, Associated Unit to the CNRST (URAC) No 29, Mohammed V-Agdal University, B.P. 1014, Rabat, Morocco |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Yang |D Xin-She |u School of Science and Technology, Middlesex University, The Burroughs, NW4 4BT, London, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/4(2015-04-01), 1099-1106 |x 1432-7643 |q 19:4<1099 |1 2015 |2 19 |o 500 | ||