基于改进的禁忌搜索算法求解有时间窗的车辆路径问题,建立了该问题的通用数学模型.改进算法中,在随机构造的多个可行解中挑选较好的解作为初始解,采用2-opt方法生成邻域,并构造了动态禁忌表,使禁忌表的大小和结构随搜索过程发生改变,提高了整体寻优能力.仿真实验证明了算法的可行性、有效性和优越性.
An improved tabu search algorithm was utilized to solve vehicle routing problem with time windows and built a general mathematical model corresponding to this problem.In the process of solving,initial solutions were selected from many random structured practical solutions,and 2-opt method was adopted to produce neighborhood and structured dynamic structure tabu list so that the size and structure of tabu list could be changed in the searching process,the overall ability in search excellence was improved.Simulation experiments indicate the feasibility,validity and superiority of the algorithm.