A two phase variable neighborhood search for the multi-product inventory routing problem
DOI10.1016/J.COR.2013.06.006zbMATH Open1348.90035OpenAlexW2033326932MaRDI QIDQ337230FDOQ337230
Authors: Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenović 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.06.006
Recommendations
- A variable neighborhood search for the multi-product inventory routing problem
- A general variable neighbourhood search for the multi-product inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- 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
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- The truck dispatching problem
- Variable neighborhood search
- Variable neighbourhood search: methods and applications
- Industrial aspects and literature survey: Combined inventory management and routing
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Title not available (Why is that?)
- Inventory routing problems: a logistical overview
- Title not available (Why is that?)
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- The traveling-salesman problem
- An optimization algorithm for the inventory routing problem with continuous moves
- A decomposition approach to the inventory routing problem with satellite facilities
- An Integrated Inventory Allocation and Vehicle Routing Problem
- Inventory routing with continuous moves
Cited In (19)
- A variable neighborhood decomposition search method for supply chain management planning problems
- Vehicle routing problems with multiple commodities: a survey
- 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 unified decomposition matheuristic for assembly, production, and inventory routing
- The inventory routing problem with split deliveries
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- A general variable neighbourhood search for the multi-product inventory routing problem
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A branch-and-cut algorithm for an assembly routing problem
- A variable neighborhood search for the multi-product inventory routing problem
- 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
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
This page was built for publication: A two phase 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 Q337230)
