Solving the shortest-path problem in logistics distribution for vehicle-routing optimization

The classical harmony search (HS) algorithm has been improved. The algorithm effectively prevents it from becoming trapped by a local optimal solution. It allows to be used to deale the shortest-path issue. To solve the shortest route problem, we improved the classical harmony algorithm and seek the optimal solution in the global scope. Second, by the application of the dynamic priority value encoding scheme, we constructed the path based on the priority value of correspondent nodes of variables in the harmonic vector. Through the iterative update of the harmony memory banks, we finally obtained the shortest route. Finally the simulation experiments show us that the proposed algorithm is better than PSO algorithm and HS algorithm on the performance.