Abstract
The vehicle routing problem with time windows (VRPTW) is a well-known combinatorial optimization problem often met in many fields of industrial applications. However a logistics company has more than one depot, the VRPTW is not suitable. To overcome this limitation, this paper built the mathematics model of multi-depot vehicle routing problem with time windows (MDVRPTW). The MDVRPTW is a NP-hard problem. To deal with the problem efficiently, an improved Ant Colony Optimization (ACO) is developed in this paper. To improve the performance of ACO, the paper improves the basic ant colony algorithm which can avoids being into local optimal solution and combines the nearest neighbour search method.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
