基于近似动态规划的动态车辆调度算法  

An Algorithm of Dynamic Vehicle Scheduling Problem Based on Approximate Dynamic Programming

作　　者：李雪[1] 聂兰顺[1] 齐文艳[1] 战德臣[1] 

机构地区：[1]哈尔滨工业大学,哈尔滨150001

出　　处：《中国机械工程》2015年第5期682-688,693,共8页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(61273038);国家科技支撑计划资助项目(2013BAH17F03);国家重点基础研究发展计划(973计划)资助项目(2010CB328004);山东省自主创新成果转化重大专项(2012ZH1A0411)

摘　　要：针对物流配送服务业中,车辆调度问题日渐呈现任务规模大,车辆类型多、属性多,调度实时性要求越来越高等特点,提出了基于近似动态规划的动态车辆调度算法。根据当前的任务需求与车辆状态以及相应的约束条件作出相应的调度,并且对一些样本进行训练,得到了一个近似价值函数。通过该价值函数,即可对任务迅速作出相应的决策。仿真模拟实验证明了该算法的有效性和优越性。Vehicle scheduling in service industry of logistics distribution was presenting features including the tasks tended to be of large scale,vehicles were multi-type and had multiple attributes as well as high demands for real-time scheduling.To solve these problems,this paper proposed a dynamic vehicle scheduling algorithm based on the approximate dynamic programming.An approximate value function was obtained through training of some samples,and according to mission requirements,vehicle state and conditions,and quick scheduling decisions could be made with the value function.The simulation test has proved the correctness and effectiveness of the algorithm.

关 键 词：服务资源 近似动态规划 动态调度 价值函数 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]