A column generation approach to the heterogeneous fleet vehicle routing problem

Computers and Operations Research

Volumn 34, Issue 7, 2007, Pages 2080-2095

  Choi, Eunjeong ^a   Tcha, Dong Wan ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Column generation; Fleet mix; Heterogeneous fleet vehicle routing problem; Vehicle routing

Indexed keywords

ALGORITHMS; COST ACCOUNTING; DYNAMIC PROGRAMMING; FLEET OPERATIONS; LINEAR PROGRAMMING; PROBLEM SOLVING;

COLUMN GENERATION; FLEET MIX; HETEROGENEOUS FLEET VEHICLE ROUTING PROBLEMS; INTEGER SOLUTIONS; VEHICLE ROUTING;

HIGHWAY TRAFFIC CONTROL;

EID: 33845365435     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.08.002     Document Type: Article

References (26)

1. Golden B., Assad A., Levy L., and Gheysens F. The fleet size and mix vehicle routing problem. Computers and Operations Research 11 (1984) 49-66
2. Salhi S., and Rand G.K. Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research 66 (1993) 313-330
3. Gheysens F., Golden B., and Assad A. A new heuristic for determining fleet size and composition. Mathematical Programming Study 26 (1986) 233-236
4. Gendreau M., Laporte G., Musaraganyi C., and Taillard E.D. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26 (1999) 1153-1173
5. Salhi S., Sari M., Saidi D., and Touati N. Adaptation of some vehicle fleet mix heuristics. Omega 20 (1992) 653-660
6. Wassan N.A., and Osman I.H. Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society 53 (2002) 768-782
7. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33 (1999) 1-14
8. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research 152 (2004) 148-158
9. Desrochers M., and Verhoog T.W. A new heuristic for the fleet size and mix vehicle routing problem. Computers and Operations Research 18 (1991) 263-274
10. Renaud J., and Boctor F.F. A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research 140 (2002) 618-628
11. Gheysens F., Golden B., and Assad A. A comparison of techniques for solving the fleet size and mix vehicle routing problem. Operations Research Spektrum 6 (1984) 207-216
12. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
13. Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., and Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33 (1999) 101-116
14. Bramel J., and Simchi-Levi D. On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Operations Research 45 (1997) 295-301
15. Christofides N., Mingozzi A., and Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks 11 (1981) 145-164
16. Christofides N., Mingozzi A., and Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical programming 20 (1981) 255-282
17. Gelinas S., Desrochers M., Desrosiers J., and Solomon M.M. A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61 (1995) 91-109
18. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem. Operations Research 9 (1961) 849-859
19. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841
20. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: column generation for solving huge integer programs. Operations Research 46 (1998) 316-329
21. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42 (1994) 977-978
22. Desrochers M., and Soumis F. A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research 35 (1988) 242-254
23. Kolen A.W.J., Rinnooy Kan A.H.G., and Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research 35 (1987) 266-273
24. Houck Jr. D.J., Picard J.C., Queyranne M., and Vemuganti R.R. The traveling salesman problem as a constrained shortest path problem: theory and computational experience. Opsearch 17 (1980) 93-109
25. Desrochers M, An algorithm for the shortest path problem with resource constraints. Cahiers du GERAD G-88-27, Ecole des H.E.C., Montreal, Canada.
26. Fukasawa R., Lysgaard J., de Aragao M.P., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Lecture Notes in Computer Science 3064 (2004) 1-15