A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
محورهای موضوعی : Mathematical Optimization
Amir-Reza Abtahi
1
(Department of Information Technology Management, Kharazmi University, Tehran, 15999-64511, Iran)
Afsane Bijari
2
(Department of Information Technology Management, Kharazmi University, Tehran, 15999-64511, Iran)
کلید واژه: Meta, heuristics . Imperialistic competition algorithm . Harmony search . Simulated annealing . Optimization,
چکیده مقاله :
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition, the proposed hybrid algorithm uses SA to make a balance between exploration and exploitation phases. The proposed hybrid algorithm is compared with several meta-heuristic methods, including genetic algorithm (GA), HS, and ICA on several well-known benchmark instances. The comprehensive experiments and statistical analysis on standard benchmark functions certify the superiority of the proposed method over the other algorithms. The efficacy of the proposed hybrid algorithm is promising and can be used in several real-life engineering and management problems.
