An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
From MaRDI portal
(Redirected from Publication:296579)
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
Cites work
- scientific article; zbMATH DE number 4057252 (Why is no real title available?)
- scientific article; zbMATH DE number 1452995 (Why is no real title available?)
- scientific article; zbMATH DE number 956789 (Why is no real title available?)
- A Note on Bounds for Direct Shipping Cost
- A Price-Directed Approach to Stochastic Inventory/Routing
- A practical solution approach for the cyclic inventory routing problem
- Analysis of the single-vehicle cyclic inventory routing problem
- Handbook of metaheuristics
- Industrial aspects and literature survey: Combined inventory management and routing
- Inventory routing problems: a logistical overview
- Iterated local search for the team orienteering problem with time windows
- Modeling inventory routing problems in supply chains of high consumption products
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Rich routing problems arising in supply chain management
- The Stochastic Inventory Routing Problem with Direct Deliveries
- The inventory-routing problem with transshipment
- The orienteering problem: a survey
- The vehicle routing problem
Cited in
(19)- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Analysis of the single-vehicle cyclic inventory routing problem
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
- An exact approach for cyclic inbound inventory routing in a level production system
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Stochastic inventory routing with time-based shipment consolidation
- Long‐term effects of short planning horizons for inventory routing problems
- Cyclic inventory routing in a line-shaped network
- 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 reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- A shortfall modelling-based solution approach for stochastic cyclic inventory routing
- Route and fleet design for cyclic inventory routing
- Analysis and Solution Developement of the Single-Vehicle Inventory Routing Problem
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)