GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem

4OR

Volumn 14, Issue 4, 2016, Pages 377-404

  Guemri, Oualid ^a   Bekrar, Abdelghani ^b   Beldjilali, Bouziane ^a   Trentesaux, Damien ^b  

^a UNIVERSITY OF ORAN   (Algeria)

^b UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

GRASP; Meta heuristics; Multi product multi vehicle inventory routing; Optimization; Tabu search

Indexed keywords

EID: 84964247498     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-016-0315-1     Document Type: Article

References (23)

1. Abdelmaguid TF (2004) Heuristic approaches for the integrated inventory distribution problem. PhD thesis, University of Southern California, Los Angeles, USA
2. Abdelmaguid TF, Dessouky MM (2006) A genetic algorithm approach to the integrated inventory-distribution problem. Int J Prod Res 44(21):4445–4464
3. Adulyasak Y, Cordeau JF, Jans R (2012) Formulations and branch-and-cut algorithms for multi-vehicule production and inventory routing problems. GERAD, Technical report G-2012-14, Canada
4. Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp Sci 41(3):382–391
5. Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J Comput 24(1):101–116
6. Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Int Trans Oper Res 21(3):353–374
7. Coelho LC, Laporte G (2013a) The exact solution of several classes of inventory-routing problems. Comput Oper Res 40(2):558–565
8. Coelho LC, Laporte G (2013b) A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int J Prod Res 51(23–24):7156–7169
9. Coelho LC, Cordeau JF, Laporte G (2012a) The inventory-routing problem with transshipment. Comput Oper Res 39(11):2537–2548
10. Coelho LC, Cordeau JF, Laporte G (2012b) Consistency in multi-vehicle inventory-routing. Transp Res Part C Emerg Technol 24(1):270–287
11. Coelho LC, Cordeau JF, Laporte G (2014) Thirty years of inventory-routing. Transp Sci 48(01):001–019
12. Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37(06):579–594
13. Cordeau JF, Lagan D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput Oper Res 55:153–166
14. Desaulniers G, Rakke JG, Coelho LC (2014) A branch-price-and-cut algorithm for the inventory-routing problem. GERAD, Technical report G-2014-12, Canada
15. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 06(2):109–133
16. Glover F (1989) Tabu search—part I. ORSA J Comput 01(03):190–206
17. Harks T, Konig F, Matuschke J (2013) Approximation algorithms for capacitated location routing. Eur J Oper Res 47(1):3–22
18. Lemouari A, Guemri O (2014) A two-phase scheduling method combined to the tabu search for the DARP. Int J Appl Metaheuristic Comput 05(02):001–021
19. Mjirda A, Jarboui B, Macedo R, Hanafi S, Mladenovic N (2014) A two phase variable neighborhood search for the multi-product inventory routing problem. Comput Oper Res 52:291–299
20. Moin NH, Salhi S, Aziz NAB (2011) An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Inte J Prod Econ 133(1):334–343
21. Popovic D, Vidovic M, Radivojevic G (2012) Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst Appl 39(18):13390–13398
22. Solyali O, Sural H (2011) A branch-and-cut algorithm using a strong formulation and an a priori tour based heuristic for an inventory-routing problem. Transp Sci 45(3):335–345
23. Yu Y, Chen H, Chu F (2008) A new model and hybrid approach for large-scale inventory routing problems. Eur J Oper Res 189(3):1022–1040