Aiming at solving multi-window VRP, this paper proposed a method based on collaborative tabu optimization algorithm. Firstly,it defined the mathematical model for multi-window VRP. Then it used the C-W algorithm to get the initial solution, and used four operators to search neighbor and defined the goal function to evaluate the quality of the solution. Then designed a tabu length modifying method and collaborative sub tabu algorithm adaptively. Used the best solution of collaborative sub tabu algorithm as the initial solution of the main tabu search algorithm. The simulation experiment shows the method can solve the multi-window VRP effectively. Compared with the other methods, the method reduces the iteration numbers and gets the best solution 386. 38 with the big superiority.%针对多时窗VRP,提出了一种对其进行求解的协同禁忌优化算法.首先定义了多时窗VRP的数学模型,通过C-W算法求初始解,采用四种算子进行邻域搜索,定义目标函数衡量候选解好坏;设计了自适应地修改禁忌长度的方法和多个子禁忌算法进行协同寻优的算法;将协同寻优获得的最好最优解作为主禁忌算法初始解进行全局寻优.仿真实验证明,该方法能有效地解决多时间窗的VRP,且与其他方法相比,以较少的迭代次数获得了全局最优解为386.38,具有较大的优越性.
展开▼
