Intraroute Resource Replenishment with Mobile Depots

References

• Adenso-Díaz B , Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper. Res. 54(1):99–114.Link, Google Scholar
• Amaya C-A , Langevin A , Trépanier M (2010) A heuristic method for the capacitated arc routing problem with refill points and multiple loads. J. Oper. Res. Soc. 61(7):1095–1103.Crossref, Google Scholar
• Audet C , Orban D (2006) Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. Optim. 17(3):642–664.Crossref, Google Scholar
• Breunig U , Baldacci R , Hartl R , Vidal T (2019) The electric two-echelon vehicle routing problem. Comput. Oper. Res. 103:198–210.Crossref, Google Scholar
• Cuda R , Guastaroba G , Speranza MG (2015) A survey on two-echelon routing problems. Comput. Oper. Res. 55:185–199.Crossref, Google Scholar
• Dayarian I , Savelsbergh M , Clarke J-P (2020) Same-day delivery with drone resupply. Transportation Sci. 54(1):229–249.Link, Google Scholar
• Drexl M (2012) Synchronization in vehicle routing—A survey of VRPs with multiple synchronization constraints. Transportation Sci. 46(3):297–316.Link, Google Scholar
• Glover F (1997) Tabu search and adaptive memory programming—Advances, applications and challenges. Barr RS , Helgason RV , Kennington JL , eds. Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies (Springer, Boston), 1–75.Crossref, Google Scholar
• Goeke D , Schneider M (2015) Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1):81–99.Crossref, Google Scholar
• Grangier P , Gendreau M , Lehuédé F , Rousseau L-M (2016) An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res. 254(1):80–91.Crossref, Google Scholar
• Hemmelmayr VC , Cordeau J-F , Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12):3215–3228.Crossref, Google Scholar
• Ho SC , Gendreau M (2006) Path relinking for the vehicle routing problem. J. Heuristics 12(1):55–72.Crossref, Google Scholar
• Hof J , Schneider M (2019) An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks 74(3):207–250.Crossref, Google Scholar
• Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. , 7(1):48–50.Crossref, Google Scholar
• Masson R , Lehuédé F , Péton O (2013a) An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Sci. 47(3):344–355.Link, Google Scholar
• Masson R , Lehuédé F , Péton O (2013b) Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper. Res. Lett. 41(3):211–215.Crossref, Google Scholar
• Nguyen V-P , Prins C , Prodhon C (2012) Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 216(1):113–126.Crossref, Google Scholar
• Perrier N , Langevin A , Campbell JF (2007) A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal. Comput. Oper. Res. 34(1):258–294.Crossref, Google Scholar
• Rivers C (2002) Coordination in vehicle routing. Unpublished PhD thesis, Massey University, Palmerston North, New Zealand.Google Scholar
• Ropke S , Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Ropke S , Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3):750–775.Crossref, Google Scholar
• Salazar-Aguilar MA , Langevin A , Laporte G (2013) The synchronized arc and node routing problem: Application to road marking. Comput. Oper. Res. 40(7):1708–1715.Crossref, Google Scholar
• Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, PES Group, Department of Computer Science, University of Strathclyde, Glasgow, Scotland.Google Scholar
• Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Maher M, Puget JF, eds. Principles and Practice of Constraint Programming–CP98, Lecture Notes in Computer Science, vol. 1520 (Springer, Berlin Heidelberg), 417–431.Crossref, Google Scholar
• Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254–265.Link, Google Scholar
• Stützle T , López-Ibáñez M (2019) Automated design of metaheuristic algorithms. Gendreau M, Potvin JY, eds. Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol. 272 (Springer), 541–579.Crossref, Google Scholar
• Villegas JG , Prins C , Prodhon C , Medaglia AL , Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput. Oper. Res. 38(9):1319–1334.Crossref, Google Scholar
• Zhou L , Baldacci R , Vigo D , Wang X (2018) A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution. Eur. J. Oper. Res. 265(2):765–778.Crossref, Google Scholar