GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2016

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.
No file

Dates and versions

hal-03426878 , version 1 (12-11-2021)

Identifiers

Cite

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, 2016, 14 (4), pp.377-404. ⟨10.1007/s10288-016-0315-1⟩. ⟨hal-03426878⟩
27 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More