An efficient column-generation-based algorithm for solving a pickup-and-delivery problem

Arunapuram, 2003, Vehicle routing with full truckloads, Transportation Science, 37, 170, 10.1287/trsc.37.2.170.15248 Berbeglia, 2007, Static pickup and delivery problems: a classification scheme and survey, TOP, 15, 1, 10.1007/s11750-007-0009-0 Cordeau, 2008, Recent models and algorithms for one-to-one pickup and delivery problems, 327 Desrochers, 1992, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, 40, 342, 10.1287/opre.40.2.342 Desrochers, 1988, A generalized permanent labeling algorithm for the shortest path problem with time windows, INFOR, 26, 191 Desrosiers, 1995, Time constrained routing and scheduling, 35, 10.1016/S0927-0507(05)80106-9 Dror, 1994, Vehicle routing with split deliveries, Discrete Applied Mathematics., 50, 239, 10.1016/0166-218X(92)00172-I Dror, 1989, Savings by split delivery routing, Transportation Science, 23, 141, 10.1287/trsc.23.2.141 Dror, 1990, Split delivery routing, Naval Research Logistics, 37, 383, 10.1002/nav.3800370304 Dumas, 1991, The pickup and delivery problem with time windows, European Journal of Operational Research, 54, 7, 10.1016/0377-2217(91)90319-Q Emmons, 1995, Lot sizing in a no-wait flow shop, Operation Research Letters, 17, 159, 10.1016/0167-6377(95)00008-8 Feillet, 2004, An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems, Networks, 44, 216, 10.1002/net.20033 Garey, 1979 Gendreau, 1999, A tabu search heuristic for the heterogeneous fleet vehicle routing problem, Computers and Operations Research, 26, 1153, 10.1016/S0305-0548(98)00100-2 Golden, 1984, The fleet size and mix vehicle routing problem, Computers and Operations Research, 11, 49, 10.1016/0305-0548(84)90007-8 Golden B, Raghavan S, Wasil E, editors. The vehicle routing problem: latest advances and new challenges. Springer; 2008. Gribkovskaia, 2008, One-to-many-to-one single vehicle pickup and delivery problems, 359 Renaud, 2002, A sweep-based algorithm for the fleet size and mix vehicle routing problem, European Journal of Operational Research, 140, 618, 10.1016/S0377-2217(01)00237-5 Righini, 2006, Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, 3, 255, 10.1016/j.disopt.2006.05.007 Righini, 2009, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, Computers and Operations Research, 36, 1191, 10.1016/j.cor.2008.01.003 Sol M. Column generation techniques for pickup and delivery problems. PhD thesis, Eindhoven University of Technology, Netherlands; 1994. Taillard, 1999, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO, 33, 1, 10.1051/ro:1999101 Toth, 2002