Abstract
In this chapter, we introduce a set of music inspired algorithms, namely, harmony search (HS), melody search (MeS) algorithm, and method of musical composition (MMC) algorithm. We first describe the general knowledge of harmony in Sect. 14.1. Then, the fundamentals and performances of HS, MeS algorithm, and MMC algorithm are introduced in Sects. 14.2 and 14.3, respectively. Finally, Sect. 14.4 summarises this chapter.
Access provided by Autonomous University of Puebla. Download chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
Everyone loves music. It is the one art form that is entirely defined by time. For example, it can be broadly divided into three groups, namely, classical music, Jazz, and rock (Jarrett and Day 2008). In addition, the fantastic thing of music is that it can be improvisational played. For example, when you go to a concert, you will find that two or three guitar players can improvise freely on the guitar based on their own trained habits (French 2012). It just like act of grabbing a few seemingly random notes, however, in the end you will admire to these excellent melodic ideas. Inspired by that, several music based algorithms are proposed recently.
1.1 Harmony
Generally speaking, harmony is one of the major building blocks when you build a musical bridge between your different melodic themes, the other two are rhythm and melody, respectively. It can be defined as any combination of notes that can be simultaneously played (Jarrett and Day 2008). The elementary study of harmony is about chord progression in which a series of chord are played in order (Yi and Goldsmith 2010). One good source for harmony is the melody itself. In fact, they are interacted with each other. In addition, different harmonies can give you a totally different feeling.
2 Harmony Search Algorithm
2.1 Fundamentals of Harmony Search Algorithm
Harmony search (HS) algorithm was originally proposed by Geem et al. (2001). With the underlying fundamental of natural musical performance processes in which the musicians improvise their instruments’ pitch by searching for the pleasing harmony (a perfect state), HS find the solutions through the determination of an objective function (i.e., the audience’s aesthetics) in which a set of values (i.e., the musicians) assigned to each decision variable (i.e., the musical instrument’s pitch). In general, the HS algorithm has three main operations: harmony memory (HM) consideration, pitch adjustment, and randomization (Geem et al. 2001). The HS algorithm is performed in several steps, outlined below (Geem et al. 2001):
-
Preparation of harmony memory: The main building block of HS is the usage of HM, because multiple randomized solution vectors are stored in HM via Eq. 14.1 (Geem 2009):
$$ {\text{HM}} = \left[ {\left. {\begin{array}{*{20}l} {D_{1}^{1} } \hfill & {D_{2}^{1} } \hfill & \cdots \hfill & {D_{n}^{1} } \hfill \\ {D_{1}^{2} } \hfill & {D_{2}^{2} } \hfill & \cdots \hfill & {D_{n}^{2} } \hfill \\ \vdots \hfill & \vdots \hfill & \cdots \hfill & \vdots \hfill \\ {D_{1}^{HMS} } \hfill & {D_{2}^{HMS} } \hfill & \cdots \hfill & {D_{n}^{HMS} } \hfill \\ \end{array} } \right|\begin{array}{*{20}l} {f\left( {{\mathbf{D}}^{1} } \right)} \hfill \\ {f\left( {{\mathbf{D}}^{2} } \right)} \hfill \\ \vdots \hfill \\ {f\left( {{\mathbf{D}}^{HMS} } \right)} \hfill \\ \end{array} } \right], $$(14.1)where D j i is the ith decision variable in the jth solution vector that has one discrete value out of a candidate set \( \left\{ {D_{i} \left( 1 \right),D_{i} \left( 2 \right), \ldots ,D_{i} \left( k \right), \ldots ,D_{i} \left( {K_{i} } \right)} \right\} \), \( f\left( {{\mathbf{D}}^{j} } \right) \) is the objective function value for the jth solution vector, and HMS is the harmony memory size (i.e., the number of multiple vectors stored in the HM).
-
Improvisation of new harmony: A new harmony vector \( D_{i}^{new} = \left( {D_{1}^{new} ,D_{2}^{new} , \ldots ,D_{n}^{new} } \right) \) is improvised by the following three rules (Geem 2009):
-
(1)
Random selection: Based on this rule, one value is chosen out of the candidate set via Eq. 14.2 (Geem 2009):
-
(2)
HM consideration: In memory consideration, one value is chosen out of the HM set with a probability of harmony memory consideration rate (HMCR) via Eq. 14.3 (Geem 2009):
-
(3)
Pitch adjustment: According to this rule, the obtained vale as in Eq. 14.3 is further changed into neighbouring values, with a probability of pitch adjusting rate (PAR) via Eq. 14.4 (Geem 2009):
Overall, these three rules are the core terms of the stochastic derivative of HS and can be summarized via Eq. 14.5 (Geem 2009):
where \( \frac{1}{{K_{i} }} \cdot \left( {1 - HMCR} \right) \) denotes for the rate to choose a value \( D_{i} \left( l \right) \) for the decision variable D i by random selection, \( \frac{{n\left( {D_{i} \left( l \right)} \right)}}{HMS} \cdot HMCR \cdot \left( {1 - PAR} \right) \) chooses the rate by HM consideration, and \( \frac{{n\left( {D_{i} \left( {l \pm 1} \right)} \right)}}{HMS} \cdot HMCR \cdot PAR \) chooses the rate by pitch adjustment.
-
Update of HM: Once the new vector \( D_{i}^{new} = \left( {D_{1}^{new} ,D_{2}^{new} , \ldots ,D_{n}^{new} } \right) \) is completely generated, it will be compared with the other vectors that stored in HM. If it is better than the worst vector in HM with respect to the objective function, it will be updated (i.e., the new harmony is included in the HM and the existing worst harmony is excluded from the HM).
The optimization procedures of the HS algorithm are given as follows (Lee and Geem 2009; Geem et al. 2001):
-
Step 1: Initialize the optimization problem and algorithm parameters.
-
Step 2: Initialization of HM.
-
Step 3: Improvise a new harmony from the HM.
-
Step 4: Update the HM.
-
Step 5: Repeat Steps 3 and 4 until the termination criterion is satisfied.
2.2 Performance of HS
In order to show how the HS algorithm performs, three problems are presented to demonstrate the searching ability of HS in Geem et al. (2001), i.e., travelling salesman problem, relatively simple constrained minimization problem, and water network design problem. The computational results showed that HS outperforms other existing heuristic methods [such as genetic algorithm (GA)] in two specific applications (i.e., relatively simple constrained minimization problem and water network design problem).
3 Emerging Music Inspired Algorithms
Although music inspired algorithm is a new member of computational intelligence (CI) family, a number of similar algorithms have been proposed in the literature. This section gives an overview to some of these algorithms which have been demonstrated to be very efficient and robust.
3.1 Melody Search Algorithm
3.1.1 Fundamentals of Melody Search Algorithm
Melody search (MeS) algorithm was originally proposed by Ashrafi and Dariane (2011). It is inspired by the basic concepts applied in HS, but unless the HS algorithm used a single HM, the MeS algorithm employed the procedure of the group improvisation [i.e., several memories called player memory (PM)] simultaneously for finding the best succession of pitches in a melody. Main steps of MeS are outlined as follows (Ashrafi and Dariane 2011):
-
Step 1: Initializing the optimization problem and adopting algorithm parameters. In general, there are six major parameters defined in MeS, namely number of player memories (PMN), player memory size (PMS), maximum number of iterations (NI), maximum number of iterations for the initial phase (NII), bandwidth (bw), and player memory considering rate (PMCR).
-
Step 2: Initial phase that includes two repeated procedures (i.e., improvise a new melody from each PM and update each PM) until the criterion for stopping this step (i.e., NII) is satisfied, is given as follows,
where MM denotes the melody memory in which a set of player memories are involved. The PM’s matrixes are generated via Eqs. 14.7 and 14.8, respectively (Ashrafi and Dariane 2011):
where D is the number of pitches of melodic line (i.e., decision variables), \( \left[ {LB_{k} ,UB_{k} } \right] \) is the possible range of the searching dimension, and r is a real number uniformly distributed in \( \left[ {0,1} \right] \).
-
(2)
Improvise a new melody \( X_{i,new} = \left( {x_{i,new}^{1} ,\,x_{i,new}^{2} , \ldots ,x_{i,new}^{n} } \right) \) from each PM according to three rules (Ashrafi and Dariane 2011):
Memory consideration: The value of each variable can be chosen from any value in the specified PM.
Pitch adjustment: Based on this rule, the value can be determined by a constant pitch bandwidth (bw) and a pitch adjusting rate (PAR) such as Eq. 14.9 (Ashrafi and Dariane 2011):
where PAR t is the pitch adjusting rate of the ith iteration, PAR min and PAR max are the minimum and maximum adjusting rates, respectively, and NI is the maximum number of iterations.
Randomization: This rule is used to increase the diversity of the solutions.
-
(3)
Update each PM.
-
Step 3: Second phase that includes two repeated procedures until the NI is satisfied, namely,
-
(1)
Improvise a new melody from each PM according to the possible range of pitches.
-
(2)
Update each PM.
-
(3)
Finally, determine the possible ranges of pitches for next improvisation (Just for randomization).
3.1.2 Performance of MeS
To evaluate the performance of MeS, five classical benchmark functions are tested in (Ashrafi and Dariane 2011). Compared with other CI methods [such as artificial bee colony (ABC), GA, HS, particle swarm optimization (PSO), and particle swarm and evolutionary algorithm (PS-EA)], the MeS is capable of finding better solutions.
3.2 Method of Musical Composition Algorithm
3.2.1 Fundamentals of Method of Musical Composition Algorithm
Method of musical composition (MMC) algorithm was originally proposed by Mora-Gutiérrez et al. (2012). The MMC algorithm used a dynamic creative system which means the composers exchange information among themselves and their environment to compose music. Normally, MMC involves four steps as follows (Mora-Gutiérrez et al. 2012):
-
Initialization: In this step, the scores (\( P_{*,*,i} \)), which used as memory, are randomly generated via Eqs. 14.10 and 14.11, respectively (Mora-Gutiérrez et al. 2012):
$$ P_{*,*,i} = \left( {\begin{array}{*{20}c} {x_{1,1} } \hfill & {x_{1,2} } \hfill & \cdots \hfill & {x_{1,n} } \hfill \\ {x_{2,1} } \hfill & {x_{2,2} } \hfill & \cdots \hfill & {x_{2,n} } \hfill \\ \vdots \hfill & \vdots \hfill & \vdots \hfill & \vdots \hfill \\ {x_{Ns,1} } \hfill & {x_{Ns,2} } \hfill & \vdots \hfill & {x_{Ns,n} } \hfill \\ \end{array} } \right), $$(14.10)$$ P_{*,*,i} = x_{l}^{L} + \left( {rand \cdot \left( {x_{l}^{U} - x_{l}^{L} } \right)} \right), $$(14.11)where \( P_{*,*,i} \) is the score of the ith composer, \( x_{j,l} \) is the lth decision variable of jth tune, rand is a real number uniformly distributed in \( \left[ {0,1} \right] \), and \( \left( {x_{l}^{U} - x_{l}^{L} } \right) \) is the possible range of the searching dimension.
-
Exchanging of information among agents: According to the interaction policy, i.e., “composer i exchange a tune with composer k if and only if there is a link between them and the worst tune of composer k is better than the worst tune of composer i”. Two sub-phases (i.e., update of links among composers and exchange of information) are employed to exchange the information.
-
Generating for each agent a new tune: Based on the composer’s background and his innovative ideas, the new tune will be created. This phase includes two sub-phases, i.e., building the background of each composer (\( KM_{*,*i} \)) which includes the knowledge of composer i and the environment information that he perceived, and creating a new tune.
-
The \( P_{*,*,i} \) updating: Based on the value of objective function, the score will be updated.
3.2.2 Performance of MMC
To show the performance of MMC, 13 benchmark continuous optimization problems are performed in Mora-Gutiérrez et al. (2012). Compared with HS, improved HS, global-best HS, and self-adaptive HS, the experimental results showed that MMC improves the results obtained by the other methods, especially in the domain of multimodal functions.
4 Conclusions
In this chapter, we introduced a set of music inspired algorithms, namely, HS, MeS, and MMC. The former two are based on the idea of improvisation process by a skilled musician, while the last algorithm is inspired by the creative process of musical composition. Although the novelties of these music algorithms (e.g., HS) are still under debate (see (Weyland 2010) for details), we have witnessed the following rapid spreading of at least one of them, i.e., HS:
First, numerous enhanced versions of HS can be found in the literature as outlined below:
-
Box-Muller HS (Fetanat et al. 2011).
-
Chaotic differential HS (Coelho et al. 2010).
-
Coevolutionary differential evolution with HS (Wang and Li 2012).
-
Discrete HS (Gandhi et al. 2012; Pan et al. 2010b; Tasgetiren et al. 2012).
-
Effective global best HS (Zou et al. 2011a).
-
Efficient HS (Degertekin 2012).
-
Global-best HS (Omran and Mahdavi 2008).
-
Grouping HS (Landa-Torres et al. 2012; Askarzadeh and Rezazadeh 2011).
-
Guided variable neighborhood embedded HS (Huang et al. 2009).
-
Harmony fuzzy search algorithm (Alia et al. 2009a).
-
Highly reliable HS (Taherinejad 2009).
-
HS with dual-memory (Gao et al. 2012b).
-
Hybrid clonal selection algorithm and HS (Wang et al. 2009).
-
Hybrid differential evolution and HS (Mirkhani et al. 2013; Li and Wang 2009; Liao 2010; Duan et al. 2013; Gao et al. 2009).
-
Hybrid global best HS and K-means algorithm (Cobos et al. 2010).
-
Hybrid HS (Gao et al. 2012a; Gil-López et al. 2012; Wang et al. 2010).
-
Hybrid HS and hill climbing (Al-Betar and Khader 2009).
-
Hybrid HS and linear discriminate analysis (Moeinzadeh et al. 2009).
-
Hybrid K-means and HS (Mahdavi and Abolhassani 2009; Forsati et al. 2008b).
-
Hybrid modified subgradient and HS (Yaşar and Özyön 2011).
-
Hybrid probabilistic neural networks and HS (Ameli et al. 2012).
-
Hybrid swarm intelligence and HS (Pandi and Panigrahi 2011; Pandi et al. 2011).
-
Improved discrete HS (Shi et al. 2011).
-
Improved HS based on exponential distribution (Coelho and Mariani 2009).
-
Intelligent tuned HS (Yadav et al. 2012).
-
Learning automata-based HS (Enayatifar et al. 2013).
-
Local-best HS with dynamic sub-harmony memories (Pan et al. 2011a).
-
Mixed-discrete HS (Jaberipour and Khorram 2011).
-
Modified HS (Kaveh and Nasr 2011; Zinati and Razfar 2012; Al-Betar and Khader 2012; Gao et al. 2008; Das et al. 2011; Mun and Cho 2012).
-
Multiobjective HS (Sivasubramani and Swarup 2011a, b; Li et al. 2012).
-
Opposition-based HS (Chatterjee et al. 2012).
-
Other hybrid HS (Jang et al. 2008; Yıldız 2008; Fesanghary et al. 2008; Zhao and Suganthan 2010).
-
Other improved HS (Afshari et al. 2011; Fourie et al. 2010; Sirjani et al. 2011; Yadav et al. 2011; Kaveh and Abadi 2010; Geem and Williams 2008; Geem 2010, 2012; Mahdavi et al. 2007; Coelho and Bernert 2009; Chakraborty et al. 2009; Jaberipour and Khorram 2010b; Qin and Forbes 2011a; Al-Betar et al. 2012).
-
Parallel HS (Lee and Zomaya 2009).
-
Parameter-setting-free HS (Geem and Sim 2010).
-
Particle-swarm enhanced HS (Geem 2009; Li et al. 2008; Zhao et al. 2011; Cheng et al. 2012).
-
Quantum inspired HS (Layeb 2013).
-
Self-adaptive global best HS (Kulluk et al. 2011; Pan et al. 2010a).
-
Self-adaptive HS (Degertekin 2012; Wang and Huang 2010; Chang and Gu 2012).
-
Social HS (Kaveh and Ahangaran 2012).
Second, the HS algorithm has been successfully applied to a variety of optimization problems as listed below:
-
Adaptive parameter controlling (Nadi et al. 2010).
-
Analog filter design optimization (Vural et al. 2013).
-
Antenna design optimization (Guney and Onay 2011).
-
Artificial neural network training (Kattan et al. 2010; Kattan and Abdullah 2011a, b; Kulluk et al. 2011, 2012).
-
Communication networks optimization (Forsati et al. 2008a; Shi et al. 2011; Landa-Torres et al. 2012; Ser et al. 2012).
-
Data mining (Mahdavi and Abolhassani 2009; Mahdavi et al. 2008; Forsati et al. 2008b; Moeinzadeh et al. 2009; Wang et al. 2009; Venkatesh et al. 2010; Cobos et al. 2010; Ramos et al. 2011).
-
Engineering design optimization (Mohammadi et al. 2011; Gil-López et al. 2012; Lee and Geem 2005).
-
Facility location optimization (Afshari et al. 2011; Kaveh and Nasr 2011).
-
Fuel cell research (Askarzadeh and Rezazadeh 2011).
-
Fuzzy-rough rule induction (Diao and Shen 2012).
-
Ground motion records analysis (Kayhan et al. 2011).
-
Image processing (Alia et al. 2009a, b, 2008, 2010; Fourie et al. 2010).
-
Interaction parameter estimation problem (Merzougui et al. 2012).
-
Lot sizing problem (Piperagkas et al. 2012).
-
Materials research (Mun and Geem 2009).
-
Milling process optimization (Razfar et al. 2011; Zarei et al. 2009; Zinati and Razfar 2012).
-
Music composition (Geem and Choi 2007).
-
Orienteering problem (Geem et al. 2005c).
-
Parameter-setting-free technique enhanced HS (Geem and Sim 2010).
-
Power system optimization (Vasebi et al. 2007; Mukhopadhyay et al. 2008; Fesanghary and Ardehali 2009; Coelho and Mariani 2009; Coelho et al. 2010; Yaşar and Özyön 2011; Fetanat et al. 2011; Geem 2011; Pandi and Panigrahi 2011; Pandi et al. 2011; Sivasubramani and Swarup 2011a, b; Khorram and Jaberipour 2011; Boroujeni et al. 2011a, b, c, d; Sirjani et al. 2011; Khazali and Kalantar 2011; Shariatkhah et al. 2012; Ezhilarasi and Swarup 2012; Javadi et al. 2012; Chatterjee et al. 2012; Ameli et al. 2012; Wang and Li 2013; Zhang et al. 2013).
-
Robot control optimization (Mirkhani et al. 2013).
-
Scheduling optimization (Huang et al. 2009; Zou et al. 2010a; Wang et al. 2010, 2011; Pan et al. 2010b, 2011a, b; Yadav et al. 2011; Gao et al. 2012a; Ahmad et al. 2012; Geem 2007; Tasgetiren et al. 2012).
-
Structure design optimization (Geem et al. 2005b; Geem and Hwangbo 2006; Degertekin 2008, 2012; Fesanghary et al. 2009, 2012; Kaveh and Talataha 2009; Kaveh and Abadi 2010; Hasançebi et al. 2010; Khajehzadeh et al. 2011; Bekdaş and Nigdeli 2011; Erdal et al. 2011; Lagaros and Papadrakakis 2012; Kaveh and Ahangaran 2012; Shahrouzi and Sazjini 2012; Miguel and Miguel 2012; Lee and Geem 2004; Ryu et al. 2007; Lee et al. 2011).
-
Sudoku puzzle problem (Geem 2008a).
-
Sum-of-ratios problem solving (Jaberipour and Khorram 2010a).
-
Supply chain optimization (Wong and Guo 2010; Taleizadeh et al. 2011, 2012; Purnomo et al. 2012).
-
System reliability optimization (Zou et al. 2010c, 2011a; Wang and Li 2012).
-
Timetabling (Al-Betar and Khader 2009, 2012; Al-Betar et al. 2008, 2010).
-
Transportation system optimization (Ceylan et al. 2008).
-
Vehicle routing problem (Geem et al. 2005b).
-
Water network optimization (Geem 2006a, b, 2008b, 2009; Ayvaz 2007, 2009; Mora-Meliá et al. 2009; Geem et al. 2011; Geem and Park 2006).
Interested readers please refer to them together with several excellent reviews [e.g., (Alia and Mandava 2011; Manjarres et al. 2013; Geem et al. 2008)] as a starting point for a further exploration and exploitation of these music inspired algorithms.
References
Afshari, S., Aminshahidy, B., & Pishvaie, M. R. (2011). Application of an improved harmony search algorithm in well placement optimization using streamline simulation. Journal of Petroleum Science and Engineering, 78, 664–678.
Ahmad, I., Mohammad, M. G., Salman, A. A., & Hamdan, S. A. (2012). Broadcast scheduling in packet radio networks using harmony search algorithm. Expert Systems with Applications, 39, 1526–1535.
Alatas, B. (2010). Chaotic harmony search algorithms. Applied Mathematics and Computation, 216, 2687–2699.
Al-Betar, M. A. & Khader, A. T. (2009, August 10–12). A hybrid harmony search for university course timetabling. In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Dublin, Ireland (pp. 157–179).
Al-Betar, M. A., & Khader, A. T. (2012). A harmony search algorithm for university course timetabling. Annals of Operations Research, 194, 3–31.
Al-Betar, M. A., Khader, A. T., & Gani, T. A. (2008). A harmony search algorithm for university course timetabling. In 7th International Conference on the Practice and Theory of Automated Timetabling, Montreal, Canada (pp. 1–12).
Al-Betar, M. A., Khader, A. T., & Nadi, F. (2010, July 7–11). Selection mechanisms in memory consideration for examination timetabling with harmony search. In Annual Conference on Genetic and Evolutionary Computation (GECCO), Portland, Oregon, USA (pp. 1203–1210).
Al-Betar, M. A., Doush, I. A., Khader, A. T., & Awadallah, M. A. (2012). Novel selection schemes for harmony search. Applied Mathematics and Computation, 218, 6095–6117.
Alia, O. M. D., & Mandava, R. (2011). The variants of the harmony search algorithm: an overview. Artificial Intelligence Review, 36, 49–68.
Alia, O. M. D., Mandava, R., Ramachandram, D., & Aziz, M. E. (2008). Dynamic fuzzy clustering using harmony search with application to image segmentation. In IEEE International Symposium on Signal Processing and Information Technology (ISSPIT) (pp. 538–543). IEEE.
Alia, O. M. D., Mandava, R., & Aziz, M. E. (2009a). A novel image segmentation algorithm based on harmony fuzzy search algorithm. In International Conference of Soft Computing and Pattern Recognition (SOCPAR) (pp. 335–340). IEEE.
Alia, O. M. D., Mandava, R., Ramachandram, D., & Aziz, M. E. (2009b). Harmony search-based cluster initialization for fuzzy C-means segmentation of MR images. In IEEE Region 10 Conference TENCON (pp. 1–6). IEEE.
Alia, O. M. D., Mandava, R., & Aziz, M. E. (2010). A hybrid harmony search algorithm to MRI brain segmentation. In 9th IEEE International Conference on Cognitive Informatics (ICCI) (pp. 712–721). IEEE.
Alsewari, A. R. A., & Zamli, K. Z. (2012a). Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Information and Software Technology, 54, 553–568.
Alsewari, A. R. A., & Zamli, K. Z. (2012b). A harmony search based pairwise sampling strategy for combinatorial testing. International Journal of the Physical Sciences, 7, 1062–1072.
Ameli, M. T., Shivaie, M., & Moslehpour, S. (2012). Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm. International Journal of Industrial Engineering Computations, 3, 71–80.
Ashrafi, S. M. & Dariane, A. B. (2011, December 5–8). A novel and effective algorithm for numerical optimization: melody search (MS). In 11th International Conference on Hybrid Intelligent Systems (HIS), Melacca (pp. 109–114). IEEE.
Askarzadeh, A., & Rezazadeh, A. (2011). A grouping-based global harmony search algorithm for modeling of proton exchange membrane fuel cell. International Journal of Hydrogen Energy, 36, 5047–5053.
Ayvaz, M. T. (2007). Simultaneous determination of aquifer parameters and zone structures with fuzzy C-means clustering and meta-heuristic harmony search algorithm. Advances in Water Resources, 30, 2326–2338.
Ayvaz, M. T. (2009). Application of harmony search algorithm to the solution of groundwater management models. Advances in Water Resources, 32, 916–924.
Bekdaş, G., & Nigdeli, S. M. (2011). Estimating optimum parameters of tuned mass dampers using harmony search. Engineering Structures, 33, 2716–2723.
Boroujeni, S. M. S., Boroujeni, B. K., Abdollahi, M., & Delafkar, H. (2011a). Multi-area load frequency control using IP controller tuned by harmony search. Australian Journal of Basic and Applied Sciences, 5, 1224–1231.
Boroujeni, S. M. S., Boroujeni, B. K., Delafkar, H., Behzadipour, E., & Hemmati, R. (2011b). Harmony search algorithm for power system stabilizer tuning. Indian Journal of Science and Technology, 4, 1025–1030.
Boroujeni, S. M. S., Boroujeni, B. K., Delafkar, H., Behzadipour, E., & Hemmati, R. (2011c). Harmony search algorithm for STATCOM controllers tuning in a multi machine environment. Indian Journal of Science and Technology, 4, 1031–1035.
Boroujeni, S. M. S., Delafkar, H., Behzadipour, E., & Boro, A. S. (2011d). Reactive power planning for loss minimization based on harmony search algorithm. International Journal of Natural and Engineering Sciences, 5, 73–77.
Ceylan, H., Ceylan, H., Haldenbilen, S., & Baskan, O. (2008). Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey. Energy Policy, 36, 2527–2535.
Chakraborty, P., Roy, G. G., Das, S., & Jain, D. (2009). An improved harmony search algorithm with differential mutation operator. Fundamenta Informaticae, 95, 1–26.
Chang, H., & Gu, X.-S. (2012). Multi-HM adaptive harmony search algorithm and its application to continuous function optimization. Research Journal of Applied Sciences, Engineering and Technology, 4, 100–103.
Chatterjee, A., Ghoshal, S. P., & Mukherjee, V. (2012). Solution of combined economic and emission dispatch problems of power systems by an opposition-based harmony search algorithm. Electrical Power and Energy Systems, 39, 9–20.
Cheng, Y. M., Li, L., Sun, Y. J., & Au, S. K. (2012). A coupled particle swarm and harmony search optimization algorithm for difficult geotechnical problems. Structural and Multidisciplinary Optimization, 45, 489–501.
Cobos, C., Andrade, J., Constain, W., Mendoza, M., & León, E. (2010, July 18–23). Web document clustering based on global-best harmony search, k-means, frequent term sets and Bayesian information criterion. In Proceedings of the IEEE World Congress on Computational Intelligence (WCCI), CCIB, Barcelona, Spain (pp. 4637–4644). IEEE.
Coelho, L. D. S., & Bernert, D. L. D. A. (2009). An improved harmony search algorithm for synchronization of discrete-time chaotic systems. Chaos, Solitons and Fractals, 41, 2526–2532.
Coelho, L. D. S., & Mariani, V. C. (2009). An improved harmony search algorithm for power economic load dispatch. Energy Conversion and Management, 50, 2522–2526.
Coelho, L. D. S., Bernert, D. L. D. A., & Mariani, V. C. (2010, July 18–23). Chaotic differential harmony search algorithm applied to power economic dispatch of generators with multiple fuel options. In IEEE World Congress on Computational Intelligence (WCCI), CCIB, Barcelona, Spain (pp. 1416–1420). IEEE.
Das, S., Mukhopadhyay, A., Roy, A., Abraham, A., & Panigrahi, B. K. (2011). Exploratory power of the harmony search algorithm: Analysis and improvements for global numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics, 41, 89–106.
Degertekin, S. O. (2008). Optimum design of steel frames using harmony search algorithm. Structural and Multidisciplinary Optimization, 36, 393–401.
Degertekin, S. O. (2012). Improved harmony search algorithms for sizing optimization of truss structures. Computers and Structures, 92–93, 229–241.
Diao, R. & Shen, Q. (2012, June 10–15). A harmony search based approach to hybrid fuzzy-rough rule induction. In IEEE World Congress on Computational Intelligence (WCCI), Brisbane, Australia (pp. 1–8). IEEE.
Duan, Q., Liao, T. W., & Yi, H. Z. (2013). A comparative study of different local search application strategies in hybrid metaheuristics. Applied Soft Computing, 13, 1464–1477.
Enayatifar, R., Yousefi, M., Abdullah, A. H., & Darus, A. N. (2013). LAHS: a novel harmony search algorithm based on learning automata. In Communications in Nonlinear Science and Numerical Simulation, 18, 3481–3497. http://dx.doi.org/10.1016/j.cnsns.2013.04.028.
Erdal, F., Doğan, E., & Saka, M. P. (2011). Optimum design of cellular beams using harmony search and particle swarm optimizers. Journal of Constructional Steel Research, 67, 237–247.
Ezhilarasi, G. A. & Swarup, K. S. (2012). Network partitioning using harmony search and equivalencing for distributed computing. Journal of Parallel and Distributed Computing, 72, 936–943. doi:10.1016/j.jpdc.2012.04.006.
Fesanghary, M., & Ardehali, M. M. (2009). A novel meta-heuristic optimization methodology for solving various types of economic dispatch problem. Energy, 34, 757–766.
Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., & Alizadeh, Y. (2008). Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering, 197, 3080–3091.
Fesanghary, M., Damangir, E., & Soleimani, I. (2009). Design optimization of shell and tube heat exchangers using global sensitivity analysis and harmony search algorithm. Applied Thermal Engineering, 29, 1026–1031.
Fesanghary, M., Asadi, S., & Geem, Z. W. (2012). Design of low-emission and energy-efficient residential buildings using a multi-objective optimization algorithm. Building and Environment, 49, 245–250.
Fetanat, A., Shafipour, G., & Ghanatir, F. (2011). Box-Muller harmony search for optimal coordination of directional overcurrent relays in power system. Scientific Research and Essays, 6, 4079–4090.
Forsati, R., Haghighat, A. T., & Mahdavi, M. (2008a). Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications, 31, 2505–2519.
Forsati, R., Mahdavi, M., Kangavari, M., & Safarkhani, B. (2008b). Web page clustering using harmony search optimization. In Canadian Conference on Electrical and Computer Engineering (CCECE) (pp. 001601–001604). IEEE.
Fourie, J., Mills, S., & Green, R. (2010). Harmony filter: a robust visual tracking system using the improved harmony search algorithm. Image and Vision Computing, 28, 1702–1716.
French, R. M. (2012). Technology of the guitar. New York, Springer Science + Business Media, ISBN 978-1-4614-1920-4.
Gandhi, T. K., Chakraborty, P., Roy, G. G., & Panigrahi, B. K. (2012). Discrete harmony search based expert model for epileptic seizure detection in electroencephalography. Expert Systems with Applications, 39, 4062–4065.
Gao, X. Z., Wang, X., & Ovaska, S. J. (2008). Modified harmony search methods for uni-modal and multi-modal optimization. In Eighth International Conference on Hybrid Intelligent Systems (pp. 65–72).
Gao, X.-Z., Wang, X., & Ovaska, S. J. (2009). Uni-modal and multi-modal optimization using modified harmony search methods. International Journal of Innovative Computing, Information and Control, 5, 2985–2996.
Gao, K.-Z., Pan, Q.-K., Li, J.-Q., & Wang, Y.-T. (2012a). A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems. Asia-Pacific Journal of Operational Research, 29, 1–23.
Gao, X. Z., Wang, X., Zenger, K., & Wang, X. (2012b, October 14–17). A novel harmony search method with dual memory. In IEEE International Conference on Systems, Man, and Cybernetics (SMC), COEX, Seoul, Korea (pp. 177–183). IEEE.
Geem, Z. W. (2005, June 25–29). School bus routing using harmony search. GECCO 2005, Washington, DC, USA (pp. 1–6). ACM.
Geem, Z. W. (2006a). Optimal cost design of water distribution networks using harmony search. Engineering Optimization, 38, 259–280.
Geem, Z. W. (2006b). Parameter estimation for the nonlinear Muskingum model using BFGS technique. Journal of Irrigation and Drainage Engineering, 132, 474–478.
Geem, Z. W. (2007). Optimal scheduling of multiple dam system using harmony search algorithm. In Computational and Ambient Intelligence, LNCS 4507 (pp. 316–323). Berlin Heidelberg: Springer.
Geem, Z. W. (2008a). Harmony search algorithm for solving Sudoku. In B. Apolloni., R. J. Howlett., & L. Jain (Eds.), Knowledge-Based Intelligent Information and Engineering Systems, LNCS 4692 (pp. 371–378). Berlin Heidelberg: Springer.
Geem, Z. W. (2008b). Novel derivative of harmony search algorithm for discrete design variables. Applied Mathematics and Computation, 199, 223–230.
Geem, Z. W. (2009). Particle-swarm harmony search for water network design. Engineering Optimization, 41, 297–311.
Geem, Z. W. (2010). State-of-the-art in the structure of harmony search algorithm. In Recent Advances in Harmony Search Algorithm (pp. 1–10). Berlin: Springer.
Geem, Z. W. (2011). Discussion on “Combined heat and power economic dispatch by harmony search algorithm” by A. Vasebi et al. International Journal of Electrical Power and Energy Systems, 29(2007), 713–719. Electrical Power and Energy Systems, 33, 1348.
Geem, Z. W. (2012). Effects of initial memory and identical harmony in global optimization using harmony search algorithm. Applied Mathematics and Computation, 218, 11337–11343. http://dx.doi.org/10.1016/j.amc.2012.04.070.
Geem, Z. W. & Choi, J.-Y. (2007). Music composition using harmony search algorithm. In M. Giacobini (Ed.), Applications of Evolutionary Computing (pp. 593–600). Berlin Heidelberg: Springer.
Geem, Z. W. & Hwangbo, H. (2006). Application of harmony search to multi-objective optimization for satellite heat pipe design. In US-Korea Conference on Science, Technology, and Entrepreneurship (UKC). Teaneck, Nj, USA (pp. 1–3).
Geem, Z. W. & Park, Y. (2006, April 16–18). Optimal layout for branched networks using harmony search. In 5th WSEAS International Conference on Applied Computer Science, Hangzhou, China (pp. 364–367).
Geem, Z. W., & Sim, K.-B. (2010). Parameter-setting-free harmony search algorithm. Applied Mathematics and Computation, 217, 3881–3889.
Geem, Z. W. & Williams, J. C. (2008, March 24–26). Ecological optimization using harmony search. In American Conference on Applied Mathematics, Harvard, Massachusetts, USA (pp. 148–152). World Scientific and Engineering Academy and Society (WSEAS).
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76, 60–68.
Geem, Z. W., Lee, K. S., & Park, Y. (2005a). Application of harmony search to vehicle routing. American Journal of Applied Sciences, 2, 1552–1557.
Geem, Z. W., Lee, K. S., & Tseng, C.-L. (2005b, June 25–29). Harmony search for structural design. In GECCO’05, Washington, DC, USA (pp. 651–652). ACM.
Geem, Z. W., Tseng, C.-L., & Park, Y. (2005c). Harmony search for generalized orienteering problem: best touring in China. In L. Wang., K. Chen K., & Y. Ong (Eds.), ICNC 2005, LNCS 3612 (pp. 741–750). Berlin Heidelberg: Springer.
Geem, Z. W., Fesanghary, M., Choi, J.-Y., Saka, M. P., Williams, J. C., Ayvaz, M. T., Li, L., Ryu, S., & Vasebi, A. (2008). Recent advances in harmony search. In W. Kosiński (Ed.), Advances in Evolutionary Algorithms, ISBN 978-953-7619-11-4, Chapter 7 (pp. 127–142). Vienna, Austria: I-Tech Education and Publishing.
Geem, Z. W., Kim, J.-H., & Jeong, S.-H. (2011). Cost efficient and practical design of water supply network using harmony search. African Journal of Agricultural Research, 6, 3110–3116.
Gil-López, S., Ser, J. D., Salcedo-Sanz, S., Pérez-Bellido, Á. M., Cabero, J. M. A., & Portilla-Figueras, J. A. (2012). A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem. Expert Systems with Applications, 39, 11089–11093.
Guney, K., & Onay, M. (2011). Optimal synthesis of linear antenna arrays using a harmony search algorithm. Expert Systems with Applications, 38, 15455–15462.
Guo, P., Wang, J., Gao, X. Z., & Tanskanen, J. M. A. (2012, October 14–17). Epileptic EEG signal classification with marching pursuit based on harmony search method. In IEEE International Conference on Systems, Man, and Cybernetics (SMC), COEX, Seoul, Korea (pp. 177–183). IEEE.
Hasançebi, O., Erdal, F., & Saka, M. P. (2010). Optimum design of geodesic steel domes under code provisions using metaheuristic techniques. International Journal of Engineering and Applied Sciences, 2, 88–103.
Huang, M., Dong, H.-Y., Wang, X.-W., Zheng, B.-L., & Ip, W. H. (2009, June 12–14). Guided variable neighborhood harmony search for integrated charge planning in primary steelmaking processes. In GEC’09, Shanghai, China (pp. 231–238). ACM.
Jaberipour, M., & Khorram, E. (2010a). Solving the sum-of-ratios problems by a harmony search algorithm. Journal of Computational and Applied Mathematics, 234, 733–742.
Jaberipour, M., & Khorram, E. (2010b). Two improved harmony search algorithms for solving engineering optimization problems. Communications in Nonlinear Science and Numerical Simulation, 15, 3316–3331.
Jaberipour, M., & Khorram, E. (2011). A new harmony search algorithm for solving mixed–discrete engineering optimization problems. Engineering Optimization, 43, 507–523.
Jang, W. S., Kang, H. I., & Lee, B. H. (2008). Hybrid simplex-harmony search method for optimization problems. In IEEE Congress on Evolutionary Computation (CEC) (pp. 4157–4164). IEEE.
Jarrett, S. & Day, H. (2008). Music composition for dummies. 111 River St. Hoboken, NJ, USA: Wiley Publishing, Inc., ISBN 978-0-470-22421-2.
Javadi, M. S., Sabramooz, S., & Javadinasab, A. (2012). Security constrained generation scheduling using harmony search optimization case study: Day-ahead heat and power scheduling. Indian Journal of Science and Technology, 5, 1812–1820.
Kattan, A. & Abdullah, R. (2011a). An enhanced parallel and distributed implementation of the harmony search based supervised training of artificial neural networks. In Third International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN) (pp. 275–280). IEEE.
Kattan, A. & Abdullah, R. (2011b). A parallel and distributed implementation of the harmony search based supervised training of artificial neural networks. In Proceedings of the Second International Conference on Intelligent Systems, Modelling and Simulation (ISMS) (pp. 277–283). IEEE.
Kattan, A., Abdullah, R., & Salam, R. A. (2010). Harmony search based supervised training of artificial neural networks. In International Conference on Intelligent Systems, Modelling and Simulation (ISMS) (pp. 105–110). IEEE.
Kaveh, A., & Abadi, A. S. M. (2010). Cost optimization of a composite floor system using an improved harmony search algorithm. Journal of Constructional Steel Research, 66, 664–669.
Kaveh, A., & Ahangaran, M. (2012). Discrete cost optimization of composite floor system using social harmony search model. Applied Soft Computing, 12, 372–381.
Kaveh, A., & Nasr, H. (2011). Solving the conditional and unconditional p-center problem with modified harmony search: A real case study. Scientia Iranica A, 18, 867–877.
Kaveh, A., & Talataha, S. (2009). Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Computers and Structures, 87, 267–283.
Kayhan, A. H., Korkmaz, K. A., & Irfanoglu, A. (2011). Selecting and scaling real ground motion records using harmony search algorithm. Soil Dynamics and Earthquake Engineering, 31, 941–953.
Khajehzadeh, M., Taha, M. R., El-Shafie, A., & Eslami, M. (2011). Economic design of foundation using harmony search algorithm. Australian Journal of Basic and Applied Sciences, 5, 936–943.
Khazali, A. H., & Kalantar, M. (2011). Optimal reactive power dispatch based on harmony search algorithm. Electrical Power and Energy Systems, 33, 684–692.
Khorram, E., & Jaberipour, M. (2011). Harmony search algorithm for solving combined heat and power economic dispatch problems. Energy Conversion and Management, 52, 1550–1554.
Kulluk, S., Ozbakir, L., & Baykasoglu, A. (2011). Self-adaptive global best harmony search algorithm for training neural networks. Procedia Computer Science, 3, 282–286.
Kulluk, S., Ozbakir, L., & Baykasoglu, A. (2012). Training neural networks with harmony search algorithms for classification problems. Engineering Applications of Artificial Intelligence, 25, 11–19.
Lagaros, N. D., & Papadrakakis, M. (2012). Applied soft computing for optimum design of structures. Structural and Multidisciplinary Optimization, 45, 787–799.
Landa-Torres, I., Gil-Lopez, S., Salcedo-Sanz, S., Ser, J. D., & Portilla-Figueras, J. A. (2012). A novel grouping harmony search algorithm for the multiple-type access node location problem. Expert Systems with Applications, 39, 5262–5270.
Layeb, A. (2013). A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems. Journal of Computational and Applied Mathematics, 253, 14–25.
Lee, K. S., & Geem, Z. W. (2004). A new structural optimization method based on the harmony search algorithm. Computers and Structures, 82, 781–798.
Lee, K. S., & Geem, Z. W. (2005). A new meta-heuristic algorithm for continuous engineering optimization: Harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering, 194, 3902–3933.
Lee, Y. C. & Zomaya, A. Y. (2009). Interweaving heterogeneous metaheuristics using harmony search. In IEEE International Symposium on Parallel and Distributed Processing (IPDPS) (pp. 1–8). IEEE.
Lee, K. S., Han, S. W., & Geem, Z. W. (2011). Discrete size and discrete-continuous configuration optimization methods for truss structures using the harmony search algorithm. International Journal of Optimization in Civil Engineering, 1, 107–126.
Li, L.-P. & Wang, L. (2009, June 12–14). Hybrid algorithms based on harmony search and differential evolution for global optimization. In GEC, Shanghai, China (pp. 271–278).
Li, H.-Q., Li, L., Kim, T.-H., & Xie, S.-L. (2008). An improved PSO-based of harmony search for complicated optimization problems. International Journal of Hybrid Information Technology, 1, 91–98.
Li, Y., Chen, J., Liu, R., & Wu, J. (2012, June 10–15). A spectral clustering-based adaptive hybrid multi-objective harmony search algorithm for community detection. In IEEE World Congress on Computational Intelligence (WCCI), Brisbane, Australia (pp. 1–8). IEEE.
Liao, T. W. (2010). Two hybrid differential evolution algorithms for engineering design optimization. Applied Soft Computing, 10, 1188–1199.
Mahdavi, M., & Abolhassani, H. (2009). Harmony K-means algorithm for document clustering. Data Mining and Knowledge Discovery, 18, 370–391.
Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation, 188, 1567–1579.
Mahdavi, M., Chehreghani, M. H., Abolhassani, H., & Forsati, R. (2008). Novel meta-heuristic algorithms for clustering web documents. Applied Mathematics and Computation, 201, 441–451.
Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Ser, J. D., Bilbao, M. N., Salcedo-Sanz, S., & Geem, Z. W. (2013). A survey on applications of the harmony search algorithm. Engineering Applications of Artificial Intelligence, 26, 1818–1831. http://dx.doi.org/10.1016/j.engappai.2013.05.008.
Merzougui, A., Hasseine, A., & Laiadi, D. (2012). Application of the harmony search algorithm to calculate the interaction parameters in liquid–liquid phase equilibrium modeling. Fluid Phase Equilibria, 324, 94–101.
Miguel, L. F. F., & Miguel, L. F. F. (2012). Shape and size optimization of truss structures considering dynamic constraints through modern metaheuristic algorithms. Expert Systems with Applications, 39, 9458–9467.
Mirkhani, M., Forsati, R., Shahri, A. M., & Moayedikia, A. (2013). A novel efficient algorithm for mobile robot localization. Robotics and Autonomous Systems, 61, 920–931. http://dx.doi.org/10.1016/j.robot.2013.04.009.
Moeinzadeh, H., Asgarian, E., Zanjani, M., Rezaee, A., & Seidi, M. (2009). Combination of harmony search and linear discriminate analysis to improve classification. In Proceedings of the Third Asia International Conference on Modelling and Simulation (AMS) (pp. 131–135). IEEE.
Mohammadi, M., Houshyar, A., Pahlavanhoseini, A., & Ghadimi, N. (2011). Using harmony search algorithm for optimization the component sizing of plug-in hybrid electric vehicle. International Review of Electrical Engineering, 6, 2990–2999.
Mora-Gutiérrez, R. A., Ramírez-Rodríguez, J., & Rincón-García, E. A. (2012). An optimization algorithm inspired by musical composition. Artificial Intelligence Review. doi:10.1007/s10462-011-9309-8.
Mora-Meliá, D., Iglesias-REY, P. L., Lopez-Patiño, G., & Fuertes-Miquel, V. S. (2009, October 29–30). Application of the harmony search algorithm to water distribution networks design. In G. Palau-Salvador (Ed.), International Workshop on Environmental Hydraulics, IWEH09, Valencia, Spain (pp. 265–271). CRC Press.
Mukhopadhyay, A., Roy, A., Das, S., Das, S., & Abraham, A. (2008). Population-variance and explorative power of harmony search: an analysis. In Third International Conference on Digital Information Management (ICDIM) (pp. 775–781). IEEE.
Mun, S., & Cho, Y.-H. (2012). Modified harmony search optimization for constrained design problems. Expert Systems with Applications, 39, 419–423.
Mun, S., & Geem, Z. W. (2009). Determination of viscoelastic and damage properties of hot mix asphalt concrete using a harmony search algorithm. Mechanics of Materials, 41, 339–353.
Nadi, F., Khader, A. T., & Al-Betar, M. A. (2010, July 7–11). Adaptive genetic algorithm using harmony search. In Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO), Portland, Oregon, USA (pp. 819–820).
Omran, M. G. H., & Mahdavi, M. (2008). Global-best harmony search. Applied Mathematics and Computation, 198, 643–656.
Pan, Q.-K., Suganthan, P. N., Tasgetiren, M. F., & Liang, J. J. (2010a). A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation, 216, 830–848.
Pan, Q.-K., Tasgetiren, M. F., Suganthan, P. N., & Liang, Y.-C. (2010b, July 18–23). Solving lot-streaming flow shop scheduling problems using a discrete harmony algorithm. In IEEE World Congress on Computational Intelligence (WCCI), CCIB, Barcelona, Spain (pp. 4134–4139). IEEE.
Pan, Q.-K., Suganthan, P. N., Liang, J. J., & Tasgetiren, M. F. (2011a). A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Systems with Applications, 38, 3252–3259.
Pan, Q.-K., Wang, L., & Gao, L. (2011b). A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Applied Soft Computing, 11, 5270–5280.
Pandi, V. R., & Panigrahi, B. K. (2011). Dynamic economic load dispatch using hybrid swarm intelligence based harmony search algorithm. Expert Systems with Applications, 38, 8509–8514.
Pandi, V. R., Panigrahi, B. K., Bansal, R. C., Das, S., & Mohapatra, A. (2011). Economic load dispatch using hybrid swarm intelligence based harmony search algorithm. Electric Power Components and Systems, 39, 751–767.
Piperagkas, G. S., Konstantaras, I., Skouri, K., & Parsopoulos, K. E. (2012). Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics. Computers and Operations Research, 39, 1555–1565.
Purnomo, H. D., Wee, H. M., & Praharsi, Y. (2012). Two inventory review policies on supply chain configuration problem. Computers and Industrial Engineering, 63, 448–455.
Qin, A. K. & Forbes, F. (2011a, July 12–16). Dynamic regional harmony search with opposition and local learning. In Annual Conference on Genetic and Evolutionary Computation (GECCO), Dublin, Ireland (pp. 53–54).
Qin, A. K. & Forbes, F. (2011b, July 12–16). Harmony search with differential mutation based pitch adjustment. In Annual Conference on Genetic and Evolutionary Computation (GECCO), Dublin, Ireland (pp. 545–552).
Ramos, C. C. O., Souza, A. N., Chiachia, G., Falcão, A. X., & Papa, J. P. (2011). A novel algorithm for feature selection using harmony search and its application for non-technical losses detection. Computers and Electrical Engineering, 37, 886–894.
Razfar, M. R., Zinati, R. F., & Haghshenas, M. (2011). Optimum surface roughness prediction in face milling by using neural network and harmony search algorithm. International Journal of Advanced Manufacturing Technology, 52, 487–495.
Ryu, S., Heyl, C. N., Duggal, A. S., & Geem, Z. W. (2007, June 10–15). Mooring cost optimization via harmony search. In 26th International Conference on Offshore Mechanics and Arctic Engineering (EMAE), San Diego, California, USA (pp. 1–8). ASME.
Ser, J. D., Matinmikko, M., Gil-López, S., & Mustonen, M. (2012). Centralized and distributed spectrum channel assignment in cognitive wireless networks: A harmony search approach. Applied Soft Computing, 12, 921–930.
Shahrouzi, M., & Sazjini, M. (2012). Refined harmony search for optimal scaling and selection of accelerograms. Scientia Iranica, Transactions A: Civil Engineering, 19, 218–224.
Shariatkhah, M.-H., Haghifam, M.-R., Salehi, J., & Moser, A. (2012). Duration based reconfiguration of electric distribution networks using dynamic programming and harmony search algorithm. Electrical Power and Energy Systems, 41, 1–10.
Shi, F., Xia, X., Chang, C., Xu, G., Qin, X., & Jia, Z. (2011). An application in frequency assignment based on improved discrete harmony search algorithm. Procedia Engineering, 24, 247–251.
Sirjani, R., Mohamed, A., & Shareef, H. (2011). Optimal capacitor placement in three-phase distribution systems using improved harmony search algorithm. International Review of Electrical Engineering, 6, 1783–1793.
Sivasubramani, S., & Swarup, K. S. (2011a). Environmental/economic dispatch using multi-objective harmony search algorithm. Electric Power Systems Research, 81, 1778–1785.
Sivasubramani, S., & Swarup, K. S. (2011b). Multi-objective harmony search algorithm for optimal power flow problem. Electrical Power and Energy Systems, 33, 745–752.
Taherinejad, N. (2009). Highly reliable harmony search algorithm. In European Conference on Circuit Theory and Design (ECCTD) (pp. 818–822). IEEE.
Taleizadeh, A. A., Niaki, S. T. A., & Barzinpour, F. (2011). Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: A harmony search algorithm. Applied Mathematics and Computation, 217, 9234–9253.
Taleizadeh, A. A., Niaki, S. T. A., & Seyedjavadi, S. M. H. (2012). Multi-product multi-chance-constraint stochastic inventory control problem with dynamic demand and partial back-ordering a harmony search algorithm. Journal of Manufacturing Systems, 31, 204–213.
Tasgetiren, M. F., Bulut, O., & Fadiloglu, M. M. (2012, June 10–15). A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy. In IEEE World Congress on Computational Intelligence (WCCI), Brisbane, Australia (pp. 1–8). IEEE.
Vasebi, A., Fesanghary, M., & Bathaee, S. M. T. (2007). Combined heat and power economic dispatch by harmony search algorithm. Electrical Power and Energy Systems, 29, 713–719.
Venkatesh, S. K., Srikant, R., & Madhu, R. M. (2010, January 22–23). Feature selection and dominant feature selection for product reviews using meta-heuristic algorithms. In Proceedings of the Compute’10, Bangalore, Karnataka, India (pp. 1–4). ACM.
Vural, R. A., Bozkurt, U., & Yildirim, T. (2013). Analog active filter component selection with nature inspired metaheuristics. International Journal of Electronics and Communications, 67, 197–205.
Wang, C.-M., & Huang, Y.-F. (2010). Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications, 37, 2826–2837.
Wang, L., & Li, L.-P. (2012). A coevolutionary differential evolution with harmony search for reliability–redundancy optimization. Expert Systems with Applications, 39, 5271–5278.
Wang, L., & Li, L.-P. (2013). An effective differential harmony search algorithm for the solving non-convex economic load dispatch problems. Electrical Power and Energy Systems, 44, 832–843.
Wang, X., Gao, X.-Z., & Ovaska, S. J. (2009). Fusion of clonal selection algorithm and harmony search method in optimization of fuzzy classification systems. International Journal of Bio-Inspired Computation, 1, 80–88.
Wang, L., Pan, Q.-K., & Tasgetiren, M. F. (2010). Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Systems with Applications, 37, 7929–7936.
Wang, L., Pan, Q.-K., & Tasgetiren, M. F. (2011). A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Computers and Industrial Engineering, 61, 76–83.
Weyland, D. (2010). A rigorous analysis of the harmony search algorithm: How the research community can be misled by a “novel” methodology. International Journal of Applied Metaheuristic Computing, 1–2, 50–60.
Wong, W. K., & Guo, Z. X. (2010). A hybrid intelligent model for medium-term sales forecasting in fashion retail supply chains using extreme learning machine and harmony search algorithm. International Journal of Production Economics, 128, 614–624.
Yadav, P., Kumar, R., Panda, S. K., & Chang, C. S. (2011). An improved harmony search algorithm for optimal scheduling of the diesel generators in oil rig platforms. Energy Conversion and Management, 52, 893–902.
Yadav, P., Kumar, R., Panda, S. K., & Chang, C. S. (2012). An intelligent tuned harmony search algorithm for optimisation. Information Sciences, 196, 47–72.
Yaşar, C., & Özyön, S. (2011). A new hybrid approach for nonconvex economic dispatch problem with valve-point effect. Energy, 36, 5838–5845.
Yi, L., & Goldsmith, J. (2010). Decision-theoretic harmony: A first step. International Journal of Approximate Reasoning, 51, 263–274.
Yildiz, A. R. (2008). Hybrid Taguchi-harmony search algorithm for solving engineering optimization problems. International Journal of Industrial Engineering, 15, 286–293.
Zarei, O., Fesanghary, M., Farshi, B., Saffar, R. J., & Razfar, M. R. (2009). Optimization of multi-pass face-milling via harmony search algorithm. Journal of Materials Processing Technology, 209, 2386–2392.
Zhang, Z.-N., Liu, Z.-L., Chen, Y., & Xie, Y.-B. (2013). Knowledge flow in engineering design: an ontological framework. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 227, 760–770.
Zhao, S.-Z. & Suganthan, P. N. (2010, July 18–23). Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search. In IEEE World Congress on Computational Intelligence (WCCI), CCIB, Barcelona, Spain (pp. 1983–1990). IEEE.
Zhao, S.-Z., Suganthan, P. N., Pan, Q.-K., & Tasgetiren, M. F. (2011). Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Systems with Applications, 38, 3735–3742.
Zinati, R. F., & Razfar, M. R. (2012). Constrained optimum surface roughness prediction in turning of X20Cr13 by coupling novel modified harmony search-based neural network and modified harmony search algorithm. International Journal of Advanced Manufacturing Technology, 58, 93–107.
Zou, D., Gao, L., Li, S., Wu, J., & Wang, X. (2010a). A novel global harmony search algorithm for task assignment problem. The Journal of Systems and Software, 83, 1678–1688.
Zou, D., Gao, L., Wu, J., & Li, S. (2010b). Novel global harmony search algorithm for unconstrained problems. Neurocomputing, 73, 3308–3318.
Zou, D., Gao, L., Wu, J., Li, S., & Li, Y. (2010c). A novel global harmony search algorithm for reliability problems. Computers and Industrial Engineering, 58, 307–316.
Zou, D., Gao, L., Li, S., & Wu, J. (2011a). An effective global harmony search algorithm for reliability problems. Expert Systems with Applications, 38, 4642–4648.
Zou, D., Gao, L., Li, S., & Wu, J. (2011b). Solving 0–1 knapsack problem by a novel global harmony search algorithm. Applied Soft Computing, 11, 1556–1564.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Xing, B., Gao, WJ. (2014). Music Inspired Algorithms. In: Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms. Intelligent Systems Reference Library, vol 62. Springer, Cham. https://doi.org/10.1007/978-3-319-03404-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-03404-1_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03403-4
Online ISBN: 978-3-319-03404-1
eBook Packages: EngineeringEngineering (R0)