Harmony Search Algorithm originally came from the analogy between the music improvisation and optimization process. The harmony search algorithm is searching the optimal solution using the novel stochastic derivative equation. The equation is based on density information of multiple solution vectors, instead of calculus based gradient information of single solution vector. In other words, if a ...

This paper presents a new optimization algorithm called GHS+LEM, which is based on the Global-best Harmony Search algorithm (GHS) and techniques from the Learnable Evolution Models (LEM) to improve convergence and accuracy of the algorithm. The performance of the algorithm is evaluated with fifteen optimization functions commonly used by the optimization community. In addition, the results obta...

This paper presents a social harmony search algorithm to solve optimization problems with continuous design variables. Although the Harmony Search (HS) algorithm (HSA) has proven its ability in finding near global regions within a reasonable time, it is rather inefficient in performing local search. The proposed method applies the harmony search optimizer for global optimization and normal dist...

This study first reviews fuzzy random Portfolio selection theory and describes the concept of portfolio optimization model as a useful instrument for helping finance practitioners and researchers. Second, this paper specifically aims at applying possibility-based models for transforming the fuzzy random variables to the linear programming. The harmony search algorithm approaches to resolve the ...

Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by harmo...

This article presents a novel modification of the Harmony Search (HS) algorithm that is able to self-tune as the search progress. This adaptive behavior is independent of total iterations. Moreover, it requires less iterations and provides more precision than other variants of HS. Its effectiveness and performance was assessed, comparing our data against four well known and recent modifications...

In recent years a lot of novel (mostly naturally inspired) search heuristics have been proposed. Among those approaches is Harmony Search. After its introduction in 2000, positive results and improvements over existing approaches have been reported. In this paper, the authors give a review of the developments of Harmony Search during the past decade and perform a rigorous analysis of this appro...

Regression test is an effective means to ensure the quality of software. But the test efficiency will become lower and lower as the test case library becomes increasingly large in the test. Therefore, in order to improve the efficiency and quality of regression test, it is necessary to implement the test case safety reduction. The optimization selection of the test case is an effective means of...

One of the main challenges for any university administrations is building a timetable for course sessions. Such a challenge not only relates to how to build a usable timetable but also how to build an optimal timetable at the same time. The university course timetable is classified as an NP-Complete problem. In general, it means assigning predefined courses to certain rooms and timeslots under ...