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

DOI10.1007/S10288-016-0315-1zbMath1358.90115OpenAlexW2340670618MaRDI QIDQ503664

Oualid Guemri, Bouziane Beldjilali, Abdelghani Bekrar, Damien Trentesaux

Publication date: 13 January 2017

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-016-0315-1

zbMATH Keywords

optimizationtabu searchGRASPmeta-heuristicsmulti-product multi-vehicle inventory routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Cites Work

• A two phase variable neighborhood search for the multi-product inventory routing problem
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• The exact solution of several classes of inventory-routing problems
• The inventory-routing problem with transshipment
• Greedy randomized adaptive search procedures
• A new model and hybrid approach for large scale inventory routing problems
• A Hybrid Heuristic for an Inventory Routing Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• A genetic algorithm approach to the integrated inventory-distribution problem
• Tabu Search—Part I
• Formulations for an inventory routing problem

This page was built for publication: GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem