A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
From MaRDI portal
Publication:6088245
DOI10.1111/itor.12540OpenAlexW2794696396WikidataQ130054260 ScholiaQ130054260MaRDI QIDQ6088245
Javier Panadero, José A. Moreno Pérez, Aljoscha Gruler, Jesica De Armas, Angel A. Juan
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12540
metaheuristicsvariable neighborhood searchstochastic demandssimheuristicsmultiperiod inventory routing problem
Related Items (14)
A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Agile optimization for a real‐time facility location problem in Internet of Vehicles networks ⋮ Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ Constraint-based robust planning and scheduling of airport apron operations through simheuristics ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty ⋮ A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows ⋮ Variable neighborhood search: the power of change and simplicity ⋮ A multi-period inventory routing problem with procurement decisions: a case in China
Cites Work
- 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
- A two-phase algorithm for the cyclic inventory routing problem
- A two phase variable neighborhood search for the multi-product inventory routing problem
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem
- Variable neighbourhood search: methods and applications
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Variable neighborhood search
- Route and fleet design for cyclic inventory routing
- Large scale stochastic inventory routing problems with~split delivery and service level constraints
- Industrial aspects and literature survey: Combined inventory management and routing
- An inventory-routing problem with the objective of travel time minimization
- A Hybrid Heuristic for an Inventory Routing Problem
- Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
- Vehicle Routing
- Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
- A Price-Directed Approach to Stochastic Inventory/Routing
This page was built for publication: A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
