Welcome to the InfoSci Platform
Reference Hub1
Probabilistic Harmony Search

Probabilistic Harmony Search

Mahamed G. H. Omran, Ayed Salman, Salah al-Sharhan, Fadi Deeb
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 14
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466610835|DOI: 10.4018/jamc.2012010101
Cite Article Cite Article

MLA

Omran, Mahamed G. H., et al. "Probabilistic Harmony Search." IJAMC vol.3, no.1 2012: pp.1-14. http://doi.org/10.4018/jamc.2012010101

APA

Omran, M. G., Salman, A., al-Sharhan, S., & Deeb, F. (2012). Probabilistic Harmony Search. International Journal of Applied Metaheuristic Computing (IJAMC), 3(1), 1-14. http://doi.org/10.4018/jamc.2012010101

Chicago

Omran, Mahamed G. H., et al. "Probabilistic Harmony Search," International Journal of Applied Metaheuristic Computing (IJAMC) 3, no.1: 1-14. http://doi.org/10.4018/jamc.2012010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Harmony Search (HS) is a new meta-heuristic algorithm imitating the music improvisation process where musicians search for a better state of harmony. In this paper, a new improvisation scheme is proposed that explicitly uses a probabilistic model of candidate solutions stored in the harmony memory. Pitch adjustment uses a probability distribution to mutate a decision variable while random selection has been replaced by generating samples from the probability distribution. The proposed scheme favors diversification in the early stages and intensification during the final stages of the search process. The performance of the proposed method is investigated and compared with a state-of-the-art HS variant and other recent methods when applied to 18 benchmark functions. The experiments conducted show that the proposed method generally outperforms the other methods when applied to the benchmark problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.