Title
Probabilistic Harmony Search
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.
Year
DOI
Venue
2012
10.4018/jamc.2012010101
Int. J. of Applied Metaheuristic Computing
Keywords
Field
DocType
musicians search,benchmark function,music improvisation process,proposed scheme,benchmark problem,new improvisation scheme,probabilistic harmony search,new meta-heuristic algorithm,harmony memory,probability distribution,harmony search
Mathematical optimization,Improvisation,Probabilistic analysis of algorithms,Probability distribution,Harmony search,Sampling (statistics),Artificial intelligence,Statistical model,Probabilistic logic,Mathematics,Harmony (color),Machine learning
Journal
Volume
Issue
ISSN
3
1
1947-8283
Citations 
PageRank 
References 
1
0.36
11
Authors
4
Name
Order
Citations
PageRank
Mahamed G. H. Omran164835.28
Ayed Salman21247.33
Salah al-Sharhan310613.21
Fadi Deeb410.36