Skip to Main content Skip to Navigation
Journal articles

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

Abstract : In this paper, we introduce an improved Greedy Randomized Adaptive Search Procedure (GRASP) based heuristic for the multi-product multi-vehicle inventory routing problem (MMIRP). The inventory routing problem, which combines the vehicle-routing problem and the inventory control decisions, is one of the most important problems in combinatorial optimization field. To deal with the MMIRP, we develop a GRASP-based heuristic (GBH). Each GBH iteration consists of two sequential phases; the first phase is a Greedy Randomized Procedure, in which, the best tradeoff between the inventory holding cost and routing cost is looked. Then, in the second phase, as local search for the GRASP, we use the Tabu search (TS) meta-heuristic to improve the solution found in the first phase. The GBH two phases are repeated until some stopped criterion is met. Our proposed method is evaluated on two benchmark data sets, and successfully compared with two state-of-the-art algorithms.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03426878
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Friday, November 12, 2021 - 4:12:57 PM
Last modification on : Saturday, November 13, 2021 - 3:53:18 AM

Identifiers

Collections

Citation

Oualid Guemri, Abdelghani Bekrar, Bouziane Beldjilali, Damien Trentesaux. GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2016, 14 (4), pp.377-404. ⟨10.1007/s10288-016-0315-1⟩. ⟨hal-03426878⟩

Share

Metrics

Record views

18