✦ LIBER ✦

A hybrid optimization method of harmony search and opposition-based learning

✍ Scribed by Gao, X. Z.; Wang, X.; Ovaska, S. J.; Zenger, K.

Book ID: 118130789
Publisher: Taylor and Francis Group
Year: 2012
Tongue: English
Weight: 612 KB
Volume: 44
Category: Article
ISSN: 0305-215X
DOI: 10.1080/0305215x.2011.628387

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid PBIL-based harmony search metho

A hybrid PBIL-based harmony search method

✍ X. Z. Gao, X. Wang, T. Jokinen, S. J. Ovaska, A. Arkkio, K. Zenger 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 828 KB

A hybrid method for learning Bayesian ne

A hybrid method for learning Bayesian networks based on ant colony optimization

✍ Junzhong Ji; Renbing Hu; Hongxun Zhang; Chunnian Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Solution of combined economic and emissi

Solution of combined economic and emission dispatch problems of power systems by an opposition-based harmony search algorithm

✍ A. Chatterjee; S.P. Ghoshal; V. Mukherjee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 528 KB

Evaluating the Internationalization Succ

Evaluating the Internationalization Success of Companies Through a Hybrid Grouping Harmony Search—Extreme Learning Machine Approach

✍ Landa-Torres, I.; Ortiz-Garcia, E.G.; Salcedo-Sanz, S.; Segovia-Vargas, M.J.; Gi 📂 Article 📅 2012 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 978 KB

MEMPSODE: A global optimization software

MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches

✍ C. Voglis; K.E. Parsopoulos; D.G. Papageorgiou; I.E. Lagaris; M.N. Vrahatis 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Greedy search and a hybrid local optimiz

Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering

✍ Raymond A. Wildman; Daniel S. Weile 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i