{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:51:34Z","timestamp":1776441094803,"version":"3.51.2"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T00:00:00Z","timestamp":1641686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s00521-021-06883-x","type":"journal-article","created":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T10:02:42Z","timestamp":1641722562000},"page":"7627-7652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8567-8798","authenticated-orcid":false,"given":"\u0130lhan","family":"\u0130lhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gazi","family":"G\u00f6kmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,9]]},"reference":[{"key":"6883_CR1","unstructured":"Gary MR, Johnson DS (1979). Computers and intractability: a guide to the theory of np completeness WH Freeman and Co. New York"},{"key":"6883_CR2","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, languages and programming","author":"DS Johnson","year":"1990","unstructured":"Johnson DS (1990) Local optimization and the traveling salesman problem. In: Paterson MS (ed) Automata, languages and programming. Springer-Verlag, Berlin\/Heidelberg, pp 446\u2013461. https:\/\/doi.org\/10.1007\/BFb0032050"},{"issue":"1","key":"6883_CR3","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"issue":"4","key":"6883_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: A survey. Oper Res 14(4):699\u2013719","journal-title":"Oper Res"},{"issue":"1","key":"6883_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33(1):60\u2013100","journal-title":"SIAM Rev"},{"issue":"1","key":"6883_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P Miliotis","year":"1978","unstructured":"Miliotis P (1978) Using cutting planes to solve the symmetric travelling salesman problem. Math Program 15(1):177\u2013188","journal-title":"Math Program"},{"issue":"4","key":"6883_CR7","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"2","key":"6883_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"6883_CR9","unstructured":"Martin O, Otto SW, Felten EW (1991) Large-step markov chains for the traveling salesman problem. oregon graduate institute of science and technology, department of computer science and engineering"},{"key":"6883_CR10","volume-title":"An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic (Doctoral dissertation","author":"K Helsgaun","year":"2006","unstructured":"Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic (Doctoral dissertation. Roskilde University, Department of Computer Science)"},{"issue":"2\u20133","key":"6883_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun K (2009) General k-opt submoves for the Lin-Kernighan TSP heuristic. Math Program Comput 1(2\u20133):119\u2013163","journal-title":"Math Program Comput"},{"key":"6883_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-02158-9_16","volume-title":"Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings","author":"C Dong","year":"2009","unstructured":"Dong C, J\u00e4ger G, Richter D, Molitor P (2009) Effective tour searching for TSP by contraction of pseudo backbone edges. In: Goldberg AV, Zhou Y (eds) Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 175\u2013187. https:\/\/doi.org\/10.1007\/978-3-642-02158-9_16"},{"issue":"3","key":"6883_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W Cook","year":"2003","unstructured":"Cook W, Seymour P (2003) Tour merging via branch-decomposition. INFORMS J Comput 15(3):233\u2013248","journal-title":"INFORMS J Comput"},{"issue":"2","key":"6883_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J Comput 25(2):346\u2013363","journal-title":"INFORMS J Comput"},{"key":"6883_CR15","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver press"},{"key":"6883_CR16","first-page":"1","volume":"9","author":"A Hussain","year":"2018","unstructured":"Hussain A, Muhammad YS, Sajid MN (2018) An improved genetic algorithm crossover operator for traveling salesman problem. Turkish J Math Comput Sci 9:1\u201313","journal-title":"Turkish J Math Comput Sci"},{"issue":"7","key":"6883_CR17","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853\u20131866","journal-title":"Neural Comput Appl"},{"key":"6883_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu AES, Adewumi AO (2017) Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl 87:70\u201378","journal-title":"Expert Syst Appl"},{"key":"6883_CR19","doi-asserted-by":"crossref","unstructured":"Akhand MA, Akter S, Rashid MA, Yaakob SB. (2015) Velocity tentative PSO: an optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci 42(3)","DOI":"10.1109\/EICT.2014.6777868"},{"key":"6883_CR20","doi-asserted-by":"crossref","unstructured":"Zhan SH, Lin J, Zhang ZJ, Zhong YW (2016). List-based simulated annealing algorithm for traveling salesman problem. Computational intelligence and neuroscience","DOI":"10.1155\/2016\/1712630"},{"key":"6883_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"issue":"24","key":"6883_CR22","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. Soft Comput 22(24):8167\u20138175","journal-title":"Soft Comput"},{"key":"6883_CR23","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438","journal-title":"Swarm Evol Comput"},{"key":"6883_CR24","doi-asserted-by":"publisher","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887","journal-title":"Appl Soft Comput"},{"issue":"1","key":"6883_CR25","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M G\u00fcnd\u00fcz","year":"2015","unstructured":"G\u00fcnd\u00fcz M, Kiran MS, \u00d6zceylan E (2015) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23(1):103\u2013117","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"6883_CR26","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490","journal-title":"Appl Soft Comput"},{"key":"6883_CR27","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu AES, Adewumi AO, Fr\u00eencu ME (2017) Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl 77:189\u2013210","journal-title":"Expert Syst Appl"},{"issue":"4","key":"6883_CR28","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1504\/IJCSM.2015.071818","volume":"6","author":"C Wang","year":"2015","unstructured":"Wang C, Lin M, Zhong Y, Zhang H (2015) Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling. Int J Comput Sci Math 6(4):336\u2013353","journal-title":"Int J Comput Sci Math"},{"issue":"12","key":"6883_CR29","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"SM Chen","year":"2011","unstructured":"Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(12):14439\u201314450","journal-title":"Expert Syst Appl"},{"key":"6883_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"A Khanra","year":"2015","unstructured":"Khanra A, Maiti MK, Maiti M (2015) Profit maximization of TSP through a hybrid algorithm. Comput Ind Eng 88:229\u2013236","journal-title":"Comput Ind Eng"},{"issue":"4598","key":"6883_CR31","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"6883_CR32","doi-asserted-by":"crossref","unstructured":"Askarzadeh A, dos Santos Coelho L, Klein CE, Mariani VC (2016). A population-based simulated annealing algorithm for global optimization. In 2016 IEEE international conference on systems, man, and cybernetics (SMC) (pp. 004626\u2013004633). IEEE","DOI":"10.1109\/SMC.2016.7844961"},{"key":"6883_CR33","doi-asserted-by":"publisher","first-page":"144366","DOI":"10.1109\/ACCESS.2019.2945570","volume":"7","author":"L Wang","year":"2019","unstructured":"Wang L, Cai R, Lin M, Zhong Y (2019) Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem. IEEE Access 7:144366\u2013144380","journal-title":"IEEE Access"},{"issue":"1","key":"6883_CR34","first-page":"32","volume":"25","author":"L Ingber","year":"1996","unstructured":"Ingber L (1996) Adaptive simulated annealing (ASA): lessons learned. Control Cybern 25(1):32\u201354","journal-title":"Control Cybern"},{"issue":"3","key":"6883_CR35","doi-asserted-by":"publisher","first-page":"7099","DOI":"10.1016\/j.eswa.2008.08.020","volume":"36","author":"SJ Jeong","year":"2009","unstructured":"Jeong SJ, Kim KS, Lee YH (2009) The efficient search method of simulated annealing using fuzzy logic controller. Expert Syst Appl 36(3):7099\u20137103","journal-title":"Expert Syst Appl"},{"issue":"11","key":"6883_CR36","doi-asserted-by":"publisher","first-page":"4349","DOI":"10.1016\/j.asoc.2013.06.018","volume":"13","author":"A Hime","year":"2013","unstructured":"Hime A, e Oliveira, Antonio Petraglia (2013) Solving nonlinear systems of functional equations with fuzzy adaptive simulated annealing. Appl Soft Comput 13(11):4349\u20134357. https:\/\/doi.org\/10.1016\/j.asoc.2013.06.018","journal-title":"Appl Soft Comput"},{"key":"6883_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput 42:77\u201388","journal-title":"Swarm Evol Comput"},{"key":"6883_CR38","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. In Proceedings of the 9th International joint conference on artificial intelligence, 85, 162\u2013164."},{"key":"6883_CR39","unstructured":"Whitley LD, Starkweather T, D'Ann Fuquay (1989). Scheduling problems and traveling salesmen: The genetic edge recombination operator. In Proceedings of the 3rd international conference on genetic algorithms, 89, 133\u201340"},{"issue":"10","key":"6883_CR40","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"issue":"4","key":"6883_CR41","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB - A traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"6883_CR42","unstructured":"Taguchi G (1986). Introduction to quality engineering: designing quality into products and processes (No. 658.562 T3)"},{"issue":"1\u20132","key":"6883_CR43","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.mcm.2011.06.056","volume":"57","author":"A Mozdgir","year":"2013","unstructured":"Mozdgir A, Mahdavi I, Badeleh IS, Solimanpur M (2013) Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing. Math Comput Model 57(1\u20132):137\u2013151","journal-title":"Math Comput Model"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06883-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06883-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06883-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T12:15:37Z","timestamp":1650284137000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06883-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,9]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["6883"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06883-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,9]]},"assertion":[{"value":"15 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}