{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T01:33:36Z","timestamp":1773452016984,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\\1152(0024)\\2020-EMR-I"],"award-info":[{"award-number":["09\\1152(0024)\\2020-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s13198-023-02161-2","type":"journal-article","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T19:01:30Z","timestamp":1696705290000},"page":"2684-2694","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A comparative analysis of genetic algorithms on a case study of asymmetric traveling salesman problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Amit","family":"Raj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parul","family":"Punia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4140-1006","authenticated-orcid":false,"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,7]]},"reference":[{"key":"2161_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s13198-016-0493-4","volume":"9","author":"AO Adewumi","year":"2018","unstructured":"Adewumi AO, Adeleke OJ (2018) A survey of recent advances in vehicle routing problems. Int J Syst Assur Eng Manage 9:155\u2013172","journal-title":"Int J Syst Assur Eng Manage"},{"key":"2161_CR2","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":"2161_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.neucom.2017.05.054","volume":"275","author":"MZ Ali","year":"2018","unstructured":"Ali MZ, Awad NH, Suganthan PN, Shatnawi AM, Reynolds RG (2018) An improved class of real-coded genetic algorithms for numerical optimization. Neurocomputing 275(1):155\u2013166","journal-title":"Neurocomputing"},{"key":"2161_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer N, Junger M, Reinelt G (2000) A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput Optim Appl 17:61\u201384","journal-title":"Comput Optim Appl"},{"issue":"1","key":"2161_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01584228","volume":"21","author":"E Balas","year":"1981","unstructured":"Balas E, Christofides N (1981) A restricted Lagrangean approach to the traveling salesman problem. Math Program 21(1):19\u201346","journal-title":"Math Program"},{"issue":"5","key":"2161_CR6","doi-asserted-by":"publisher","first-page":"2132","DOI":"10.1007\/s13198-022-01685-3","volume":"13","author":"N Bansal","year":"2022","unstructured":"Bansal N, Singh AK (2022) Valuable survey on scheduling algorithms in the cloud with various publications. Int J Syst Assur Eng Manag 13(5):2132\u20132150","journal-title":"Int J Syst Assur Eng Manag"},{"issue":"3","key":"2161_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore M, Nemhauser GL (1968) The traveling salesman problem: a survey. Oper Res 16(3):538\u2013558","journal-title":"Oper Res"},{"key":"2161_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.eswa.2018.12.044","volume":"122","author":"U Boryczka","year":"2019","unstructured":"Boryczka U, Szwarc K (2019) The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem. Expert Syst Appl 122:43\u201353","journal-title":"Expert Syst Appl"},{"key":"2161_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L Buriol","year":"2004","unstructured":"Buriol L, Franca PM, Moscato P (2004) A new memetic algorithm for the asymmetric traveling salesman problem. J Heurist 10:483\u2013506","journal-title":"J Heurist"},{"issue":"4","key":"2161_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/212066.212081","volume":"21","author":"G Carpaneto","year":"1995","unstructured":"Carpaneto G, Dell\u2019Amico M, Toth P (1995) Exact solution of large-scale, asymmetric traveling salesman problems. ACM Transact Math Softw (TOMS) 21(4):394\u2013409","journal-title":"ACM Transact Math Softw (TOMS)"},{"key":"2161_CR11","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s13198-014-0328-0","volume":"9","author":"K Deep","year":"2018","unstructured":"Deep K, Mebrahtu H, Nagar AK (2018) Novel GA for metropolitan stations of Indian railways when modeled as a TSP. Int J Syst Assur Eng Manage 9:639\u2013645","journal-title":"Int J Syst Assur Eng Manage"},{"key":"2161_CR12","volume-title":"Introduction to genetic algorithms","author":"SN Deepa","year":"2008","unstructured":"Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin"},{"key":"2161_CR13","unstructured":"Dehedkar SN, Raj S (2022) Determination of optimal location and implementation of solar photovoltaic system using ETAP. In: 2022 IEEE 2nd International Symposium on Sustainable Energy, Signal Processing and Cyber Security (iSSSC). IEEE, pp 1\u20134"},{"issue":"1","key":"2161_CR14","first-page":"187","volume":"2","author":"LJ Eshelman","year":"1993","unstructured":"Eshelman LJ, Schaffer JD (1993) Real-coded genetic algorithms and interval-schemata. Found Genet Algorithm 2(1):187\u2013202","journal-title":"Found Genet Algorithm"},{"issue":"3","key":"2161_CR15","doi-asserted-by":"publisher","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":"2161_CR16","unstructured":"Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness"},{"key":"2161_CR17","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading"},{"issue":"1","key":"2161_CR18","first-page":"139","volume":"5","author":"DE Goldberg","year":"1991","unstructured":"Goldberg DE (1991) Real-coded genetic algorithms, virtual alphabeths, and blocking. Complex Syst 5(1):139\u2013167","journal-title":"Complex Syst"},{"key":"2161_CR19","unstructured":"https:\/\/www.google.com\/maps\/@29.282929,76.026532,8z"},{"issue":"5","key":"2161_CR20","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80(5):8091\u20138126","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"2161_CR21","first-page":"681","volume":"1","author":"JW Kim","year":"2002","unstructured":"Kim JW, Kim SW, Park P, Park TJ (2002) On the similarities between binary-coded GA and real-coded GA in wide search space. Proc 2002 Congress Evoluti Comput 1(2):681\u2013686","journal-title":"Proc 2002 Congress Evoluti Comput"},{"issue":"2","key":"2161_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larranaga","year":"1999","unstructured":"Larranaga P, Kuijpers C, Murga R (1999) Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artif Intell Rev 13(2):129\u2013170","journal-title":"Artif Intell Rev"},{"issue":"1","key":"2161_CR23","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s13198-021-01549-2","volume":"13","author":"K Li","year":"2022","unstructured":"Li K, Zhuo Y, Luo X (2022) Optimization method of fuel saving and cost reduction of tugboat main engine based on genetic algorithm. Int J Syst Assur Eng Manage 13(1):605\u2013614","journal-title":"Int J Syst Assur Eng Manage"},{"key":"2161_CR24","doi-asserted-by":"publisher","first-page":"109943","DOI":"10.1016\/j.asoc.2022.109943","volume":"133","author":"W Li","year":"2023","unstructured":"Li W, Wang C, Huang Y, Cheung YM (2023) Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem. Appl Soft Comput 133:109943","journal-title":"Appl Soft Comput"},{"key":"2161_CR25","doi-asserted-by":"crossref","unstructured":"Lin C (2009) An adaptive genetic algorithm based on population diversity strategy. In: 2009 Third International Conference on Genetic and Evolutionary Computing, pp 93\u201396","DOI":"10.1109\/WGEC.2009.67"},{"issue":"12","key":"2161_CR26","doi-asserted-by":"publisher","first-page":"7641","DOI":"10.1002\/int.22602","volume":"36","author":"S Mahapatra","year":"2021","unstructured":"Mahapatra S, Dey B, Raj S (2021) A novel ameliorated Harris hawk optimizer for solving complex engineering optimization problems. Int J Intell Syst 36(12):7641\u20137681","journal-title":"Int J Intell Syst"},{"key":"2161_CR27","first-page":"200220","volume":"18","author":"S Mahapatra","year":"2023","unstructured":"Mahapatra S, Raj S (2023) A novel meta-heuristic approach for optimal RPP using series compensated FACTS controller. Intell Syst Appl 18:200220","journal-title":"Intell Syst Appl"},{"issue":"9","key":"2161_CR28","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar J, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235(9):3063\u20133078","journal-title":"J Comput Appl Math"},{"issue":"2","key":"2161_CR29","first-page":"114","volume":"1","author":"A Mohebifar","year":"2006","unstructured":"Mohebifar A (2006) New binary representation in genetic algorithms for solving TSP by mapping permutations to a list of ordered numbers. WSEAS Transact Comput Res 1(2):114\u2013118","journal-title":"WSEAS Transact Comput Res"},{"issue":"186","key":"2161_CR30","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.proeng.2017.03.209","volume":"100","author":"D Mora-Melia","year":"2017","unstructured":"Mora-Melia D, Martinez-Solano FJ, Iglesias-Rey PL, Gutierrez-Bahamondes JH (2017) Population size influence on the efficiency of evolutionary algorithms to design water networks. Procedia Eng 100(186):341\u2013348","journal-title":"Procedia Eng"},{"key":"2161_CR31","doi-asserted-by":"crossref","unstructured":"Mzili T, Mzili I, Riffi ME (2023) Artificial rat optimization with decision-making: a bio-inspired metaheuristic algorithm for solving the traveling salesman problem. Decis Making Appl Manage Eng","DOI":"10.31181\/dmame622023644"},{"issue":"10","key":"2161_CR32","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2012.02.029","volume":"39","author":"Y Nagata","year":"2012","unstructured":"Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric traveling salesman problem. Expert Syst Appl 39(10):8947\u20138953","journal-title":"Expert Syst Appl"},{"key":"2161_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba E, Del Ser J, Sadollah A, Bilbao MN, Camacho D (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl Soft Comput 71:277\u2013290","journal-title":"Appl Soft Comput"},{"key":"2161_CR34","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"},{"key":"2161_CR35","doi-asserted-by":"crossref","unstructured":"Pekny JF, Miller DL (1990) A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. In: Proceedings of the 1990 ACM annual conference on Cooperation, pp 56\u201362","DOI":"10.1145\/100348.100358"},{"issue":"3","key":"2161_CR36","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"JY Potvin","year":"1996","unstructured":"Potvin JY (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63(3):337\u2013370","journal-title":"Ann Oper Res"},{"key":"2161_CR37","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.swevo.2017.12.008","volume":"40","author":"S Raj","year":"2018","unstructured":"Raj S, Bhattacharyya B (2018) Optimal placement of TCSC and SVC for reactive power planning using Whale optimization algorithm. Swarm Evol Comput 40:131\u2013143","journal-title":"Swarm Evol Comput"},{"key":"2161_CR38","doi-asserted-by":"publisher","first-page":"113363","DOI":"10.1016\/j.chaos.2023.113363","volume":"170","author":"S Raj","year":"2023","unstructured":"Raj S, Mahapatra S, Babu R, Verma S (2023) Hybrid intelligence strategy for techno-economic reactive power dispatch approach to ensure system security. Chaos, Solitons Fractals 170:113363","journal-title":"Chaos, Solitons Fractals"},{"key":"2161_CR39","doi-asserted-by":"publisher","first-page":"106223","DOI":"10.1016\/j.cor.2023.106223","volume":"155","author":"Y Rocha","year":"2023","unstructured":"Rocha Y, Subramanian A (2023) Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows. Comput Operat Res 155:106223","journal-title":"Comput Operat Res"},{"issue":"3","key":"2161_CR40","first-page":"01","volume":"1569","author":"NGAPH Saptarini","year":"2020","unstructured":"Saptarini NGAPH, Ciptayani PI, Wisswani NW, Suasnawa IW (2020) Adaptive genetic algorithm for high school time-table. J Phys 1569(3):01\u201306","journal-title":"J Phys"},{"key":"2161_CR41","doi-asserted-by":"crossref","unstructured":"Singh G, Gupta N, Khosravy M (2015) New crossover operators for real coded genetic algorithm (RCGA). In: 2015 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS), pp 135\u2013140","DOI":"10.1109\/ICIIBMS.2015.7439507"},{"issue":"4","key":"2161_CR42","doi-asserted-by":"publisher","first-page":"3669","DOI":"10.1007\/s13369-018-3617-0","volume":"44","author":"MA Tawhid","year":"2019","unstructured":"Tawhid MA, Savsani P (2019) Discrete sine-cosine algorithm (DSCA) with local search for solving traveling salesman problem. Arab J Sci Eng 44(4):3669\u20133679","journal-title":"Arab J Sci Eng"},{"key":"2161_CR43","doi-asserted-by":"crossref","unstructured":"Wang J, Huang J, Rao S, Xue S, Yin J (2008) An adaptive genetic algorithm for solving traveling salesman problem. In: International Conference on Intelligent Computing, pp 182\u2013189","DOI":"10.1007\/978-3-540-85984-0_23"},{"issue":"1","key":"2161_CR44","first-page":"01","volume":"2019","author":"J Wang","year":"2019","unstructured":"Wang J, Zhang M, Ersoy OK, Sun K, Bi Y (2019) An improved real-coded genetic algorithm using the Heuristical normal distribution and direction-based crossover. Comput Intell Neurosci 2019(1):01\u201318","journal-title":"Comput Intell Neurosci"},{"key":"2161_CR45","volume-title":"Genetic Algorithms+ Data Structures= Evolution Programs","author":"M Zbigniew","year":"1996","unstructured":"Zbigniew M (1996) Genetic Algorithms+ Data Structures= Evolution Programs. Springer-Verlag, Berlin"},{"key":"2161_CR46","doi-asserted-by":"publisher","first-page":"119765","DOI":"10.1016\/j.eswa.2023.119765","volume":"221","author":"T Zhang","year":"2023","unstructured":"Zhang T, Zhou Y, Zhou G, Deng W, Luo Q (2023) Discrete Mayfly algorithm for spherical asymmetric traveling salesman problem. Expert Syst Appl 221:119765","journal-title":"Expert Syst Appl"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-023-02161-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13198-023-02161-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-023-02161-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T14:20:10Z","timestamp":1699971610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13198-023-02161-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,7]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2161"],"URL":"https:\/\/doi.org\/10.1007\/s13198-023-02161-2","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"value":"0975-6809","type":"print"},{"value":"0976-4348","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,7]]},"assertion":[{"value":"8 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interest to disclose by the authors in relation to the current study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The author did not conduct any studies involving human participants or animals for this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"All the authors have approved the manuscript and agree with its submission to the International Journal of System Assurance Engineering and Management.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}