A NEW METHOD FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
According to a problem in the real world, a mathematical model is established for the multi-depot vehicle routing problem with time windows (MDVRPTW). In order to improve the computational efficiency, first, based on decomposition and coordination technology (DCT), the problem is decomposed into several sub-problems and the customers are decomposed into coupling and non-coupling customers by a heuristic method. Second, due to the bad convergence when traditional DCT is used to solve the problem, the coordination values are designed elaborately by means of an adaptive genetic algorithm. Moreover, a tabu search method is developed to solve VRPTW for each sub-system. Finally, the validity of the proposed method is proved by the practical instance.
Multi-depot vehicle routing problem Genetic algorithm Tabu search Decomposition and coordination
SHAN-ZUO LOU ZHONG-KE SHI
College of Automation, Northwestern Polytechnical University, Xian, 710072, China
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
2503-2509
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）