Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows

Doerner, Karl F.; Gronalt, Manfred; Hartl, Richard F.; Kiechle, Guenter; Reimann, Marc

doi:10.1016/j.cor.2007.02.012

Cited by 78 publications

(36 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solution approaches based on mixed integer programming are provided. To the best of our knowledge, Doerner et al (2008) were the first to explicitly consider interdependent time windows in a real-world problem faced in blood transportation. As in our problem, a change in the sequence of one route can lead to infeasibility of all other routes.…”

Section: Related Workmentioning

confidence: 99%

A matheuristic for routing real-world home service transport systems facilitating walking

Fikar

Hirsch

2015

Journal of Cleaner Production

112

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

A matheuristic for routing real-world home service transport systems facilitating walking

Fikar

Hirsch

2015

Journal of Cleaner Production

112

View full text Add to dashboard Cite

“…Doerner et al [34] studied the VRP with multiple interdependent time windows in which each customer may be required to be visited several times and the elapsed time between two consecutive visits must not exceed a maximum time. This VRPTW variant is inspired by a blood transportation application.…”

Section: Driver Considerations Multiple Use Of Vehicles and Multiplmentioning

confidence: 99%

Chapter 5: The Vehicle Routing Problem with Time Windows

Desaulniers¹,

Madsen²,

Røpke³

2014

Vehicle Routing

View full text Add to dashboard Cite

“…Fügenschuh refers to the problem as the vehicle routing problem with coupled time windows. Doerner et al [14] describe an application in blood collection from satellite locations for a central blood bank. Multiple visits at each location have to be scheduled with a certain slack between them.…”

Section: Introductionmentioning

confidence: 99%

The vehicle routing problem with time windows and temporal dependencies

2011

View full text Add to dashboard Cite

In this paper, we formulate the vehicle routing problem with time windows and temporal dependencies. The problem is an extension of the well studied vehicle routing problem with time windows. In addition to the usual constraints, a scheduled time of one visit may restrain the scheduling options of other visits. Special cases of temporal dependencies are synchronization and precedence constraints. Two compact formulations of the problem are introduced and the Dantzig-Wolfe decompositions of these formulations are presented to allow for a column-generation-based solution approach. Temporal dependencies are modeled by generalized precedence constraints. A total of four different master problem formulations are proposed and it is shown that the formulations can be ranked according to the tightness with which they describe the solution space. A tailored time window branching is used to enforce feasibility on the relaxed master problems. Finally, a computational study is carried out to quantitatively reveal strengths and weaknesses of the proposed formulations. It is concluded that, depending on the problem at hand, the best performance is achieved either by relaxing the generalized precedence constraints in the master problem, or by using a time-indexed model, where generalized precedence constraints are added as cuts when they become severely violated.

show abstract

Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows

Cited by 78 publications

References 16 publications

A matheuristic for routing real-world home service transport systems facilitating walking

A matheuristic for routing real-world home service transport systems facilitating walking

Chapter 5: The Vehicle Routing Problem with Time Windows

The vehicle routing problem with time windows and temporal dependencies

Contact Info

Product

Resources

About