{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:13Z","timestamp":1748405413277,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00521-025-11029-4","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T19:40:47Z","timestamp":1742067647000},"page":"10243-10285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Route Multi-Objective TSP: mathematical model and its solution by reference point and aspiration level-based MOQO Jaya algorithm"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3789-2749","authenticated-orcid":false,"given":"Aaishwarya","family":"Bajaj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayesh","family":"Dhodiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"11029_CR1","doi-asserted-by":"crossref","unstructured":"Alkafaween E, Hassanat A (2020) Improving TSP solutions using GA with a new hybrid mutation based on knowledge and randomness. Manag Sci Inform Transp, 128\u2013139","DOI":"10.26552\/com.C.2020.3.128-139"},{"issue":"1","key":"11029_CR2","first-page":"2127340","volume":"10","author":"A Bajaj","year":"2022","unstructured":"Bajaj A, Dhodiya J (2022) Multi-objective quasi oppositional Jaya algorithm to solve multi-objective solid travelling salesman problem with different aspiration level. Int J Syst Sci Oper Logist 10(1):2127340","journal-title":"Int J Syst Sci Oper Logist"},{"issue":"3","key":"11029_CR3","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1007\/s12065-021-00613-x","volume":"15","author":"M Bouzid","year":"2021","unstructured":"Bouzid M, Alaya I, Tagina M (2021) A new artificial bee colony algorithm using a gradual weight method for the bi-objective traveling salesman problems. Evol Intel 15(3):2077\u20132088","journal-title":"Evol Intel"},{"issue":"3","key":"11029_CR4","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, 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":"11029_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatra G, Pal RK (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm Evol Comput"},{"key":"11029_CR6","unstructured":"Corporation SM (2018) Sustainable urban transport index Surat, India"},{"issue":"4","key":"11029_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2013","unstructured":"Deb K, Jain H (2013) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"11029_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40064-016-3685-0","volume":"5","author":"JM Dhodiya","year":"2016","unstructured":"Dhodiya JM, Tailor AR (2016) Genetic algorithm based hybrid approach to solve fuzzy multi-objective assignment problem using exponential membership function. Springerplus 5(1):1\u201329","journal-title":"Springerplus"},{"key":"11029_CR9","doi-asserted-by":"crossref","unstructured":"Dou X-A, Yang Q, Xu P-L, Gao X-D, Lu Z-Y (2023) Comparative study on different encoding strategies for multiple traveling salesmen problem. In: 2023 IEEE international conference on systems, man, and cybernetics (SMC), pp 1437\u20131442. IEEE","DOI":"10.1109\/SMC53992.2023.10394521"},{"key":"11029_CR10","doi-asserted-by":"crossref","unstructured":"Durillo JJ, Nebro AJ, Luna F, Alba E (2009) On the effect of the steady-state selection scheme in multi-objective genetic algorithms. In: International conference on evolutionary multi-criterion optimization, pp 183\u2013197. Springer","DOI":"10.1007\/978-3-642-01020-0_18"},{"key":"11029_CR11","unstructured":"Fang L, Chen P, Liu S (2007) Particle swarm optimization with simulated annealing for TSP. In: Proceedings of the 6th WSEAS international conference on artificial intelligence, knowledge engineering and data bases, pp 206\u2013210. Citeseer"},{"key":"11029_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2014.02.098","volume":"270","author":"H-M Feng","year":"2014","unstructured":"Feng H-M, Liao K-L (2014) Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems. Inf Sci 270:204\u2013225","journal-title":"Inf Sci"},{"key":"11029_CR13","first-page":"416","volume":"93","author":"CM Fonseca","year":"1993","unstructured":"Fonseca CM, Fleming PJ et al (1993) Genetic algorithms for multiobjective optimization: formulationdiscussion and generalization. Icga 93:416\u2013423","journal-title":"Icga"},{"key":"11029_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48661-5_1","volume":"840","author":"R Gerhard","year":"1994","unstructured":"Gerhard R (1994) The traveling salesman: computational solutions for TSP applications. Lect Notes Comput Sci 840:1\u2013223","journal-title":"Lect Notes Comput Sci"},{"key":"11029_CR15","first-page":"8887","volume":"975","author":"HC Ingole","year":"2017","unstructured":"Ingole HC, Kute VB (2017) Parallel computing approach to solve travelling salesman problem. Int J Comput Appl 975:8887","journal-title":"Int J Comput Appl"},{"issue":"5","key":"11029_CR16","first-page":"606","volume":"2","author":"MR Jalali","year":"2005","unstructured":"Jalali MR, Afshar A, Marino MA (2005) Ant colony optimization algorithm(ACO); a new heuristic approach for engineering optimization. WSEAS Trans Inf Sci Appl 2(5):606\u2013610","journal-title":"WSEAS Trans Inf Sci Appl"},{"issue":"5","key":"11029_CR17","first-page":"1406","volume":"6","author":"VY Kakran","year":"2021","unstructured":"Kakran VY, Dhodiya JM (2021) Multi-objective capacitated solid transportation problem with uncertain variables. Int J Math Eng Manag Sci 6(5):1406","journal-title":"Int J Math Eng Manag Sci"},{"issue":"3","key":"11029_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp RM (1977) Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math Oper Res 2(3):209\u2013224","journal-title":"Math Oper Res"},{"issue":"11","key":"11029_CR19","doi-asserted-by":"publisher","first-page":"3942","DOI":"10.1007\/s10489-020-01713-4","volume":"50","author":"I Khan","year":"2020","unstructured":"Khan I, Maiti MK, Basuli K (2020) Multi-objective traveling salesman problem: an ABC approach. Appl Intell 50(11):3942\u20133960","journal-title":"Appl Intell"},{"issue":"1","key":"11029_CR20","first-page":"47","volume":"36","author":"A Khanra","year":"2019","unstructured":"Khanra A, Pal T, Maiti MK, Maiti M (2019) Multi-objective four dimensional imprecise tsp solved with a hybrid multi-objective ant colony optimization-genetic algorithm with diversity. J Intell Fuzzy Syst 36(1):47\u201365","journal-title":"J Intell Fuzzy Syst"},{"key":"11029_CR21","doi-asserted-by":"crossref","unstructured":"Liu B et\u00a0al (2010) Uncertainty theory. Springer, pp 1\u201379","DOI":"10.1007\/978-3-642-13959-8_1"},{"key":"11029_CR22","doi-asserted-by":"crossref","unstructured":"Liu D et\u00a0al (2007) Uncertainty theory. Springer, pp 205\u2013234","DOI":"10.1007\/978-3-540-73165-8_5"},{"key":"11029_CR23","doi-asserted-by":"crossref","unstructured":"Liu Z, Zhang F, Wang X, Zhao Q, Zhang C, Liu T, Zhang B (2021) A discrete squirrel search optimization based algorithm for bi-objective TSP. Wirel Netw, 1\u201315","DOI":"10.1007\/s11276-021-02653-8"},{"issue":"3","key":"11029_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.cor.2009.01.005","volume":"37","author":"T Lust","year":"2010","unstructured":"Lust T, Jaszkiewicz A (2010) Speed-up techniques for solving large-scale biobjective TSP. Comput Oper Res 37(3):521\u2013533","journal-title":"Comput Oper Res"},{"issue":"9","key":"11029_CR25","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":"3\u20134","key":"11029_CR26","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0888-613X(98)10017-8","volume":"19","author":"S Medasani","year":"1998","unstructured":"Medasani S, Kim J, Krishnapuram R (1998) An overview of membership function generation techniques for pattern recognition. Int J Approx Reason 19(3\u20134):391\u2013417","journal-title":"Int J Approx Reason"},{"key":"11029_CR27","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1377\/1\/012048","volume":"1377","author":"M Pavithra","year":"2019","unstructured":"Pavithra M, Ganesan K (2019) A simple approach for the solution of fuzzy multi objective travelling salesman problem. J Phys Conf Ser 1377:012048","journal-title":"J Phys Conf Ser"},{"key":"11029_CR28","unstructured":"Rao RV (2019) Jaya: an advanced optimization algorithm and its engineering applications"},{"key":"11029_CR29","doi-asserted-by":"publisher","first-page":"3409","DOI":"10.1007\/s00366-020-01008-9","volume":"37","author":"RV Rao","year":"2021","unstructured":"Rao RV, Keesari HS (2021) Rao algorithms for multi-objective optimization of selected thermodynamic cycles. Eng Comput 37:3409\u20133437","journal-title":"Eng Comput"},{"issue":"5","key":"11029_CR30","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1007\/s12206-017-0449-x","volume":"31","author":"RV Rao","year":"2017","unstructured":"Rao RV, Rai DP (2017) Optimization of submerged arc welding process parameters using quasi-oppositional based Jaya algorithm. J Mech Sci Technol 31(5):2513\u20132522","journal-title":"J Mech Sci Technol"},{"key":"11029_CR31","unstructured":"Reinelt G (1997) Tsblib. Last accessed February 19, 1997"},{"issue":"1","key":"11029_CR32","first-page":"17","volume":"40","author":"A Roy","year":"2020","unstructured":"Roy A, Gao R, Jia L, Maity S, Kar S (2020) A noble genetic algorithm to solve a solid green traveling purchaser problem with uncertain cost parameters. Am J Math Manag Sci 40(1):17\u201331","journal-title":"Am J Math Manag Sci"},{"issue":"2","key":"11029_CR33","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.cie.2008.01.005","volume":"55","author":"F Samanlioglu","year":"2008","unstructured":"Samanlioglu F, Ferrell WG Jr, Kurz ME (2008) A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem. Comput Ind Eng 55(2):439\u2013449","journal-title":"Comput Ind Eng"},{"key":"11029_CR34","doi-asserted-by":"crossref","unstructured":"Sun P-F, Li J-Y, Li M-Y, Gao Z-Y, Jin H, Jeon S-W, Zhang J (2024) Tour multi-route planning with matrix-based differential evolution. IEEE Trans Intell Transp Syst","DOI":"10.1109\/TITS.2024.3381344"},{"key":"11029_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.trb.2022.12.007","volume":"168","author":"GO Tini\u00e7","year":"2023","unstructured":"Tini\u00e7 GO, Karasan OE, Kara BY, Campbell JF, Ozel A (2023) Exact solution approaches for the minimum total cost traveling salesman problem with multiple drones. Transp Res Part B Methodol 168:81\u2013123","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"11029_CR36","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0165-0114(78)90031-3","volume":"1","author":"H-J Zimmermann","year":"1978","unstructured":"Zimmermann H-J (1978) Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst 1(1):45\u201355","journal-title":"Fuzzy Sets Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11029-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11029-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11029-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T07:08:12Z","timestamp":1748329692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11029-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,15]]},"references-count":36,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["11029"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11029-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2025,3,15]]},"assertion":[{"value":"6 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the author(s).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The author have given consent to participate.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and Consent to participate"}},{"value":"No participation of Human and\/or Animal.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}