Другие журналы

scientific edition of Bauman MSTU

SCIENCE & EDUCATION

Bauman Moscow State Technical University.   El № FS 77 - 48211.   ISSN 1994-0408

Global Optimization Based on the Hybridization of Harmony Search and Particle Swarm Optimization Methods

# 07, July 2014
DOI: 10.7463/0714.0717653
Article file: SE-BMSTU...o242.pdf (2516.56Kb)
authors: A.P. Karpenko, T.V. Pechenina, V.A. Bulanov

We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.
Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.
The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS) and swarm of particles (PSO), software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.
We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called HSPSO, present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.

References
  1. Wang X. Hybrid nature-inspired computation method for optimization. Doctoral Dissertation . Helsinki University of Technology, TKK Dissertations, 2009, 161 p.
  2. El-Abd, Kamel M. A taxonomy of cooperative search algorithms. In: Hybrid Metaheuristics. Proc. Second International Workshop . Springer Berlin Heidelberg, 2005, pp. 32-41. (Ser. Lecture Notes in Computer Science ; vol. 3636). DOI: 10.1007/11546245_4
  3. Raidl G.R. A Unified View on Hybrid Metaheuristics. In: Hybrid Metaheuristics. Proc. Third International Workshop . Springer Berlin Heidelberg, 2006, pp. 1-12. (Ser. Lecture Notes in Computer Science ; vol. 4030). DOI: 10.1007/11890584_1
  4. Geem Z.W., Kim J.H., Loganathan G.V. A new heuristic optimization algorithm: harmony search. Simulation , 2001, vol.76, no. 2, pp. 60-68. http://dx.doi.org/10.1177/003754970107600201
  5. Mahdavi M., Fesanghary M., Damangir E. An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation , 2007, vol. 188, iss. 2, pp. 1567-1579. DOI:10.1016/j.amc.2006.11.033
  6. Omran M.G.H., Mahdavi M. Global-best harmony search. Applied Mathematics and Computation , 2008, vol. 198, no. 2, pp. 643-656. DOI:10.1016/j.amc.2007.09.004
  7. Karpenko A.P., Seliverstov E.Yu. Review of the particle swarm optimization method (PSO) for a global optimization problem. Nauka i obrazovanie MGTU im. N.E. Baumana = Science and Education of the Bauman MSTU , 2009, no. 3. Available at:http://technomag.edu.ru/doc/116072.html, accessed 01.06.2014. (in Russian).
  8. Lin Y., Chang-Ming X. A new improved harmony search algorithm for continuous optimization problem. 2011 International Conference on Computer Science and Network Technology (ICCSNT). Vol. 2 . IEEE, 2011, pp. 686-690. DOI: 10.1109/ICCSNT.2011.6182059
  9. Wang Chia-Ming, Huang Yin-Fu. Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications , 2010, vol. 37, no. 4, pp. 2826-2837. DOI:10.1016/j.eswa.2009.09.008
  10. Chen Jing, Man Hong-Fang, Wang Ya-Min. Novel Self-adaptive Harmony Search Algorithm for continuous optimization problems. 2011 30th Chinese Control Conference (CCC) . IEEE, 2011, pp. 5452-5456.
  11. Fesanghary M., Mahdavi M., Minary-Jolandan M., Alizadeh Y. Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering , 2008, vol. 197, iss. 33-40, pp. 3080-3091. DOI:10.1016/j.cma.2008.02.006
  12. Taherinejad N. Highly reliable harmony search algorithm. ECCTD 2009. European Conference Circuit Theory and Design . IEEE, 2009, pp. 818-822. DOI:10.1109/ECCTD.2009.5275109
  13. Gao X.Z., Wang X., Ovaska S.J., He Xu. A modified harmony search method in constrained optimization. International Journal of Innovative Computing, Information and Control , 2009, vol. 6, no.9, pp. 4235-4247.
  14. Xin-She Yang. Harmony Search as a Metaheuristic Algorithm. In: Geem Z.W., ed. Music-Inspired Harmony Search Algorithm: Theory and Applications . Springer Berlin Heidelberg , 2009, pp. 1-14. (Ser. Studies in Computational Intelligence ; vol. 191). DOI:10.1007/978-3-642-00185-7_1
  15. Kennedy J., Eberhart R. Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks. Vol. 4 . IEEE, 1995, pp. 1942-1948. DOI:10.1109/ICNN.1995.488968
  16. Tang K., Yao X., Suganthan P.N., MacNish C., Chen Y.P., Chen C.M., Yang Z. Benchmark Functions for the CEC’2008 Special Session and Competition on Large Scale Global Optimization . Technical Report. Nature Inspired Computation and Applications Laboratory, USTC, China, 2007. Available at: http://nical.ustc.edu.cn/cec08ss.php, accessed 01.06.2014.
  17. Hultman M. Weight Optimization of Steel Trusses by a Genetic Algorithm–Size, Shape and Topology Optimization According to Eurocode . Report TVBK, Department of Structural Engineering Lund Institute of Technology, Lund University, 2010. 61 p.
  18. Lee K.S., Geem Z.W. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering , 2005, vol. 194, no. 36-38, pp. 3902-3933. DOI:10.1016/j.cma.2004.09.007

 

Поделиться:
 
SEARCH
 
elibrary crossref ulrichsweb neicon rusycon
Photos
 
Events
 
News



Authors
Press-releases
Library
Conferences
About Project
Rambler's Top100
Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)
  RSS
© 2003-2024 «Наука и образование»
Перепечатка материалов журнала без согласования с редакцией запрещена
 Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)