An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Lucena, 1990, Time-dependent traveling salesman problem: the deliveryman case, Networks, 20, 753, 10.1002/net.3230200605 Fischetti, 1993, The delivery man problem and cumulative matroids, Operations Research, 41, 1055, 10.1287/opre.41.6.1055 Picard, 1978, The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling, Operations Research, 26, 86, 10.1287/opre.26.1.86 Stecco, 2009, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, Journal of Scheduling, 12, 3, 10.1007/s10951-008-0068-6 Heilporn, 2010, The delivery man problem with time windows, Discrete Optimization, 7, 269, 10.1016/j.disopt.2010.06.002 Park, 2010, The school bus routing problem: a review, European Journal of Operational Research, 202, 311, 10.1016/j.ejor.2009.05.017 Ogryczak, 2000, Inequality measures and equitable approaches to location problems, European Journal of Operational Research, 122, 374, 10.1016/S0377-2217(99)00240-4 Campbell, 2008, Routing for relief efforts, Transportation Science, 42, 127, 10.1287/trsc.1070.0209 Ngueveu, 2010, An effective memetic algorithm for the cumulative capacitated vehicle routing problem, Computers & Operations Research, 37, 1877, 10.1016/j.cor.2009.06.014 Nolz, 2010, A bi-objective metaheuristic for disaster relief operation planning, 167 Augerat P, Belenguer J, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 949-M, Université Joseph Fourier, Grenoble; 1995. Golden, 1998, Metaheuristics in vehicle routing, 33 Prins, 2004, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, 31, 1985, 10.1016/S0305-0548(03)00158-8 Ropke, 2006, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 40, 455, 10.1287/trsc.1050.0135 Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical Report, University of Strathclyde, Glasgow; 1997. Pisinger, 2010, Large neighborhood search, vol. 146, 399 Ropke, 2006, A unified heuristic for a large class of vehicle routing problems with backhauls, European Journal of Operational Research, 171, 750, 10.1016/j.ejor.2004.09.004 Pisinger, 2007, A general heuristic for the vehicle routing problem, Computers & Operations Research, 34, 2403, 10.1016/j.cor.2005.09.012 Azi N, Gendreau M, Potvin J.-Y. An adaptive large neighborhood search for a vehicle routing problem with multiple trips. Technical Report 2010-08, CIRRELT, Montréal, Available at 〈https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2010-08.pdf〉; 2010. Pepin, 2009, A comparison of five heuristics for the multiple depot vehicle scheduling problem, Journal of Scheduling, 12, 17, 10.1007/s10951-008-0072-x Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society, vol. 7. American Mathematical Society; 1956. p. 48–50. Potvin, 1993, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, European Journal of Operational Research, 66, 331, 10.1016/0377-2217(93)90221-8 Christofides, 1979, The vehicle routing problem, 315