The dynamic multi-period vehicle routing problem

Authors:
Min Wen;Jean-François Cordeau;Gilbert Laporte;Jesper Larsen
Affiliations:
Department of Management Engineering, Technical University of Denmark, Produktionstorvet DTU-Building 426, DK-2800 Kongens Lyngby, Denmark;Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;Canada Research Chair in Distribution Management and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;Department of Management Engineering, Technical University of Denmark, Produktionstorvet DTU-Building 426, DK-2800 Kongens Lyngby, Denmark
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 1

Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
A genetic algorithm for a bi-objective capacitated arc routing problem

Computers and Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
Waiting Strategies for Dynamic Vehicle Routing

Transportation Science
Competitive analysis for dynamic multiperiod uncapacitated routing problems

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

Networks

Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

International Journal of Applied Logistics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the dynamic multi-period vehicle routing problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that the proposed approach can yield high quality solutions within reasonable running times.