Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits

作     者：Goodson, Justin C. Ohlmann, Jeffrey W. Thomas, Barrett W. 

作者机构：St Louis Univ John Cook Sch Business Dept Operat & Informat Technol Management St Louis MO 63108 USA Univ Iowa Tippie Coll Business Dept Management Sci Iowa City IA 52242 USA 

出 版 物：《OPERATIONS RESEARCH》 (运筹学)

年 卷 期：2013年第61卷第1期

页      面：138-154页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Executive Council for Graduate and Professional Students at the University of Iowa 

主　　题：rollout policy approximate dynamic programming stochastic vehicle routing fixed routes 

摘      要：We develop a family of rollout policies based on fixed routes to obtain dynamic solutions to the vehicle routing problem with stochastic demand and duration limits (VRPSDL). In addition to a traditional one-step rollout policy, we leverage the notions of the pre- and post-decision state to distinguish two additional rollout variants. We tailor our rollout policies by developing a dynamic decomposition scheme that achieves high quality solutions to large problem instances with reasonable computational effort. Computational experiments demonstrate that our rollout policies improve upon the performance of a rolling horizon procedure and commonly employed fixed-route policies, with improvement over the latter being more substantial.