An approximate dynamic programming approach for the vehicle routing problem with stochastic demands

This paper examines approximate dynamic programming algorithms for the single-vehicle routing problem with stochastic demands from a dynamic or reoptimization perspective. The methods extend the rollout algorithm by implementing different base sequences (i.e. a priori solutions), look-ahead policies...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2009-07, Vol.196 (2), p.509-515
Hauptverfasser:	Novoa, Clara, Storer, Robert
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Approximate dynamic programming Dynamic programming Exact sciences and technology Logistics Monte Carlo simulation Operational research and scientific management Operational research. Management science Optimization algorithms Routing Stochastic models Stochastic vehicle routing Studies Transportation Transportation Stochastic vehicle routing Approximate dynamic programming
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!