Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
Publication:5356988
DOI10.1007/978-3-319-18161-5_20zbMath1370.90030MaRDI QIDQ5356988
Viacheslav A. Shirokikh, V. V. Zakharov
Publication date: 12 September 2017
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_20
heuristic algorithms; time consistency; adaptive large neighborhood search (ALNS); inventory routing problem (IRP); dynamic adaptive large neighborhood search (DALNS)
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90B05: Inventory, storage, reservoirs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- Heuristics for dynamic and stochastic inventory-routing
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- The exact solution of several classes of inventory-routing problems
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- The inventory-routing problem with transshipment
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Hybrid heuristics for a short sea inventory routing problem
- A Hybrid Heuristic for an Inventory Routing Problem
- The Biobjective Inventory Routing Problem – Problem Solution and Decision Support
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- Formulations for an inventory routing problem