A variable neighborhood search for the multi-product inventory routing problem
DOI10.1016/J.ENDM.2012.10.013zbMATH Open1268.90155OpenAlexW2069825310MaRDI QIDQ2840757FDOQ2840757
Authors: Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.013
Recommendations
- A two phase variable neighborhood search for the multi-product inventory routing problem
- A general variable neighbourhood search for the multi-product inventory routing problem
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- A decomposition-based heuristic for the multiple-product inventory-routing problem
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (11)
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- A variable neighborhood decomposition search method for supply chain management planning problems
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- Local search based metaheuristics for two-echelon distribution network with perishable products
- A general variable neighbourhood search for the multi-product inventory routing problem
- A two phase variable neighborhood search for the multi-product inventory routing problem
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
This page was built for publication: A variable neighborhood search for the multi-product inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840757)
