单车场复杂情况下的车辆调度

针对单车场复杂情况下的车辆调度问题提出了一种改进的禁忌算法。该算法基于自然数编码，并且采用多初始解和全局禁忌表等技术，把不同的车型指标、路况信息、时间窗、容量、发车时间等约束通过控制车场插入和惩罚项加入到优化解中。本文介绍了此算法的原理，给出了具有代表性的算例试验结果和结果分析。实验表明，此方法对求解复杂情况下的车辆调度问题是有效的。

Vehicle Scheduling Problem with Single Depot in Complex Conditions

In the study, an improved tabu search algorithm (TS) is introduced to the vehicle scheduling problem(VSP) with single depot in complex conditions . The algorithm is based on nature number coding and uses technique such as many primary solutions and global tabu list, and adds different constraints to optimize solution by controlling the insertion of depots and penalty term. These constraints include vehicle type, road condition information, time windows, weight limit and vehicle departure time. This paper presents the principium of the TS .The typical result and the analysis of experiment indicate the validity of the improved TS to the VSP with single depot in complex conditions.