{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:52:30Z","timestamp":1760647950979,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"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":[[2024,3]]},"DOI":"10.1007\/s00500-023-09574-y","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T11:02:22Z","timestamp":1705489342000},"page":"4235-4265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Varied offspring memetic algorithm with three parents for a realistic synchronized goods delivery and service problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Somnath","family":"Maji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7209-0784","authenticated-orcid":false,"given":"Samir","family":"Maity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumanta","family":"Bsau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debasis","family":"Giri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoranjan","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"issue":"3","key":"9574_CR1","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak M, Allahverdi N (2011) Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst Appl 38(3):1313\u20131320","journal-title":"Expert Syst Appl"},{"key":"9574_CR2","doi-asserted-by":"crossref","unstructured":"Averbakh I, Yu W (2018) Multi-depot traveling salesmen location problems on networks with special structure. Ann Oper Res 635\u2013648","DOI":"10.1007\/s10479-018-2812-4"},{"key":"9574_CR3","unstructured":"Bailay R (2018) Ikea bets on small stores to go digital. https:\/\/economictimes.indiatimes.com\/industry\/services\/retail\/ikea-bets-on-small-stores-to-go-digital\/articleshow\/66743638.cms?from=mdr"},{"issue":"354","key":"9574_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1086\/276408","volume":"30","author":"JM Baldwin","year":"1896","unstructured":"Baldwin JM (1896) A new factor in evolution. Am Nat 30(354):441\u2013451","journal-title":"Am Nat"},{"key":"9574_CR5","unstructured":"BBC (2018) Surrogate mother of \u2019twins\u2019 finds one is hers. https:\/\/www.bbc.com\/news\/health-41858232"},{"issue":"24","key":"9574_CR6","doi-asserted-by":"publisher","first-page":"13673","DOI":"10.1007\/s00500-022-07358-4","volume":"26","author":"M Beamurgia","year":"2022","unstructured":"Beamurgia M, Basagoiti R, Rodr\u00edguez I, Rodr\u00edguez V (2022) Improving waiting time and energy consumption performance of a bi-objective genetic algorithm embedded in an elevator group control system through passenger flow estimation. Soft Comput 26(24):13673\u201313692","journal-title":"Soft Comput"},{"issue":"9","key":"9574_CR7","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1007\/s00500-016-2406-5","volume":"21","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerulli R, Sciomachen A (2017) An exact approach for the grocery delivery problem in urban areas. Soft Comput 21(9):2439\u20132450","journal-title":"Soft Comput"},{"issue":"3","key":"9574_CR8","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"T-S Chang","year":"2009","unstructured":"Chang T-S, Wan Y-W, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Oper Res 198(3):748\u2013759","journal-title":"Eur J Oper Res"},{"key":"9574_CR9","unstructured":"Constantinescu E (2012) Three dimensional mari time transportation models. https:\/\/www.scribd.com\/document\/419467025\/Three-Dimensional-Maritime-Transportation-Models"},{"key":"9574_CR10","first-page":"429","volume":"14","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G, Potvin J-Y, Savelsbergh MW (2007) Transportation on demand. Handbk Oper Res Manag Sci 14:429\u2013466","journal-title":"Handbk Oper Res Manag Sci"},{"key":"9574_CR11","unstructured":"Corporation X (2012) Reliable installation service from MI. https:\/\/www.mi.com\/in\/service\/tv_installationservice\/"},{"issue":"1","key":"9574_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"9574_CR13","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong G, 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"},{"key":"9574_CR14","doi-asserted-by":"crossref","unstructured":"Eiben AE, Raue PE, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. In: International conference on parallel problem solving from nature. Springer, pp 78\u201387","DOI":"10.1007\/3-540-58484-6_252"},{"issue":"15","key":"9574_CR15","doi-asserted-by":"crossref","first-page":"6697","DOI":"10.1007\/s00500-018-3303-x","volume":"23","author":"Z Feng","year":"2019","unstructured":"Feng Z (2019) Constructing rural e-commerce logistics model based on ant colony algorithm and artificial intelligence method. Soft Comput 23(15):6697\u20136714","journal-title":"Soft Comput"},{"issue":"4","key":"9574_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci F, Lodi A, Milano M (2002) A hybrid exact algorithm for the TSPTW. INFORMS J Comput 14(4):403\u2013417","journal-title":"INFORMS J Comput"},{"key":"9574_CR17","unstructured":"Forum WE (2018) Where people work the longest hours. https:\/\/www.weforum.org\/agenda\/2018\/01\/the-countries-where-people-work-the-longest-hours\/"},{"issue":"4","key":"9574_CR18","first-page":"275","volume":"3","author":"K Ghoseiri","year":"2008","unstructured":"Ghoseiri K, Sarhadi H (2008) A memetic algorithm for symmetric traveling salesman problem. Int J Manag Sci Eng Manag 3(4):275\u2013283","journal-title":"Int J Manag Sci Eng Manag"},{"issue":"3","key":"9574_CR19","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/opre.11.3.368","volume":"11","author":"K Haley","year":"1963","unstructured":"Haley K (1963) The multi-index problem. Oper Res 11(3):368\u2013379","journal-title":"Oper Res"},{"issue":"2","key":"9574_CR20","first-page":"8","volume":"3","author":"Y Haxhimusa","year":"2011","unstructured":"Haxhimusa Y, Carpenter E, Catrambone J, Foldes D, Stefanov E, Arns L, Pizlo Z (2011) 2d and 3d traveling salesman problem. J Problem Solv 3(2):8","journal-title":"J Problem Solv"},{"key":"9574_CR21","unstructured":"Lagarteja JG, Gerardo BD, Medina RP (2017) Improved genetic algorithm using new crossover operator. In: Proceedings of 4th international conference on innovations in engineering, technology, computers and industrial applications (IETCIA-17) Aug, pp 3\u20134"},{"key":"9574_CR22","doi-asserted-by":"crossref","unstructured":"Lawler E, Lenstra J, Rinnooy Kan A, Shmoys D (1985) The traveling salesman problem: Ge re guided tour of combinatorial optimization. Wiley and Sons, New York","DOI":"10.2307\/2582681"},{"key":"9574_CR23","doi-asserted-by":"publisher","first-page":"12355","DOI":"10.1007\/s00500-022-07094-9","volume":"26","author":"CW Lee","year":"2022","unstructured":"Lee CW, Wong WP (2022) Last-mile drone delivery combinatorial double auction model using multi-objective evolutionary algorithms. Soft Comput 26:12355\u201312384","journal-title":"Soft Comput"},{"issue":"15","key":"9574_CR24","doi-asserted-by":"publisher","first-page":"6697","DOI":"10.1007\/s00500-019-03754-5","volume":"23","author":"Y Ma","year":"2019","unstructured":"Ma Y, Li Z, Yan F, Feng C (2019) A hybrid priority-based genetic algorithm for simultaneous pickup and delivery problems in reverse logistics with time windows and multiple decision-makers. Soft Comput 23(15):6697\u20136714","journal-title":"Soft Comput"},{"key":"9574_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.cie.2015.02.023","volume":"83","author":"S Maity","year":"2015","unstructured":"Maity S, Roy A, Maiti M (2015) A modified genetic algorithm for solving uncertain constrained solid travelling salesman problems. Comput Ind Eng 83:273\u2013296","journal-title":"Comput Ind Eng"},{"key":"9574_CR26","first-page":"39","volume":"5","author":"S Maity","year":"2017","unstructured":"Maity S, Roy A, Maiti M (2017) An intelligent hybrid algorithm for 4-dimensional tsp. J Ind Inf Integr 5:39\u201350","journal-title":"J Ind Inf Integr"},{"issue":"9","key":"9574_CR27","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"},{"key":"9574_CR28","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.omega.2017.01.005","volume":"74","author":"E Malaguti","year":"2018","unstructured":"Malaguti E, Martello S, Santini A (2018) The traveling salesman problem with pickups, deliveries, and draft limits. Omega 74:50\u201358","journal-title":"Omega"},{"issue":"3","key":"9574_CR29","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TSMCB.2005.860138","volume":"36","author":"AC Mart\u00ednez-Estudillo","year":"2005","unstructured":"Mart\u00ednez-Estudillo AC, Herv\u00e1s-Mart\u00ednez C, Mart\u00ednez-Estudillo FJ, Garc\u00eda-Pedrajas N (2005) Hybridization of evolutionary algorithms and local search by means of a clustering method. IEEE Trans Syst Man Cybern B (Cybern) 36(3):534\u2013545","journal-title":"IEEE Trans Syst Man Cybern B (Cybern)"},{"issue":"4","key":"9574_CR30","first-page":"297","volume":"13","author":"P Merz","year":"2001","unstructured":"Merz P, Freisleben B (2001) Memetic algorithms for the traveling salesman problem. Complex Syst 13(4):297\u2013346","journal-title":"Complex Syst"},{"issue":"3","key":"9574_CR31","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140(3):606\u2013617","journal-title":"Eur J Oper Res"},{"key":"9574_CR32","unstructured":"Moscato P et al (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P Report, 826:1989"},{"issue":"10","key":"9574_CR33","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"},{"issue":"1","key":"9574_CR34","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen HL, Madsen OB (2009) The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches. Eur J Oper Res 198(1):139\u2013147","journal-title":"Eur J Oper Res"},{"key":"9574_CR35","first-page":"17","volume":"544","author":"S Reardon","year":"2017","unstructured":"Reardon S (2017) Genetic details of controversial \u2018three-parent baby\u2019 revealed. Reprod Biol 544:17\u201318","journal-title":"Reprod Biol"},{"key":"9574_CR36","unstructured":"Reinelt G (1995) Tsplib. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software. TSPLIB95"},{"key":"9574_CR37","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.ssci.2017.12.013","volume":"103","author":"D Rodriguez-Roman","year":"2018","unstructured":"Rodriguez-Roman D (2018) A surrogate-assisted genetic algorithm for the selection and design of highway safety and travel time improvement projects. Saf Sci 103:305\u2013315","journal-title":"Saf Sci"},{"key":"9574_CR38","doi-asserted-by":"crossref","unstructured":"Roy A, Chakraborty G, Khan I, Maity S, Maiti M (2016) A hybrid heuristic for restricted 4-dimensional TSP (R-4DTSP). In: International conference on frontiers in optimization: theory and applications. Springer, pp 285\u2013302","DOI":"10.1007\/978-981-10-7814-9_20"},{"key":"9574_CR39","unstructured":"Sarkar R (2014) Ro leads, but kent thirsty for more"},{"issue":"5","key":"9574_CR40","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1093\/gbe\/evv073","volume":"7","author":"MK Skinner","year":"2015","unstructured":"Skinner MK (2015) Environmental epigenetics and a unified theory of the molecular aspects of evolution: a neo-Lamarckian concept that facilitates neo-darwinian evolution. Genome Biol Evol 7(5):1296\u20131302","journal-title":"Genome Biol Evol"},{"key":"9574_CR41","doi-asserted-by":"crossref","unstructured":"T\u00fc\u0171-Szab\u00f3 B, F\u00f6ldesi P, K\u00f3czy LT (2017) An efficient new memetic method for the traveling salesman problem with time windows. In: International workshop on multi-disciplinary trends in artificial intelligence. Springer, pp 426\u2013436","DOI":"10.1007\/978-3-319-69456-6_35"},{"key":"9574_CR42","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang J, Ersoy OK, He M, Wang F (2016) Multi-offspring genetic algorithm and its application to the traveling salesman problem. Appl Soft Comput 43:415\u2013423","journal-title":"Appl Soft Comput"},{"issue":"12","key":"9574_CR43","doi-asserted-by":"publisher","first-page":"5150","DOI":"10.1016\/j.eswa.2015.02.037","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang Y (2015) An approximate method to compute a sparse graph for traveling salesman problem. Expert Syst Appl 42(12):5150\u20135162","journal-title":"Expert Syst Appl"},{"key":"9574_CR44","doi-asserted-by":"crossref","unstructured":"Wang Y, Li J, Pan Q, Sun J, Ren L (2010) Memetic algorithm based on improved inver-over operator for TSP. In: 2010 sixth international conference on natural computation (ICNC), vol 5. IEEE, pp 2386\u20132389","DOI":"10.1109\/ICNC.2010.5583529"},{"key":"9574_CR45","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.eswa.2016.11.003","volume":"72","author":"Z Wang","year":"2017","unstructured":"Wang Z, Lin W-H (2017) Incorporating travel time uncertainty into the design of service regions for delivery\/pickup problems with time windows. Expert Syst Appl 72:207\u2013220","journal-title":"Expert Syst Appl"},{"key":"9574_CR46","doi-asserted-by":"crossref","unstructured":"Xu X, Yuan H, Matthew P, Ray J, Bagdasar O, Trovati M (2019) Gorts: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems. Soft Comput 24:7197\u20137210","DOI":"10.1007\/s00500-019-04335-2"},{"key":"9574_CR47","unstructured":"Ye T, Wang T, Lu Z, Hao JK (2014) A multi-parent memetic algorithm for the linear ordering problem. arXiv preprint arXiv:1405.4507"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09574-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-09574-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-09574-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T07:08:23Z","timestamp":1708067303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-09574-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-09574-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2024,1,17]]},"assertion":[{"value":"10 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","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 certify that there is no conflict of interest with any individual\/organization for the present work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This paper does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants"}},{"value":"Informed consent was obtained from all individual participants included in this study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}