A hybrid heuristic based on iterated local search for multivehicle inventory routing problem

DOI10.1016/j.endm.2016.03.026zbMath1351.90017OpenAlexW2403763572MaRDI QIDQ325440

Edcarllos Santos, Pedro Henrique González, Luidi Simonetti, Luiz Satoru Ochi

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.026

zbMATH Keywords

hybrid metaheuristicsiterated local searchmultivehicle inventory routing problem

Mathematics Subject Classification ID

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

Related Items (6)

Inventory routing in a warehouse: the storage replenishment routing problem ⋮ Comparison of formulations for the inventory routing problem ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ On the zero-inventory-ordering policy in the inventory routing problem ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ The inventory routing problem with split deliveries

Cites Work

• The exact solution of several classes of inventory-routing problems
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems

This page was built for publication: A hybrid heuristic based on iterated local search for multivehicle inventory routing problem