The hybrid genetic algorithm for vehicle routing problem with time windows
Tai Lei-lei · Journal of Anhui University · 2007
The vehicle routing problem with time window is a kind of NP-Hard problem.We often use the genetic algorithm to solve such problem.But the traditional genetic algorithm have some weaknesses,which will affect the performance of the algorithm.This paper brings forward a kind of hybrid genetic algorithm called remembered genetic simulated annealing algorithm.We make some experimental computation,the result demonstrates this algorithm can overcome the weakness above,and the high quality solutions obtained.