Real-time vehicle rerouting problems with time windows

This paper introduces and studies real-time vehicle rerouting problems with time windows, applicable to delivery and/or pickup services that undergo service disruptions due to vehicle breakdowns. In such problems, one or more vehicles need to be rerouted, in real-time, to perform uninitiated service...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 194; H. 3; S. 711 - 727
Hauptverfasser: Li, Jing-Quan, Mirchandani, Pitu B., Borenstein, Denis
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.05.2009
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Deliveries
Dynamic programming
Exact sciences and technology
Heuristic
Job shops
Lagrange multiplier
Lagrangian heuristic
Operational research. Management science
Rerouting
Routing
Schedule recovery
Shortest path algorithms
Studies
Vehicle routing
Vehicle routing Rerouting Schedule recovery Lagrangian heuristic
Rerouting
Lagrangian heuristic
Vehicle routing
Schedule recovery
Lagrangian
Insertion
Shortest path
Routing
Real time
Recovery
Delivery lead time
Lagrange multiplier
Time window
Resource constraint
Heuristic method
Relaxation method
Dynamic programming
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper introduces and studies real-time vehicle rerouting problems with time windows, applicable to delivery and/or pickup services that undergo service disruptions due to vehicle breakdowns. In such problems, one or more vehicles need to be rerouted, in real-time, to perform uninitiated services, with the objective to minimize a weighted sum of operating, service cancellation and route disruption costs. A Lagrangian relaxation based-heuristic is developed, which includes an insertion based-algorithm to obtain a feasible solution for the primal problem. A dynamic programming based algorithm solves heuristically the shortest path problems with resource constraints that result from the Lagrangian relaxation. Computational experiments show that the developed Lagrangian heuristic performs very well.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.12.037