Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows

Operations Research

Volumn 58, Issue 1, 2010, Pages 179-192

  Desaulniers, Guy ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Branch and price and cut algorithm; Integer programming; Transportation; Vehicle routing

Indexed keywords

BRANCH AND PRICE; BRANCH-AND-PRICE-AND-CUT; BRANCH-AND-PRICE-AND-CUT ALGORITHM; COLUMN GENERATION; COMPUTATIONAL RESULTS; DELIVERY VEHICLE; KNAPSACK PROBLEMS; LABEL-SETTING ALGORITHM; LINEAR RELAXATIONS; RESOURCE-CONSTRAINED; SET OF CUSTOMERS; SHORTEST PATH PROBLEM; TIME WINDOWS; TRANSPORTATION VEHICLES; VEHICLE CAPACITY;

COSTS; CUSTOMER SATISFACTION; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; ROUTING ALGORITHMS; SALES; VEHICLES; WINDOWS;

PROBLEM SOLVING;

EID: 77249153242     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0713     Document Type: Article

References (36)

1. Archetti, C., A. Hertz, M. G. Speranza. 2006a. A tabu search algorithm for the split delivery vehicle routing problem. Transportation Sci. 40(1) 64-73. (Pubitemid 43312233)
2. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2006b. Worst-case analysis for split delivery vehicle routing problems. Transportation Sci. 40(2) 226-234. (Pubitemid 43747025)
3. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2008a. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1) 22-31.
4. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2008b. To split or not to split: That is the question. Transportation Res. Part E 44 114-123.
5. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
6. Belenguer, J. M., M. C. Martinez, E. Mota. 2000. A lower bound for the split delivery vehicle routing problem. Oper. Res. 48(5) 801-810.
7. Boland, N., J. Dethridge, I. Dumitrescu. 2006. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34(1) 58-68.
8. Chabrier, A. 2006. Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10) 2972-2990.
9. Chen, S., B. Golden, E. Wasil. 2007. The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks 49(4) 318-329. (Pubitemid 47324738)
10. Dantzig, G. B., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8(1) 101-111.
11. Desaulniers, G., F. Lessard, A. Hadjar. 2008. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3) 387-404.
12. Desaulniers, G., J. Desrosiers, I. Ioachim, M. M. Solomon, F. Soumis, D. Villeneuve. 1998. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics, Chapter 3. Kluwer Academic Publishers, Norwell, MA, 57-93.
13. Desrochers, M., F. Soumis. 1989. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. 23(1) 1-13.
14. Desrosiers, J., M. E. Lübbecke. 2005. A primer in column generation. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation, Chapter 1. Springer, New York, 1-32.
15. Dror, M., P. Trudeau. 1989. Savings by split delivery routing. Transportation Sci. 23 141-145.
16. Dror, M., P. Trudeau. 1990. Split delivery routing. Naval Res. Logist. 37 383-402.
17. Dror, M., G. Laporte, P. Trudeau. 1994. Vehicle routing with split deliveries. Discrete Appl. Math. 50 239-254.
18. Feillet, D., P. Dejax, M. Gendreau, C. Gueguen. 2004. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 216-229.
19. Frizzell, P. W., J. W. Giffin. 1992. The bounded split delivery vehicle routing problem with grid network distances. Asia-Pacific J. Oper. Res. 9(1) 101-116.
20. Frizzell, P. W., J. W. Giffin. 1995. The split delivery vehicle scheduling problem with time windows and grid network distances. Comput. Oper. Res. 22(6) 655-667.
21. Gendreau, M., P. Dejax, D. Feillet, C. Gueguen. 2006. Vehicle routing with time windows and split deliveries. Technical Report 2006-2851, Laboratoire Informatique d'Avignon, Avignon, France.
22. Ho, S. C., D. Haugland. 2004. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31 1947-1964.
23. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation, Chapter 2. Springer, New York, 33-65.
24. Jin, M., K. Liu, R. O. Bowden. 2007. A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. Internat. J. Production Econom. 105 228-242.
25. Jin, M., K. Liu, B. Eksioglu. 2008. A column generation approach for the split delivery vehicle routing problem. Oper. Res. Lett. 36 265-270.
26. Kohl, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33(1) 101-116.
27. Laporte, G., Y. Nobert, M. Desrochers. 1985. Optimal routing under capacity and distance restrictions. Oper. Res. 33(5) 1050-1073.
28. Lee, C. G., M. A. Epelman, C. C. White III, Y. A. Bozer. 2006. A shortest path approach to the multiple-vehicle routing problem with split pickups. Transportation Res. Part B 40 265-284.
29. Lübbecke, M. E., J. Desrosiers. 2005. Selected topics in column generation. Oper. Res. 53(6) 1007-1023.
30. Mullaseril, P. A., M. Dror, P. Trudeau. 1997. Split-delivery routing heuristics in livestock feed distribution. J. Oper. Res. Soc. 48 107-116.
31. Righini, G., M. Salani. 2006. Symmetry helps: Bounded bidirectional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3) 255-273.
32. Righini, G., M. Salani. 2008. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3) 155-209.
33. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. North-Holland, Amsterdam, 269-280.
34. Sierksma, G., G. A. Tijssen. 1998. Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76 261-286.
35. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35(2) 254-265.
36. Toth, P., D. Vigo, eds. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.