有顾客时间窗和发货量变化的紧急车辆调度研究

对紧急车辆调度系统进行了研究,探讨了紧急车辆调度问题实现的关键技术.对有顾客时间窗和发货量变化的紧急车辆调度问题,运用了禁忌算法(TS)进行优化.算法基于实数编码,应用GENI插入法产生初始解和进行邻域操作,设计了三种邻域,利用容量约束控制单条路径配送点数,采用惩罚函数处理时间窗约束,通过设计虚拟车场等方法实现了车辆的紧急调度.本文给出了一个具有代表性的算例试验结果,算例结果及其分析表明了此方法对优化紧急车辆调度问题的有效性.

Study on Urgency Vehicle Scheduling Problem with the Changes of Time Windows and Delivery Weight of Customers

The Urgency Vehicle Scheduling problem and the key technology for solving it are studied.A Tabu Search Algorithm(TS) is proposed to optimize the problem with the changes of time windows and delivery weight.The algorithm uses GENI insertion to construct the initial solution and operate the neighborhood.Three neighborhoods are designed to extend the search space.Capacity limit is designed to control the number of distribution points in each route.The time windows limit is solved with adding penalty function to the object function.A suppositional depot is designed to convert multi-depot into single depot.A representative result and the analysis are given in this paper.The experiment indicates the validity of the technique to Urgency Vehicle Scheduling problem with the above-mentioned conditions.