OPTIMIZING TECHNIQUE-GRENADE

EXPLOSION METHOD
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

ABSTRACT

Grenade explosion method is a population based new met heuristic technique. The fundamental
concepts and ideas which underlie the method are fully explained. It is seen that this simple and
robust algorithm is quite powerful in finding all global and some local optima of multimodal
functions. The method is tested with several multimodal benchmark functions and the results
show it usually converges to the global minima faster than other evolutionary methods such
Genetic Algorithm (GA) and Artificial Bee Colony (ABC). Based on the performance on
classical benchmark functions, the efficiency of the method in solving engineering applications
can be highly appreciated.

Grenade explosion method this technique is designed by Aharari and Atai by observing the
grenade explosion phenomenon. Actually when grenade explosed, a piece of shrapnel can
damage the object which are whin a certaion distance Le from explosion site. This distance is
called the lengths of explosion.the loss due to each piece of shrapnel is computed and a high
value of loss per shrapnel the presense of valuable object in the vicinity of the explosion site.
Tthere fore to inflict more loss, the next grenade should be thrown where we got maximum loss.
In this method the fitness is the loss occurred at the collision location.

2
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 1

INTRODUCTION

1.1 Optimization

Optimization is the act of obtaining the best result under the given circumstances. In
design construction and maintenance of any engineering system, many technological and
managerial decisions have to be taken at several stages. The ultimate goal of all such decisions
is either to minimize the effort required or to maximize the desired benefit. Hence optimization
can be defined as the process of finding the conditions that give the minimum or maximum
value of a function, where the function represents the effort required or the desired benefit.
This module starts with a glance through the historical development of optimization methods.
Engineering applications of optimizations are scanned through from which one would get a
broad picture of the multitude of applications. The Art of modeling is briefly explained with
the various phases involved in modeling. In the second lecture various components of the
Optimization problem are discussed and summarized with steps involved in formulating a
mathematical programming problem. In the third lecture the optimization problems are
classified under criteria to enable choosing an appropriate model applicable to different types
of optimization problems. In the final lecture an introduction to the classical and advanced
optimization techniques in use are given. Normative economic decision analysis involves
determining the action that best achieves a desired goal or objective. This means finding the
action that optimize (that is, maximizes or minimizes) the value of an objective function. In a
production problem, the goal may be to find the combination of inputs (resources) that
minimizes the cost of producing a desired level of output. In capital budgeting problem, the
objective may be to select those projects that maximize the net present value of the investments
chosen. There are many techniques for solving optimization problems such as these.
Optimization problems are examined. Optimization techniques are a powerful set of tools that

3
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

are important in efficiently managing an enterprises and resources and thereby maximizing
shareholder wealth.

1.2 NEEDS HAVE ADVANCED OPTIMIZING TECHNIQUE

Many difficulties such as multi-modality, dimensionality and differentiability are associated with
the optimization of large-scale problems. Traditional techniques such a steepest decent, linear
programming and dynamic programming generally failto solve such large-scale problems
especially with nonlinear objective functions. Most of the traditional techniques require gradient
information and hence it is not possible to solve none differ differentiable functions with the help
of such traditional techniques. Moreover, such techniques often fail to solve optimization
problems that have many local optima. To overcome these problems, there is a need to develop
more powerful optimization techniques and research is going on to find effective optimization
techniques.

4
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 2

TYPES OF OPTIMIZING TECHNIQUE

2.1 Classical Optimization Techniques

These methods assume that the function is differentiable twice with respect to the design
variables and the derivatives are continuous. Three main types of problems can be handled by the
classical optimization techniques:
single variable functions
multivariable functions with no constraints,
Multivariable functions with both equality and inequality constraints.
In problems with equality constraints the Lagrange multiplier method can be used. If the problem
has inequality constraints, the Kuhn-Tucker conditions can be used to identify the optimum
solution. These methods lead to a set of nonlinear simultaneous equations that may be difficult to
solve.

2.2 Advanced Optimization Techniques

Some well-known population-based advanced optimization techniques developed are:
Genetic Algorithms (GA) which works on the principle of the Darwinian theory of the survival-
of-the fittest and the theory of evolution of the living beings; Artificial Immune Algorithms
(AIA) which works on the principle of immune system of the human being; Ant Colony
Optimization (ACO) which works on the principle of foraging behavior of the ant for the food;
Harmony Search (HS) which works on the principle of music improvisation in a music player;
Shuffled Frog Leaping (SFL) which works on the principle of communication among the frogs,
Artificial Bee Colony (ABC) which works on the principle of foraging behavior of a honey bee;
Grenade Explosion Method (GEM)which works on the principle of explosion of grenade. These
algorithms have been applied to many engineering optimization problems and proved effective to

5
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

solve some specific kind of problems. All the above-mentioned algorithms are nature inspired
population-based optimization methods, but they have some limitations in one or the other
aspect.

CHAPTER 3

CASE STUDY- GRENADE EXPLOSION METHOD

