Abstract
In order to improve the efficiency of vehicle objective, the paper addresses the problem of multi-depot vehicle routing with time window. An adaptive genetic algorithm based on the artificial bee colony algorithm is developed for the solution process of the multi-depot vehicle routing problem. The new algorithm provides not only with the strong global search capability, but also the strong local search capability. Give the multiple depots vehicle scheduling model and the coding method of the vehicle route. On the one hand, in order to increase the accuracy of optimization and reduce the probability of trapping in local optimum, adjust adaptively the ratio of the crossover and mutation. On the other hand, the acceptance operators are treated by the simulated annealing. The fitness function with the adaptive penalty coefficient is designed. The simulation results demonstrate that the solving result of the fusion algorithm is more excellent than the other algorithms, and it improves the performance in searching speed and increases the global astringency compared with simple genetic algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
