Skip to main content

2009 | Buch

Music-Inspired Harmony Search Algorithm

Theory and Applications

insite
SUCHEN

Über dieses Buch

Calculus has been used in solving many scientific and engineering problems. For optimization problems, however, the differential calculus technique sometimes has a drawback when the objective function is step-wise, discontinuous, or multi-modal, or when decision variables are discrete rather than continuous. Thus, researchers have recently turned their interests into metaheuristic algorithms that have been inspired by natural phenomena such as evolution, animal behavior, or metallic annealing.

This book especially focuses on a music-inspired metaheuristic algorithm, harmony search. Interestingly, there exists an analogy between music and optimization: each musical instrument corresponds to each decision variable; musical note corresponds to variable value; and harmony corresponds to solution vector. Just like musicians in Jazz improvisation play notes randomly or based on experiences in order to find fantastic harmony, variables in the harmony search algorithm have random values or previously-memorized good values in order to find optimal solution.

Inhaltsverzeichnis

Frontmatter
Harmony Search as a Metaheuristic Algorithm
Abstract
This first chapter intends to review and analyze the powerful new Harmony Search (HS) algorithm in the context of metaheuristic algorithms. We will first outline the fundamental steps of HS, and show how it works. We then try to identify the characteristics of metaheuristics and analyze why HS is a good metaheuristic algorithm. We then review briefly other popular metaheuristics such as particle swarm optimization so as to find their similarities and differences with HS. Finally, we will discuss the ways to improve and develop new variants of HS, and make suggestions for further research including open questions.
Xin-She Yang
Overview of Applications and Developments in the Harmony Search Algorithm
Abstract
The Harmony Search (HS) algorithm appeared around the year 2000 and it now has a substantial literature. The aim of this chapter is to inform the reader of the diversity of HS applications and the range of modified and hybrid HS methods that have been developed. The chapter contains five sections. In the first, the different types of optimisation problem are described. Section two provides an overview of the growth in the literature, a chronology of some HS highlights and a breakdown of HS work by discipline. In the third section, HS applications in nine discipline areas are reported. The fourth section classifies the types of modifications that have been made to the original HS method and summarises the innovations in many of the modified algorithms. Lastly, we take a step back and reflect on the current state of the HS literature.
Gordon Ingram, Tonghua Zhang
Harmony Search Methods for Multi-modal and Constrained Optimization
Abstract
The Harmony Search (HS) method is an emerging meta-heuristic optimization algorithm. In this chapter, we propose two modified HS methods to handle the multi-modal and constrained optimization problems. The first modified HS method employs a novel HS memory management approach to handle the multi-modal problems. The second modified HS method utilizes the Pareto-dominance technique, and it targets at the constrained problems. Several simulation examples are used to demonstrate and verify the effectiveness of our new HS methods.
X. Z. Gao, X. Wang, S. J. Ovaska
Solving NP-Complete Problems by Harmony Search
Abstract
In the last few years, there has been explosive growth in the application of Harmony Search (HS) in solving NP-complete problems in computer science. The success of the HS algorithm in finding relatively good solutions to these problems discriminates it as an affirmative alternative to other conventional optimization techniques. This chapter surveys the existing literature on the application of HS in combinatorial optimization problems. We begin by presenting HS based algorithms for solving problems such as Sudoku puzzle, music composition, orienteering problem, and vehicle routing. We then turn to solve a multicast routing problem with two constraints (i.e. bandwidth and delay constraints). Finally, we show how to apply HS to a clustering problem.
Mehrdad Mahdavi
Harmony Search Applications in Mechanical, Chemical and Electrical Engineering
Abstract
The primary aim of this chapter is to introduce the state of the art applications of the harmony search (HS) algorithm in mechanical, chemical and electrical engineering fields. The HS algorithm has been broadly utilized in complex optimization problems arising in most engineering applications. It has been reported to be a viable alternative to other conventional optimization techniques in these engineering disciplines. This chapter is intended to discuss the available literature in the field and to provide general information for those who are interested in optimized-design of thermal systems, economic utilization of electric power-systems and optimization of machining processes.
Mohammad Fesanghary
Optimum Design of Steel Skeleton Structures
Abstract
Designing steel skeleton structures optimally is a tedious task for designers. They need to select the appropriate steel sections for the members of a steel frame from a discrete list that is available in the practice. Assigning arbitrarily any one of these sections to any member of the steel frame generates one possible design combination. The total number of such combinations is quite large and finding out which one these combinations produces the optimum design by trial is almost practically impossible. The harmony search algorithm is a recently developed technique for determining the solution of such combinatorial optimization problems. In this chapter, harmony search algorithm based optimum design methods are introduced for moment resisting steel frames, grillage systems, geodesic domes and cellular beams. The design problems of these steel structures are carried out according to British and American Design Codes respectively. The design examples considered in both structural systems have shown that harmony search algorithm is an effective and robust technique to find the optimum solutions of combinatorial structural optimization problems.
Mehmet Polat Saka
Harmony Search Algorithms for Water and Environmental Systems
Abstract
Recently, the harmony search (HS) algorithm and other phenomenon-inspired algorithms have gained attention for their abilities to solve large-scale, difficult combinatorial optimization problems. This chapter reviews the applications of the HS method in the areas of water resources and environmental system optimization. Four specific optimization problems are considered: design of water distribution networks, scheduling of multi-location dams, parameter calibration of environmental models, and determination of ecological reserve location. The computational performance of the HS method on solving these four optimization problems will be compared against other optimization methods. It will be shown in this chapter that the HS method can outperform other methods in terms of solution quality and computational time.
Zong Woo Geem, Chung-Li Tseng, Justin C. Williams
Identification of Groundwater Parameter Structure Using Harmony Search Algorithm
Abstract
Mathematical simulation models are widely used to predict the future response of groundwater systems for different flow and mass transport conditions. These models are based on the solution of governing partial differential equations which require some spatially distributed hydro-geological model parameters. However, these parameters are usually unknown due to the complexity of groundwater systems. Therefore, identification of them is an important task since they are the primary input of management models used in groundwater modeling. This chapter provides a brief review dealing with the solution of parameter structure identification problems based on the harmony search optimization algorithm. The results of this review indicate that the harmony search algorithm yields nearly same or better solutions than those of a genetic algorithm, which is another popular meta-heuristic optimization algorithm.
M. Tamer Ayvaz
Modified Harmony Methods for Slope Stability Problems
Abstract
In many practical slope stability problems, a thin layer of soft material with very low shear strength parameters may exist. Such soft and thin soil layer has caused many large scale slope failures in Hong Kong and many other places. Determining the critical failure surface with the smallest factor of safety for such a problem is extremely difficult. This chapter proposes a domain transformation technique, which is coupled with two new versions of improved harmony search algorithms to ensure both the efficiency and effectiveness of optimization analysis for large scale difficulty problems. The improved harmony search algorithms differ from the original harmony search algorithm in that: (1) the harmonies are rearranged into several pairs and the better pairs are used to develop several new harmonies; (2) different probabilities are assigned to different harmonies. The robustness of the newly proposed methods is demonstrated by using some difficult slope stability problems, and the improvement in the efficiency of the new algorithms is examined with respect to some large scale slope stability problems in China.
Yung-Ming Cheng
Harmony Search Algorithm for Transport Energy Demand Modeling
Abstract
The transport sector is one of the major consumers of energy production throughout the world. Thus, the estimation of medium and long-term energy consumption based on socio-economic and transport related indicators is a critical issue on a global scale. This chapter reviews the harmony search (HS) applications to transport energy modeling problems. The models reviewed in this chapter are in the form of linear, exponential and quadratic mathematical expressions, and they are applied to transportation sector energy consumption. Convergence behavior of the HS during the modeling is tested. Performance of each HS model is compared according to an absolute error between observed data and predicted data. Results showed the HS method can be applied to the transport energy modeling issues.
Halim Ceylan, Huseyin Ceylan
Sound Classification in Hearing Aids by the Harmony Search Algorithm
Abstract
This chapter focuses on the application of the harmony search algorithms to the problem of selecting more appropriate features for sound classification in digital hearing aids. Implementing sound classification algorithms embedded in hearing aids is a very challenging task. Hearing aids have to work at very low clock frequency in order to minimize power consumption, and thus maximize battery life. This necessitates the reduction of computational load while maintaining a low error probability. Since the feature extraction process is one of the most time-consuming tasks, selecting a reduced number of appropriate features is essential, thus requiring low computational cost without degrading the operation. The music-inspired harmony-search (HS) algorithm allows for effectively searching adequate solutions to this strongly constrained problem. By starting with an initial set of 74 different sound-describing features, a number of experiments were carried out to test the performance of the proposed method. Results of the harmony search algorithm are compared to those reached by other widely used methods.
Enrique Alexandre, Lucas Cuadra, Roberto Gil-Pita
Harmony Search in Therapeutic Medical Physics
Abstract
Medical physics is a branch of physics that concerns the application of radiation for therapeutic and diagnostic use in medicine. In therapeutic medical physics, ionizing radiation is used to treat patients afflicted with cancer. The main goal in radiotherapy is to deliver a high amount of radiation dose to cancer cells while sparing surrounding organs. The process begins with radiation treatment planning that requires optimization of radioisotope placement or radiation beam intensities. Prior optimization algorithms, such as genetic algorithm and simulated annealing, have been widely discussed in medical physics literature. However, Harmony Search has shown to be a superior optimization algorithm based on the results in other scientific fields. Thus, this study investigated high dose-rate prostate brachytherapy optimization using Harmony Search. Results showed that the algorithm is significantly faster than genetic algorithm and that rapid planning allows improved patient care in medical physics.
Aditya Panchal
Backmatter
Metadaten
Titel
Music-Inspired Harmony Search Algorithm
herausgegeben von
Zong Woo Geem
Copyright-Jahr
2009
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-00185-7
Print ISBN
978-3-642-00184-0
DOI
https://doi.org/10.1007/978-3-642-00185-7