摘要
本文研究基于禁止时间窗的应急物资调度车辆路径问题。首先对研究问题进行界定,其中交通网络的道路和节点均带有禁止时间窗,目标是通过路径选择最小化应急物资的调运时间;随后定义两组决策变量,分别用于路径上节点和枝线的选择,进而构建问题的整数规划优化模型;鉴于模型的组合属性,设计问题求解的禁忌搜索启发式算法;最后通过一个算例对结果进行说明,得到如下结论:由于禁止时间窗的影响,车辆在最差路径上的运输时间及等待时间,要比满意路径上的分别长68.8%和266.7%,显示出路径优选的实用价值。
This paper involves the forbidding time window based vehicle routing problem in emergency transportation. The problem, where both arcs and nodes in network have a forbidding time window and the objective is to minimize the emergency transportation time, is identified firstly. Then two groups of decision variables are de- fined to indicate the nodes and arcs on the path selected, and an integer programming optimization model of the problem is constructed. For the combinational attribute owned by the model, a tabu search heuristic is developed. Finally, the research is illustrated by an instance and the following conclusion is obtained： For the effect of the forbidding time windows, the transportation time and the waiting time of the vehicle on the worst path are 68.8% and 266.7% longer than those of the vehicle on the satisfactory path respectively, showing the importance of path optimization.
出处
《运筹与管理》
CSCD
北大核心
2009年第2期1-6,共6页
Operations Research and Management Science
基金
国家应急平台体系关键技术研究与应用示范基金资助项目(2006BAK01A40)
国家自然科学基金资助项目(70871097)
关键词
运筹学与控制论
应急物资调度
禁忌搜索启发式算法
车辆路径
禁止时间窗
operations research and cybernetics
emergency transportation scheduling
tabu search heuristic
vehicle routing
forbidding time window
