This paper thoroughly reviews and analyzes the main characteristics and application portfolio of the so-called Harmony Search algorithm, a meta-heuristic approach that has been shown to achieve excellent results in a wide range of optimization problems. As evidenced by a number of studies, this algorithm features several innovative aspects in its operational procedure that foster its utilizatio...

Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

This paper presents a novel hybrid data clustering algorithm based on parameter adaptive harmony search algorithm. The recently developed parameter adaptive harmony search algorithm (PAHS) is used to refine the cluster centers, which are further used in initializing Expectation-Maximization clustering algorithm. The optimal number of clusters are determined through four well-known cluster valid...

This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstly, two novel heuristics and several existing heuristics are employed to initialize the harmony me...

Being one of the main challenges to clustering algorithms, the sensitivity of fuzzy c-means (FCM) and hard c-means (HCM) to tune the initial clusters centers has captured the attention of the clustering communities for quite a long time. In this study, the new evolutionary algorithm, Harmony Search (HS), is proposed as a new method aimed at addressing this problem. The proposed approach consist...

Harmony Search (HS) is a meta-heuristic algorithm which bases its operation on the musical improvisation process. Recently, HS has become a popular algorithm in the evolutionary computation fielddue to its superiority to many other algorithms. As a consequence, in this paper, HS algorithm, its improvements and applications in many fields, such as operations research and computer science, are di...

Harmony search (HS) is a meta-heuristic algorithm mimicking the improvisation process of musicians. This paper arranges the basic structure of the HS algorithm and customizes the algorithm for clustering optimization problems. We propose novel clustering algorithm based on Harmony Search (HS) optimization method that deals with document clustering. By modeling Retrieval as an optimization probl...