A continuous approximation model for the fleet composition problem

Transportation Research Part B: Methodological

Volumn 46, Issue 10, 2012, Pages 1591-1606

  Jabali, Ola ^a   Gendreau, Michel ^b   Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Continuous approximation; Fleet composition; Fleet size and mix vehicle routing problem; Vehicle routing problem

Indexed keywords

COST ACCOUNTING; COSTS; VEHICLE ROUTING; VEHICLES;

BOUNDING PROCEDURES; COMPUTATIONALLY EFFICIENT; CONTINUOUS APPROXIMATIONS; DECISION VARIABLES; FLEET COMPOSITION; FLEET SIZE AND MIXES; TEST INSTANCES; VEHICLE ROUTING PROBLEMS;

FLEET OPERATIONS;

NUMERICAL MODEL; PERFORMANCE ASSESSMENT; TRANSPORT VEHICLE; TRANSPORTATION INFRASTRUCTURE; TRANSPORTATION PLANNING; TRANSPORTATION SYSTEM;

EID: 84867608269     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2012.06.004     Document Type: Article

References (36)

1. Applegate D.L., Bixby R.E., Chvátal V., Cook W.J. The Traveling Salesman Problem: A Computational Study 2006, Princeton University Press, Princeton, NJ.
2. Baldacci R., Battarra M., Vigo D. Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, vol. 43:1-25. Springer, New York.
3. Baldacci R., Mingozzi A. A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming 2009, 120(2):347-380.
4. Beardwood J., Halton J.H., Hammersley J.M. The shortest path through many points. Proceedings of the Cambridge Philosophical Society 1959, 55(9):299-328.
5. Carlsson, J.G., 2012. Dividing a territory among several vehicles. INFORMS Journal on Computing. http://dx.doi.org/10.1287/ijoc.1110.0479.
6. Choi E., Tcha D.W. A column generation approach to the heterogeneous fleet vehicle routing problem. Computers & Operations Research 2007, 34(1):2080-2095.
7. Daganzo C.F. The distance traveled to visit N points with a maximum of C stops per vehicle. Transportation Science 1984, 18(4):135-146.
8. Daganzo C.F. The length of tours in zones of different shapes. Transportation Research Part B 1984, 18(2):135-146.
9. Daganzo C.F. Modeling distribution problems with time windows: Part I. Transportation Science 1987, 21(3):171-179.
10. Daganzo C.F. Modeling distribution problems with time windows: Part II: two customer types. Transportation Science 1987, 21(3):180-187.
11. Daganzo C.F. Logistics Systems Analysis 2005, Springer, New York. fourth ed.
12. Figliozzi M.A. Planning approximations to the average length of vehicle routing problems with time window constraints. Transportation Research Part B 2008, 43(4):438-447.
13. Figliozzi M.A. Planning approximations to the average length of vehicle routing problems with varying customer demands and routing constraints. Transportation Research Record 2008, 2089:1-8.
14. Francis P., Smilowitz K. Modeling techniques for periodic vehicle routing problems. Transportation Research Part B 2006, 40(10):872-884.
15. Golden B.L., Assad A.A., Levy L., Gheysens F.G. The fleet size and mix vehicle routing problem. Computers & Operations Research 1984, 11(1):49-66.
16. Groër C., Golden B.L., Wasil E.A. The consistent vehicle routing problem. Manufacturing Service Operations Management 2009, 11(4):630-643.
17. Haugland D., Ho S.C., Laporte G. Designing delivery districts for the vehicle routing problem with stochastic demands. European Journal of Operational Research 2007, 180(3):997-1010.
18. Hoff A., Andersson H., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey: fleet composition and routing. Computers & Operations Research 2010, 37(12):2041-2061.
19. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 1988, 36(6):929-936.
20. Langevin A., Mbaraga P., Campbell J.F. Continuous approximation models in freight distribution: an overview. Transportation Research Part B 1996, 30(3):163-188.
21. Langevin A., Soumis F. Design of multiple-vehicle delivery tours satisfying time constraints. Transportation Research Part B 1989, 23(2):123-138.
22. Laporte G. Fifty years of vehicle routing. Transportation Science 2009, 43(4):408-416.
23. Larson R.C., Odoni A.R. Urban Operations Research 1981, Prentice-Hall, Englewood Cliffs, NJ.
24. Lee Y.H., Kim J.I., Kang K.H., Kim K.H. A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational Research Society 2008, 59(6):833-841.
25. Lei H., Laporte G., Guo B. Districting for routing with stochastic customers. EURO Journal on Transportation and Logistics 2012, 1(1-2):67-85.
26. Newell G.F., Daganzo C.F. Design of multiple-vehicle delivery tours - I: a ring-radial network. Transportation Research Part B 1986, 20(5):345-363.
27. Pessoa A., Poggi de Aragão M., Uchoa E. A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Lecture Notes in Computer Science 2007, vol. 4525. Springer, Berlin, pp. 150-160.
28. Robusté F., Daganzo C.F., Souleyrette R.R. Implementing vehicle routing models. Transportation Research Part B 1990, 24(4):263-286.
29. Salhi S., Rand G.K. Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research 1993, 66(3):313-330.
30. Smilowitz, K., Nowak, M., Jiang, T., 2012. Workforce management in periodic delivery operations. Transportation Science http://dx.doi.org/10.1287/trsc.1120.0407.
31. Stein D.M. An asymptotic, probabilistic analysis of a routing problem. Mathematics of Operations Research 1978, 3(2):89-101.
32. Strang G. Introduction to Linear Algebra 2009, Wellesley-Cambridge Press, Wellesley, MA.
33. Teodorović D., Krčmar-NoŽić E., Pavković G. The mixed fleet stochastic vehicle-routing problem. Transportation Planning and Technology 1995, 19(1):31-43.
34. Toth, P., Vigo. D., 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
35. Yaman H.D. Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming 2006, 106(2):365-390.
36. Zhong H., Hall R.W., Dessouky M.M. Territory planning and vehicle dispatching with driver learning. Transportation Science 2007, 41(1):74-89.