摘要
对于一类基于运行距离最短的车队调度问题,构建了问题的数学规划模型。由于模型难以直接求解,构造网络图对车队问题进行表述。通过求解车队调度网路图的最小生成树,去除最小生成树中车辆和车辆之间连接线,从而将问题分解为一个个单车辆调度问题。对于单车辆调度问题的处理,设计了最小权奇点边添加法。该方法通过构造奇点边集合,使单车辆调度网络图成为所有顶点均为偶点的多重图;进而寻找欧拉环,并删除欧拉环中的重复中间点,最终得到问题的求解方案。最后设计了实例,分别采用图解算法和禁忌搜索算法进行求解。对比发现图解算法在求解车辆调度问题方面具有一定的优越性。
For the fleet scheduling problem based on the shortest distance, a mathematical model is constructed. For it is difficult to directly solve the model, the fleet scheduling problem is expressed with the network diagram. By solving the minimum spanning tree of the fleet scheduling network diagram and removing the connection between vehicles of the minimum spanning tree, the fleet scheduling prob- lem is decomposed into several single vehicle scheduling problems. Then the method that singular point edge is increased into network diagram is designed for single vehicle scheduling problem. The method converts the single vehicle scheduling network diagram into multi-graph by constructing a singular point edge set. Then looking for the Euler ring, the repeating intermediate point of Euler ring is removed. Finally the algorithm of problem solving is found. At last a case is designed. Then it is solved by the graphic algorithm and the tabu search algorithm respectively. By comparison, the graphical algorithm for solving the vehicle scheduling problem has certain advantages. The method can be used as reference for effectively freight vehicle scheduling and scientific freight transportation.
出处
《控制工程》
CSCD
北大核心
2014年第3期409-414,共6页
Control Engineering of China
基金
国家自然科学基金项目(71001091
71001090)
博士后科学基金资助项目(2013M531683)
关键词
车队调度问题
奇点边
最小生成树
欧拉环
fleet scheduling problem
singular boundary
minimum spanning tree
Euler ring
作者简介
李冰（1976-），男，河南开封人，教授，主要从事物流系统优化与控制、运输组织优化等方面的教学与科研工作。
