The Research Of Vehicle Routing Problem Based On Improved Harmony Search Algrithm

The Vehicle Routing Problem (VRP) is exist widely in all aspects of life. And it is a key to transportation management and supply-chain coordination.It has important significance for enterprises strengthening the logistics distribution and supply chain management, reducing logistics distribution costs and circulation fee and enhancing our country's the logistic level and change the logistics management backward situation.At the same time it has big effect to solve the troubled people's social problems like urban traffic congestion, energy shortage also air pollution etc.The Vehicle Routing Problem is typical combinatorial optimization problem, and it is a NP-hard problem. The research for Vehicle Routing Problem has been on looking for effective algorithms. Harmony search algorithm is the latest proposed heuristic global search algorithm.,and is not yet used for Vehicle Routing Problem. So this paper attempts to use harmony search algorithm to solve the Vehicle Routing Problem.Firstly reviewed the Vehicle Routing Problem's general research situation and introduced the research background knowledges, combined with Vehicle Routing Problem's mathematical model, used harmony search algorithm to solve it, discussed the algorithm's detail design and operation process. On the comparison and analysis of the harmony search algorithm and genetic algorithm in solving vehicle routing problem's advantages and disadvantages. Imitates the genetic algorithm's search features, for harmony search algorithm's shortcomings, puts forward the improving method. Finally through examples, compared the improved harmony search algorithm's compute results and performance to basic harmony algorithm harmony's, to genetic algorithm's, and to other literatures' algorithms, proved that the improved harmony search algorithm in this paper can effectively solve the Vehicle Routing Problem for optimal solution or approximate optimal solution.