A matheuristic for the multivehicle inventory routing problem

INFORMS Journal on Computing

Volumn 29, Issue 3, 2017, Pages 377-387

  Archetti, Claudia ^a   Boland, Natashia ^b   Speranza, M Grazia ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

^b Georgia Institute of Technology   (United States)

Author keywords

Inventory routing; Matheuristics; Mixed integer linear programming; Tabu search

Indexed keywords

COSTS; FLEET OPERATIONS; MATHEMATICAL PROGRAMMING; SALES; TABU SEARCH;

CAPACITATED VEHICLES; INVENTORY COSTS; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; MATHEURISTICS; MIXED INTEGER LINEAR PROGRAMMING; OPTIMAL SOLUTIONS; SET OF CUSTOMERS;

INTEGER PROGRAMMING;

EID: 85025453155     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.2016.0737     Document Type: Article

References (22)

1. Adulyasak Y, Cordeau J-F, Jans R (2014a) Formulations and branchand-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103-120.
2. Adulyasak Y, Cordeau J-F, Jans R (2014b) Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Sci. 48(1):20-45.
3. Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory-routing problem. INFORMS J. Comput. 24(1):101-116.
4. Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) Abranch-andcut algorithm for a vendor managed inventory-routing problem. Transportation Sci. 41(3):382-391.
5. Archetti C, Bertazzi L, Paletta G, Speranza MG (2011) Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12):1731-1746.
6. Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Internat. Trans. Oper. Res. 21(3):353-374.
7. Archetti C, Speranza MG, Savelsbergh MWP (2008) An optimizationbased heuristic for the split delivery vehicle routing problem. Transportation Sci. 42(1):22-31.
8. Bertazzi L, Speranza MG (2012) Inventory routing problems: An introduction. EURO J. Transportation Logist. 1(4):307-326.
9. Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J. Transportation Logist. 2(3):255-275.
10. Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40(2):558-565.
11. Coelho LC, Laporte G (2014) Improved solutions for inventoryrouting problems through valid inequalities and input ordering. Internat. J. Production Econom. 155(1):391-397.
12. Coelho LC, Cordeau J-F, Laporte G (2012a) Consistency in multivehicle inventory-routing. Transportation Res. Part C 24(1): 270-287.
13. Coelho LC, Cordeau J-F, Laporte G (2012b) The inventoryrouting problem with transshipment. Comput. Oper. Res. 39(11): 2537-2548.
14. Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transportation Sci. 48(1):1-19.
15. Cordeau J-F, Lagan D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55:153-166.
16. Degraeve Z, Gochet W, Jans R (2002) Alternative formulations for a layout problem in the fashion industry. Eur. J. Oper. Res. 143(1): 80-93.
17. Desaulniers G, Rakke JG, Coelho LC (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transportation Sci. 50(3):1060-1076.
18. Jans R (2009) Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21(1):123-136.
19. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2):498-516.
20. Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1):60-100.
21. Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Management Sci. 47(10): 1396-1407.
22. 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.