Grenade explosion method is a population based new met heuristic technique designed
by Aharari and Atai by observing the grenade explosion phenomenon. Grenade Explosion
Method (GEM) which works on the principle of explosion of grenade. Actually when grenade
explosed, a piece of shrapnel can damage the object which are when a certain distance Le from
explosion site. This distance is called the length of explosion. The loss due to each piece of
shrapnel is computed and a high value of loss per shrapnel the presence of valuable object in the
vicinity of the explosion site. Therefore to inflict more loss, the next grenade should be thrown
where we got maximum loss. In this method the fitness is the loss occurred at the collision
location
The grenade optimization techniques are useful in finding the optimum solution or
unconstrained maxima or minima of continuous and differentiable functions. These optimizing
methods and make use of differential calculus in locating the optimum solution. .
This work presents a new optimization technique called Grenade Explosion Method
(GEM). The fundamental concepts and ideas which underlie the method are fully explained. It is
seen that this simple and robust algorithm is quite powerful in finding all global and some local
optima of multimodal functions Three main types of problems can be handled by the this
optimization techniques,viz. single variable functions, multivariable functions with no
constraints and multivariable functions with both equality and inequality constraints. For
problems with equality constraints the Lagrange multiplier method can be used. If the problem
has inequality constraints, the Kuhn-Tucker conditions can be used to identify the optimum
solution. These methods lead to a set of nonlinear simultaneous equations that may be solve
easily.
GEM is an iterative algorithm that begins by generating a population of solution randomly
where each solution point represents the location of grenades. So nube of grenade Ng is the

6
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

population size. Only restriction on initial population is that each member should be a distance of
Rt from other member, Rt is called agent territory radious and is an important parameter of the
algorithm .a higher value of Rt ensures that solution points are widely spattered in search space,
where a low value Rt may yield solution point close to one another. The otter parameter Rt can
be adjusted during the iteration of the algorithm

3.1 Method

Genetic Algorithm

Genetic Algorithm (GA) works on the theory of Darin's theory of evolution and the survival-of-
the fittest . Genetic algorithms guide the search through the solution space by using natural
selection and genetic operators, such as crossover, mutation and the selection. GA encodes the
decision variables or input parameters of the problem into solution strings of a finite length.
While traditional optimization techniques work directly with the decision variables or input
parameters, genetic algorithms usually work with the coding. Genetic algorithms start to search
from a population of encoded solutions instead of from a single point in the solution space. The
initial population of individuals is created at random. Genetic algorithms use genetic operators to
create Global optimum solutions based on the solutions in the current population. The most
popular genetic operators are
(1) selection,
2) crossover and
(3) mutation.
The newly generated individuals replace the old population, and the evolution process proceeds
until certain termination criteria are satisfied.

7
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

3.2 Algorithm

Step 1: Initialize- GA parameters which are necessary for the algorithm

Step 2: Move-Generate random population equal to the population size specified
Step 3:Calculate-Obtain the values of the objective function for all the population members
Step 4: Choose-This step is for the selection procedure to form a mating pool which
consists of the population made up of best individuals
Step 5: This step is for the crossover where two individuals, known as parents, are
selected randomly from the mating pool to generate two new solutions known as
off-springs
Step 7: Best obtained results are saved using elitism
Step 8: Repeat the steps until the specified number of generations or
termination criterion is reached

8
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 4

CASE STUDY-OPTIMAL DESIGGN OF CAR SUSPENSION

The comfort riding a car largely depends on the suspension characteristics. The car body is
usually supported by a suspension oil spring and a damped rag teaches wheel .In order to
formulate the optima design problem, the first task is to identify them important design variables.
Sprung mass ms ,Fron tcoil stiffness kissFront un sprung mass mfu,Rearc oil stiffness k rs, Rear
un sprung mass mru ,Front tyres stiffness k distance ,
Polar moment tofu inertia of the car J,
other parameter are kept constant
ms=1000kgl=3.2m
mfu=70kgl1=1.6m

9
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

mru=150kgl2=1.6m
kft=20kg/mmJ=550kg-

When the four couple differential equations are solved ,the above constraint can be
computed by numerically differentiating the vertical movement of the sprung mass thrice with
respecttotime.The next task is to formulate the objective function .In this problem, the primary
objective is to minimize the transmissibility factor which is calculate dashertoo the bouncing
amplitude) of the sprung mass to the road excitation amplitude a Thus, we write the objective
functions The above objective function can be calculated from the solution on the four
differentiable quationsment Finally minimum and maximum emit for each design variable can
be set.Thi say require some previous experience with a car suspension design ,but the following
limits for the above car may in clued the optimal solution Thus, the above optimal car
suspension design problem can be written in NL Formats follows

10
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 5

APPLICATION

Design of a pressure vessel

The objective is to minimize the total cost of a pressure vessel considering the cost of material,
forming and welding. This problem has a nonlinear objective function with 3 linear and one
nonlinear inequality constraints and two discrete and two continuous design variables.
Design of tension/compression spring
The objective is to minimize the weight of a tension/compression spring subjected to one linear
and three nonlinear inequality constraints with three continuous design variables.
Design of welded beam
The objective is to design a welded beam for minimum cost. There are four continuous design
variables with two linear and five nonlinear inequality constraints.
Design of gear train
The objective is to minimize the weight of a gear train with one discrete and six continuous
design variables. There are 4 linear and 7 nonlinear inequality constraints. The peculiarity of this
problem is that there are four active constraints at the best known feasi

