Single-period cutting planes for inventory routing problems

Transportation Science

Volumn 52, Issue 3, 2018, Pages 497-508

  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; Valid inequalities

Indexed keywords

BENCHMARKING; INTEGER PROGRAMMING;

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL RESULTS; CUTTING PLANES; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; REPLENISHMENT POLICY; SEPARATION PROBLEMS; VALID INEQUALITY;

DISTRIBUTION OF GOODS;

EID: 85048217322     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2016.0729     Document Type: Article

References (11)

1. Adulyasak Y, Cordeau J-F, Jans R (2014) Formulations and branchand-cut algorithms for multi-vehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103-120.
2. Archetti C, Bianchessi N, Speranza MG (2013) Optimal solutions for routing problems with profits. Discrete Appl. Math. 161(4):547-557.
3. Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-andcut algorithm for a vendor-managed inventory-routing problem. Transportation Sci. 41(3):382-391.
4. Avella P, Boccia M, Wolsey LA (2015) Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65(2):129-138.
5. Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2):558-565.
6. Coelho LC, Laporte G (2014) Improved solutions for inventoryrouting problems through valid inequalities and input ordering. Internat. J. Production Econom. 155:391-397.
7. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1-19.
8. Desaulniers G, Rakke JG, Coelho LC (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Sci. 50(3):1060-1076.
9. Naddef D, Rinaldi G (2001) Branch-and-cut algorithms for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 53-84.
10. Picard JC, Ratliff HD (1973) A graph-theoretic equivalence for integer programs. Oper. Res. 21(1):261-269.
11. Solyali O, Süral H (2011) A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem. Transportation Sci. 45(3):335-345.