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

Authors:
Lars Magnus Hvattum;Arne Løkketangen;Gilbert Laporte
Affiliations:
Molde University College, 6411 Molde, Norway;Molde University College, 6411 Molde, Norway;Canada Research Chair in Distribution Management, HEC Montréal, Canada
Venue:
Networks
Year:
2007

Citing 0
Cited 5

Adaptive granular local search heuristic for a dynamic vehicle routing problem

Computers and Operations Research
The dynamic multi-period vehicle routing problem

Computers and Operations Research
ASAP: The After-Salesman Problem

Manufacturing & Service Operations Management
Heuristics for dynamic and stochastic routing in industrial shipping

Computers and Operations Research
Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new Branch-and-Regret Heuristic for a class of dynamic and stochastic vehicle routing problems. This work is motivated by a real-life problem faced by a major transporter in Norway. The heuristic uses stochastic information during the solution process. The new method is shown to be superior to previous heuristics that are uniquely based on a pure dynamic approach. The proposed heuristic is well suited to problems containing stochastic customers, stochastic demands, or both. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 49(4), 330–340 2007