A New Method for Multi-Depot Vehicle Routing Problem with Time Windows

Author

Lou, Shan-Zuo ; Shi, Zhong-ke

Author_Institution

Coll. of Autom., Northwestern Polytech. Univ., Xi´´an

fYear

2006

fDate

13-16 Aug. 2006

Firstpage

2503

Lastpage

2509

Abstract

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

Keywords

genetic algorithms; search problems; transportation; DCT; MDVRPTW; genetic algorithm; heuristic method; mathematical model; multidepot vehicle routing problem; tabu search method; time window; Automation; Cities and towns; Computational efficiency; Cybernetics; Discrete cosine transforms; Educational institutions; Electronic mail; Genetic algorithms; Machine learning; Mathematical model; Routing; Vehicles; Decomposition and coordination; Genetic algorithm; Multi-depot vehicle routing problem; Tabu search;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2006 International Conference on

Conference_Location

Dalian, China

Print_ISBN

1-4244-0061-9

Type

conf

DOI

10.1109/ICMLC.2006.258787

Filename

4028485