2012
DOI: 10.1016/j.ins.2011.12.035
|View full text |Cite
|
Sign up to set email alerts
|

An Intelligent Tuned Harmony Search algorithm for optimisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
78
0
1

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 180 publications
(79 citation statements)
references
References 52 publications
0
78
0
1
Order By: Relevance
“…• HS and six variants: Chaos HS (CHS) [3], Mahdavi HS (MHS) [21]; Global-best HS (GHS) [25], Selfadaptative GSH (SGHS) [33], Intelligent Tunned HS (ITHS) [41]; and Novel Global HS (NGHS) [4];…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…• HS and six variants: Chaos HS (CHS) [3], Mahdavi HS (MHS) [21]; Global-best HS (GHS) [25], Selfadaptative GSH (SGHS) [33], Intelligent Tunned HS (ITHS) [41]; and Novel Global HS (NGHS) [4];…”
Section: Resultsmentioning
confidence: 99%
“…Recently, Yadav et al [41] have introduced a new HS variant called Intelligent Tunned HS (ITHS), which still depends on parameters used in the original HS, i.e., it does not introduce new parameters as stated by some aforementioned HS-based approaches. Additionally, PAR is automatically computed in ITHS, instead of traditional HS, in which the user needs to input it.…”
Section: Evolutionary Optimization Backgroundmentioning
confidence: 99%
“…As a result, different instances require different implementations and configurations in designing the algorithms. There are, however, a group of problems represented with a common XML structure but associated with different constraints and objectives [26]. Some effort has also been made in the literature to construct relatively general frameworks [31,32].…”
Section: Problem Descriptionmentioning
confidence: 99%
“…The idea is adapted in the search process for solving optimization problems [19]. HSA can be categorized as a recent evolutionary algorithm and showed to be efficient in solving difficult optimization problems such as university course timetabling [20], vehicle routing [21], Sudoku Puzzle [22], and many others [23][24][25][26][27].…”
Section: Introductionmentioning
confidence: 99%
“…When applied to numerical optimization problems, it tends to perform badly in local searching. Lots of improved HS algorithms have been presented to enhance the performance of the HS algorithm [23,25,26]. Inspired by quantum computing, a new variation of the HS algorithm called quantum harmony search algorithm (QHS) is proposed in this paper.…”
Section: Quantum Harmony Search (Qhs) Algorithmmentioning
confidence: 99%