The Application of Improved Harmony Search Algorithm for Solving Shortest Path Problems
Zhi-wang Jiang, Hongxia Zhang · Advances in computer science research · 2015
The shortest path problem is a classical problem in graph theory, it is also one of the classical problems in the field of combinatorial optimization.This paper analyzes the basic harmony search algorithm model, and points out its insufficiency in solving the shortest path problem, then modifies the harmony memory and perturbation method.The simulation experiment shows that the improved harmony search algorithm (IHSA) has faster global convergence speed, and can obtain more accurate optimal path.IHSA is an effective solution to solve the shortest path problem.