Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances

Networks

Volumn 65, Issue 2, 2015, Pages 129-138

  Avella, Pasquale ^a   Boccia, Maurizio ^a   Wolsey, Laurence A ^b  

^a UNIVERSITY OF SANNIO   (Italy)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cutting planes; Inventory routing; Single item lot sizing

Indexed keywords

INTEGER PROGRAMMING; SALES; VEHICLE ROUTING;

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CUTTING PLANES; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; LOT SIZING; VEHICLE ROUTING PROBLEMS; VENDOR MANAGED INVENTORY;

BENCHMARKING;

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

References (14)

1. Y. Adulyasak, J-F. Cordeau, and R. Jans, Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems, INFORMS J Comput 26 (2014), 103-120.
2. C. Archetti, L. Bertazzi, A. Hertz, and M.G. Speranza, A hybrid heuristic for an inventory routing problem, INFORMS J Comput 24 (2012), 101-116.
3. C. Archetti, L. Bertazzi, G. Laporte, and M.G. Speranza, A branch-and-cut algorithm for a vendor-managed inventory-routing problem, Transport Sci, 41 (2007), 382-391.
4. A. Atamtürk and S. Küçükyavuz, Lot sizing with inventory bounds and fixed costs, Oper Res 53 (2005), 711-730.
5. L. Bertazzi and M.G. Speranza, Inventory routing problems: An introduction, EURO J Transport Logist 1 (2012), 307-326.
6. L.C. Coelho, J-F. Cordeau, and G. Laporte, Thirty years of inventory routing. Transport Sci 48 (2014), 1-19.
7. L.C. Coelho and G. Laporte, The exact solution of several classes of inventory-routing problems, Comput Oper Res 40 (2013), 558-565.
8. L.C. Coelho and G. Laporte, Improved solutions for inventory-routing problems through valid inequalities and input ordering, Int J Prod Econ 155 (2014), 391-397.
9. FICO, Xpress-Optimizer Reference Manual, Release 7.3, FICO, 2012. Available at: www.fico.com/xpress.
10. M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev 33 (1991), 60-100.
11. Y. Pochet and L.A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Math Program 67 (1994), 297-324.
12. Y. Pochet and L.A. Wolsey, Production Planning by Mixed Integer Programming, Springer Series in Operations Research and Financial Engineering, Springer, 2006.
13. O. Solyal i and H. Süral, A single supplier-single retailer system with an order-up-to level inventory policy, Oper Res Lett 36 (2008), 543-546.
14. O. Solyal i and H. Süral, A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem, Transport Sci 45 (2011), 335-345.