The Application of Improved Harmony Search Algorithm for Solving Shortest Path Problems

DOI

10.2991/iccse-15.2015.8How to use a DOI?

Keywords

Harmony search algorithm; Shortest path problem; Combinatorial optimization

Abstract

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. Keywords: multi-objective bi-level programming, genetic algorithm, interpolation.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhi-wang Jiang
AU  - Hong-xia Zhang
PY  - 2015/07
DA  - 2015/07
TI  - The Application of Improved Harmony Search Algorithm for Solving Shortest Path Problems
BT  - Proceedings of the 2015 International Conference on Computational Science and Engineering
PB  - Atlantis Press
SP  - 38
EP  - 43
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccse-15.2015.8
DO  - 10.2991/iccse-15.2015.8
ID  - Jiang2015/07
ER  -