{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:12:26Z","timestamp":1767046346659},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T00:00:00Z","timestamp":1581033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T00:00:00Z","timestamp":1581033600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00500-020-04712-2","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T06:02:52Z","timestamp":1581055372000},"page":"12855-12885","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A novel ODV crossover operator-based genetic algorithms for traveling salesman problem"],"prefix":"10.1007","volume":"24","author":[{"given":"P.","family":"Victer Paul","sequence":"first","affiliation":[]},{"given":"C.","family":"Ganeshkumar","sequence":"additional","affiliation":[]},{"given":"P.","family":"Dhavachelvan","sequence":"additional","affiliation":[]},{"given":"R.","family":"Baskaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,7]]},"reference":[{"issue":"2","key":"4712_CR1","first-page":"339","volume":"2","author":"JG Andal","year":"2001","unstructured":"Andal JG, Sathiamoorthy S (2001) A hybrid genetic algorithm: a new approach to solve traveling salesman problem. Int J Comput Eng Sci 2(2):339\u2013355","journal-title":"Int J Comput Eng Sci"},{"key":"4712_CR2","doi-asserted-by":"crossref","unstructured":"Arthi J, Nanthini R, Sridevi S, Victer Paul P (2015) Enhanced ODV based population seeding technique for ATSP. In: International conference on innovations in information, embedded and communication systems (ICIIECS), India, pp 1\u20134","DOI":"10.1109\/ICIIECS.2015.7193041"},{"key":"4712_CR3","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 travelling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38:14439\u201314450","journal-title":"Expert Syst Appl"},{"key":"4712_CR4","unstructured":"Chuan KT(2007) Multi-parent extension of edge recombination. In: Proceedings of the 9th annual ACM conference on genetic and evolutionary computation (GECCO \u201807), pp 1535\u20131535"},{"key":"4712_CR5","doi-asserted-by":"crossref","unstructured":"Deng Y, Liu Y, Zhou D (2015) An improved genetic algorithm with initial population strategy for symmetric TSP. Mathematical Problems in Engineering 2015","DOI":"10.1155\/2015\/212794"},{"key":"4712_CR6","unstructured":"Eiben A (2002) Multiparent recombination in evolutionary computing. In: Advances in evolutionary computing, Springer, pp 175\u2013192"},{"key":"4712_CR7","doi-asserted-by":"crossref","unstructured":"Eiben A, Rau\u00e9 P-E, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. In: Parallel problem solving from nature\u2014PPSN III. LNCS, vol 866, pp 78\u201387, Springer","DOI":"10.1007\/3-540-58484-6_252"},{"issue":"2","key":"4712_CR8","first-page":"124","volume":"13","author":"TA El-Mihoub","year":"2006","unstructured":"El-Mihoub TA, Hopgood AA, Nolle L, Battersby A (2006) Hybrid genetic algorithms: a review. Eng Lett 13(2):124\u2013137","journal-title":"Eng Lett"},{"key":"4712_CR9","doi-asserted-by":"crossref","first-page":"6995","DOI":"10.1016\/j.eswa.2008.08.026","volume":"36","author":"L Fei","year":"2009","unstructured":"Fei L, Guangzhou Z (2009) Study of genetic algorithm with reinforcement learning to solve the TSP. Expert Syst Appl 36:6995\u20137001","journal-title":"Expert Syst Appl"},{"key":"4712_CR100","unstructured":"Hains DR (2012) Generalized partition crossover for the traveling salesman problem. Diss. Colorado State University, Libraries"},{"key":"4712_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0895-7177(00)00088-1","volume":"31","author":"K Katayama","year":"2000","unstructured":"Katayama K, Sakamoto H, Narihisa H (2000) The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Math Comput Model 31:197\u2013203","journal-title":"Math Comput Model"},{"key":"4712_CR11","unstructured":"Kaur D, Murugappan MM (2008) Performance enhancement in solving travelling salesman problem using hybrid genetic algorithm. In: Annual meeting of the North American fuzzy information processing society, NAFIPS 2008, pp 1\u20136"},{"issue":"2012","key":"4712_CR12","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.asoc.2011.09.020","volume":"12","author":"G Liu","year":"2012","unstructured":"Liu G, Yuanxiang L, Xin N, Hao Z (2012) A novel clustering-based differential evolution with 2 multi-parent crossovers for global optimization. Appl Soft Comput 12(2012):663\u2013681","journal-title":"Appl Soft Comput"},{"key":"4712_CR13","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1016\/j.camwa.2003.07.011","volume":"47","author":"H Maaranen","year":"2004","unstructured":"Maaranen H, Miettinen K, Makela MM (2004) Quasi-random initial population for genetic algorithms. Comput Math Appl 47:1885\u20131895","journal-title":"Comput Math Appl"},{"issue":"2","key":"4712_CR14","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1016\/j.eswa.2009.06.085","volume":"37","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M (2010) A hybrid genetic\u2013particle swarm optimization algorithm for solving the vehicle routing problem. Expert Syst Appl 37(2):1446\u20131455","journal-title":"Expert Syst Appl"},{"key":"4712_CR15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s10015-010-0866-8","volume":"15","author":"K Masafumi","year":"2010","unstructured":"Masafumi K, Kunihito Y, Masaharu M, Moritoshi Y, Ikuo Y (2010) Development of a novel crossover of hybrid genetic algorithms for large-scale traveling salesman problems. Artif Life Robot 15:547\u2013550","journal-title":"Artif Life Robot"},{"key":"4712_CR16","first-page":"219","volume-title":"Parallel problem solving from nature","author":"K Mathias","year":"1992","unstructured":"Mathias K, Whitley D (1992) Genetic operators, the fitness landscape and the traveling salesman problem. In: Manner R, Manderick B (eds) Parallel problem solving from nature. North Holland, Elsevier, pp 219\u2013228"},{"key":"4712_CR17","first-page":"3885","volume":"9","author":"N Moganarangan","year":"2014","unstructured":"Moganarangan N, Raju R, Ramachandiran R, Paul PV, Dhavachelvan P, Venkatachalapathy VS (2014) Efficient crossover operator for genetic algorithm with ODV based population seeding technique. Int J Appl Eng Res 9:3885\u20133898","journal-title":"Int J Appl Eng Res"},{"key":"4712_CR18","doi-asserted-by":"publisher","unstructured":"Nagata Y (2004). Criteria for designing crossovers for TSP. In: Proceeding of congress on evolutionary computation (CEC 2004), vol 2. https:\/\/doi.org\/10.1109\/cec.2004.1331069","DOI":"10.1109\/cec.2004.1331069"},{"key":"4712_CR19","unstructured":"Nagata Y, Kobayashi S (1997) Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem. In: Proceeding of the seventh international conference on genetic algorithms (ICGA), pp 450\u2013457"},{"key":"4712_CR20","doi-asserted-by":"publisher","unstructured":"Nguyen HD, Yoshihara I, Yasunaga M (2000) Modified edge recombination operators of genetic algorithms for the traveling salesman problem. In: 26th annual IEEE confjerence of the industrial electronics society (IECON), Nagoya. pp 2815\u20132820. https:\/\/doi.org\/10.1109\/iecon.2000.972444","DOI":"10.1109\/iecon.2000.972444"},{"issue":"2","key":"4712_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s00500-014-1522-3","volume":"20","author":"G Pan","year":"2016","unstructured":"Pan G et al (2016) Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft Comput 20(2):555\u2013566","journal-title":"Soft Comput"},{"key":"4712_CR22","doi-asserted-by":"crossref","unstructured":"Pandey HM et al. (2016) Evaluation of genetic algorithm\u2019s selection methods. In: Information systems design and intelligent applications. Springer, New Delhi, pp 731\u2013738","DOI":"10.1007\/978-81-322-2752-6_72"},{"issue":"3","key":"4712_CR23","first-page":"2993","volume":"5","author":"PV Paul","year":"2013","unstructured":"Paul PV, Ramalingam A, Baskaran R, Dhavachelvan P, Vivekanandan K, Subramanian R, Venkatachalapathy VS (2013a) Performance analyses on population seeding techniques for genetic algorithms. Int J Eng Technol 5(3):2993\u20133000","journal-title":"Int J Eng Technol"},{"key":"4712_CR24","unstructured":"Paul PV, Dhavachelvan P, Baskaran R (2013b) A novel population initialization technique for genetic algorithm. In: IEEE international conference on circuit, power and computing technologies (ICCPCT), India, pp 1235\u20131238. ISBN: 978-1-4673-4921-5"},{"issue":"2","key":"4712_CR25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.jocs.2013.05.009","volume":"5","author":"PV Paul","year":"2014","unstructured":"Paul PV, Ramalingam A, Baskaran R, Dhavachelvan P, Vivekanandan K, Subramanian R (2014) A new population seeding technique for permutation-coded genetic algorithm: service transfer approach. J Comput Sci 5(2):277\u2013297","journal-title":"J Comput Sci"},{"key":"4712_CR26","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","volume":"32","author":"PV Paul","year":"2015","unstructured":"Paul PV, Moganarangan N, Kumar SS, Raju R, Vengattaraman T, Dhavachelvan P (2015) Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems. Applied Soft Computing. 32:383\u2013402","journal-title":"Applied Soft Computing."},{"issue":"1","key":"4712_CR27","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","volume":"22","author":"PW Poon","year":"1995","unstructured":"Poon PW, Carter JN (1995) Genetic algorithm crossover operators for ordering applications. Comput Oper Res. 22(1):135\u2013147","journal-title":"Comput Oper Res."},{"issue":"2010","key":"4712_CR28","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"DC Porumbel","year":"2010","unstructured":"Porumbel DC, Jin-Kao H, Pascale K (2010) An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput Oper Res 37(2010):1822\u20131832","journal-title":"Comput Oper Res"},{"key":"4712_CR29","doi-asserted-by":"crossref","unstructured":"Rong Y (1997) Solving large travelling salesman problems with small populations. In: Genetic algorithms in engineering systems: innovations and applications, Conference Publication No. 446, pp 157\u2013162","DOI":"10.1049\/cp:19971173"},{"issue":"10","key":"4712_CR30","first-page":"0973","volume":"8","author":"M Shanmugam","year":"2013","unstructured":"Shanmugam M, SaleemBasha MS, Victer Paul P, Dhavachelvan P, Baskaran R (2013) Performance assessment over heuristic population seeding techniques of genetic algorithm: benchmark analyses on traveling salesman problems. Int J Appl Eng Res 8(10):0973\u20134562","journal-title":"Int J Appl Eng Res"},{"issue":"3","key":"4712_CR31","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","volume":"26","author":"SR Shubhra","year":"2007","unstructured":"Shubhra SR, Sanghamitra B, Sankar KP (2007) Genetic operators for combinatorial optimization in TSP and microarray gene ordering. J Appl Intell 26(3):183\u2013195","journal-title":"J Appl Intell"},{"key":"4712_CR32","volume-title":"Introduction to genetic algorithms","author":"SN Sivanandam","year":"2008","unstructured":"Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin"},{"key":"4712_CR33","unstructured":"Ting CK (2005) Design and analysis of multi-parent genetic algorithms, Ph.D. thesis, University of Paderborn, Germany"},{"issue":"2","key":"4712_CR34","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.asoc.2012.10.018","volume":"13","author":"JZ Ting","year":"2013","unstructured":"Ting JZ (2013) A genetic algorithm for finding a path subject to two constraints. Appl Soft Comput 13(2):891\u2013898","journal-title":"Appl Soft Comput"},{"key":"4712_CR35","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1016\/j.eswa.2009.07.082","volume":"37","author":"CK Ting","year":"2010","unstructured":"Ting CK, Chien-Hao S, Chung-Nan L (2010) Multi-parent extension of partially mapped crossover for combinatorial optimization problems. Expert Syst Appl 37:1879\u20131886","journal-title":"Expert Syst Appl"},{"issue":"4","key":"4712_CR36","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"HK Tsai","year":"2004","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2004) An evolutionary algorithm for large traveling salesman problems. IEEE Trans Syst Man Cybern Part B 34(4):1718\u20131729","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"4712_CR37","unstructured":"TSPLIB http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/. Accessed 21 Sep 2012"},{"key":"4712_CR38","doi-asserted-by":"crossref","unstructured":"Tsutsui S, Ghosh A (1998) A study on the effect of multi-parent recombination in real coded genetic algorithms. In: Proceedings of international conference on evolutionary computation, pp 828\u2013833","DOI":"10.1109\/ICEC.1998.700159"},{"key":"4712_CR39","doi-asserted-by":"crossref","unstructured":"Tsutsui S, Jain L (1998) On the effect on multi-parent recombination in real coded genetic algorithms. In: Proceedings of the 2nd international conference on knowledge-based intelligent electronic systems, pp 155\u2013160","DOI":"10.1109\/ICEC.1998.700159"},{"key":"4712_CR40","first-page":"657","volume":"1","author":"S Tsutsui","year":"1999","unstructured":"Tsutsui S, Yamamura M, Higuchi T (1999) Multi-parent recombination with simplex crossover in real coded genetic algorithms. Proc Genet Evolut Comput Conf 1:657\u2013664","journal-title":"Proc Genet Evolut Comput Conf"},{"key":"4712_CR41","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":"4712_CR42","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang J et al (2016) Multi-offspring genetic algorithm and its application to the traveling salesman problem. Appl Soft Comput 43:415\u2013423","journal-title":"Appl Soft Comput"},{"key":"4712_CR43","unstructured":"Whitely D, Starkweather T, D\u2019Ann F (1989) Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Proceedings 3rd international conference genetic algorithms, pp 133\u2013140"},{"key":"4712_CR44","doi-asserted-by":"crossref","unstructured":"Whitley D, Hains D, Howe A (2009) Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, pp 915\u2013922. ACM","DOI":"10.1145\/1569901.1570026"},{"key":"4712_CR45","first-page":"566","volume-title":"PPSN XI LNCS","author":"D Whitley","year":"2010","unstructured":"Whitley D, Hains D, Howe A (2010) A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer R, Cotta C, Kolodziej J, Rudolph G (eds) PPSN XI LNCS, vol 6238. Springer, Heidelberg, pp 566\u2013575"},{"key":"4712_CR200","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.537","volume-title":"Third international conference on natural computation (ICNC 2007)","author":"W Yingzi","year":"2007","unstructured":"Yingzi W,  Yulan H, Kanfeng G (2007) Parallel search strategies for TSPs using a greedy genetic algorithm. In: Third international conference on natural computation (ICNC 2007). vol. 3. IEEE, Haikou, China. https:\/\/doi.org\/10.1109\/ICNC.2007.537"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04712-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-04712-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04712-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:01:50Z","timestamp":1612821710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-04712-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,7]]},"references-count":47,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4712"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-04712-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,7]]},"assertion":[{"value":"7 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Author P. Victer Paul declares that he has no conflict of interest. Author P. Dhavachelvan declares that he has no conflict of interest. Author C. Ganeshkumar declares that he has no conflict of interest. Author R. Baskaran declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}