A column-generation based tactical planning method for inventory routing

Operations Research

Volumn 60, Issue 2, 2012, Pages 382-397

  Michel, S ^a   Vanderbeck, F ^b  

^a UNIVERSITÉ DU HAVRE   (France)

^b INRIA   (France)

Author keywords

Branch and price and cut; Inventory routing; Primal heuristic; Symmetry

Indexed keywords

BRANCH-AND-PRICE-AND-CUT; DUAL BOUND; FLEET SIZES; INDUSTRIAL PRACTICES; INDUSTRIAL TESTS; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; LOCAL SEARCH HEURISTICS; MASTER PROGRAMS; NUMBER OF VEHICLES; PRIMAL HEURISTIC; PRODUCT DELIVERY; REGIONAL CLUSTERING; RELAXATION TECHNIQUES; STATE-SPACE; TACTICAL PLANNING; TIME HORIZONS; TIME-PERIODS; TRAVEL DISTANCE;

COSTS; CRYSTAL SYMMETRY; CUSTOMER SATISFACTION; OPTIMIZATION; PICKUPS; SALES;

VEHICLES;

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

References (34)

1. Archetti, C., M. W. P. Savelsbergh, M. G. Speranza. 2008. An optimization-based heuristic for the split delivery routing problem. Transportation Sci. 42(1) 22-31.
2. Archetti, C., L. Bertazzi, G. Laporte, M. G. Speranza. 2007. A branchand- cut algorithm for a vendor managed inventory routing problem. Transportation Sci. 41(3) 382-391.
3. Bell, W., L. Dalberto, M. Fisher, A. Greenfield, R. Jaikumar, P. Kedia, R. Mack, P. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6) 4-23. (Pubitemid 14609903)
4. Belov, G., G. Scheithauer. 2002. A cutting plane algorithm for the one dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141(2) 274-294. (Pubitemid 34623937)
5. Bertazzi, L., G. Paletta, M. G. Speranza. 2002. Deterministic order-upto level policies in an inventory routing problem. Transportation Sci. 36(1) 119-132. (Pubitemid 34268737)
6. Bertazzi, L., M. Savelsbergh, M. G. Speranza. 2008. Inventory routing. The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, Vol. 43. Springer, Berlin, 49-72.
7. Borndörfer, R., M. Grötschel, A. Löbel. 2003. Duty scheduling in public transit. Mathematics-Key Technology for the Future. Springer, Berlin, 653-674.
8. Bramel, J., D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43(4) 649-660.
9. Briant, O., C. Lemaréchal, P. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck. 2008. Comparison of bundle and classical column generation. Math. Programming 113(2) 299-344. (Pubitemid 351177973)
10. Campbell, A. M., M. W. P. Savelsbergh. 2004. A decomposition approach for the inventory routing problem. Transportation Sci. 38(4) 488-502.
11. Campbell, A. M., L. W. Clarke, M. W. P. Savelsbergh. 2002. Inventory routing in practice. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 309-330.
12. Campbell, A. M., L. W. Clarke, A. Kleywegt, M. W. P. Savelsbergh. 1998. The inventory routing problem. Fleet Management Logistics. Kluwer, 95-113.
13. Chien, T. W., A. Balakrishnan, R. T. Wong. 1989. An integrated inventory allocation and vehicle routing problem. Transportation Sci. 23(2) 67-76.
14. Christiansen, M. 1999. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Sci. 33(1) 3-13.
15. Christiansen, M., B. Nygreen. 1998. A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81 357-378.
16. Cordeau, J.-F., G. Laporte, M. W. P. Savelsbergh, D. Vigo. 2007. Vehicle routing. C. Barnhart, G. Laporte, eds. Transportation. Handbooks in Operations Research and Management Science, Vol. 14. Elsevier, Amsterdam, 367-428.
17. Custódio, A.-L., R.-C. Oliveira. 2001. A logistic management system. Integrating inventory management and routing. Working paper, FCTUNL, Aveiro, Portugal.
18. Dror, M., M. Ball. 1987. Inventory/routing: Reduction from an annual to a short-term problem. Naval Res. Logist. 34 891-905. (Pubitemid 18520153)
19. Federgruen, A., D. Simchi-Levi. 1995. Analysis of vehicle routing and inventory management problems. M. O. Ball, C. L. Monma, T. L. Magnanti, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 297-371.
20. Gamache, M., F. Soumis, G. Marquis, J. Desrosiers. 1999. A column generation approach for large-scale aircrew rostering problems. Oper. Res. 47(2) 247-263.
21. Gaur, V., M. L. Fisher. 2004. A periodic inventory routing problem at a supermarket chain. Oper. Res. 52(6) 813-822. (Pubitemid 40122344)
22. Golden, B., A. Assad, R. Dahl. 1984. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale System 7(2-3) 181-190. (Pubitemid 15456419)
23. Gunluk, O., T. Kimbrel, L. Ladanyi, B. Schieber, G. Sorkin. 2006. Vehicle routing and staffing for sedan service. Transportation Sci. 40(3) 313-326. (Pubitemid 44147353)
24. Joncour, C., S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck. 2010. Column generation based heuristics. Electronic Notes Discrete Math. 36(1) 695-702.
25. Michel, S. 2006. Decomposition approach to inventory routing. Ph.D. thesis, Université Bordeaux 1, Bordeaux, France.
26. Nemhauser, G. L., L. A. Wolsey. 1988. The theory of valid inequalities: Superadditive functions and valid inequalities. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 229-237.
27. Perrot, N. 2005. Integer programming column generation strategies for the cutting stock problem and its variants. Ph.D. thesis, Université Bordeaux 1, Bordeaux, France.
28. Pisinger, D. 1995. A minimal algorithm for the multiple-choice knapsack problem. Eur. J. Oper. Res. 83(2) 394-410.
29. Vanderbeck, F. 2000. Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper. Res. 48(5) 915-926. (Pubitemid 32189514)
30. Vanderbeck, F. 2005. Implementing mixed integer column generation. Column Generation. Springer, 331-358.
31. Vanderbeck, F., M. P. W. Savelsbergh. 2006. A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34 296-306. (Pubitemid 43242946)
32. Webb, I., R. Larson. 1995. Period and phase of customer replenishment: A new approach to the strategic inventory/routing problem. Eur. J. Oper. Res. 85(1) 132-148.
33. Witucki, M., P. Dejax, M. Haouari. 1997. Un modèle et un algorithme de résolution exacte pour le problème de tournées de véhicules multipériodique: une application à la distribution des gaz industriels. Deuxième Congrès International Franco-Québecois de Génie Industriel. Albi, France.
34. Xpress. 2006. User guide and reference manual. Dash Optimization. http://www.dashoptimization.com.