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

DOI10.1002/net.20182zbMath1141.90337OpenAlexW4239618018MaRDI QIDQ5295489

Lars Magnus Hvattum, Gilbert Laporte, Arne Løkketangen

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

heuristicregretstochastic vehicle routingdynamic vehicle routing

Mathematics Subject Classification ID

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

Related Items (13)

Pro-active real-time routing in applications with multiple request patterns ⋮ Heuristics for dynamic and stochastic routing in industrial shipping ⋮ A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows ⋮ Dynamic scheduling of patients in emergency departments ⋮ 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 ⋮ Dynamic transportation of patients in hospitals ⋮ The dynamic multi-period vehicle routing problem ⋮ Adaptive granular local search heuristic for a dynamic vehicle routing problem ⋮ Dynamic pickup and delivery problems ⋮ Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review ⋮ A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling

Cites Work

• The Vehicle Routing Problem
• Computer Solutions of the Traveling Salesman Problem

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