ACM Home Page
Please provide us with feedback. Feedback
Hybrid algorithms based on harmony search and differential evolution for global optimization
Full text PdfPdf (711 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
SESSION: Full papers table of contents
Pages 271-278  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Ling-po Li  Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, Beijing, China
Ling Wang  Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, Beijing, China
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 68,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1543834.1543871
What is a DOI?

ABSTRACT

In this paper, two hybrid algorithms are proposed for global optimization by merging the mechanisms of Harmony Search (HS) and Differential Evolution (DE). First, the learning mechanism of a variant of HS named Global-best Harmony Search (GHS) is embedded into the framework of DE to develop an algorithm called Global Harmony Differential Evolution (GHDE). Besides, the differential operator of DE is introduced into the framework of GHS to develop another new algorithm called Differential Harmony Search (DHS). Numerical simulations are carried out based a set of benchmarks. And simulation results and comparisons show that the hybrid algorithms are superior to the GHS and DE in terms of searching efficiency and searching quality. Meanwhile, the effect of some key parameters on the performances of DHS is investigated.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Eberhart R.C., Kennedy J., 1995. A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 39--43.
 
2
Geem, Z. W., Kim, J. H. and Loganathan, G. V. 2001. A new heuristic optimization algorithm: harmony search. Simulation, 71(2), 60--68.
 
3
Geem, Z. W. 2007. Harmony search algorithm for solving sudoku. Knowledge-Based Intelligent Information and Engineering Systems, 4692, 371--378.
 
4
Lee, K. S. and Geem, Z. W. 2005. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Method Appl M, 194(36--38), 3902--3933.
 
5
Lee, K. S., Geem, Z. W., Lee, S. H. and Bae, K. W. 2005. The harmony search heuristic algorithm for discrete structural optimization. Eng Optimiz, 37(7), 663--684.
 
6
Li, B. B. and Wang, L. 2007. A hybrid quantum-inspired genetic algorithm for multi-objective flow shop scheduling. Ieee T Syst Man Cy B, 37(3), 576--591.
 
7
Liu, B., Wang, L., Jin, Y. H., Tang, F. and Huang, D.X. 2005. Improved particle swarm optimization combined with chaos. Chaos, Solitons & Fractals, 25(5), 1261--1271.
 
8
Mahdavi M., Fesanghary M., and Damangir E., 2007. An improved harmony search algorithm for solving optimization problems. Appl Math Comput, 188, 1567--1579.
 
9
Noman, N. and Iba, H. 2008. Accelerating differential evolution using an adaptive local search. Ieee T Evolut Comput, 12(1), 107--125.
 
10
Omran, M. and Mahdavi, M. 2008. Global-best harmony search. Appl Math Comput, 198(2), 643--656.
 
11
 
12
 
13
Wang, L. Intelligent Optimization Algorithms with Applications. Tsinghua University & Springer Press, Beijing, 2001.
 
14
Wang, L. and Zheng, D. Z. 2003. An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Tech, 21, 1 (2003), 38--44.