Hybrid Taguchi-Harmony Search Algorithm for Solving Engineering Optimization Problems Ali Rıza Yıldız Uludag University, Mechanical Engineering Department, 16059, Bursa, Turkey e-mail : [email protected] ; [email protected]

This paper describes a new optimization strategy that offers significant improvements in performance over existing methods to support multi-objective design optimization applications in industry. A new design optimization approach is based on two-stages which are (1) Taguchi’s robust design approach to find appropriate interval levels of design parameters (2) Harmony search algorithm to generate optimal multi-objective solutions using refined intervals from the previous stage. This research is the first application of harmony search algorithm to shape design optimization problems in the literature. The validity and efficiency of proposed new approach are evaluated and illustrated with multi objective twobar truss problem taken from literature. Finally, it is applied to the shape design optimization of a vehicle component to illustrate how the present approach can be applied for solving multi-objective shape design optimization problems. Keywords: Design optimization, Harmony search algorithm, Taguchi’s method, Robust Design

1. Introduction

In order to meet today`s competition requirements and to produce higher quality products at lower cost with shorter lead times, there is a crucial need to use new optimization techniques in industry. The real world design problems are usually multi-objective, often conflicting, and they have uncontrollable variations in their design parameters with complex nature. There is a need to obtain solutions that are multi-objectively optimum and insensitive to uncontrollable parameter variations. The whole problem must be taken as multi-objective with the Pareto optimal set instead of single objective optimization. It is difficult to design the best product by classical optimization methods under all these conditions. Classical optimization methods are not only time consuming in solving complex nature problems that include multivariable and multi-objective but also they may not be used efficiently in finding global or near global optimum solutions. In addition, they can stick to the local optimum values. Although classical optimization methods were widely used to solve multi-objective optimization problems in

design and manufacturing area, the inefficiency of classical methods in complex nature problems have forced researchers to search for new approaches. There is an increasing interest to apply the new approaches and to further improve the performance of multi-objective design optimization techniques for the solution of shape optimization problems. Although some improvements regarding multi-objective design optimization issues are achieved, the complexity of design problems with conflicting objectives presents shortcomings. The main goal of present research is to further develop and strengthen the harmony search algorithm based multiobjective optimization approach to generate real world design solutions. A new hybrid approach based on robustness issues are used to help better initialize harmony search algorithm search. It has been aimed to reach optimum designs by using Taguchi’s robust parameter design approach coupled with harmony search algorithms. In this new hybrid approach, S/N values are calculated and ANOVA (analysis of variance) table for each of the objectives are formed using S/N ratios respectively. According to results of ANOVA table, appropriate interval levels of design parameters are found and then, initial search population of harmony search algorithm process is defined according to these interval levels. Then, optimum results of multi-objective design optimization problem are obtained using harmony search algorithm. The validity and efficiency of proposed approach are evaluated and illustrated with a test problem of the two-bar truss design taken from literature. Then, a vehicle part design problem taken from automotive industry is introduced to demonstrate the application of the present approach to real world design problems. The results of the proposed multi-objective design optimization algorithm are better and more robust compared to computational experimental solutions of design optimization test problems.

2. Global optimization using harmony search algorithm and robust parameter design

A larger population makes the algorithm more likely to locate a good making string, but also increases the time taken by the algorithm. The problem with larger population is to tend evolutionary algorithms to converge and stick around certain solutions; therefore, there is a need to define the efficient range of population intervals to achieve better Pareto optimal sets in shorter times. This shortcoming is eliminated by introducing Taguchi’s based initial population.

The algorithm of proposed hybrid approach can be outlined as follows

BEGIN Step 1: Taguchi method’

Begin 1.a Choose convenient orthogonal array from Taguchi’s standard orthogonal arrays 1.b Define levels and intervals 1.c For i:=1 to NOE (number of experiments) do begin Compute objective function values end; 1.d Choose convenient S/N ratio type (smaller the best or larger the best or nominal the best) based on minimization or maximization of objective functions 1.e For i:=1 to NOE do begin Compute S/N ratios end; 1.f Constitute Anova table for objective functions using S/N ratios 1.g Determine optimum levels and intervals using percentage contribution to performance using Anova table Use these levels and intervals for forming initial population end; ‘Generate Pareto optimal set using harmony search algorithm and computed robust initial population space’ Begin Input Use Initial population found in previous part of the program as input to harmony search algorithm Step 2: Harmony search algorithm Step 1: Initialize the problem and algorithm parameters. Step 2: Initialize the harmony memory. Step 3: Improvise a new harmony. Step 4: Update the harmony memory. Step 5: Check the stopping criterion. end; END.

Hybrid Taguchi-Harmony Search Algorithm for Solving ...

Finally, it is applied to the shape design optimization of a vehicle component to illustrate how the present approach can be applied for solving multi-objective shape design optimization problems. Keywords: Design optimization, Harmony search algorithm, Taguchi's method, Robust Design. 1. Introduction. In order to meet ...

69KB Sizes 0 Downloads 235 Views

Recommend Documents

A Hybrid Genetic Algorithm with Pattern Search for ...
computer simulated crystals using noise free data. .... noisy crystallographic data. 2. ..... Table 4: Mean number of HA's correctly identified per replication and the ...

Hybrid Taguchi-Harmony Search Algorithm for
dsL= 1.0 mm ko= 0.5 $/min kt =2.5 $/edge h1= 7x10-4 h2= 0.3 tc =0.75 min/piece te = 1.5 min/edge p= 5 q= 1.75 r= 0.75. C0 = 6x1011. TU =45 min. TL= 25 min.

An efficient hybrid algorithm based on harmony search ...
different methods of structural optimization have been introduced which can be ... There are several papers utilizing heuristic methods in structural optimization field, but ... Corresponding author: Tel: +98-21-44202710; fax: +98-21-77240398.

Hybrid Search
statistics based IR methods for ranking, database methods ... best static features. .... Wang, H., Tran, T., Liu, C.: CE2: towards a large scale hybrid search engine.

Performance Evaluation of a Hybrid Algorithm for Collision Detection ...
and the performance of the algorithm was evaluated in terms of output ..... (c). Figure 1. The object's geometry and the object's spherical octree with 4 and 5 levels are shown in ..... [15] G. Rowe, Computer Graphics with Java, Palgrave,. 2001.

Performance Evaluation of a Hybrid Algorithm for Collision Detection ...
Extensive tests were conducted and the ... that this approach is recommendable for applications ..... performance in the previous tests for the broad phase.

Performance Evaluation of a Hybrid Algorithm for Collision Detection ...
are also approaches other than spatial partitioning data structures. ... from GPU memory is usually a very slow operation, making buffer ... data structures: grids and octrees. Finally, in ... partitioning the cells in a new grid when required (with.

A Hybrid Hardware-Accelerated Algorithm for High ...
octree data structures [27]. Hardware-accelerated .... nal rendering quality comparison (shown in Figure 4) to ..... Reality modeling and visualization from multiple.

TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing state- ful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, to explore the space of feasible tests efficiently, and novel qual- it

A Practical Algorithm for Solving the ... - Research at Google
Aug 13, 2017 - from the data. Both of these problems result in discovering a large number of incoherent topics that need to be filtered manually which limits the ...

A heuristic ant algorithm for solving QoS multicast ...
the network, real time services will be affected. ... quality ofreal time services can be guaranteed. ... (1) applying Dijkstra algorithm to find the shortest path, (2).

An algorithm for solving the open gallery problem
ABSTRACT. Given a polygon and a desired number of guards resulting after performing an reflex vertex straddling (RVS) deploy- ment or a polygonal ...

A Competent Genetic Algorithm for Solving Permutation ...
Jan 30, 2002 - ... Volume 6) (Genetic Algorithms and Evolutionary Computation) Q2 Cloud, TFT 2. ... algorithm, combines some of the latest in competent GA technology to ... Competent GAs are those designed for principled solutions of hard ...

An application of genetic algorithm method for solving ...
To expound the potential use of the approach, a case example of the city Kolkata, ... From the mid-'60s to early '70s of the last century, a .... early stage. ... objective Fk(X), k = 1, 2, ..., K. Then the fuzzy goal ..... enforcement of traffic rul

A multigrid-in-time algorithm for solving evolution ...
our multigrid-in-time algorithm simply calls an existing time-stepping routine. However, to ...... Algebraic Multigrid Cycle on HPC Platforms, in 25th ACM International Conference on Supercomputing,. Tucson, AZ ... App. Math. and Comp. Sci., 5.

An algorithm for symbolic solving of differential ...
The next step is solving the algebraic system with polynomial coefficients and the right ... ferential equations and computer algebra systems. Minsk (2005) 195-.

Novel Derivative of Harmony Search Algorithm for ...
is selected from the set of stored good values, with a probability of Pitch ..... Proceedings of the 26th International Conference on Offshore Mechanics and Arctic ...

A Block-Based Gradient Descent Search Algorithm for ...
is proposed in this paper to perform block motion estimation in video coding. .... shoulder sequences typical in video conferencing. The NTSS adds ... Hence, we call our .... services at p x 64 kbits,” ITU-T Recommendation H.261, Mar. 1993.

A harmony search algorithm for university course ...
School of Computer Sciences, Universiti Sains Malaysia, 11800 USM, Pinang, .... Network. His official home page is “http://www.dcs.napier.ac.uk/~benp/”. .... equal to HMS after assigning the courses by the weighted largest degree first.

An Efficient Pseudocodeword Search Algorithm for ...
next step. The iterations converge rapidly to a pseudocodeword neighboring the zero codeword ..... ever our working conjecture is that the right-hand side (RHS).

Refined Routing Algorithm in Hybrid Networks with ... - IEEE Xplore
Abstract—In this paper, a low-complexity routing strategy is introduced for a hybrid network in which wireless nodes are randomly located and multiple base ...

A Hybrid algorithm applied to facility location for forest ...
Abstract—This paper develops an integrated system for forest fire fighting facility location. We propose a mathematical model to deploy available fire fighting resources in proper positions so that any forest fire can be attacked within a specified

Quantum Search Algorithm with more Reliable Behaviour using Partial ...
School of Computer Science. University of Birmingham. Julian Miller ‡. Department of Electronics. University of York. November 16, 2006. Abstract. In this paper ...

A fast search algorithm for a large fuzzy database
a large fuzzy database that stores iris codes or data with a similar ... To deploy a large-scale biometric recognition system, the ... manipulating a file of this size.