A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
From MaRDI portal
Publication:325440
DOI10.1016/J.ENDM.2016.03.026zbMATH Open1351.90017OpenAlexW2403763572MaRDI QIDQ325440FDOQ325440
Edcarllos Santos, Luiz S. Ochi, Pedro Henrique González, L. Simonetti
Publication date: 18 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.026
Recommendations
- A hybrid heuristic for an inventory routing problem
- A kernel search heuristic for the multivehicle inventory routing problem
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- A model and two heuristic methods for the multi-product inventory-location-routing problem with heterogeneous fleet
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (6)
- Inventory routing in a warehouse: the storage replenishment routing problem
- The inventory routing problem with split deliveries
- On the zero-inventory-ordering policy in the inventory routing problem
- A kernel search heuristic for the multivehicle inventory routing problem
- Comparison of formulations for the inventory routing problem
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
This page was built for publication: A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325440)