Image compression techniques are important and useful in data storage and image transmission through the Internet. These techniques eliminate redundant information in an image which minimizes the physical space requirement of the image. Numerous types of image compression algorithms have been developed but the resulting image is still less than the optimal. The Harmony search algorithm (HSA), a...

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...

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

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...