预测(人工智能)
计算机科学
布线(电子设计自动化)
动态规划
服务(商务)
车辆路径问题
马尔可夫决策过程
运筹学
数据库事务
任务(项目管理)
数学优化
计算机网络
工程类
数据库
算法
马尔可夫过程
机器学习
经济
数学
统计
经济
系统工程
作者
Marlin Wolf Ulmer,Justin C. Goodson,Dirk Christian Mattfeld,Marco Hennig
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2018-04-13
卷期号:53 (1): 185-202
被引量:218
标识
DOI:10.1287/trsc.2017.0767
摘要
Although increasing amounts of transaction data make it possible to characterize uncertainties surrounding customer service requests, few methods integrate predictive tools with prescriptive optimization procedures to meet growing demand for small-volume urban transport services. We incorporate temporal and spatial anticipation of service requests into approximate dynamic programming (ADP) procedures to yield dynamic routing policies for the single-vehicle routing problem with stochastic service requests, an important problem in city-based logistics. We contribute to the routing literature as well as to the field of ADP. We combine offline value function approximation (VFA) with online rollout algorithms resulting in a high-quality, computationally tractable policy. Our offline–online policy enhances the anticipation of the VFA policy, yielding spatial and temporal anticipation of requests and routing developments. Our combination of VFA with rollout algorithms demonstrates the potential benefit of using offline and online methods in tandem as a hybrid ADP procedure, making possible higher-quality policies with reduced computational requirements for real-time decision making. Finally, we identify a policy improvement guarantee applicable to VFA-based rollout algorithms, showing that base policies composed of deterministic decision rules lead to rollout policies with performance at least as strong as that of their base policy.
科研通智能强力驱动
Strongly Powered by AbleSci AI