Improved solutions for inventory-routing problems through valid inequalities and input ordering

International Journal of Production Economics

Volumn 155, Issue , 2014, Pages 391-397

  Coelho, Leandro C ^a,b   Laporte, Gilbert ^a,c  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

^c HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Input order; Inventory routing; Symmetry breaking; Valid inequalities

Indexed keywords

BENCHMARKING; INTEGER PROGRAMMING; SCHEDULING;

BRANCH-AND-CUT; INPUT ORDER; INVENTORY ROUTING; SYMMETRY-BREAKING; VALID INEQUALITY;

SCHEDULING; INVENTORY CONTROL;

EID: 84906080265     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2013.11.019     Document Type: Article

References (30)

1. Adulyasak, Y., Cordeau, J.-F., Jans, R. Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems. INF. J. Comput., forthcoming. 10.1287/ijoc.2013.0550.
2. H. Andersson, A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen Industrial aspects and literature survey combined inventory management and routing Comput. Oper. Res. 37 9 2010 1515 1536
3. C. Archetti, L. Bertazzi, G. Laporte, and M.G. Speranza A branch-and-cut algorithm for a vendor-managed inventory-routing problem Transp. Sci. 41 3 2007 382 391
4. C. Archetti, L. Bertazzi, A. Hertz, and M.G. Speranza A hybrid heuristic for an inventory routing problem INF. J. Comput. 24 1 2012 101 116
5. W.J. Bell, L.M. Dalberto, M.L. Fisher, A.J. Greenfield, R. Jaikumar, P. Kedia, R.G. Mack, and P.J. Prutzman Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer Interfaces 13 6 1983 4 23
6. L.E. Cárdenas-Barrón, J.-T. Teng, G. Treviño-Garza, H.-M. Wee, and K.-R. Lou An improved algorithm and solution on an integrated production-inventory model in a three-layer supply chain Int. J. Prod. Econ. 136 2 2012 384 388
7. L.C. Coelho, and G. Laporte The exact solution of several classes of inventory-routing problems Comput. Oper. Res. 40 2 2013 558 565
8. Coelho, L.C., Laporte, G. A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res., forthcoming. http://dx.doi.org/10.1080/00207543.2012.757668.
9. L.C. Coelho, J.-F. Cordeau, and G. Laporte The inventory-routing problem with transshipment Comput. Oper. Res. 39 11 2012 2537 2548
10. L.C. Coelho, J.-F. Cordeau, and G. Laporte Consistency in multi-vehicle inventory-routing Transp. Res. Part C Emerg. Technol. 24 1 2012 270 287
11. Coelho, L.C., Cordeau, J.-F., Laporte, G. Thirty years of inventory-routing. Transp. Sci., forthcoming. http://dx.doi.org/10.1287/trsc. 2013.0472.
12. S.E. Elmaghraby The economic lot scheduling problem (ELSP) review and extensions Manag. Sci. 24 6 1978 587 598
13. M. Gendreau, G. Laporte, and F. Semet The covering tour problem Oper. Res. 45 4 1997 568 576
14. Gendron, B., Crainic, T.G., 1994. Relaxations for Multicommodity Capacitated Network Desgin Problems. Technical Report CRT-965, Centre de Recherche sur les Transports, Montreal.
15. Q. Gou, L. Liang, Z. Huang, and C. Xu A joint inventory model for an open-loop reverse supply chain Int. J. Prod. Econ. 116 1 2008 28 42
16. W.J. Guerrero, C. Prodhon, N. Velasco, and C.A. Amaya Hybrid heuristic for the inventory location-routing problem with deterministic demand. Int. J. Prod. Econ. 146 1 2013 359 370
17. F.W. Harris How many parts to make at once Factory The Magazine of Management 10 2 1913 pp. 135-136, & 152
18. Jans, R., Desrosiers, J., 2010. Binary clustering problems: Symmetric, asymmetric and decomposition formulations. Technical Report G-2010-44, GERAD, Montreal, Canada.
19. R. Jans, and J. Desrosiers Efficient symmetry breaking formulations for the job grouping problem Computers & Operations Research 40 4 2013 1132 1142
20. Jena, S.D., Cordeau, J.-F., Gendron, B. Modeling and solving a logging camp location problem. Ann. Oper. Res., forthcoming. http://dx.doi.org/10.1007/ s10479-012-1278-z.
21. Jena, S.D., Cordeau, J.-F., Gendron, B., 2013. Dynamic Facility Location with Generalized Modular Capacities. Technical Report, CIRRELT-2013-18, Montreal.
22. W. Klibi, and A. Martel Modeling approaches for the design of resilient supply networks under disruptions Int. J. Prod. Econ. 135 2 2012 882 898
23. G. Laporte Fifty years of vehicle routing Transp. Sci. 43 4 2009 408 416
24. M.W. Padberg, and G. Rinaldi A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems SIAM Rev. 33 1 1991 60 100
25. J. Rogers A computational approach to the economic lot scheduling problem Manag. Sci. 4 3 1958 264 291
26. E.A. Silver, and H.C. Meal A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment Prod. Inven. Manag. 14 2 1973 64 74
27. S.A. Tarim, and B.G. Kingsman The stochastic dynamic production/inventory lot-sizing problem with service-level constraints Int. J. Prod. Econ. 88 1 2004
28. K.H. van Donselaar, and R.A.C.M. Broekmeulen Determination of safety stocks in a lost sales inventory system with periodic review, positive lead-time, lot-sizing and a target fill rate Int. J. Prod. Econ. 143 2 2013 440 448
29. A. van Horenbeek, J. Buré, D. Cattrysse, L. Pintelon, and P. Vansteenwegen Joint maintenance and inventory optimization systems a review Int. J. Prod. Econ. 143 2 2013 499 508
30. H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Manag. Sci. 5 1 1958 89 96