计算机应用研究2012，Vol.29Issue(12)：4542-4545,4.DOI:10.3969/j.issn.1001-3695.2012.12.036
基于协同自适应禁忌的多时窗VRP算法实现
Implementation for VRP with multi-window based on collaborative adaptive tabu algorithm
摘要
Abstract
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.关键词
车辆路径/禁忌算法/多时间窗/协同Key words
vehicle routing/ tabu search/ multi-time window/ collaborate分类
信息技术与安全科学引用本文复制引用
朱玲玲,杨爱琴,吴宽仁..基于协同自适应禁忌的多时窗VRP算法实现[J].计算机应用研究,2012,29(12):4542-4545,4.基金项目
国家自然科学基金资助项目(60211227) （60211227）
南通大学自然科学基金资助项目(03040850,03040846) （03040850,03040846）
