Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs

Networks

Volumn 54, Issue 4, 2009, Pages 178-189

  Baldacci, Roberto ^a   Battarra, Maria ^a   Vigo, Daniele ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and cut; Fleet management; Vehicle routing

Indexed keywords

BRANCH-AND-CUT; FIXED COST; FLEET MANAGEMENT; FLEET SIZE AND MIXES; LINEAR PROGRAMMING RELAXATION; MATHEMATICAL FORMULATION; MIXED INTEGER PROGRAMMING; NETWORK FLOW APPROACH; VALID INEQUALITY; VEHICLE CAPACITY CONSTRAINTS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COMPETITION; COST ACCOUNTING; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEARIZATION; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES;

FLEET OPERATIONS;

EID: 71949111289     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20331     Document Type: Article

References (34)

1. R. Baldacci, E.A. Hadjiconstantinou, and A. Mingozzi, An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation, Oper Res 52 (2004), 723-738.
2. R. Baldacci, M. Battarra, and D. Vigo, "Routing a heterogeneous fleet of vehicles", The vehicle routing problem: Latest advances and new challenges, B.L. Golden, S. Raghavan, and E. Wasil (Editors), Vol.43, Springer Verlag, Berlin, 2008.
3. O. Bräysy, M. Gendreau, G. Hasle, and A. Løkketangen, A survey of rich vehicle routing models and heuristic solution techniques, Technical report, SINTEF Applied Mathematics, Department of Optimization, Norway, 2002.
4. E. Choi and D. Tcha, A column generation approach to the heterogeneous fleet vehicle routing problem, Comput Oper Res 34 (2007), 2080-2095.
5. N. Christofides, A. Mingozzi, and P. Toth, Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation, Math Program 10 (1981), 255-280.
6. J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, and D. Vigo, "Vehicle routing", Transportation, handbooks in operations research and management science, C. Barnhart and G. Laporte (Editors), Vol.14, Elsevier, Amsterdam, 2007, pp. 367-428.
7. CPLEX, ILOG CPLEX 10.1 callable library, ILOG, Gentilly Cedex, France, 2007.
8. G.B. Dantzig and J.H. Ramser, The truck dispatching problem, Manag Sci 6 (1959), 80-91.
9. M. Dell'Amico, M. Monaci, C. Pagani, and D. Vigo, Heuristic approaches for the fleet size and mix vehicle routing problem with time windows, Transport Sci 41 (2007), 516-526.
10. M. Desrochers and T.W. Verhoog, A new heuristic for the fleet size and mix vehicle-routing problem, Comput Oper Res 18 (1991), 263-274.
11. J.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-185, Electrical Engineering and Computer Science Department, University of Tennessee, 2008. Available at: http://www. netlib.org/benchmark/performance.ps.
12. W. Dullaert, G.K. Janssens, K. Sörensen, and B. Vernim- men, New heuristics for the fleet size and mix vehicle routing problem with time windows, J Oper Res Soc 53 (2002), 1232-1238.
13. R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa, and R.F. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Math Program Ser A 106 (2006), 491-511. (Pubitemid 43296485)
14. M. Gendreau, G. Laporte, C. Musaraganyi, and E.D. Taillard, A tabu search heuristic for the heterogeneous fleet vehicle routing problem, Comput Oper Res 26 (1999), 1153-1173. (Pubitemid 30024491)
15. F. Gheysens, B. Golden, and A. Assad, A comparison of techniques for solving the fleet size and mix vehicle routing problem, OR Spectrum 6 (1984), 207-216.
16. F.G. Gheysens, B.L. Golden, and A. Assad, A new heuristic for determining fleet size and composition, Math Program Stud 26 (1986), 233-236.
17. B.L. Golden, A.A. Assad, L. Levy, and F. Gheysens, The fleet size and mix vehicle routing problem, Comput OR 11 (1984), 49-66.
18. A.N. Letchford, R.W. Eglese, and J. Lysgaard, Multistars, partialmultistars and the capacitated vehicle routing problem, Math Program 94 (2002), 21-40.
19. F.H. Liu and S.Y. Shen, The fleet size and mix vehicle routing problem with time windows, J Oper Res Soc 50 (1999), 721-732.
20. J. Lysgaard, CVRPSEP: A package of separation routines for the capacitated vehicle routing problem, Technical report, Dept. of Mgt. Science and Logistics, Aarhus School of Business, Aarhus, Denmark, 2003.
21. J. Lysgaard, A.N. Letchford, and R.W. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Math Program Ser. A 100 (2004), 423-445. (Pubitemid 40878095)
22. D. Naddef and G. Rinaldi, "Branch-and-cut algorithms for the capacitated VRP", The vehicle routing problem, P. Toth and D. Vigo (Editors), Vol.9, SIAM Monographs on Discrete Mathematics and Applications, Philadelpia, PA, 2002, pp. 53-81.
23. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1999.
24. L.S. Ochi, D.S. Vianna, L.M.A. Drummond, and A.O. Victor, An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet, Lect Notes in Computer Science 1391 (1998), 187-195.
25. L.S. Ochi, D.S. Vianna, L.M.A. Drummond, and A.O. Victor, A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet, Parallel Distributed Process 1388 (1998), 216-224.
26. I.H. Osman and S. Salhi, "Local search strategies for the vehicle fleet mix problem", Modern Heuristic Search Methods, V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith (Editors), Wiley, Chichester, 1996, pp. 131-153.
27. A. Pessoa, M. Poggi de Aragão, and E. Uchoa, A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem, Lecture Notes in Computer Science, Vol.4525, Springer: Berlin / Heidelberg, 2007, pp. 150-160.
28. J. Renaud and F.F. Boctor, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Eur J Oper Res 140 (2002), 618-628.
29. S. Salhi and G.K. Rand, Incorporating vehicle routing into the vehicle fleet composition problem, Eur J Oper Res 66 (1993), 313-330.
30. E.D. Taillard, A heuristic column generation method for the heterogeneous fleet VRP, RAIRO Recherche Oper 33 (1999), 1-14.
31. P. Toth and D. Vigo (Editors), The vehicle routing problem, Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 2002.
32. N.A. Wassan and I.H. Osman, Tabu search variants for the mix fleet vehicle routing problem, J Oper Res Soc 53 (2002), 768-782.
33. A. Westerlund, M. Göthe-Lundgren, and T. Larsson, "Mathematical formulations of the heterogeneous fleet vehicle routing problem", ROUTE 2003, Oli Madsen (Editor), CTT, Technical University of Denmark, 2003. Availabe at: http://www1.ctt.dtu.dk/ROUTE2003/presentations/ westerlund-route2003.ppt.
34. H. D. Yaman, Formulations and valid inequalities for the heterogeneous vehicle routing problem, Math Program Ser A 106 (2006), 365-390.