{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T06:27:31Z","timestamp":1749191251465,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00500-022-07581-z","type":"journal-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T10:02:46Z","timestamp":1666173766000},"page":"4975-4985","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Application of proposed hybrid active genetic algorithm for optimization of traveling salesman problem"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4355-7744","authenticated-orcid":false,"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kushal Pal","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Meena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun Bihari","family":"Rana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makkhan Lal","family":"Meena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Govind Sharan","family":"Dangayach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Zhi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"7581_CR1","first-page":"49","volume":"31","author":"O Abdoun","year":"2012","unstructured":"Abdoun O, Abouchabaka J (2012) A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Int J Comput Appl 31:49\u201357","journal-title":"Int J Comput Appl"},{"key":"7581_CR2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/258207","author":"ZH Ahmed","year":"2014","unstructured":"Ahmed ZH (2014) The ordered clustered travelling salesman problem: A hybrid genetic algorithm. Sci World J Article ID. https:\/\/doi.org\/10.1155\/2014\/258207","journal-title":"Sci World J Article ID"},{"key":"7581_CR3","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Derakhshi MRF, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30:2935\u20132951. https:\/\/doi.org\/10.1007\/s00521-017-2880-4","journal-title":"Neural Comput Appl"},{"key":"7581_CR4","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1016\/j.asoc.2015.06.011","volume":"34","author":"B Avsar","year":"2015","unstructured":"Avsar B, Aliabadi DE (2015) Parallelized neural network system for solving Euclidean traveling salesman problem. Appl Soft Comput 34:862\u2013873. https:\/\/doi.org\/10.1016\/j.asoc.2015.06.011","journal-title":"Appl Soft Comput"},{"key":"7581_CR5","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1007\/s00500-016-2075-4","volume":"21","author":"C Changdar","year":"2017","unstructured":"Changdar C, Pal RK, Mahapatra GS (2017) A genetic ant colony optimization based algorithm for solid multiple travelling salesmen problem in fuzzy rough environment. Soft Comput 21:4661\u20134675. https:\/\/doi.org\/10.1007\/s00500-016-2075-4","journal-title":"Soft Comput"},{"key":"7581_CR6","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. Exp Syst Appl 38:14439\u201314450. https:\/\/doi.org\/10.1016\/j.eswa.2011.04.163","journal-title":"Exp Syst Appl"},{"key":"7581_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S1007-0214(07)70068-8","volume":"12","author":"C Ding","year":"2007","unstructured":"Ding C, Cheng Y, He M (2007) Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Sci Technol 12:459\u2013465. https:\/\/doi.org\/10.1016\/S1007-0214(07)70068-8","journal-title":"Tsinghua Sci Technol"},{"key":"7581_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ins.2012.12.053","volume":"233","author":"X Feng","year":"2013","unstructured":"Feng X, Lau FC, Yu H (2013) A novel bio-inspired approach based on the behavior of mosquitoes. Inf Sci 233:87\u2013108. https:\/\/doi.org\/10.1016\/j.ins.2012.12.053","journal-title":"Inf Sci"},{"key":"7581_CR9","first-page":"163","volume":"8","author":"E Filip","year":"2011","unstructured":"Filip E, Otakar M (2011) The travelling salesman problem and its application in logistic practice. WSEAS Trans Bus Econ 8:163\u2013173","journal-title":"WSEAS Trans Bus Econ"},{"key":"7581_CR10","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput 22:1669\u20131685. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","journal-title":"Soft Comput"},{"key":"7581_CR11","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 Elect Engg Comp Sci 23:103\u2013117. https:\/\/doi.org\/10.3906\/elk-1210-147","journal-title":"Turk J Elect Engg Comp Sci"},{"key":"7581_CR12","first-page":"1387","volume":"16","author":"AR Hosseinabadi","year":"2012","unstructured":"Hosseinabadi AR, Yazdanpanah M, Rostami AS (2012) A new search algorithm for solving symmetric traveling salesman problem based on gravity. World Appl Sci J 16:1387\u20131392","journal-title":"World Appl Sci J"},{"key":"7581_CR13","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.apm.2017.02.042","volume":"49","author":"AR Hosseinabadi","year":"2017","unstructured":"Hosseinabadi AR, Rostami NSH, Kardgar M, Mirkamali SS, Abraham A (2017) A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm. Appl Math Model 49:663\u2013679. https:\/\/doi.org\/10.1016\/j.apm.2017.02.042","journal-title":"Appl Math Model"},{"key":"7581_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1080\/25765299.2019.1615172","volume":"26","author":"J Kaabi","year":"2019","unstructured":"Kaabi J, Harrath Y (2019) Permutation rules and genetic algorithm to solve the traveling salesman problem. Arab J Basic Appl Sci 26:283\u2013291. https:\/\/doi.org\/10.1080\/25765299.2019.1615172","journal-title":"Arab J Basic Appl Sci"},{"key":"7581_CR15","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.asoc.2016.08.036","journal-title":"Appl Soft Comput"},{"key":"7581_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1109\/41.538609","volume":"43","author":"KF Man","year":"1996","unstructured":"Man KF, Tang KS, Kwong S (1996) Genetic algorithms: concepts and applications. IEEE Trans Ind Electron 43:519\u2013534. https:\/\/doi.org\/10.1109\/41.538609","journal-title":"IEEE Trans Ind Electron"},{"key":"7581_CR17","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\u2014A traveling salesman problem library. ORSA J Comput 3:376\u2013384. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J Comput"},{"key":"7581_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42452-019-1469-1","volume":"1","author":"A Riazi","year":"2019","unstructured":"Riazi A (2019) Genetic algorithm and a double-chromosome implementation to the traveling salesman problem. SN Appl Sci 1:1\u20137. https:\/\/doi.org\/10.1007\/s42452-019-1469-1","journal-title":"SN Appl Sci"},{"key":"7581_CR19","first-page":"699","volume":"9","author":"AS Rostami","year":"2015","unstructured":"Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl Math Inf Sci 9:699\u2013709","journal-title":"Appl Math Inf Sci"},{"key":"7581_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0167-739X(99)00134-X","volume":"17","author":"GA Sena","year":"2001","unstructured":"Sena GA, Megherbi D, Isern G (2001) Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study. Future Gener Comput Sys 17:477\u2013488. https:\/\/doi.org\/10.1016\/S0167-739X(99)00134-X","journal-title":"Future Gener Comput Sys"},{"key":"7581_CR21","doi-asserted-by":"publisher","first-page":"7351","DOI":"10.1007\/s00500-016-2279-7","volume":"21","author":"S Trigui","year":"2017","unstructured":"Trigui S, Cheikhrouhou O, Koubaa A, Baroudi U, Youssef H (2017) FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems. Soft Comput 21:7351\u20137362. https:\/\/doi.org\/10.1007\/s00500-016-2279-7","journal-title":"Soft Comput"},{"key":"7581_CR22","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s00500-003-0317-8","volume":"8","author":"HK Tsai","year":"2004","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2004) Some issues of designing genetic algorithms for traveling salesman problems. Soft Comput 8:689\u2013697. https:\/\/doi.org\/10.1007\/s00500-003-0317-8","journal-title":"Soft Comput"},{"key":"7581_CR23","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/178621","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. https:\/\/doi.org\/10.1155\/2014\/178621","journal-title":"Sci World J"},{"key":"7581_CR24","doi-asserted-by":"publisher","first-page":"12855","DOI":"10.1007\/s00500-020-04712-2","volume":"24","author":"P Victer Paul","year":"2020","unstructured":"Victer Paul P, Ganeshkumar C, Dhavachelvan P, Baskaran R (2020) A novel ODV crossover operator-based genetic algorithms for traveling salesman problem. Soft Comput 24:12855\u201312885. https:\/\/doi.org\/10.1007\/s00500-020-04712-2","journal-title":"Soft Comput"},{"key":"7581_CR25","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.parco.2005.03.006","volume":"31","author":"ZG Wang","year":"2005","unstructured":"Wang ZG, Wong YS, Rahman M (2005) Development of a parallel optimization method based on genetic simulated annealing algorithm. Parallel Comput 31:839\u2013857. https:\/\/doi.org\/10.1016\/j.parco.2005.03.006","journal-title":"Parallel Comput"},{"key":"7581_CR26","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu X, Yuan H, Liptrott M, Trovati M (2018) Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Comput 22:6567\u20136581. https:\/\/doi.org\/10.1007\/s00500-017-2705-5","journal-title":"Soft Comput"},{"key":"7581_CR27","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max\u2013min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585\u2013596. https:\/\/doi.org\/10.1007\/s00500-014-1279-8","journal-title":"Soft Comput"},{"key":"7581_CR28","doi-asserted-by":"publisher","first-page":"5782","DOI":"10.1016\/j.asoc.2011.01.046","volume":"11","author":"R Yusof","year":"2011","unstructured":"Yusof R, Khalid M, Hui GT, Yusof SM, Othman MF (2011) Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm. Appl Soft Comput 11:5782\u20135792. https:\/\/doi.org\/10.1016\/j.asoc.2011.01.046","journal-title":"Appl Soft Comput"},{"key":"7581_CR29","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/1712630","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. https:\/\/doi.org\/10.1155\/2016\/1712630","journal-title":"Comput Intell Neurosci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07581-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07581-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07581-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T10:29:07Z","timestamp":1680085747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07581-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["7581"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07581-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2022,10,19]]},"assertion":[{"value":"22 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":2,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}