2016
DOI: 10.1007/s40092-016-0170-x
|View full text |Cite
|
Sign up to set email alerts
|

A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems

Abstract: In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition, the proposed hybrid algorithm uses SA to make a balance between exploration and exploitation phases. The proposed hy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 31 publications
0
7
0
Order By: Relevance
“…Further, there are plenty of real-world problems that may be challenging to solve with limited resources of time. Even though the traditional methods of mathematical programming are ideal to deal with problems of a small-scale and is also posed to solve instances of a large-scale for the Non-Deterministic Polynomial (NP)-hard problems [7]. There have been plenty of metaheuristic algorithms working with several mechanisms inspired from the physical, mechanical, cultural, political, economic, social and natural concepts.…”
Section: Sathish K Srinivasanmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, there are plenty of real-world problems that may be challenging to solve with limited resources of time. Even though the traditional methods of mathematical programming are ideal to deal with problems of a small-scale and is also posed to solve instances of a large-scale for the Non-Deterministic Polynomial (NP)-hard problems [7]. There have been plenty of metaheuristic algorithms working with several mechanisms inspired from the physical, mechanical, cultural, political, economic, social and natural concepts.…”
Section: Sathish K Srinivasanmentioning
confidence: 99%
“…Choose two learners, P and Q so that (7) Now g to step (3) for the subsequent iteration and repeat until such time a predefined number of generations are met or this is done after a certain acceptable solution is found…”
Section: Teaching-learning-based Optimization (Tlbo) Algorithmmentioning
confidence: 99%
“…Glover et al (1999) presented the successful development of OptQuest, an optimization tool box containing different algorithms (mainly metaheuristics) designed to optimize configuration decisions in simulation models. OptQuest uses iterative heuristics (Kleijnen 2008), and it can be used to utilize a combination of three meta-heuristics: Scatter Search (SS), Tabu Search (TS), and Neural Networks (NN) (Glover et al 1999;Keskin et al 2010;Abtahi and Bijari 2017). An example of successful application of scatter search within OptQuest is reported by Bulut (2001), to solve a multi-scenario optimization problem based on a large-scale linear programming problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Meta-heuristics are popular optimization algorithms, often used to solve large-scale complex optimization problems in various fields (Abtahi and Bijari 2016;Javanmard and Koraeizadeh 2016;Moradgholi et al 2016). In the research of Shao et al (2009), a genetic algorithmbased method was used for optimization of two functions: process planning and scheduling.…”
Section: Literature Reviewmentioning
confidence: 99%