A new improved harmony search algorithm for continuous optimization problems

Author

Lin, Yang ; Xing Chang-ming

Author_Institution

Int. Sch. of SICT, Shandong Inst. of Commerce & Technol., Jinan, China

Volume

2

fYear

2011

Firstpage

686

Lastpage

689

Abstract

Harmony Search (HS) is a new meta-heuristic algorithm, which can be used to solve lots of NP-hard problems. A new improved harmony search algorithm based on the current global information (IGHS) is presented for solving continuous optimization problems. IGHS employs a novel method for generating new solution vectors, which using the current global optimum in the harmony memory. In order to avoid premature and enhance global search ability, IGHS disturbs the current global optimum at a certain probability. The computational simulations and comparisons are carried out by employing 6 benchmark problems from literature. The results show that the proposed IGHS algorithm is more effective in finding better solutions when compared to HS and other related algorithms.

Keywords

computational complexity; optimisation; probability; search problems; vectors; IGHS; NP-hard problems; continuous optimization problems; global information; global optimum; harmony memory; improved harmony search algorithm; meta-heuristic algorithm; probability; solution vectors; Algorithm design and analysis; Convergence; Educational institutions; Heuristic algorithms; Optimization; Search problems; Vectors; Continuous optimization; Evolutionary algorithms; Global optimization; harmony search;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Network Technology (ICCSNT), 2011 International Conference on

Conference_Location

Harbin

Print_ISBN

978-1-4577-1586-0

Type

conf

DOI

10.1109/ICCSNT.2011.6182059

Filename

6182059