Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Improvement of harmony search algorithm by using statistical analysis
Sarvari H., Zamanifar K. Artificial Intelligence Review37 (3):181-215,2012.Type:Article
Date Reviewed: Jul 13 2012

Classical jazz performers and marching bands play different musical instruments that require harmonization to produce pleasant melodies. The synchronization of symphony orchestras has been attracting the attention of optimization research scientists since 2001. Approaches to this problem search for a perfect state of harmony of the pitches of instruments played concurrently by musicians. Solving alternative mathematical and engineering optimization problems requires setting the appropriate initial parameters of the design variables [1]. The harmony search algorithm has been used to solve specific optimization problems, such as the scheduling of electric power generation systems [2]. However, the reliable design of a variety of engineering projects, such as complex bridges, gas turbines, gas and liquid pressure vessels, and welded beams, requires solving difficult mathematical optimization problems. How should the objective function of a reliable engineering design be minimized or maximized, subject to the constraints on the probable values of an independent variable?

Sarvari and Zamanifar perceptively present a harmony search algorithm with embedded statistical techniques for generating the optimal solutions to various mathematical and engineering optimization problems without imposing many constraints on their initial parameters. This algorithm cleverly initializes the harmony memory and algorithmic parameters for each optimization problem. Then, it locally searches the harmony memory to diminish the effect of the initial parameters of diverse optimization problems, and to boost the convergence rate and precision of the harmony search algorithm. The authors’ algorithm creates similar harmonies by selecting the appropriate harmony memory, considering rate, pitch adjusting rate, harmony memory size, and bandwidth vector parameters for the algorithm. The bandwidth is automatically established with an oscillating function, which eventually turns out to be preset, to speed up the convergence pace and to enhance the accuracy of the algorithm.

The authors utilized this novel approach to solve a variety of well-known benchmark functional minimization and engineering optimization problems, exhibiting the effectiveness and strength of the meta-heuristic harmony search algorithm. Their algorithm reliably generated solutions to: unconstrained functional minimization problems, such as the concave banana function, the gear train inertia function, and the 2D six-hump camel back function; constrained functional minimization problems, such as the design of a welded beam at a minimal fabrication cost to grasp a definite load; and reliability problems, such as the design of a complex bridge system or an over-speed gas turbine safety system with many reliability requirements on the components in the subsystems. The authors’ approach consistently generated results for functional minimization problems and reliability optimization problems that are comparable to the solutions available in the literature. Consequently, the algorithm is a generic pliable harmony search algorithm for solving a variety of emerging functional minimization problems and engineering optimization problems.

Reviewer:  Amos Olagunju Review #: CR140370 (1212-1265)
1) Alia, O. M.; Mandava, R. The variants of the harmony search algorithm: an overview. Artificial Intelligence Review 36, 1(2011), 49–68.
2) Afkousi-Paqaleh, M.; Rashidinejad, M.; Pourakbari-Kasmaei, M. An implementation of harmony search algorithm to unit commitment problem. Electrical Engineering (Archiv Fur Elektrotechnik) 92, 6(2010), 215–225.
Bookmark and Share
  Featured Reviewer  
Graph And Tree Search Strategies (I.2.8 ... )
Heuristic Methods (I.2.8 ... )
Statistical Computing (G.3 ... )
Would you recommend this review?
Other reviews under "Graph And Tree Search Strategies": Date
How evenly should one divide to conquer quickly?
Walsh T. Information Processing Letters 19(4): 203-208, 1984. Type: Article
Oct 1 1985
Three approaches to heuristic search in networks
Bagchi A., Mahanti A. Journal of the ACM 32(1): 1-27, 1985. Type: Article
Sep 1 1986
AND/OR graph heuristic search methods
Mahanti A., Bagchi A. Journal of the ACM 32(1): 28-51, 1985. Type: Article
Feb 1 1986

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy