Reach Us +1 850 754 6199

Journal of Computer Engineering & Information TechnologyISSN : 2324-9307

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

Research Article, J Comput Eng Inf Technol Vol: 2 Issue: 1

Harmony Search Algorithm: Strengths and Weaknesses

Milad Ahangaran1* and Pezhman Ramezani2
1Department of Civil Engineering, Iran University of Science and Technology, Tehran, Iran
2Department of Industrial Engineering, K N Toosi University of Technology, Tehran, Iran
Corresponding author : Milad Ahangaran
Department of Civil Engineering, Iran University of Science and Technology, Tehran, Iran
E-mail: [email protected]
Received: November 12, 2012 Accepted: February 15, 2013 Published: February 22, 2013
Citation: Ahangaran M, Ramezani P (2013) Harmony Search Algorithm: Strengths and Weaknesses. J Comput Eng Inf Technol 2:1. doi:10.4172/2324-9307.1000102

Abstract

Harmony Search Algorithm: Strengths and Weaknesses

For better understanding the metaheuristic algorithms, a detailed analysis of their search mechanism will be very important. This study concentrates on the search mechanism of a powerful metaheuristic algorithm, namely, Harmony Search (HS) algorithm. To optimize different optimization problems, the HS algorithm uses three rules, namely, Random Selecting (RS), Harmony Memory Considering (HMC), and Pitch Adjusting (PA) rules, which are inspired from the process that the musicians use to improvise a perfect state of harmony.

Keywords: Metaheuristic algorithm; Harmony search algorithm; Random selecting rule; Harmony memory considering rule; Pitch adjusting rule

Track Your Manuscript

Share This Page