A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows

DOI10.1016/j.cor.2022.106129OpenAlexW4313429943MaRDI QIDQ6109341

Emilio Jose Alarcon Ortega, Karl F. Doerner

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106129

zbMATH Keywords

consistencyadaptive large neighborhood searchmatheuristicsstochastic inventory routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Delivery strategies for blood products supplies
• A general heuristic for vehicle routing problems
• Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
• An assign-and-route matheuristic for the time-dependent inventory routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Inventory Routing
• The Stochastic Inventory Routing Problem with Direct Deliveries
• A Matheuristic for the Multivehicle Inventory Routing Problem
• A unified tabu search heuristic for vehicle routing problems with time windows
• Consistent Inventory Routing with Split Deliveries
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• A Price-Directed Approach to Stochastic Inventory/Routing
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

This page was built for publication: A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows