An effective global harmony search algorithm for integer programming problems

Author

Wu, Peifeng ; Gao, Liqun ; Ge, Yanfeng ; Zou, Dexuan

Author_Institution

Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China

Volume

1

fYear

2010

fDate

25-27 June 2010

Abstract

An effective global harmony search algorithm (EGHS) is proposed to solve integer programming problems. The EGHS designs a novel location updating equation, which enables the improvised solution to move to the global best solution rapidly in each iteration. Random selection with a low probability is carried out for the improvised solution after updating location, for it can prevent the EGHS from being trapped into the local optimum. The results show that the EGHS can be an efficient alternative for solving integer programming problems.

Keywords

integer programming; probability; search problems; EGHS algorithm; global harmony search algorithm; integer programming problems; random selection; Algorithm design and analysis; Constraint optimization; Design engineering; Design optimization; Educational institutions; Electronic mail; Equations; Information science; Linear programming; Particle swarm optimization; effective global harmony search algorithm; integer programming problems; location updating; random selection;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Design and Applications (ICCDA), 2010 International Conference on

Conference_Location

Qinhuangdao

Print_ISBN

978-1-4244-7164-5

Electronic_ISBN

978-1-4244-7164-5

Type

conf

DOI

10.1109/ICCDA.2010.5541040

Filename

5541040