A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands

DOI10.1111/itor.12776OpenAlexW3003425327MaRDI QIDQ6090498

Alejandro Estrada-Moreno, Javier Panadero, Angel A. Juan, Unnamed Author

Publication date: 17 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.12776

zbMATH Keywords

stochastic demandsonline datamulti-period inventory routing problembiased randomizationsimheuristics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

A stochastic approach for planning airport ground support resources ⋮ From scenarios to conditional scenarios in two‐stage stochastic MILP problems ⋮ An inventory hub location model for multi‐coal‐fired coastal power plants: a case study in Guangdong district ⋮ A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty

Cites Work

• 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
• A multi-agent based cooperative approach to scheduling and routing
• A two-phase algorithm for the cyclic inventory routing problem
• A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
• Inventory management with log-normal demand per unit time
• 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
• Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
• Dynamic pickup and delivery problems
• Using scenario trees and progressive hedging for stochastic inventory routing problems
• 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
• Feature Article: Optimization for simulation: Theory vs. Practice
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
• A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
• A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

This page was built for publication: A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands