A MARKOV DECISION-MODEL AND DECOMPOSITION HEURISTIC FOR DYNAMIC VEHICLE DISPATCHING
成果类型：
Article
署名作者：
MINKOFF, AS
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.41.1.77
发表日期：
1993
页码：
77-101
关键词：
摘要：
We describe a dynamic and stochastic vehicle dispatching problem called the delivery dispatching problem. This problem is modeled as a Markov decision process. Because exact solution of this model is impractical, we adopt a heuristic approach for handling the problem. The heuristic is based in part on a decomposition of the problem by customer, where customer subproblems generate penalty functions that are applied in a master dispatching problem. We describe how to compute bounds on the algorithm's performance, and apply it to several examples with good results.