Consistency in multi-vehicle inventory-routing

Transportation Research Part C: Emerging Technologies

Volumn 24, Issue , 2012, Pages 270-287

  Coelho, Leandro C ^a   Cordeau, Jean François ^a   Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Adaptive large neighborhood search; Consistency; Inventory routing; Matheuristic; Service quality; Vendor managed inventory systems

Indexed keywords

INTEGER PROGRAMMING; INVENTORY CONTROL; QUALITY OF SERVICE; VEHICLE ROUTING; VEHICLES;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; CONSISTENCY; INVENTORY ROUTING; MATHEURISTIC; SERVICE QUALITY; VENDOR MANAGED INVENTORY SYSTEMS;

FLEET OPERATIONS;

ALGORITHM; COST; NEIGHBORHOOD; TRANSPORTATION POLICY; TRANSPORTATION SYSTEM;

EID: 84860379155     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2012.03.007     Document Type: Article

References (35)

1. Abdelmaguid T.F., Dessouky M.M. A genetic algorithm approach to the integrated inventory-distribution problem. International Journal of Production Research 2006, 44:4445-4464.
2. Andersson H., Hoff A., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey: combined inventory management and routing. Computers & Operations Research 2010, 37(9):1515-1536.
3. Archetti C., Bertazzi L., Laporte G., Speranza M.G. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 2007, 41(3):382-391.
4. Archetti C., Bertazzi L., Paletta G., Speranza M.G. Analysis of the maximum level policy in a production-distribution system. Computers & Operations Research 2011, 12(38):1731-1746.
5. Archetti C., Bertazzi L., Hertz A., Speranza M.G. A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing 2012, 24(1):101-116.
6. Barlett C.A., Ghoshal S. Building competitive advantage through people. MIT Sloan Management Review 2002, 43(2):34-41.
7. Barrat M. Positioning the role of collaborative planning in grocery supply chains. International Journal of Logistics Management 2003, 14(2):53-66.
8. Bartodziej P., Derigs U., Malcherek D., Vogel U. Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: an application to road feeder service planning in air cargo transportation. OR Spectrum 2009, 31(2):405-429.
9. Beamon B.M. Measuring supply chain performance. International Journal of Operations & Production Management 1999, 19(3):275-292.
10. Bell W.J., Dalberto L.M., Fisher M.L., Greenfield A.J., Jaikumar R., Kedia P., Mack R.G., Prutzman P.J. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 1983, 13(6):4-23.
11. Bertazzi L., Paletta G., Speranza M.G. Deterministic order-up-to level policies in an inventory routing problem. Transportation Science 2002, 36(1):119-132.
12. Christofides N., Beasley J.E. The periodic routing problem. Networks 1984, 14(2):237-256.
13. Coelho L.C., Cordeau J.-F., Laporte G. The inventory-routing problem with transshipment. Computers & Operations Research 2012, 10.1016/j.cor.2011.12.020.
14. Cordeau J.-F., Laporte G., Savelsbergh M.W.P., Vigo D. Vehicle routing. Transportation Handbooks in Operations Research and Management Science 2007, vol. 14:367-428. Elsevier, North-Holland, Amsterdam.
15. Dauzère-Pérès S., Nordli A., Olstad A., Haugen K., Koester U., Olav M.P., Teistklub G., Reistad A. Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 2007, 37(1):39-51.
16. Desrochers M., Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 1991, 10(1):27-36.
17. Erhun F., Keskinocak P. Collaborative supply chain management. International Series in Operations Research & Management Science 2011, vol. 151:233-268. Springer, New York. K.G. Kempf, P. Keskinocak, R. Uzsoy (Eds.).
18. Francis P., Smilowitz K., Tzur M. The periodic vehicle routing problem and its extensions. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, 239-261. Springer, New York.
19. Goldberg A.V. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms 1997, 22(1):1-29.
20. Groër C., Golden B.L., Wasil E.A. The consistent vehicle routing problem. Manufacturing & Service Operations Management 2009, 11(4):630-643.
21. Hewitt M., Nemhauser G.L., Savelsbergh M.W.P. Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS Journal on Computing 2010, 22(2):314-325.
22. Kara I., Laporte G., Bektas T. A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research 2004, 158(3):793-795.
23. Laporte G., Musmanno R., Vocaturo F. An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Science 2010, 44(1):125-135.
24. Lee H.L., Seungjin W. The whose, where and how of inventory control design. Supply Chain Management Review 2008, 12(8):22-29.
25. Maniezzo V., Stützle T., Voß S. Matheuristics: Hybridizing Metaheuristics and Mathematical Programming 2009, Springer, New York.
26. Olson D.L., Xie M. A comparison of coordinated supply chain inventory management systems. International Journal of Services and Operations Management 2010, 6(1):73-88.
27. Pepin A.-S., Desaulniers G., Hertz A., Huisman D. A comparison of five heuristics for the multiple depot vehicle scheduling problem. Journal of Scheduling 2009, 12(1):17-30.
28. Prins C., Prodhon C., Soriano P., Ruiz A., Wolfler Calvo R. Solving the capacitated location routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 2007, 41(4):470-483.
29. Ropke S., Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 2006, 40(4):455-472.
30. Ropke S., Pisinger D. A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 2006, 171(3):750-755.
31. Shaw, P., 1997. A New Local Search Algorithm Providing high Quality Solutions to Vehicle Routing Problems. Technical Report, University of Strathclyde, Glasgow, 1997.
32. Smilowitz K., Nowak M., Jiang T. Workforce Management in Periodic Delivery Operations. Transportation Science 2012.
33. Tarantilis C.D., Zachariadis E.E., Kiranoudis C.T. A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems 2009, 10(2):255-271.
34. Wolfler Calvo R., Touati-Moungla N. A matheuristic for the dial-a-ride problem. Lecture Notes in Computer Science 2011, vol. 6701:450-463. Springer, Berlin/Heidelberg. J. Pahl, T. Reiners, S. Voß (Eds.).
35. Yu Y., Chen H., Chu F. A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research 2008, 189(3):1022-1040.