{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:53:05Z","timestamp":1774993985228,"version":"3.50.1"},"reference-count":147,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100014440","name":"Spain Ministry of Science and Innovation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund Plus","doi-asserted-by":"publisher","award":["RYC2022-035269-I"],"award-info":[{"award-number":["RYC2022-035269-I"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2025.09.040","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T05:21:12Z","timestamp":1759296072000},"page":"711-729","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recent developments in location-routing problems"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0418-6212","authenticated-orcid":false,"given":"Rossana","family":"Cavagnini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0440-0357","authenticated-orcid":false,"given":"Alberto","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4203-8926","authenticated-orcid":false,"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.09.040_b1","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1287\/trsc.2019.0943","article-title":"A hybrid metaheuristic for single truck and trailer routing problems","volume":"54","author":"Accorsi","year":"2020","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b2","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.ejor.2018.02.020","article-title":"A profit-maximization location-routing-pricing problem: A branch-and-price algorithm","volume":"271","author":"Ahmadi-Javid","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b3","series-title":"Operations research and cyber-infrastructure","first-page":"309","article-title":"A branch-and-price algorithm for combined location and routing problems under capacity restrictions","volume":"vol. 47","author":"Akca","year":"2009"},{"key":"10.1016\/j.ejor.2025.09.040_b4","article-title":"A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem","volume":"168","author":"Akpunar","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.ejor.2011.09.022","article-title":"Multiperiod location-routing with decoupled time scales","volume":"217","author":"Albareda-Sambola","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b6","series-title":"Location science","first-page":"431","article-title":"Location-routing and location-arc routing","author":"Albareda-Sambola","year":"2019"},{"key":"10.1016\/j.ejor.2025.09.040_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102356","article-title":"A novel risk perspective on location-routing planning: An application in cash transportation","volume":"150","author":"Allahyari","year":"2021","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2018.12.026","article-title":"Location routing problems on trees","volume":"259","author":"Ar\u00e1oz","year":"2019","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.09.040_b9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","article-title":"Knowledge-guided local search for the vehicle routing problem","volume":"105","author":"Arnold","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105166","article-title":"A progressive filtering heuristic for the location-routing problem and variants","volume":"129","author":"Arnold","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2021.02.010","article-title":"The location-or-routing problem","volume":"147","author":"Arslan","year":"2021","journal-title":"Transportation Research Part B"},{"key":"10.1016\/j.ejor.2025.09.040_b12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.trb.2020.11.010","article-title":"The location and location-routing problem for the refugee camp network design","volume":"143","author":"Arslan","year":"2021","journal-title":"Transportation Research Part B"},{"key":"10.1016\/j.ejor.2025.09.040_b13","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(93)E0173-U","article-title":"The hub location and routing problem","volume":"83","author":"Aykin","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b14","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.ejor.2018.06.038","article-title":"Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network","volume":"272","author":"Bagheri Hosseini","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b15","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","article-title":"New route relaxation and pricing strategies for the vehicle routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b16","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1287\/opre.1110.0989","article-title":"An exact method for the capacitated location-routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b17","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","article-title":"Using clustering analysis in a capacitated location-routing problem","volume":"179","author":"Barreto","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.09.040_b18","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.trd.2009.01.004","article-title":"Energy and emissions impacts of a freeway-based dynamic eco-driving system","volume":"14","author":"Barth","year":"2009","journal-title":"Transportation Research Part D"},{"issue":"17","key":"10.1016\/j.ejor.2025.09.040_b19","doi-asserted-by":"crossref","first-page":"13267","DOI":"10.1007\/s00521-019-04666-z","article-title":"Bi-objective optimization approaches to many-to-many hub location routing with distance balancing and hard time window","volume":"32","author":"Basirati","year":"2019","journal-title":"Neural Computing and Applications"},{"issue":"6","key":"10.1016\/j.ejor.2025.09.040_b20","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","article-title":"A branch-and-cut method for the capacitated location-routing problem","volume":"38","author":"Belenguer","year":"2011","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b21","series-title":"Proceedings of the 2015 international conference on industrial engineering and systems management","first-page":"1383","article-title":"A model and a metaheuristic method for the hub location routing problem and application to postal services","author":"Bostel","year":"2015"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0377-2217(90)90092-P","article-title":"The Hamiltonian p-median problem","volume":"47","author":"Branco","year":"1990","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ejor.2018.05.055","article-title":"A column generation approach for location-routing problems with pickup and delivery","volume":"272","author":"Capelle","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b24","series-title":"Location routing problem instances","author":"Cavagnini","year":"2025"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/21681015.2018.1479894","article-title":"The location routing problem with arc time windows for terror regions: a mixed integer formulation","volume":"35","author":"\u00c7etinkaya","year":"2018","journal-title":"Journal of Industrial and Production Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2025.09.040_b26","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b27","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.disopt.2013.07.005","article-title":"A computational comparison of flow formulations for the capacitated location-routing problem","volume":"10","author":"Contardo","year":"2013","journal-title":"Discrete Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b28","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","article-title":"An exact algorithm based on cut-and-column generation for the capacitated location-routing problem","volume":"26","author":"Contardo","year":"2014","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1002\/net.21594","article-title":"Reaching the elementary lower bound in the vehicle routing problem with time windows","volume":"65","author":"Contardo","year":"2015","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.09.040_b31","series-title":"Transportation","first-page":"467","article-title":"Intermodal transportation","volume":"vol. 14","author":"Crainic","year":"2007"},{"key":"10.1016\/j.ejor.2025.09.040_b32","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.cor.2014.06.008","article-title":"A survey on two-echelon routing problems","volume":"55","author":"Cuda","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.09.040_b33","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/trsc.18.4.331","article-title":"The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application","volume":"18","author":"Daganzo","year":"1984","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b34","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s00500-020-05186-y","article-title":"The multi-zone location\u2013routing problem with pricing: a flow-based formulation and two heuristic approaches","volume":"25","author":"Dastaki","year":"2020","journal-title":"Soft Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b35","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1007\/s00291-023-00718-y","article-title":"A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours","volume":"45","author":"De Freitas","year":"2023","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2025.09.040_b36","series-title":"Computational logistics","first-page":"275","article-title":"Two echelon location routing problem with simultaneous pickup and delivery: Mixed integer programming formulations and comparative analysis","volume":"vol. 9855","author":"Demircan-Yildiz","year":"2016"},{"key":"10.1016\/j.ejor.2025.09.040_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106426","article-title":"A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem","volume":"161","author":"Dom\u00ednguez-Mart\u00edn","year":"2024","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b38","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing\u2014a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b39","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","article-title":"A survey of variants and extensions of the location-routing problem","volume":"241","author":"Drexl","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2025.09.040_b40","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"Du Merle","year":"1999","journal-title":"Discrete Mathematics"},{"issue":"11","key":"10.1016\/j.ejor.2025.09.040_b41","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","article-title":"A GRASP \u00d7 ELS approach for the capacitated location-routing problem","volume":"37","author":"Duhamel","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b42","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cor.2019.01.011","article-title":"The green location-routing problem","volume":"105","author":"Dukkanci","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2024.02.037","article-title":"A unifying framework for selective routing problems","volume":"320","author":"Dursuno\u011flu","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b44","doi-asserted-by":"crossref","first-page":"3733","DOI":"10.1051\/ro\/2022170","article-title":"Mathematical modeling of a bi-objective hub location-routing problem for rapid transit networks","volume":"56","author":"Fallah-Tafti","year":"2022","journal-title":"RAIRO \u2014 Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b45","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.cor.2017.09.010","article-title":"A column generation approach for the location-routing problem with time windows","volume":"90","author":"Farham","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b46","series-title":"Location science","first-page":"67","article-title":"Fixed-charge facility location problems","author":"Fern\u00e1ndez","year":"2019"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b47","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1287\/trsc.2018.0881","article-title":"Exact solution of several families of location-arc routing problems","volume":"53","author":"Fern\u00e1ndez","year":"2019","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b48","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.asoc.2018.05.024","article-title":"Two effective simulated annealing algorithms for the location-routing problem","volume":"70","author":"Ferreira","year":"2018","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108443","article-title":"A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints","volume":"118","author":"Ferreira","year":"2022","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b50","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2018.07.022","article-title":"A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms","volume":"100","author":"Ghaffarinasab","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b51","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1287\/trsc.2015.0600","article-title":"The multicommodity-ring location routing problem","volume":"50","author":"Gianessi","year":"2016","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b52","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/net.21683","article-title":"Locating depots for capacitated vehicle routing","volume":"68","author":"G\u00f8rtz","year":"2016","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2025.09.040_b53","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1002\/net.21912","article-title":"An MIP formulation for the open location-routing problem considering the topological characteristic of the solution-paths","volume":"74","author":"Granada","year":"2019","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.09.040_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106041","article-title":"A location-or-routing problem with partial and decaying coverage","volume":"149","author":"Haghi","year":"2023","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b55","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.1120.0423","article-title":"Approximation algorithms for capacitated location routing","volume":"47","author":"Harks","year":"2013","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b56","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ejor.2022.04.028","article-title":"Bifactor approximation for location routing with vehicle and facility capacities","volume":"304","author":"Heine","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b57","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b58","series-title":"An extension of the Lin\u2013Kernighan\u2013Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","first-page":"966","author":"Helsgaun","year":"2017"},{"issue":"12","key":"10.1016\/j.ejor.2025.09.040_b59","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","article-title":"An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics","volume":"39","author":"Hemmelmayr","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b60","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/trsc.1030.0085","article-title":"Effective local search algorithms for routing and scheduling problems with general time-window constraints","volume":"39","author":"Ibaraki","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106211","article-title":"The p-hub centre routing problem with emissions budget: Formulation and solution procedure","volume":"154","author":"Ibnoulouafi","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b62","series-title":"Location science","first-page":"705","article-title":"Districting problems","author":"Kalcsics","year":"2019"},{"key":"10.1016\/j.ejor.2025.09.040_b63","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2014.06.009","article-title":"A memetic algorithm for the capacitated location-routing problem with mixed backhauls","volume":"55","author":"Karaoglan","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b64","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.ejor.2011.01.003","article-title":"A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery","volume":"211","author":"Karaoglan","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b65","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cie.2017.12.020","article-title":"The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems","volume":"116","author":"Karimi","year":"2018","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.09.040_b66","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.tre.2017.10.004","article-title":"Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery","volume":"108","author":"Kartal","year":"2017","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b67","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1051\/ro\/2024116","article-title":"Round-trip hub location problem","volume":"59","author":"Kemmar","year":"2025","journal-title":"RAIRO \u2014 Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b68","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10696-018-9319-9","article-title":"Analysis of vehicle emissions in location-routing problem","volume":"31","author":"Ko\u00e7","year":"2018","journal-title":"Flexible Services and Manufacturing Journal"},{"key":"10.1016\/j.ejor.2025.09.040_b69","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","article-title":"A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows","volume":"64","author":"Ko\u00e7","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b70","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ejor.2015.06.082","article-title":"The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm","volume":"248","author":"Ko\u00e7","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b71","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.trb.2015.12.010","article-title":"The impact of depot location, fleet composition and routing on emissions in city logistics","volume":"84","author":"Ko\u00e7","year":"2016","journal-title":"Transportation Research Part B"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b72","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","article-title":"Locating median cycles in networks","volume":"160","author":"Labb\u00e9","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b73","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/8987402","article-title":"Shared mechanism-based self-adaptive hyperheuristic for regional low-carbon location-routing problem with time windows","author":"Leng","year":"2018","journal-title":"Mathematical Problems in Engineering"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b74","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1287\/opre.2023.2458","article-title":"Nonrobust strong knapsack cuts for capacitated location routing and related problems","volume":"71","author":"Liguori","year":"2023","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b75","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"issue":"7","key":"10.1016\/j.ejor.2025.09.040_b76","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","article-title":"The fleet size and mix vehicle routing problem with time windows","volume":"50","author":"Liu","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2025.09.040_b77","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2023.100063","article-title":"A conceptually simple algorithm for the capacitated location-routing problem","volume":"11","author":"L\u00f6ffler","year":"2023","journal-title":"EURO Journal on Computational Optimization"},{"key":"10.1016\/j.ejor.2025.09.040_b78","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1002\/net.21685","article-title":"Heuristics for a hub location-routing problem","volume":"68","author":"Lopes","year":"2014","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.09.040_b79","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2016.01.006","article-title":"A simple and effective evolutionary algorithm for the capacitated location\u2013routing problem","volume":"70","author":"Lopes","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.09.040_b80","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1111\/itor.12032","article-title":"A taxonomical analysis, current methods and objectives on location-routing problems","volume":"20","author":"Lopes Borges","year":"2013","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b81","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.cor.2015.03.011","article-title":"Skewed general variable neighborhood search for the location routing scheduling problem","volume":"61","author":"Macedo","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b82","series-title":"Proceedings of 5th berkeley symposium on mathematical statistics and probability","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"Macqueen","year":"1967"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b83","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","article-title":"Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms","volume":"26","author":"Malandraki","year":"1992","journal-title":"Transportation Science"},{"issue":"6","key":"10.1016\/j.ejor.2025.09.040_b84","doi-asserted-by":"crossref","first-page":"2941","DOI":"10.1111\/itor.12950","article-title":"Location-routing problem: a classification of recent research","volume":"28","author":"Mara","year":"2021","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b85","series-title":"Encyclopedia of optimization","first-page":"1","article-title":"Location routing problem","author":"Marinakis","year":"2025"},{"key":"10.1016\/j.ejor.2025.09.040_b86","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122488","article-title":"Exploring fairness in food delivery routing and scheduling problems","volume":"240","author":"Mart\u00ednez-Sykora","year":"2024","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b87","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1080\/23249935.2020.1720036","article-title":"The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches","volume":"16","author":"Moon","year":"2020","journal-title":"Transportmetrica A"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b88","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.ejor.2016.05.048","article-title":"The latency location-routing problem","volume":"255","author":"Moshref-Javadi","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b89","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1051\/ro\/2020058","article-title":"Formulation and a heuristic approach for the orienteering location-routing problem","volume":"55","author":"Nadizadeh","year":"2021","journal-title":"RAIRO \u2014 Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b90","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","article-title":"A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem","volume":"25","author":"Nagata","year":"2013","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b91","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02564791","article-title":"The many-to-many location-routing problem","volume":"6","author":"Nagy","year":"1998","journal-title":"TOP"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b92","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","article-title":"Location-routing: issues, models and methods","volume":"177","author":"Nagy","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b93","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/s11750-020-00590-x","article-title":"A branch & cut algorithm for the prize-collecting capacitated location routing problem","volume":"29","author":"Negrotto","year":"2021","journal-title":"TOP"},{"key":"10.1016\/j.ejor.2025.09.040_b94","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.eswa.2018.07.025","article-title":"The cumulative capacitated vehicle routing problem: New formulations and iterated greedy algorithms","volume":"113","author":"Nucamendi-Guill\u00e9n","year":"2018","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2025.09.040_b95","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105767","article-title":"New formulations and solution approaches for the latency location routing problem","volume":"143","author":"Nucamendi-Guill\u00e9n","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.09.040_b96","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1111\/itor.12698","article-title":"Cooperative game-theoretic features of cost sharing in location-routing","volume":"27","author":"Osicka","year":"2019","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b97","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106293","article-title":"An iterated local search algorithm for latency vehicle routing problems with multiple depots","volume":"158","author":"Osorio-Mora","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b98","doi-asserted-by":"crossref","first-page":"3801","DOI":"10.1111\/itor.13294","article-title":"Effective metaheuristics for the latency location routing problem","volume":"30","author":"Osorio-Mora","year":"2023","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b99","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10732-021-09477-x","article-title":"A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem","volume":"27","author":"Pandiri","year":"2021","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2025.09.040_b100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2015.12.003","article-title":"Branch-and-price algorithm for the location-routing problem with time windows","volume":"86","author":"Ponboon","year":"2016","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b101","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","article-title":"Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking","volume":"4","author":"Prins","year":"2006","journal-title":"4OR. A Quarterly Journal of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b102","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","article-title":"A survey of recent research on location-routing problems","volume":"238","author":"Prodhon","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b103","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1111\/itor.12479","article-title":"Using horizontal cooperation concepts in integrated routing and facility-location decisions","volume":"26","author":"Quintero-Araujo","year":"2017","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b104","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10479-014-1621-7","article-title":"A location-routing problem in glass recycling","volume":"223","author":"Rahim","year":"2014","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b105","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2013.10.038","article-title":"New mixed integer-programming model for the pickup-and-delivery problem with transshipment","volume":"235","author":"Rais","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b106","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11590-020-01675-z","article-title":"An efficient heuristic for a hub location routing problem","volume":"16","author":"Ratli","year":"2020","journal-title":"Optimization Letters"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b107","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ejor.2024.11.040","article-title":"The location routing problem with time windows and load-dependent travel times for cargo bikes","volume":"323","author":"Rave","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b108","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","article-title":"Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms","volume":"27","author":"Rego","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b109","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch and cut and price for the pickup and delivery problem with time windows","volume":"43","author":"Ropke","year":"2009","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b110","first-page":"3","article-title":"Consistency and robustness in location-routing","volume":"13","author":"Salhi","year":"1999","journal-title":"Studies in Locational Analysis"},{"key":"10.1016\/j.ejor.2025.09.040_b111","doi-asserted-by":"crossref","first-page":"7465","DOI":"10.1016\/j.apm.2013.02.035","article-title":"A new formulation and an exact approach for the many-to-many hub location-routing problem","volume":"37","author":"Saraiva de Camargo","year":"2013","journal-title":"Applied Mathematical Modelling"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b112","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/trsc.2018.0836","article-title":"Vehicle routing and location routing with intermediate stops: A review","volume":"53","author":"Schiffer","year":"2019","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b113","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.tre.2019.06.015","article-title":"The time-dependent location-routing problem","volume":"128","author":"Schmidt","year":"2019","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b114","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10479-017-2509-0","article-title":"A survey of the standard location-routing problem","volume":"259","author":"Schneider","year":"2017","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b115","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.2017.0770","article-title":"Large composite neighborhoods for the capacitated location-routing problem","volume":"53","author":"Schneider","year":"2019","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/j.ejor.2025.09.040_b116","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/21681015.2018.1484391","article-title":"The multi-route location-routing problem and zone price decision-making using a tabu and variable neighborhood search algorithm","volume":"35","author":"Setak","year":"2018","journal-title":"Journal of Industrial and Production Engineering"},{"key":"10.1016\/j.ejor.2025.09.040_b117","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.105954","article-title":"Green location routing problem with flexible multi-compartment for source-separated waste: A Q-learning and multi-strategy-based hyper-heuristic algorithm","volume":"121","author":"Shang","year":"2023","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2025.09.040_b118","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117077","article-title":"The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm","volume":"201","author":"Shang","year":"2022","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b119","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1287\/trsc.2023.0369","article-title":"Genetic algorithms with neural cost predictor for solving hierarchical vehicle routing problems","volume":"59","author":"Sobhanan","year":"2025","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b120","doi-asserted-by":"crossref","first-page":"4641","DOI":"10.1007\/s12351-022-00734-w","article-title":"Bi- and multi-objective location routing problems: classification and literature review","volume":"22","author":"Tadaros","year":"2022","journal-title":"Operational Research: An International Journal"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b121","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b122","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.1070.0230","article-title":"A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities","volume":"20","author":"Tarantilis","year":"2008","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.09.040_b123","series-title":"Proceedings of the 7th international conference on principles and practice of constraint programming","first-page":"16","article-title":"Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming","author":"Thorsteinsson","year":"2001"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b124","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10287-014-0226-6","article-title":"A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces","volume":"12","author":"Tokg\u00f6z","year":"2014","journal-title":"Computational Management Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b125","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s11590-015-0984-2","article-title":"2-facility manifold location routing problem","volume":"11","author":"Tokg\u00f6z","year":"2015","journal-title":"Optimization Letters"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b126","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1111\/itor.13125","article-title":"The location routing problem with facility sizing decisions","volume":"30","author":"Tordecilla","year":"2022","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.09.040_b127","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","article-title":"A two-phase tabu search approach to the location routing problem","volume":"116","author":"Tuzun","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b128","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105643","article-title":"Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood","volume":"140","author":"Vidal","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b129","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","article-title":"A simulated annealing heuristic for the capacitated location routing problem","volume":"58","author":"Vincent","year":"2010","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.09.040_b130","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105856","article-title":"Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions","volume":"146","author":"Voigt","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b131","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106861","article-title":"A literature review on hub location-routing models and their solution techniques","volume":"173","author":"Wandelt","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.09.040_b132","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.procs.2017.08.147","article-title":"Carbon reduction in the location routing problem with heterogeneous fleet, simultaneous pickup-delivery and time windows","volume":"112","author":"Wang","year":"2017","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.ejor.2025.09.040_b133","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.102118","article-title":"Green logistics location-routing problem with eco-packages","volume":"143","author":"Wang","year":"2020","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b134","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103862","article-title":"Exact solution of location\u2013routing problems with heterogeneous fleet and weight-based carbon emissions","volume":"193","author":"Wang","year":"2025","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2025.09.040_b135","first-page":"355","article-title":"Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"Tohoku Mathematical Journal"},{"issue":"3","key":"10.1016\/j.ejor.2025.09.040_b136","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/j.ejor.2022.02.002","article-title":"Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem","volume":"302","author":"Wu","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.09.040_b137","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.cie.2016.10.029","article-title":"Solving location and routing problem for UAVs","volume":"102","author":"Yak\u0131c\u0131","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.09.040_b138","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1287\/trsc.2021.1070","article-title":"Hub location, routing, and route dimensioning: Strategic and tactical intermodal transportation hub network design","volume":"55","author":"Y\u0131ld\u0131z","year":"2021","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.09.040_b139","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s10732-018-9389-6","article-title":"A UAV location and routing problem with spatio-temporal synchronization constraints solved by ant colony optimization","volume":"25","author":"Y\u0131lmaz","year":"2019","journal-title":"Journal of Heuristics"},{"issue":"12","key":"10.1016\/j.ejor.2025.09.040_b140","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3390\/math10122131","article-title":"Regional location routing problem for waste collection using hybrid genetic algorithm-simulated annealing","volume":"10","author":"Yu","year":"2022","journal-title":"Mathematics"},{"key":"10.1016\/j.ejor.2025.09.040_b141","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.cor.2014.10.009","article-title":"A simulated annealing heuristic for the open location-routing problem","volume":"62","author":"Yu","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b142","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1080\/00207543.2015.1085655","article-title":"Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing","volume":"54","author":"Yu","year":"2015","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2025.09.040_b143","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106936","article-title":"Location-routing problem with time-dependent demands","volume":"151","author":"Yu","year":"2021","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.09.040_b144","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105760","article-title":"A novel hybrid genetic algorithm for the location routing problem with tight capacity constraints","volume":"85","author":"Yu","year":"2019","journal-title":"Applied Soft Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.09.040_b145","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1007\/s12351-019-00480-6","article-title":"A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery","volume":"21","author":"Zhao","year":"2019","journal-title":"Operational Research: An International Journal"},{"key":"10.1016\/j.ejor.2025.09.040_b146","article-title":"Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery","author":"Zhao","year":"2020","journal-title":"Complexity"},{"key":"10.1016\/j.ejor.2025.09.040_b147","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106758","article-title":"A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem","volume":"170","author":"Zou","year":"2024","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725007775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725007775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:12:40Z","timestamp":1774991560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725007775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":147,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221725007775"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.09.040","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Recent developments in location-routing problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.09.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}