Publication: Hybrid Taguchi-harmony search algorithm for solving engineering optimization problems
Date
Authors
Yıldız, Ali Rıza
Authors
Advisor
Language
Type
Publisher:
University of Cincinnati Industrial Engineering
Journal Title
Journal ISSN
Volume Title
Abstract
Harmony search algorithms have recently gained a lot of attention from the optimization research community. In this paper, an improved harmony search algorithm is introduced to solve engineering optimization problems. To demonstrate the effectiveness and robustness of the proposed approach, it is applied to an engineering design and manufacturing optimization problem taken from the literature. The results obtained by the new hybrid harmony search approach for the case studies are compared with a hybrid genetic algorithm, scatter search algorithm, genetic algorithm, and feasible direction method and handbook recommendation. The results of case studies show that the proposed optimization approach is highly competitive and that can be considered a viable alternative to solve design and manufacturing optimization problems.
Significance: This paper presents a novel hybrid algorithm based on harmony search algorithm and Taguchi method. The new approach is applied to the case studies for turning and milling and design optimization problems.
Description
Source:
Keywords:
Keywords
Mulipass turning operations, Genetic algorithm, Machining conditions, Topology design, Shape optimization, Parameters, Harmony search algorithm, Design optimization, Taguchi method, Turning, Milling (machining), Learning algorithms, Research, Engineering design, Engineering optimization problems, Feasible direction methods, Harmony search algorithms, Hybrid genetic algorithms, Optimization approach, Optimization problems, Research communities, Scatter search algorithm, Taguchi, Design, Engineering
Citation
Yıldız, A. R. (2008). '' Hybrid Taguchi-harmony dearch algorithm for solving engineering optimization problems''. International Journal of Industrial Ergineering-Theory Applications and Practice, 15(3), 286-293.