{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T08:20:24Z","timestamp":1766391624093},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The travelling salesman problem (TSP) belongs to the class of NP-hard problems, in which an optimal solution to the problem cannot be obtained within a reasonable computational time for large-sized problems. To address TSP, we propose a hybrid algorithm, called GA-TCTIA-LBSA, in which a genetic algorithm (GA), tour construction and tour improvement algorithms (TCTIAs) and a list-based simulated annealing (LBSA) algorithm are used. The TCTIAs are introduced to generate a first population, and after that, a search is continued with the GA. The problem of premature convergence of the GA to local optimum is tackled by a method called social disaster technique. Afterwards, the LBSA is applied to generate a new population based on one of two proposed operators called packing and judgement day. The proposed algorithm is implemented in the MATLAB environment, and its two variants, called GA-TCTIA-LBSA packing and GA-TCTIA-LBSA judgement day, are tested on symmetric and asymmetric instances from TSPLIB. The overall results demonstrate that the proposed GA-TCTIA-LBSAs offer promising results, particularly for small-sized instances.<\/jats:p>","DOI":"10.1093\/jigpal\/jzac028","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T04:11:51Z","timestamp":1643083911000},"page":"602-617","source":"Crossref","is-referenced-by-count":30,"title":["A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem"],"prefix":"10.1093","volume":"31","author":[{"given":"Vladimir","family":"Ilin","sequence":"first","affiliation":[{"name":"University of Novi Sad Faculty of Technical Sciences, , Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Serbia"}]},{"given":"Dragan","family":"Simi\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad Faculty of Technical Sciences, , Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Serbia"}]},{"given":"Svetislav D","family":"Simi\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad Faculty of Technical Sciences, , Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Serbia"}]},{"given":"Svetlana","family":"Simi\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad Faculty of Medicine, , Hajduk Veljkova 1\u20139, 21000 Novi Sad, Serbia"}]},{"given":"Nenad","family":"Sauli\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad Faculty of Technical Sciences, , Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Serbia"}]},{"given":"Jos\u00e9 Luis","family":"Calvo-Rolle","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a Department of Industrial Engineering, , 15405 Ferrol-A Coru\u00f1a, Spain"}]}],"member":"286","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"key":"2023072813243305100_ref1","doi-asserted-by":"crossref","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","article-title":"A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem","volume":"30","author":"Alipour","year":"2018","journal-title":"Neural Computing and Applications"},{"key":"2023072813243305100_ref2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.asoc.2018.11.019","article-title":"Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems","volume":"75","author":"Ardjmand","year":"2019","journal-title":"Applied Soft Computing"},{"key":"2023072813243305100_ref3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s12293-013-0128-0","article-title":"Spider monkey optimization algorithm for numerical optimization","volume":"6","author":"Bansal","year":"2014","journal-title":"Memetic Computing"},{"key":"2023072813243305100_ref4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1080\/0305215X.2019.1579804","article-title":"An effective hybrid harmony search for the asymmetric travelling salesman problem","volume":"52","author":"Boryczka","year":"2020","journal-title":"Engineering Optimization"},{"key":"2023072813243305100_ref5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.eswa.2018.12.044","article-title":"The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem","volume":"122","author":"Boryczka","year":"2019","journal-title":"Expert Systems with Applications"},{"key":"2023072813243305100_ref6","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/bxy133","article-title":"Deer hunting optimization algorithm: a new nature-inspired meta-heuristic paradigm","author":"Brammya","year":"2019","journal-title":"The Computer Journal"},{"key":"2023072813243305100_ref7","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","article-title":"A memetic neural network for the Euclidean traveling salesman problem","volume":"72","author":"Creput","year":"2009","journal-title":"Neurocomputing"},{"key":"2023072813243305100_ref8","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","volume":"85","author":"Davis","year":"1985","journal-title":"International Joint Conference on Artificial Intelligence"},{"key":"2023072813243305100_ref9","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","article-title":"A novel two-stage hybrid swarm intelligence optimization algorithm and application","volume":"16","author":"Deng","year":"2012","journal-title":"Soft Computing"},{"key":"2023072813243305100_ref10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.advengsoft.2017.05.014","article-title":"Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications","volume":"114","author":"Dhiman","year":"2017","journal-title":"Advances in Engineering Software"},{"key":"2023072813243305100_ref11","first-page":"745","article-title":"The traveling salesman problem: a linear programming formulation","volume":"6","author":"Diaby","year":"2007","journal-title":"WSEAS Transactions on Mathematics"},{"key":"2023072813243305100_ref12","doi-asserted-by":"crossref","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","article-title":"Solving the traveling salesman problem using cooperative genetic ant systems","volume":"39","author":"Dong","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"2023072813243305100_ref13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2023072813243305100_ref14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","article-title":"Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem","volume":"77","author":"Ezugwu","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"2023072813243305100_ref15","first-page":"167","article-title":"A two-commodity network flow approach to the traveling salesman problem","volume":"41","author":"Finke","year":"1984","journal-title":"Congressus Numerantium"},{"key":"2023072813243305100_ref16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230070303","article-title":"A statistical approach to the TSP","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"2023072813243305100_ref17","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland","year":"1975"},{"key":"2023072813243305100_ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2017\/7430125","article-title":"Genetic algorithm for traveling salesman problem with modified cycle crossover operator","volume":"2017","author":"Hussain","year":"2017","journal-title":"Computational Intelligence and Neuroscience"},{"key":"2023072813243305100_ref19","first-page":"530","volume-title":"Computing Models in Industrial and Environmental Applications. SOCO","author":"Ilin","year":"2021"},{"key":"2023072813243305100_ref20","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-319-19644-2_53","volume-title":"Hybrid Artificial Intelligence Systems. LNCS","author":"Ilin","year":"2015"},{"key":"2023072813243305100_ref21","volume-title":"Adaptive Computing in Engineering Design and Control. ACEDC, PEDC","author":"Kureichick","year":"1996"},{"key":"2023072813243305100_ref22","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"2023072813243305100_ref23","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"2023072813243305100_ref24","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","article-title":"Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing\u2013tabu search algorithm to solve the symmetrical traveling salesman problem","volume":"49","author":"Lin","year":"2016","journal-title":"Applied Soft Computing"},{"key":"2023072813243305100_ref25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"The Journal of Chemical Physics"},{"key":"2023072813243305100_ref26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01609016","article-title":"Using cutting planes to solve the symmetric travelling salesman problem","volume":"15","author":"Miliotis","year":"1978","journal-title":"Mathematical Programming"},{"key":"2023072813243305100_ref27","doi-asserted-by":"crossref","first-page":"6157","DOI":"10.1007\/s00500-018-3269-8","article-title":"A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem","volume":"23","author":"Moraes","year":"2019","journal-title":"Soft Computing"},{"key":"2023072813243305100_ref28","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"2023072813243305100_ref29","article-title":"Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem","volume":"227","author":"Rajesh Kanna","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"2023072813243305100_ref30","author":"Reinelt"},{"key":"2023072813243305100_ref31","first-page":"33","volume-title":"Proceedings of the 15th Annual IEEE Symposium of Switching and Automata Theory","author":"Rosenkrantz","year":"1974"},{"key":"2023072813243305100_ref32","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ejor.2018.06.003","article-title":"Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization","volume":"272","author":"Salii","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"2023072813243305100_ref33","doi-asserted-by":"crossref","first-page":"11","DOI":"10.5120\/ijca2016911384","article-title":"Artificial bee colony algorithm: a survey","volume":"149","author":"Sharma","year":"2016","journal-title":"International Journal of Computers and Applications"},{"key":"2023072813243305100_ref34","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle swarm optimization-based algorithms for TSP and generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Information Processing Letters"},{"key":"2023072813243305100_ref35","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1093\/jigpal\/jzv011","article-title":"Hybrid firefly model in routing heterogeneous fleet of vehicles in logistics distribution","volume":"23","author":"Simi\u0107","year":"2015","journal-title":"Logic Journal of IGPL"},{"key":"2023072813243305100_ref36","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1504\/IJCSM.2015.071818","article-title":"Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling","volume":"6","author":"Wang","year":"2015","journal-title":"International Journal of Computing Science and Mathematics"},{"key":"2023072813243305100_ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJBIC.2018.093328","article-title":"Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems","volume":"12","author":"Wang","year":"2018","journal-title":"International Journal of Bio-Inspired Computation"},{"key":"2023072813243305100_ref38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2016\/1712630","article-title":"List-based simulated annealing algorithm for traveling salesman problem","volume":"2016","author":"Zhan","year":"2016","journal-title":"Computational Intelligence and Neuroscience"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/4\/602\/50979282\/jzac028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/4\/602\/50979282\/jzac028.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T13:48:51Z","timestamp":1690552131000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/31\/4\/602\/6534866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,2,28]]},"published-print":{"date-parts":[[2023,7,25]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzac028","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,8]]},"published":{"date-parts":[[2022,2,28]]}}}