Hybrid Genetic Simulated Annealing Algorithm with its Application in Vehicle Routing Problem with Time Windows
2010 ◽
Vol 148-149
◽
pp. 395-398
Keyword(s):
Set Up
◽
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).
2009 ◽
Vol 3
(2)
◽
pp. 87-100
◽
2016 ◽
Vol 9
(12)
◽
pp. 187-198
2009 ◽
Vol 29
(5)
◽
pp. 186-192
◽