有时间窗约束车辆调度优化的一种禁忌算法  

A Tabu Search Algorithm for Vehicle Scheduling Problem with Time Windows

作　　者：钟石泉[1] 贺国光[1] 

机构地区：[1]天津大学管理学院,天津300072

出　　处：《系统工程理论方法应用》2005年第6期522-526,共5页Systems Engineering Theory·Methodology·Applications

摘　　要：针对有时间窗的V SP问题提出了一种禁忌算法,本算法运用了多初始解和全局禁忌表等各种措施来减小解的不稳定性和扩大搜索范围,并根据容量约束和时间窗约束性质的不同,结合惩罚函数和各约束的性质来联合控制车场的分配。给出了两组具有代表性的试验数据,并与其他算法优化时间窗V SP的实验结果作了比较。结果表明,此禁忌算法是解决有时间窗约束的一条有效途径。In this paper, a Tabu search（TS） algorithm for vehicle scheduling problem（VSP） with time windows is presented. This algorithm uses many primitive solutions and full-scale tabu table to decrease the solution instability and expand searching area. Based on the difference between weight limit and time windows limit, this paper combines penalty function and the properties of the limits to control the distribution of depot. In the study, two groups of representational examination data are proposed.Compared with the results attained by some other algorithms, this TS algorithm is a better way to solve Vehicle Scheduling Problem with time windows.

关 键 词：车辆调度问题 禁忌搜索 时间窗 

分 类 号：O221[理学—运筹学与控制论]