A Dynamic Quality-Based Harmony Search Algorithm for Solving Constrained Engineering Optimization Problems

DOI

10.2991/cse.2013.18How to use a DOI?

Keywords

component; meta-heuristic; optimization; constrained problems; harmony search

Abstract

Meta-heuristic algorithms overcome the computational drawbacks of the existing numerical methods where they are commonly used to solve constrained engineering problems and find an optimum solution. Solving this kind of problems is considered of high value in many engineering and manufacturing processes. The author have recently published a dynamic and self-adaptive meta-heuristic that is based on the harmony search algorithm. The method has the advantage of dynamically setting optimization parameters based on quality measures that are computed during the optimization process. Testing showed superiority in solving continuous optimization problems with high dimensionality. In this work, the same method is applied with minor modifications to solve constrained engineering problems whereby the feasible search-space is shrunk due to the existing constraints making the problem more difficult. The results obtained are close to those achieved by some other recent meta-heuristic methods. However, there is a room for improvement.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ali Kattan
PY  - 2013/07
DA  - 2013/07
TI  - A Dynamic Quality-Based Harmony Search Algorithm for Solving Constrained Engineering Optimization Problems
BT  - Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013)
PB  - Atlantis Press
SP  - 72
EP  - 75
SN  - 1951-6851
UR  - https://doi.org/10.2991/cse.2013.18
DO  - 10.2991/cse.2013.18
ID  - Kattan2013/07
ER  -