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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 196; no. 2; pp. 509 - 515
Main Authors:	Novoa, Clara, Storer, Robert
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.07.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!