{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T15:29:47Z","timestamp":1750433387269,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:00:00Z","timestamp":1667606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:00:00Z","timestamp":1667606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Lulea University of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper introduces the Hierarchical Multi-Switch Multi-Echelon Vehicle Routing Problem, a new variant of the well-known Vehicle Routing Problem. It is a real-world problem originating from the policies of a Nordic distribution company. The problem includes a single depot, a non-predetermined hierarchy of intermediate facilities, and two different fleets, consisting of homogeneous original and homogeneous local vehicles, which are pulling swap-bodies. Original vehicles with attached swap-bodies depart from the central depot. They can either visit customers directly if only one swap-body is attached or visit one or two consecutive switch points in order to transfer one or two loaded swap-bodies to a corresponding number of local vehicles, which are subsequently routed to customers while the original vehicle itself proceeds to serve customers with the remaining loaded swap-body. A mixed-integer formulation of the problem is proposed. A short bibliographic review, relations, shared characteristics, and differences of the proposed variant and several known VRP variants are analyzed and discussed. The solution of an illustrative instance is presented in order to demonstrate the solution concept for the problem as well as to compare with solution concepts for previously stated VRP variants. Computational experiments on small instances that could be solved within one hour are also presented. The problem is computationally hard to solve. Thus, the development of heuristics and metaheuristics is an important future task in order to enable solution of real case instances or instances of realistic sizes.<\/jats:p>","DOI":"10.1007\/s11590-022-01946-x","type":"journal-article","created":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T02:09:25Z","timestamp":1667614165000},"page":"1469-1486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A note on the hierarchical multi-switch multi-echelon vehicle routing problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8108-6998","authenticated-orcid":false,"given":"M.","family":"Tadaros","sequence":"first","affiliation":[]},{"given":"A.","family":"Migdalas","sequence":"additional","affiliation":[]},{"given":"B.","family":"Samuelsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,5]]},"reference":[{"issue":"5","key":"1946_CR1","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1287\/trsc.2019.0943","volume":"54","author":"L Accorsi","year":"2020","unstructured":"Accorsi, L., Vigo, D.: A hybrid metaheuristic for single truck and trailer routing problems. Transp. Sci. 54(5), 1351\u20131371 (2020)","journal-title":"Transp. Sci."},{"key":"1946_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68928-5","volume-title":"Pyomo-Optimization Modeling in Python","author":"ML Bynum","year":"2021","unstructured":"Bynum, M.L., Hackebeil, G.A., Hart, W.E., Laird, C.D., Nicholson, B.L., Siirola, J.D., Watson, J.-P., Woodruff, D.L.: Pyomo-Optimization Modeling in Python, vol. 67, 3rd edn. Springer Science & Business Media, Cham (2021)","edition":"3"},{"issue":"1","key":"1946_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0305-0548(00)00056-3","volume":"29","author":"I-M Chao","year":"2002","unstructured":"Chao, I.-M.: A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1), 33\u201351 (2002)","journal-title":"Comput. Oper. Res."},{"key":"1946_CR4","doi-asserted-by":"crossref","unstructured":"Crainic, T., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6622 LNCS:179\u2013190 (2011)","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"1946_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.cor.2014.06.008","volume":"55","author":"R Cuda","year":"2015","unstructured":"Cuda, R., Guastaroba, G., Speranza, M.G.: A survey on two-echelon routing problems. Comput. Oper. Res. 55, 185\u2013199 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1946_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1287\/trsc.2018.0844","volume":"53","author":"N Dellaert","year":"2019","unstructured":"Dellaert, N., Dashty Saridarq, F., Van Woensel, T., Crainic, T.G.: Branch-and-price-based algorithms for the two-echelon vehicle routing problem with time windows. Transp. Sci. 53(2), 463\u2013479 (2019)","journal-title":"Transp. Sci."},{"issue":"2","key":"1946_CR7","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.cor.2012.08.007","volume":"40","author":"U Derigs","year":"2013","unstructured":"Derigs, U., Pullmann, M., Vogel, U.: Truck and trailer routing-problems, heuristics and computational experience. Comput. Oper. Res. 40(2), 536\u2013546 (2013)","journal-title":"Comput. Oper. Res."},{"key":"1946_CR8","first-page":"5","volume":"12","author":"M Drexl","year":"2013","unstructured":"Drexl, M., et al.: Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem. Revista de Metodos Cuantitativos para la Economia y la Empresa. 12, 5\u201338 (2011)","journal-title":"Revista de Metodos Cuantitativos para la Economia y la Empresa"},{"issue":"1","key":"1946_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","volume":"254","author":"P Grangier","year":"2016","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.-M.: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res. 254(1), 80\u201391 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1946_CR10","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, (2021). URL https:\/\/www.gurobi.com"},{"issue":"3","key":"1946_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in python. Math. Program. Comput. 3(3), 219\u2013260 (2011)","journal-title":"Math. Program. Comput."},{"key":"1946_CR12","doi-asserted-by":"crossref","unstructured":"Huber, S., Geiger, M.: Swap body vehicle routing problem: a heuristic solution approach. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8760, pp. 16\u201330 (2014)","DOI":"10.1007\/978-3-319-11421-7_2"},{"key":"1946_CR13","doi-asserted-by":"crossref","unstructured":"Huber, S., Geiger, M.: Dealing with scarce optimization time in complex logistics optimization: a study on the biobjective swap-body inventory routing problem. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9019, pp. 279\u2013294 (2015)","DOI":"10.1007\/978-3-319-15892-1_19"},{"issue":"12","key":"1946_CR14","doi-asserted-by":"publisher","first-page":"15244","DOI":"10.1016\/j.eswa.2011.05.075","volume":"38","author":"S-W Lin","year":"2011","unstructured":"Lin, S.-W., Vincent, F.Y., Lu, C.-C.: A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst. Appl. 38(12), 15244\u201315252 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"1946_CR15","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/s10479-016-2233-1","volume":"253","author":"J Miranda-Bront","year":"2017","unstructured":"Miranda-Bront, J., Curcio, B., M\u00e9ndez-D\u00edaz, I., Montero, A., Pousa, F., Zabala, P.: A cluster-first route-second approach for the swap body vehicle routing problem. Ann. Oper. Res. 253(2), 935\u2013956 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"1946_CR16","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1007\/s11067-014-9282-2","volume":"15","author":"S Mirmohammadsadeghi","year":"2015","unstructured":"Mirmohammadsadeghi, S., Ahmed, S.: Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows. Netw. Spat. Econ. 15(4), 1093\u20131115 (2015)","journal-title":"Netw. Spat. Econ."},{"key":"1946_CR17","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.endm.2010.05.081","volume":"36","author":"G Perboli","year":"2010","unstructured":"Perboli, G., Tadei, R.: New families of valid inequalities for the two-echelon vehicle routing problem. Electron. Notes Discrete Math. 36, 639\u2013646 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"1946_CR18","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1287\/trsc.1110.0368","volume":"45","author":"G Perboli","year":"2011","unstructured":"Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transp. Sci. 45(3), 364\u2013380 (2011)","journal-title":"Transp. Sci."},{"issue":"4","key":"1946_CR19","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.cor.2004.08.002","volume":"33","author":"S Scheuerer","year":"2006","unstructured":"Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. 33(4), 894\u2013909 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1946_CR20","unstructured":"Tadaros, M.: HMSME-VRP Instances, (2022). URL https:\/\/github.com\/ahotad\/HMSME-VRP-Instances.git"},{"key":"1946_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.cor.2017.08.002","volume":"89","author":"T Toffolo","year":"2018","unstructured":"Toffolo, T., Christiaens, J., Van Malderen, S., Wauters, T., Vanden Berghe, G.: Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89, 68\u201381 (2018)","journal-title":"Comput. Oper. Res."},{"key":"1946_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM, Philadelphia (2014)"},{"issue":"5","key":"1946_CR23","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.engappai.2010.01.013","volume":"23","author":"JG Villegas","year":"2010","unstructured":"Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: Grasp\/vnd and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intell. 23(5), 780\u2013794 (2010)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"11","key":"1946_CR24","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1057\/s41274-016-0170-7","volume":"68","author":"K Wang","year":"2017","unstructured":"Wang, K., Lan, S., Zhao, Y.: A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service. J. Oper. Res. Soc. 68(11), 1409\u20131421 (2017)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01946-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01946-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01946-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:16:44Z","timestamp":1685114204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01946-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,5]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1946"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01946-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,11,5]]},"assertion":[{"value":"29 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}