An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
From MaRDI portal
Publication:296579
DOI10.1016/J.EJOR.2014.02.020zbMATH Open1338.90036OpenAlexW2056802132MaRDI QIDQ296579FDOQ296579
Manuel Mateo, Pieter Vansteenwegen
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.020
Recommendations
- Analysis of the single-vehicle cyclic inventory routing problem
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
- A two-phase algorithm for the cyclic inventory routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- The orienteering problem: a survey
- The vehicle routing problem
- The inventory-routing problem with transshipment
- Handbook of metaheuristics
- A practical solution approach for the cyclic inventory routing problem
- Rich routing problems arising in supply chain management
- Industrial aspects and literature survey: Combined inventory management and routing
- Modeling inventory routing problems in supply chains of high consumption products
- Analysis of the single-vehicle cyclic inventory routing problem
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Title not available (Why is that?)
- A Note on Bounds for Direct Shipping Cost
- The Stochastic Inventory Routing Problem with Direct Deliveries
- Title not available (Why is that?)
- A Price-Directed Approach to Stochastic Inventory/Routing
- Inventory routing problems: a logistical overview
- Title not available (Why is that?)
- Iterated local search for the team orienteering problem with time windows
Cited In (15)
- A shortfall modelling-based solution approach for stochastic cyclic inventory routing
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- An exact approach for cyclic inbound inventory routing in a level production system
- Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- A two-phase algorithm for the cyclic inventory routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
- Stochastic inventory routing with time-based shipment consolidation
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Long‐term effects of short planning horizons for inventory routing problems
Uses Software
This page was built for publication: An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296579)