The Application Research Of Improved Harmony Search Algorithm In Vehicle Routing Problem

This paper analyzed the characteristics of the open-pit mine's vehicle routing problem, established the mathematical model based on the shortest total path as optimal objective, and introduced the latest proposed harmony search algorithm for solving the open-pit mine's vehicle routing problem, through a case analyze, it is concluded that the basic harmony search algorithm was able to find the open-pit mine vehicle routing problem problem's solution, but the basic harmony also display that the basic harmony search algorithm have a great dependence on the initial harmony memory. After analyzed the features of the genetic algorithm and the harmony search algorithm this paper proposed an improved harmony search algorithm by combining the genetic algorithm and the basic harmony search algorithm together. By using the genetic algorithm to produce the initial harmony memory for the harmony algorithm to overcome the basic harmony search algorithm's shortcoming of has great dependence on the initial harmony memory. Finally, a practical example analysis shows that, compared with basic harmony search algorithm ,the improved harmony search algorithm can well solve the vehicle routing problem of open-pit mine, and the algorithm of solution is more accurate and stability.