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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 196; číslo 2; s. 509 - 515
Hlavní autoři:	Novoa, Clara, Storer, Robert
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.07.2009 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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 Stochastic vehicle routing Approximate dynamic programming Transportation Monte Carlo method Filtering Vehicle routing problem Routing Modeling Confidence interval Exact solution Computation time Pruning(tree) Cost estimation Dynamic programming
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!