{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:53:32Z","timestamp":1774965212273,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T00:00:00Z","timestamp":1487808000000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00521-017-2880-4","type":"journal-article","created":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T06:30:00Z","timestamp":1487831400000},"page":"2935-2951","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":106,"title":["A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Mir Mohammad","family":"Alipour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Naser","family":"Razavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Feizi Derakhshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Ali","family":"Balafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"issue":"1","key":"2880_CR1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106\u2013130","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2880_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231\u2013247","journal-title":"Eur J Oper Res"},{"key":"2880_CR3","first-page":"215","volume":"1","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. Local Search Comb Optim 1:215\u2013310","journal-title":"Local Search Comb Optim"},{"key":"2880_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/0-306-48213-4_9","volume-title":"The traveling salesman problem and its variations","author":"DS Johnson","year":"2007","unstructured":"Johnson DS, McGeoch LA (2007) Experimental analysis of heuristics for the STSP. In: The traveling salesman problem and its variations. Springer, US, pp 369\u2013443"},{"key":"2880_CR5","volume-title":"Local search in combinatorial optimization","author":"JK Lenstra","year":"1997","unstructured":"Lenstra JK (1997) Local search in combinatorial optimization. Princeton University Press, Princeton"},{"issue":"2","key":"2880_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the traveling salesman problem. BioSystems 43(2):73\u201381","journal-title":"BioSystems"},{"issue":"1","key":"2880_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach for the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53\u201366","journal-title":"IEEE Trans Evolut Comput"},{"key":"2880_CR8","unstructured":"Dorigo M, Gambardella LM (2016) Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Proceedings of the twelfth international conference on machine learning (ML-95), pp 252\u2013260"},{"issue":"1","key":"2880_CR9","doi-asserted-by":"crossref","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 traveling salesman problem. Turk J Electr Eng Comput Sci 23(1):103\u2013117","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"5","key":"2880_CR10","doi-asserted-by":"crossref","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"GF Dong","year":"2012","unstructured":"Dong GF, Guo WW, Tickle K (2012) Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst Appl 39(5):5006\u20135011","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2880_CR11","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max-min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19(3):585\u2013596","journal-title":"Soft Comput"},{"key":"2880_CR12","first-page":"2004","volume":"2","author":"S Haykin","year":"2004","unstructured":"Haykin S, Network N (2004) A comprehensive foundation. Neural Netw 2:2004","journal-title":"Neural Netw"},{"issue":"2","key":"2880_CR13","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1162\/neco.1996.8.2.416","volume":"8","author":"M Budinich","year":"1996","unstructured":"Budinich M (1996) A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput 8(2):416\u2013424","journal-title":"Neural Comput"},{"key":"2880_CR14","doi-asserted-by":"crossref","unstructured":"Li R, Qiao J, Li W (2016) A modified hopfield neural network for solving TSP problem. In: 12th world congress on proceedings of the in intelligent control and automation (WCICA), 2016, IEEE","DOI":"10.1109\/WCICA.2016.7578744"},{"issue":"10","key":"2880_CR15","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TA Masutti","year":"2009","unstructured":"Masutti TA, de Castro LN (2009) A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf Sci 179(10):1454\u20131468","journal-title":"Inf Sci"},{"issue":"4","key":"2880_CR16","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"JC Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put JC, Koukam A (2009) A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72(4):1250\u20131264","journal-title":"Neurocomputing"},{"key":"2880_CR17","doi-asserted-by":"crossref","unstructured":"Thanh PD, Binh HTT, Lam BT (2015) New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In: Knowledge and systems engineering. Springer International Publishing, pp 367\u2013379","DOI":"10.1007\/978-3-319-11680-8_29"},{"key":"2880_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1155\/2014\/178621","volume":"2014","author":"CW Tsai","year":"2014","unstructured":"Tsai CW, Tseng SP, Chiang MC, Yang CS, Hong TP (2014) A high-performance genetic algorithm: using traveling salesman problem as a case. Sci World J 2014:14, Article ID 178621. doi: 10.1155\/2014\/178621","journal-title":"Sci World J"},{"issue":"3","key":"2880_CR19","first-page":"471","volume":"52","author":"OM Sallabi","year":"2009","unstructured":"Sallabi OM, El-Haddad Y (2009) An improved genetic algorithm to solve the traveling salesman problem. World Acad Sci, Eng Technol 52(3):471\u2013474","journal-title":"World Acad Sci, Eng Technol"},{"issue":"12","key":"2880_CR20","doi-asserted-by":"crossref","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"},{"issue":"1","key":"2880_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21(1):59\u201384","journal-title":"Ann Oper Res"},{"issue":"4","key":"2880_CR22","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng X, Chen Z, Yang W, Shi D, Zhao K (2011) Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl Soft Comput 11(4):3680\u20133689","journal-title":"Appl Soft Comput"},{"key":"2880_CR23","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin Y, Bian Z, Liu X (2016) Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing\u2013tabu search algorithm to solve the symmetrical traveling salesman problem. Appl Soft Comput 49:937\u2013952","journal-title":"Appl Soft Comput"},{"key":"2880_CR24","first-page":"8","volume":"2016","author":"SH Zhan","year":"2016","unstructured":"Zhan SH, Lin J, Zhang ZJ, Zhong YW (2016) List-based simulated annealing algorithm for traveling salesman problem. Comput Intell Neurosci 2016:8","journal-title":"Comput Intell Neurosci"},{"issue":"3","key":"2880_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"CN Fiechter","year":"1994","unstructured":"Fiechter CN (1994) A parallel tabu search algorithm for large traveling salesman problems. Discret Appl Math 51(3):243\u2013267","journal-title":"Discret Appl Math"},{"key":"2880_CR26","first-page":"3","volume":"32","author":"A Misevi\u010dius","year":"2015","unstructured":"Misevi\u010dius A (2015) Using iterated tabu search for the traveling salesman problem. Inf Technol Control 32:3","journal-title":"Inf Technol Control"},{"key":"2880_CR27","doi-asserted-by":"crossref","unstructured":"Wong LP, Low MYH, Chong CS (2008) A bee colony optimization algorithm for traveling salesman problem. In: Proceedings of the second Asia international conference on modelling and simulation, IEEE","DOI":"10.1109\/AMS.2008.27"},{"issue":"1","key":"2880_CR28","doi-asserted-by":"crossref","first-page":"342","DOI":"10.12928\/telkomnika.v14i1.3169","volume":"14","author":"L Meng","year":"2016","unstructured":"Meng L, Yin S, Hu X (2016) A new method used for traveling salesman problem based on discrete artificial bee colony algorithm. TELKOMNIKA Telecommun Comput Electron Control 14(1):342\u2013348","journal-title":"TELKOMNIKA Telecommun Comput Electron Control"},{"issue":"5","key":"2880_CR29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang QX (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"key":"2880_CR30","doi-asserted-by":"crossref","unstructured":"Merz P, Freisleben B (1997) Genetic local search for the TSP: new results. In: IEEE international conference on proceedings of the in evolutionary computation, 1997, IEEE, pp 159\u2013164","DOI":"10.1109\/ICEC.1997.592288"},{"key":"2880_CR31","doi-asserted-by":"crossref","unstructured":"White CM, Yen GG (2004) A hybrid evolutionary algorithm for traveling salesman problem. In: Congress on proceedings of the in evolutionary computation, 2004. CEC2004, IEEE, vol 2, pp 1473\u20131478","DOI":"10.1109\/CEC.2004.1331070"},{"key":"2880_CR32","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-211-27389-1_61","volume-title":"Adaptive and Natural Computing Algorithms","author":"TR Machado","year":"2005","unstructured":"Machado TR, Lopes HS (2005) A hybrid particle swarm optimization model for the traveling salesman problem. In: Adaptive and natural computing algorithms. Springer, Vienna, pp 255\u2013258"},{"issue":"7","key":"2880_CR33","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.pnsc.2008.01.030","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang J, Wu C, Lee HP, Liang Y (2008) Solving traveling salesman problems using generalized chromosome genetic algorithm. Prog Nat Sci 18(7):887\u2013892","journal-title":"Prog Nat Sci"},{"key":"2880_CR34","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124\u2013133","journal-title":"Comput Ind Eng"},{"key":"2880_CR35","first-page":"212794","volume":"2015","author":"Y Deng","year":"2015","unstructured":"Deng Y, Liu Y, Zhou D (2015) An improved genetic algorithm with initial population strategy for symmetric TSP. Math Probl Eng 2015:212794","journal-title":"Math Probl Eng"},{"key":"2880_CR36","unstructured":"de Lima Junior FC, de Melo JD, Neto ADD (2007) Using q-learning algorithm for initialization of the grasp metaheuristic and genetic algorithm. In: Proceedings of the in 2007 international joint conference on neural networks, IEEE, pp 1243\u20131248"},{"issue":"3","key":"2880_CR37","doi-asserted-by":"crossref","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"F Liu","year":"2009","unstructured":"Liu F, Zeng G (2009) Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst Appl 36(3):6995\u20137001","journal-title":"Expert Syst Appl"},{"key":"2880_CR38","doi-asserted-by":"crossref","unstructured":"dos Santos JPQ, de Lima FC, Magalhaes RM, de Melo JD, Neto ADD (2009) A parallel hybrid implementation using genetic algorithm, GRASP and reinforcement learning. In: Proceedings of the In 2009 international joint conference on neural networks. IEEE, pp 2798\u20132803","DOI":"10.1109\/IJCNN.2009.5178938"},{"issue":"2","key":"2880_CR39","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/MGS-150232","volume":"11","author":"MM Alipour","year":"2015","unstructured":"Alipour MM, Razavi SN (2015) A new multiagent reinforcement learning algorithm to solve the symmetric traveling salesman problem. Multiagent Grid Syst 11(2):107\u2013119","journal-title":"Multiagent Grid Syst"},{"key":"2880_CR40","first-page":"225","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger M, Reinelt G, Rinaldi G (1995) The traveling salesman problem. Handb Oper Res Manag Sci 7:225\u2013330","journal-title":"Handb Oper Res Manag Sci"},{"key":"2880_CR41","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press, Ann Arbor"},{"key":"2880_CR42","unstructured":"Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem. In: Proceedings of an international conference on genetic algorithms and their applications, vol 154. Lawrence Erlbaum, Hillsdale, pp 154\u2013159"},{"key":"2880_CR43","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceedings of the in IJCAI, vol. 85, pp 162\u2013164"},{"key":"2880_CR44","unstructured":"Oliver IM, Smith D, Holland JR (1987) Study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the in genetic algorithms and their applications: proceedings of the second international conference on genetic algorithms: July 28-31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA. Hillsdale, NJ: L. Erlhaum Associates, 1987"},{"key":"2880_CR45","unstructured":"Whitley LD, Starkweather T, Fuquay DA (1989) Scheduling problems and traveling salesmen: the genetic edge recombination operator. In: Proceedings of the In ICGA, vol 89, pp 133\u201340"},{"issue":"1","key":"2880_CR46","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1016\/j.asoc.2010.01.008","volume":"11","author":"M Kaya","year":"2011","unstructured":"Kaya M (2011) The effects of two new crossover operators on genetic algorithm performance. Appl Soft Comput 11(1):881\u2013890","journal-title":"Appl Soft Comput"},{"key":"2880_CR47","unstructured":"Alipour MM, Razavi SN (2016) A novel local search heuristic based on nearest insertion into the convex hull for solving euclidean TSP. Int J Oper Res, (Under Publishing)"},{"key":"2880_CR48","volume-title":"Artificial intelligence: a modern approach","author":"S Russell","year":"2010","unstructured":"Russell S, Norvig P (2010) Artificial intelligence: a modern approach. Prentice Hall, Englewood Cliffs"},{"key":"2880_CR49","unstructured":"Claus C, Boutilier C (1998) The dynamics of reinforcement learning in cooperative multiagent systems. In: Proceedings of the In AAAI\/IAAI, pp 746\u2013752)"},{"key":"2880_CR50","unstructured":"Reinelt G TSPLIB is a library of sample benchmark instances for the TSP (and related problems) from various sources and of various types\u2019 [online] http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95\/ . Accessed Feb 2016"},{"key":"2880_CR51","doi-asserted-by":"crossref","unstructured":"Tokic M, Schwenker F, Palm G (2013) Meta-learning of exploration and exploitation parameters with replacing eligibility traces. In: Proceedings of the In IAPR international workshop on partially supervised learning. Springer, Berlin, pp 68\u201379","DOI":"10.1007\/978-3-642-40705-5_7"},{"key":"2880_CR52","doi-asserted-by":"crossref","unstructured":"Kobayashi K, Mizoue H, Kuremoto T, Obayashi M (2009) A meta-learning method based on temporal difference error. In: Proceedings of the in international conference on neural information processing. Springer, Berlin, pp 530\u2013537","DOI":"10.1007\/978-3-642-10677-4_60"},{"key":"2880_CR53","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT press, Cambridge"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-017-2880-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-2880-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-017-2880-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T00:29:53Z","timestamp":1568852993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-017-2880-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,23]]},"references-count":53,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["2880"],"URL":"https:\/\/doi.org\/10.1007\/s00521-017-2880-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,23]]}}}