Study on Optimization of Logistics Distribution Route Based on Improved Adaptive Genetic Algorithm
A new improved adaptive genetic algorithm is proposed for solving vehicle routing problem with soft time windows (VRPSTW).The initial population of genetic algorithm (GA) is highly stochastic and individual distribution is dispersed,so elitism strategy is adopted to improve operation speed.GA is prone to "premature" and in local optima trap when searching to near the local optima solution.To avoid algorithm immature convergence the paper proposes an adaptive adjustment method of crossover probability and mutation probabili ty.The new improved adaptive genetic algorithm is applied to vehicle routing problem.The results clearly demonstrate that the proposed method has better solution.
NETL
NSTL
万方数据
维普
