net/publication/271020225
CITATIONS READS
0 3,485
2 authors, including:
Metin Zeyveli
Karabuk University
13 PUBLICATIONS 42 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Metin Zeyveli on 19 January 2015.
E-mail: m_zeyveli@hotmail.com
b
Division of Design and Machine Building, Faculty of Technical Education,
E-mail: cgologlu@hotmail.com
Abstract
Engineering design is an iterative process that requires to be dealt with all feasible design
solutions in order to arrive at desired objective. Proper design of gearbox has a significant
place in power transmission applications. Traditional methods used in its design do not
have ability in automating the process. Thus, an attempt to automate preliminary design of
gearbox has been accomplished in the paper. A software to automate preliminary design
of gearbox with spur, helical and bevel gears was developed. In the software Genetic
Algorithm (GA) was applied to the problem with the objective function of minimising of
volume of gear trains. The objective function was constrained by bending strength,
contact stress, face width and number of pinion and gear teeth. The preliminary design
parameters module, number of teeth, and width of teeth for pinion and gear pairs of the
stages were optimised and gear ratios were determined in respect to the objective
function and design constraints. Design optimisation of a two stage gearbox by using GA
was accomplished by readily supplying the design parameters requested.
A gearbox utilises a group of gears to achieve a gear ratio between the driver and
driven shafts. The material volume of gear trains is the main determination factor in
sizing of this power transmitting units. Trail-and-error method is mainly used in
traditional design of gearbox. Researchers have developed several applications using
different design and calculation methods. A gearbox producing the required output
speed was designed by GA [1]. The objective function of the study was to determine
the number of shafts and number of teeth for each gear by GA. The objective function
was constrained by number of teeth of gear, maximum transmission ratio and
maximum number of shafts. An algorithm automating preliminary design of multi stage
gear drives was proposed [2]. The algorithm having four steps was run iteratively until a
desirable solution is found. The steps in the algorithm were mainly conducted
manually, by random search and generate and test methods. In last step, simulated
annealing algorithm has been used for minimising geometrical volume of a gearbox by
means of integrating dimensional and configuration design process. An optimal weight
design problem of a gear pair system was studied using GA [3]. The system was able
to find the number of design variables considering specified constraints. A generalised
optimal design formulation to gear trains was presented [4]. In the research, tradeoff
between surface fatigue life and minimum volume using a basic multiobjective
optimisation procedure was studied. The results were presented as a Pareto optimal
set representing a collection of optimal designs. A computer aided design of gears
approach was proposed [5] to optimise one stage gear pair. GA was employed for
minimising gear volume by reducing the distance between the centres of gear pairs,
and other parameters such as transmitting power, reduction ratio. In another study an
expert system composing of a GA module has been developed [6]. The GA module
was used for optimising volumes of pitch cylinders of gears for a single reduction
gearing system.
In this research, a genetic algorithm was used for preliminary design of gearbox. The
objective function was chosen as minimum material volume of gearbox. The
constraints of bending strength, contact stress, number of pinion and face width
parameters of helical gear pairs were employed as restrictions on design criteria.
725
of 17 ≤ z1,3 ≤ 24 where z1 and z3 are the numbers of teeth of pinions of first and
second stages respectively. Binary representation of the number of teeth of pinion is
also given in Table 1 as three bits. As it starts from the teeth number 17 so the method
at the representation of modules was used here. The interval for number of teeth of
gear is accepted as 35 ≤ z 2, 4 ≤145 where z2 and z4 are the numbers of teeth of gears
of first and second stages respectively. For binary representation of the gear teeth
number of z2 the method of Lin and Hajela [7] was used and it was presented with
seven bits. The face width b is determined at the beginning of design process based on
face width factor 19 ≤ ϕ m ≤ 40 and it is defined as b = ϕ m mn . The face width values
are presented as five bits in binary code at represented.
Design variables m1 z1 b1 z2 m2 z3 b2
4 bits 3 5 bits 7 bits 4 bits 3 5 bits
String length
bits bits
Sample design variables 1010 101 10010 1011100 0111 011 11001
Module m1 (1st stage)
Number of teeth of pinion z1 (1st stage)
Tooth (face) width b1 (1st stage)
Number of teeth of gear z2 (1st stage)
Module m2 (2nd stage)
Number of teeth of pinion z3 (2nd stage)
Tooth (face) width b2 (2nd stage)
A sample of design solution
1010101100101011100011101111001
(chromosome)
726
3. The objective function
In the study, minimisation of material volume is the objective function Fobj and it is
defined as:
where mn1 is the module of pinion and gear at first stage and mn2 is the module of
pinion of gear at second stage. z1 and z3 are the number of teeth of pinion at first stage
and number of teeth of pinion at second stage respectively. The width of gear pairs at
stages are presented by b1 and b2. The material volume of a helical pinion F1 is defined
as:
π 2
F1 = (mn1 z1 ) b1 (2)
4
In a two stage gearbox configuration, total volume of two pairs of helical gears FT can
be written as a function of module, number of teeth and width of gear (Eq. (3)).
π π
4
( 2
4
) ( 2
)
FT = F1 + F2 + F3 + F4 = (mn1 z1 ) + (mn1 z2 ) b1 + (mn 2 z3 ) + (mn 2 z4 ) b2 (3)
2 2
Then, the global objective function with constraints can be presented by:
Nconst
Fglabalobj = FT + ∑ rj (max [0, g j ( x)] ) (5)
j =1
By using Eq. (5), constraint optimisation problem has been become unconstrained
optimisation problem by introducing static penalty functions to the objective function.
The penalty coefficients, rj, for the j-th constraint have to be wisely selected. These
leads to the solutions are selected by trusting on proper values of penalty coefficients.
The weighting constraints by penalties are difficult to adjust and assigning right values
are essential to solutions compromised. By subtracting the function from a large
enough positive number F [8], the function becomes as
727
Nconst
Fobj = F − Fi + ∑ r j (max[0, g j x)]) (6)
j =1
The constraints g3 and g4 present similarly first and second pairs’ contact stress.
z + z1
g 3 ( x) = K d (K m K α K ε K β )2 Ft1 2 − b1 mn1 z 2 (Palw )2 ≤ 0 (9)
z1
z + z3
g 4 ( x) = K d (K m K α K ε K β )2 Ft 2 4 − b 2 mn 2 z 4 (Palw )2 ≤ 0 (10)
z3
The constraint g5 represents the pinion width constraint and g6 represents the gear
width constraints for the first stage.
Similarly, g7 and g8 represent the pinion width and gear width constraints for the
second stage respectively. Here, a premise of the width factor for helical gears is
chosen between 20 to 40 has been adopted in Eqs. (13)-(14).
g 7 ( x) = ((20 mn 2 ) − b2 ) ≤ 0 (13)
g8 ( x) = (b2 − (40 mn 2 )) ≤ 0 (14)
The constraints of g9 and g10 represent the number of teeth of pinions for first and
second stages respectively.
The number of teeth of gears for first and second stages is constrained by g11 and g12
respectively.
728
g11 ( x) = (35 − z 2, 4 ) ≤ 0 (17)
g12 ( x) = ( z 2, 4 − 145) ≤ 0 (18)
The GA parameters in the study were chosen as initial population = 50; number of
generations = 100, 200, and 500; crossover probabilities = 0.5, 0.7, and 0.9, mutation
probabilities = 0.1, 0.01, and 0.001. As crossover operator two-point crossover was
employed (Fig. 1) and as a selection mechanism, tournament selection was chosen
with 6 of tournament size. The GA was run with the mentioned number of generations
and it was seen that the objective function curve do not change at the generations after
100. Thus, the generation number 200 was admitted as a compromised one.
729
The crossover probabilities of 0.9, 0.7, and 0.5 were tried and the last crossover
probability of 0.5 was seen as the most appropriate (see Fig. 2).
19000
Cross. prob. of 0.9
17000 Cross. prob. of 0.7
Cross. prob. of 0.5
15000
13000
11000
Fitness
9000
7000
5000
3000
0 50 100 150 200
Generations
Based on the crossover probability of 0.5, the mutation probabilities of 0.1, 0.01, and
0.001 were tested. Fig. 3 shows the average fitness values obtained by the different
mutation probabilities. The most successful was seen as the mutation probability of
0.001. The minimum fitness values at crossover probability of 0.5 were given in Fig. 4.
Minimum and average fitness values at minimum crossover probability of 0.5 and
minimum mutation probability of 0.001 were depicted in Fig. 5.
43000
Fitness
33000
23000
13000
3000
0 50 100 150 200
Generations
730
8000
5500
5000
4500
4000
0 50 100 150 200
Generations
10000
Average fitness
9000
Minimum fitness
8000
6000
5000
4000
0 20 40 60 80 100 120 140 160 180 200
Generations
The result of GA gives the preliminary design optimisation variable values of two stage
gearbox (see Table 4).
731
Fig. 6 and Fig 7 show initial design parameter determination menu and the GA results
menu of the developed software respectively.
5. Conclusion
732
Nomenclature
References
[1] D.T. Pham, Y. Yang, Optimization of multi-model discrete functions using genetic
algorithms. Proc. Instn. Mech. Engrs. 207 (1993) 53-59
[2] T.H. Chong, I. Bae, G.J. Park, A new and generalized methodology to design multi
stage gear drives by integrating the dimensional and configuration design process.
Mechanism and Machine Theory 37 (2002) 295-310
[3] T. Yokota, T. Taguchi, M. Gen, A solution method for optimal weight design
problem of the gear using genetic algorithms. Computers ind. Engng. 35 (3-4)
(1998) 523-526
[4] D.F. Thompson, S. Gupta, A. Shukla, Tradeoff analysis in minimum volume design
of multi-stage spur gear reduction units. Mechanism and Machine Theory 35
(2000) 609-627
[5] J.L. Marcelin, Genetic optimisation of gears. Int J Adv Manuf Technol. 17 (2001)
910-915
[6] B. Abersek, V. Popov, Intelligent tutoring system for training in design and
manufacturing. Advances in Engineering Software 35 (2004) 461–471
[7] C.Y. Lin, P. Hajela, Genetic algorithms in optimization problems with discrete and
integer design variables. Engineering Optimization 19 (1992) 309–327
[8] D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning,
Addison Wesley, New York, 1989
733