摘要
将随机动态装卸混合问题的车辆数由单车辆推广至多车辆,针对其中存在的排队现象,运用排队论推导出需求密集情况下期望系统时间的下界,提出了一种求解的堆栈策略,并推导出了堆栈策略期望系统时间的上界,分析了堆栈策略的渐近性.仿真结果表明,堆栈策略是一种适用于需求密集情况下随机动态多车辆装卸混合问题的求解策略.
An extension from a single vehicle to multi-vehicles in stochastic dynamic pick-up and delivery problem was made. According to the queuing phenomena existing in this problem, the lower bound of expected system time in heavy traffic condition was deduced by applying queuing theory. A solution policy, which is called stacker crane policy, was proposed to solve this problem. The upper bound of the expected system time of this policy was deduced in the case of heavy traffic, and the asymptotic property of this policy was analyzed. The results of simulation show that the stacker crane policy is a solution policy suitable for stochastic dynamic multi-vehicles pick-up and delivery problem with heavy traffic.
出处
《系统工程学报》
CSCD
北大核心
2012年第1期61-68,共8页
Journal of Systems Engineering
基金
国家自然科学基金资助项目(70972056)
重庆市自然科学基金资助项目(CSTC2010BB5422)
重庆工商大学科研启动经费资助项目(2010-56-02)
关键词
装卸混合问题
动态车辆路径问题
随机车辆路径问题
排队论
仿真
pick-up and delivery problem
dynamic vehicle routing problem
stochastic vehicle routing prob-lem
queuing theory
simulation