11
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

Multiple disc clutch brake

This problem is taken from [23]. Fig. 4 shows a multiple disc clutch brake. The objective is to
minimize the mass of the multiple disc clutch brake using five discrete variables: inner radius (ri
= 60, 61, 62, . . . , 80), outer radius (ro = 90, 91, 92, . . . , 110), thickness of discs (t =1,1.5,
2, 2.5, 3), actuating force (F = 600, 610, 620, . . . , 1000) and number of friction surfaces (Z =2,
3, 4, 5, 6, 7, 8, 9). 5.3.2.

Robot gripper

12
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

The objective is to minimize the difference between the maximum and minimum force applied
by the gripper for the range of gripper end displacements. There are 7 continuous design
variables (a, b, c, d, e, f , ), as shown in Fig. 5. There are six different constraints associated
with the robot gripper problem

Step-cone pulley

The objective is to design a 4 step-cone pulley with minimum weight using 5 design variables,
consisting of four design variables for the diameters of each step, with the fifth being the width
of the pulley. Fig. 6 shows a step-cone pulley. It is assumed in this example that the widths of the
cone pulley and belt are the same.There are 11 constraints, out of which 3 are equality
constraints and the remainder are inequality constraints.

13
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

. Belleville spring

The objective is to design a Belleville spring having minimum weight and satisfying a number of
constraints. The problem has 4 design variables: external diameter of the spring (De), internal
diameter of the spring (Di), thickness of the spring (t), and the height (h) of the spring, as shown
in Fig. 9. Of these design variables, t is a discrete variable and the remainder are continuous
variables. The constraints are for compressive stress, deflection, height to deflection, height to
maximum height, outer diameter, inner diameter, and slope6.
Most of these techniques require large number of evaluations of the objectives and the constraints.
The disciplinary models are often very complex and can take significant amount of time for a single
evaluation. The solution can therefore be extremely time-consuming

14
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 6

LITERATURE REVIEW

The following steps summarize the general procedure used to formulate and solve
optimization problems. Some problems may not require that the engineer follow the steps in the
exact order, but each of the steps should be considered in the process.
1) Analyze the process itself to identify the process variables and specific characteristics of interest,
i.e., make a list of all the variables.
2) Determine the criterion for optimization and specify the objective function in terms of the above
variables together with coefficients.
3) Develop via mathematical expressions a valid process model that relates the input-output variables
of the process and associated coefficients. Include both equality and inequality constraints. Use well
known physical principles such as mass balances, energy balance, empirical relations, implicit
concepts and external restrictions. Identify the independent and dependent variables to get the
number of degrees of freedom.
4) If the problem formulation is too large in scope:
break it up into manageable parts, or

simplify the objective function and the model

5) Apply a suitable optimization technique for mathematical statement of the problem.
Since many meta-heuristic algorithms that combine rules and randomness imitating
natural phenomena have been developed to overcome the computational drawbacks of existing
numerical algorithms (i.e., complex derivatives, sensitivity to initial values, and the large amount
of enumeration memory) when solving difficult and complex engineering optimization problems.
These algorithms include simulated annealing, tabu search, particle swarm algorithm, bee colony
search, ant colony search algorithm, firefly algorithm, genetic algorithm and other evolutionary
computation methods. From above mentioned problem solving techniques genetic algorithm is
widely used technique for optimization problems and it gives global solution of the problem.
G.R.Ahari . in 2003 developed a meta-heuristic algorithm having the purpose to produce better
solution than other existing algorithm in less number of iterations, which is explained in section

15
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

CHAPTER 7
CONCLUSION

So in this way we understand

The need and origin of the grenade optimization methods.

Various applications of grenade optimization methods used in mechanical engineering.

Define a grenade optimization problem and its various components.

Formulating grenade optimization problems as mathematical programming problems.

Classify grenade optimization problems and steps needed to solve the problem.

Studied the classical and advanced optimizing techniques in optimizations.

16
 OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

REFERENCE

Goldberg D. Genetic algorithms in search, optimization, and machine learning.

New York: Addison-Wesley; 1989.
Back T. Evolutionary algorithms in theory and practice. Oxford University Press; 1996.
Kennedy V, Eberhart R. Particle grenade optimization. In: Proceedings of the IEEE
International Conference on Neural Networks. 1995. p. 194248.
Clerc M. Particle grenade optimization. ISTE Publishing Company; 2006.
Karaboga D. An idea based on honey bee swarm for numerical optimization. Technical
report-TR06. Erciyes University, Engineering Faculty, Computer Engineering
Department. 2005.
Basturk B, Karaboga D. An artificial bee colony (ABC) algorithm for numeric function
optimization. In: IEEE Swarm Intelligence Symposium. 2006.
Karaboga D, Basturk B. On the performance of artificial bee colony (ABC) algorithm.

17
OPTIMIZING TECHNIQUE-GRENADE EXPLOSION METHOD

18