A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems

DOI10.1002/NET.20182MaRDI QIDQ5295489zbMATH OpenOpenAlexFDO

Authors Lars Magnus Hvattum, Arne Løkketangen, G. Laporte

Publication date 30 July 2007

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20182

zbMATH Keywords

dynamic vehicle routingheuristicregretstochastic vehicle routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• The Vehicle Routing Problem with Stochastic Travel Times
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands

Cites work

• Computer Solutions of the Traveling Salesman Problem
• The vehicle routing problem

Cited in

(17)

• Adaptive granular local search heuristic for a dynamic vehicle routing problem
• Dynamic pickup and delivery problems
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Ant colony optimization with clustering for solving the dynamic location routing problem
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Dynamic transportation of patients in hospitals
• The dynamic multi-period vehicle routing problem
• Pro-active real-time routing in applications with multiple request patterns
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
• Heuristics for dynamic and stochastic routing in industrial shipping
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
• Dynamic scheduling of patients in emergency departments

This page was built for publication: A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295489)