Abstract:

The Vehicle Routing Problem(VRP)is a worth researching NP-Hard problem in logistic and supply chain.The Bat Algorithm (BA)is a new intelligent optimization algorithm having broad application prospect. But it can’t use to solve discrete problem directly,and just like most intelligent optimization algorithms, it may easily fall into local optimum and its convergence rate is very slow in the late stage of the algorithm.In this paper,in view of the specific characteristics of the VRP,we redefine the coding mode and use GRASP to generate the initial population of BA to improve the algorithm,and then apply it to solve the VRP.

Key words: Bat algorithm, GRASP algorithm, Vehicle routing problem, Coding mode