An improved harmony search algorithm for solving optimization problems

This paper develops an Improved harmony search (IHS) algorithm for solving optimization problems. IHS employs a novel method for generating new solution vectors that enhances accuracy and convergence rate of harmony search (HS) algorithm. In this paper the impacts of constant parameters on harmony s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 188; číslo 2; s. 1567 - 1579
Hlavní autoři: Mahdavi, M., Fesanghary, M., Damangir, E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY Elsevier Inc 15.05.2007
Elsevier
Témata:
Acceleration of convergence
Calculus of variations and optimal control
Exact sciences and technology
Global optimization
Harmony search algorithm
Heuristics
Mathematical analysis
Mathematical programming
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Sciences and techniques of general use
Global optimization
Heuristics
Harmony search algorithm
Mathematical programming
Search problem
Convergence acceleration
Optimization method
Search algorithm
Numerical analysis
Applied mathematics
Heuristic method
Problem solving
Convergence rate
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper develops an Improved harmony search (IHS) algorithm for solving optimization problems. IHS employs a novel method for generating new solution vectors that enhances accuracy and convergence rate of harmony search (HS) algorithm. In this paper the impacts of constant parameters on harmony search algorithm are discussed and a strategy for tuning these parameters is presented. The IHS algorithm has been successfully applied to various benchmarking and standard engineering optimization problems. Numerical results reveal that the proposed algorithm can find better solutions when compared to HS and other heuristic or deterministic methods and is a powerful search algorithm for various engineering optimization problems.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.11.033