Results 261 to 270 of about 7,467 (294)
Some of the next articles are maybe not open access.
A Discrete Harmony Search Algorithm
2010Harmony search (HS), inspired by the music improvisation process, is a new meta-heuristic optimization method and has been used to tackle various optimization problems in discrete and continuous space successfully. However, the standard HS algorithm is not suitable for settling discrete binary problems.
Ling Wang +3 more
openaire +1 more source
Clustering using modified harmony search algorithm
International Journal of Computational Intelligence Studies, 2014Metaheuristic techniques are being successfully used as optimisation methods in various application areas. This paper presents modification in one such metaheuristic called as harmony search HS that is inspired from music improvisation process. The two parameters, harmony memory consideration rate HMCR and pitch adjusting rate PAR, in HS play important
Vijay Kumar 0003 +2 more
openaire +1 more source
Harmony Search Algorithm for Solving Sudoku
2007Harmony search (HS) algorithm was applied to solving Sudoku puzzle. The HS is an evolutionary algorithm which mimics musicians' behaviors such as random play, memory-based play, and pitch-adjusted play when they perform improvisation. Sudoku puzzles in this study were formulated as an optimization problem with number-uniqueness penalties.
openaire +1 more source
Adaptive genetic algorithm using harmony search
Proceedings of the 12th annual conference on Genetic and evolutionary computation, 2010Evolutionary algorithm is one of the major classes of stochastic search methods. This algorithm searches the problem space by exploring and exploiting the search space. The balance between exploration and exploitation will change throughout the search process.
Farhad Nadi +2 more
openaire +1 more source
An improved adaptive binary Harmony Search algorithm
Information Sciences, 2013Harmony Search (HS), inspired by the music improvisation process, is a new meta-heuristic optimization method and has been successfully used to tackle the optimization problems in discrete or continuous space. Although the standard HS algorithm is able to solve binary-coded optimization problems, the pitch adjustment operator of HS is degenerated in ...
Ling Wang 0009 +5 more
openaire +1 more source
Harmony Search Algorithm with Ensemble of Surrogate Models
2015Recently, Harmony Search Algorithm (HSA) is gaining prominence in solving real-world optimization problems. Like most of the evolutionary algorithms, finding optimal solution to a given numerical problem using HSA involves several evaluations of the original function and is prohibitively expensive.
Krithikaa Mohanarangam +1 more
openaire +1 more source
A Hybrid Harmony Search Algorithm for Numerical Optimization
2010 International Conference on Computational Aspects of Social Networks, 2010In the paper a novel harmony search (HS) algorithm based on opposition and differential evolution (ODHS) algorithm is proposed in order to solve high dimensional optimization problems. It provides a new architecture of hybrid algorithms, which organically merges the differential evolution (DE) into HS algorithm and the ODHS algorithm initializes the HM
openaire +1 more source
Stochastic co-derivative of harmony search algorithm
International Journal of Mathematical Modelling and Numerical Optimisation, 2011A novel stochastic co-derivative was developed based on the density information of multiple vectors in the harmony search (HS) algorithm. While the existing stochastic partial derivative represents the probability with which certain candidate value is selected when searching for a new vector, this co-derivative represents how much one variable in a ...
openaire +1 more source
Semi-self-adaptive harmony search algorithm
Natural Computing, 2017This paper proposes a semi-self-adaptive harmony search algorithm (SSaHS) with the self-adaptive adjustment of the bandwidth and the elitist learning strategy of particle swarm optimization. SSaHS employs a self-adaptive adjusting strategy for with the difference between the maximum and minimum components in the harmony memory as the bandwidth.
Xinchao Zhao +4 more
openaire +1 more source
Fine-grained Differential Harmony Search algorithm
2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), 2015A novel Fine-grained Differential Harmony Search algorithm (FDHS) is presented in this paper. The new algorithm incorporates differential mutation scheme with the pitch adjustment operator of Harmony Search (HS) algorithm. Meanwhile a fine-grained evaluation strategy is adopted inside pitch adjustment on every dimension instead of construction ...
Xiaoyu Lin +2 more
openaire +1 more source

