{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:12:38Z","timestamp":1779905558467,"version":"3.53.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T00:00:00Z","timestamp":1613779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T00:00:00Z","timestamp":1613779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-021-00623-8","type":"journal-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T17:07:55Z","timestamp":1613840875000},"page":"1813-1851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7392-9011","authenticated-orcid":false,"given":"Anupam","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Partha Sarathi","family":"Barma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joydeep","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goutam","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manoranjan","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,20]]},"reference":[{"key":"623_CR1","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.endm.2015.07.055","volume":"50","author":"FHN Abe","year":"2015","unstructured":"Abe FHN, Hoshino EA, Hill A (2015) The ring star facility location problem. Electron Notes Discrete Math 50:331\u2013336","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"623_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2009.07.026","volume":"203","author":"R Baldacci","year":"2010","unstructured":"Baldacci R, Dell\u2019Amico M (2010) Heuristic algorithms for the multi-depot ring star problem. Eur J Oper Res 203(1):270\u2013281","journal-title":"Eur J Oper Res"},{"issue":"6","key":"623_CR2","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci R, Dell\u2019Amico M, Salazar Gonz\u00e1lez JJ (2007) The capacitated m-ring star problem. Oper Res 55(6):1147\u20131162","journal-title":"Oper Res"},{"key":"623_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2014.12.016","volume":"299","author":"Z Beheshti","year":"2015","unstructured":"Beheshti Z, Shamsuddin SM, Hasan S (2015) Memetic binary particle swarm optimization for discrete optimization problems. Inf Sci 299:58\u201384","journal-title":"Inf Sci"},{"key":"623_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.10.032","volume":"115","author":"O Belgin","year":"2018","unstructured":"Belgin O, Karaoglan I, Altiparmak F (2018) Two-echelon vehicle routing problem with simultaneous pickup and delivery: mathematical model and heuristic approach. Comput Ind Eng 115:1\u201316","journal-title":"Comput Ind Eng"},{"key":"623_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2013.05.013","volume":"231","author":"HI Calvete","year":"2013","unstructured":"Calvete HI, Gal\u00e9 C, Iranzo JA (2013) An efficient evolutionary algorithm for the ring star problem. Eur J Oper Res 231:22\u201333","journal-title":"Eur J Oper Res"},{"issue":"3","key":"623_CR7","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23(3):208\u2013213","journal-title":"Transp Sci"},{"issue":"2","key":"623_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4018\/jamc.2011040103","volume":"2","author":"M Das","year":"2011","unstructured":"Das M, Roy R, Dehuri S, Cho SB (2011) A new approach to associative classification based on binary multi-objective particle swarm optimization. Int J Appl Metaheuristic Comput 2(2):51\u201373","journal-title":"Int J Appl Metaheuristic Comput"},{"issue":"2","key":"623_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast elitist multiobjective genetic algorithm: NSGAII. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"623_CR10","doi-asserted-by":"crossref","unstructured":"Dias TCS, de Sousa Filho GF, Macambira EM, Cabral LAF, Fampa MHC (2006) An efficient heuristic for the ring star problem. In: Alvarez C, Serna M (eds) Experimental algorithms. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, pp 24\u201335","DOI":"10.1007\/11764298_3"},{"issue":"4","key":"623_CR11","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"BL Golden","year":"2012","unstructured":"Golden BL, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534\u2013553","journal-title":"INFORMS J Comput"},{"key":"623_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: a survey of recent variants, solution approaches and applications. Eur J Oper Res 255:315\u2013332","journal-title":"Eur J Oper Res"},{"key":"623_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) Effective implementation of the Lin\u2013Kerninghan traveling salesman heuristic. Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"623_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2018.02.004","volume":"94","author":"A Hill","year":"2018","unstructured":"Hill A, Schwarze S (2018) Exact algorithms for bi-objective ring tree problems with reliability measures. Comput Oper Res 94:38\u201351","journal-title":"Comput Oper Res"},{"key":"623_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s13675-015-0035-x","volume":"4","author":"A Hill","year":"2016","unstructured":"Hill A, Vo\u00df S (2016) Optimal capacitated ring trees. EURO J Comput Optim 4:137\u2013166","journal-title":"EURO J Comput Optim"},{"key":"623_CR15","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2017.09.010","volume":"242","author":"A Hill","year":"2018","unstructured":"Hill A, Vo\u00df S (2018) Generalized local branching heuristics and the capacitated ring tree problem. Discrete Appl Math 242:34\u201352","journal-title":"Discrete Appl Math"},{"issue":"1","key":"623_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/02331930903500332","volume":"59","author":"S Kedad-Sidhoum","year":"2010","unstructured":"Kedad-Sidhoum S, Nguyen VH (2010) An exact algorithm for solving the ring star problem. Optimization 59(1):125\u2013140","journal-title":"Optimization"},{"key":"623_CR19","unstructured":"Labbe M, Laporte G, Rodriguez Martin I, Salazar Gonzalez JJ (1999) The median cycle problem, Working paper, CRT-99-29, Universit\u00e9 de Montr\u00e9al, Corpus ID: 10164962"},{"issue":"3","key":"623_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labbe","year":"2004","unstructured":"Labbe M, Laporte G, Rodriguez Martin I, Salazar Gonzalez JJ (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177\u2013189","journal-title":"Networks"},{"key":"623_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345\u2013358","journal-title":"Eur J Oper Res"},{"key":"623_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.amc.2010.01.021","volume":"216","author":"YH Liu","year":"2010","unstructured":"Liu YH (2010) Different initial solution generators in genetic algorithms for solving the probabilistic travelling salesman problem. Appl Math Comput 216:125\u2013137","journal-title":"Appl Math Comput"},{"key":"623_CR22","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","volume":"83","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80\u201398","journal-title":"Adv Eng Softw"},{"issue":"1","key":"623_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10489-016-0825-8","volume":"45","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Jangir P, Saremi S (2017) Multi-objective ant lion optimizer: a multiobjective optimization algorithm for solving engineering problems. Appl Intell 45(1):79\u201395","journal-title":"Appl Intell"},{"key":"623_CR24","doi-asserted-by":"publisher","first-page":"11557","DOI":"10.1007\/s00500-018-03697-3","volume":"23","author":"S Majumder","year":"2019","unstructured":"Majumder S, Kar S, Pal T (2019a) Uncertain multi-objective Chinese postman problem. Soft Comput 23:11557\u201311572","journal-title":"Soft Comput"},{"key":"623_CR25","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1007\/s00500-017-2987-7","volume":"23","author":"S Majumder","year":"2019","unstructured":"Majumder S, Kundu P, Kar S, Pal T (2019b) Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint. Soft Comput 23:3279\u20133301","journal-title":"Soft Comput"},{"key":"623_CR26","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:297\u2013345","journal-title":"Complex Syst"},{"issue":"2","key":"623_CR27","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00831-7","volume":"151","author":"JA Moreno P\u00e9rez","year":"2003","unstructured":"Moreno P\u00e9rez JA, Moreno Vega JM, Rodr\u00edguez Mart\u00edn I (2003) Variable neighborhood Tabu search and its application to the median cycle problem. Eur J Oper Res 151(2):365\u2013378","journal-title":"Eur J Oper Res"},{"key":"623_CR28","doi-asserted-by":"crossref","unstructured":"Mukherjee A, Maity S, Panigrahi G, Maiti M (2017a) Imprecise constrained covering solid travelling salesman problem with credibility. In: Giri D, Mohapatra R, Begehr H, Obaidat M (eds) Mathematics and computing. ICMC 2017 communications in computer and information science, vol 655. Springer, Singapore, pp 181\u2013195","DOI":"10.1007\/978-981-10-4642-1_16"},{"key":"623_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s12652-017-0620-3","volume":"10","author":"A Mukherjee","year":"2017","unstructured":"Mukherjee A, Panigrahi G, Kar S, Maiti M (2017b) Constrained covering solid travelling salesman problems in uncertain environment. J Ambient Intell Human Comput 10:125\u2013141","journal-title":"J Ambient Intell Human Comput"},{"issue":"1","key":"623_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"Z Naji-Azimi","year":"2012","unstructured":"Naji-Azimi Z, Salari M, Toth P (2012) An integer linear programming based heuristic for the capacitated m-ring-star problem. Eur J Oper Res 217(1):17\u201325","journal-title":"Eur J Oper Res"},{"key":"623_CR31","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985\u20132002","journal-title":"Comput Oper Res"},{"issue":"1","key":"623_CR32","doi-asserted-by":"publisher","first-page":"38","DOI":"10.31181\/dmame180138r","volume":"1","author":"A Rikalovic","year":"2018","unstructured":"Rikalovic A, Soares GA, Ignjatic J (2018) Spatial analysis of logistics center location: a comprehensive approach. Decis Mak Appl Manag Eng 1(1):38\u201350","journal-title":"Decis Mak Appl Manag Eng"},{"issue":"4","key":"623_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.4018\/jamc.2011100104","volume":"2","author":"R Roy","year":"2011","unstructured":"Roy R, Dehuri S, Cho SB (2011) A novel particle swarm optimization algorithm for multi-objective combinatorial optimization problem. Int J Appl Metaheuristic Comput 2(4):41\u201357","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"623_CR34","doi-asserted-by":"publisher","first-page":"2594","DOI":"10.1016\/j.cor.2012.01.004","volume":"39","author":"M Salari","year":"2012","unstructured":"Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39:2594\u20132602","journal-title":"Comput Oper Res"},{"key":"623_CR35","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cie.2015.02.019","volume":"83","author":"M Salari","year":"2015","unstructured":"Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244\u2013251","journal-title":"Comput Ind Eng"},{"key":"623_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00543-8","author":"I Sbai","year":"2020","unstructured":"Sbai I, Krichen S, Limam O (2020) Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00543-8","journal-title":"Oper Res"},{"issue":"16","key":"623_CR37","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2011.01.015","volume":"159","author":"L Simonetti","year":"2011","unstructured":"Simonetti L, Frota Y, De Souza CC (2011) The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm. Discrete Appl Math 159(16):1901\u20131914","journal-title":"Discrete Appl Math"},{"issue":"10","key":"623_CR38","first-page":"3113","volume":"24","author":"G Yogaranjan","year":"2016","unstructured":"Yogaranjan G, Revathi T (2016) A discrete ant lion optimization (DALO) algorithm for solving data gathering tour problem in wireless sensor networks. Middle-East J Sci Res 24(10):3113\u20133120","journal-title":"Middle-East J Sci Res"},{"issue":"1","key":"623_CR39","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11633-009-0097-4","volume":"06","author":"F Zhao","year":"2009","unstructured":"Zhao F, Sun J, Li S, Liu W (2009) A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery. Int J Autom Comput 06(1):97\u2013102","journal-title":"Int J Autom Comput"},{"issue":"4","key":"623_CR40","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00623-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00623-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00623-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T17:04:12Z","timestamp":1659027852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00623-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,20]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00623-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,20]]},"assertion":[{"value":"23 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2021","order":4,"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":"The authors declare that there is no conflict of interest regarding the publication of this paper.","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"}}]}}