{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T05:34:32Z","timestamp":1770615272835,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00500-014-1322-9","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T21:15:48Z","timestamp":1402434948000},"page":"1099-1106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["Random-key cuckoo search for the travelling salesman problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Aziz","family":"Ouaarab","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Ahiod","sequence":"additional","affiliation":[]},{"given":"Xin-She","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"1322_CR1","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J Bean","year":"1994","unstructured":"Bean J (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013154","journal-title":"ORSA J Comput"},{"issue":"3","key":"1322_CR2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"issue":"1","key":"1322_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10745-006-9083-4","volume":"35","author":"CT Brown","year":"2007","unstructured":"Brown CT, Liebovitch LS, Glendon R (2007) L\u00e9vy flights in Dobe Ju\/\u2019hoansi foraging patterns. Hum Ecol 35(1):129\u2013138","journal-title":"Hum Ecol"},{"key":"1322_CR4","first-page":"208","volume":"11","author":"H Chen","year":"2011","unstructured":"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\u2013217","journal-title":"Int J Comput Sci Netw Secur"},{"key":"1322_CR5","doi-asserted-by":"crossref","unstructured":"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\u201359","DOI":"10.1007\/3-540-44808-X_3"},{"issue":"6","key":"1322_CR6","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G Croes","year":"1958","unstructured":"Croes G (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"key":"1322_CR7","doi-asserted-by":"crossref","unstructured":"Davendra D (2010) Traveling salesman problem, theory and applications. InTech","DOI":"10.5772\/547"},{"key":"1322_CR8","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2002","unstructured":"Gutin G, Punnen AP (2002) The traveling salesman problem and its variations, vol 12. Springer, Berlin"},{"key":"1322_CR9","volume-title":"Approximation algorithms for NP-hard problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston"},{"key":"1322_CR10","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, Chichester"},{"key":"1322_CR11","doi-asserted-by":"crossref","unstructured":"Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. J Oper Res Soc 26(4):717\u2013733","DOI":"10.1057\/jors.1975.151"},{"key":"1322_CR12","doi-asserted-by":"crossref","first-page":"502","DOI":"10.4028\/www.scientific.net\/AMM.421.502","volume":"421","author":"A Mohamad","year":"2013","unstructured":"Mohamad A, Zain AM, Bazin NEN, Udin A (2013) Cuckoo search algorithm for optimization problems\u2014a literature review. Appl Mech Mater 421:502\u2013506","journal-title":"Appl Mech Mater"},{"key":"1322_CR13","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/s10845-013-0853-8"},{"key":"1322_CR14","doi-asserted-by":"crossref","unstructured":"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\u201384","DOI":"10.1007\/978-3-319-02141-6_4"},{"key":"1322_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013784","DOI":"10.12785\/amis\/070248"},{"key":"1322_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502135.001.0001","volume-title":"The cuckoos","author":"RB Payne","year":"2005","unstructured":"Payne RB (2005) The cuckoos, vol 15. Oxford University Press, Oxford"},{"key":"1322_CR17","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, Berlin"},{"key":"1322_CR18","unstructured":"Reinelt G (1995) Tsplib95. Interdisziplin\u00e4res Zentrum f\u00fcr Wissenschaftliches Rechnen (IWR), Heidelberg"},{"key":"1322_CR19","doi-asserted-by":"crossref","unstructured":"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\u201363","DOI":"10.1504\/IJOR.2007.011443"},{"key":"1322_CR20","doi-asserted-by":"crossref","unstructured":"Shlesinger MF, Zaslavsky GM, Frisch U (1995) L\u00e9vy flights and related topics in physics. In: Levy flights and related topics in physics, vol 450","DOI":"10.1007\/3-540-59222-9"},{"issue":"1","key":"1322_CR21","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder LV, Daskin MS (2006) A random-key genetic algorithm for the generalized traveling salesman problem. Eur J Oper Res 174(1):38\u201353","journal-title":"Eur J Oper Res"},{"key":"1322_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9780470640425","volume-title":"Engineering Optimization: an introduction with metaheuristic applications","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Engineering Optimization: an introduction with metaheuristic applications. Wiley, USA"},{"key":"1322_CR23","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, UK"},{"key":"1322_CR24","volume-title":"Cuckoo search and firefly algorithm: theory and applications","author":"XS Yang","year":"2013","unstructured":"Yang XS (2013) Cuckoo search and firefly algorithm: theory and applications. Springer, Berlin"},{"key":"1322_CR25","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via l\u00e9vy flights. In: World Congress on Nature and biologically inspired computing, 2009. NaBIC 2009, pp 210\u2013214. IEEE","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"4","key":"1322_CR26","first-page":"330","volume":"1","author":"XS Yang","year":"2010","unstructured":"Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330\u2013343","journal-title":"Int J Math Model Numer Optim"},{"key":"1322_CR27","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1016\/j.cor.2011.09.026","volume":"40","author":"XS Yang","year":"2013","unstructured":"Yang XS, Deb S (2013) Multiobjective cuckoo search for design optimization. Comput Oper Res 40:1616\u20131624","journal-title":"Comput Oper Res"},{"key":"1322_CR28","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1007\/s00521-013-1498-4","volume":"23","author":"XS Yang","year":"2013","unstructured":"Yang XS, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithms. Neural Comput Appl 23:2051\u20132057","journal-title":"Neural Comput Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1322-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1322-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1322-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T16:36:53Z","timestamp":1716827813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1322-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["1322"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1322-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,10]]}}}