A scenario decomposition algorithm for strategic time window assignment vehicle routing problems

•We study the TWAVRP with both continuous and discrete sets of time windows and general scenario-based models of uncertainty for several routing-specific parameters.•We propose a novel, decomposition algorithm for the TWAVRP that can be easily parallelized, can utilize any available vehicle routing...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation research. Part B: methodological 2018-11, Vol.117, p.296-317
Hauptverfasser:	Subramanyam, Anirudh, Wang, Akang, Gounaris, Chrysanthos E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Black boxes Branch-and-bound Computation Computer applications Decision making Decisions Decomposition Optimization Parallel processing Parameter uncertainty Route planning Routing Service consistency Stochastic models Stochastic programming Stochasticity Time window assignment Travel time Vehicle routing Vehicle routing under uncertainty Windows (intervals)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!