Abstract
Under the situations of distribution center and customer demand, a mathematical model of Vehicle Routing Problem with Time Windows(VRPTW) is set up, where the main factors of less total distance of vehicles driving and less delayed time of vehicles are considered. For the "premature" convergence in Genetic Algorithms, Simulated Annealing Algorithm is introduced, and GSA is designed to optimize and analyse the VRPTW examples. It is shown that the performance of GSA is better than Genetic Annealing(GA).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
