Hybrid algorithm for variable fleet vehicle routing problem with time window
不确定车辆数的有时间窗车辆选径问题的混合算法

The standard Genetic Algorithm was applied into Vehicle Routing Problem,and it was the common defects of early convergence and easily falling into local minimization.According to it,a new stochastic approach called the genetic simulated annealing algorithm(GSAG) was proposed to solve vehicle routing problems and the solution wass then compared with that from simulated algorithm.Making full of preventing into local minimization in simulated annealing,GSAG avoided effectively the common defects of early convergence.Results from case studies show that the proposed algorithm has better convergence property and find the optimal or near-optimal solution effectively as well as time and quickly convergence property.So,it is an efficient method for vehicle routing problem.