A note on determining operating strategies for probabilistic vehicle routing

DOI10.1002/nav.3800270114zbMath0431.90054OpenAlexW1988022841MaRDI QIDQ3869086

Bruce L. Golden, James R. Yee

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270114

zbMATH Keywords

algorithmtransportationlogisticsstochastic vehicle routing problemdeliverydynamic programming recursionprobabilistic vehicle routingdetermination of operating strategiesmunicipal waste collectionschoolbus routingsubscription bus scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items

Faster rollout search for the vehicle routing problem with stochastic demands and restocking, Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands, A modular algorithm for an extended vehicle scheduling problem, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, The stochastic vehicle routing problem revisited, Stochastic vehicle routing