Escolar Documentos
Profissional Documentos
Cultura Documentos
International Journal of Physical, Nuclear Science and Engineering Vol:7 No:12, 2013
A. Encoding
The decision variables of a problem are normally encoded
into a finite length string this could be a binary string or a list
of integers.
For example: 0 1 1 0 1 1 0 1 0 or 2 3 4 1 1 4 5
I. INTRODUCTION
B. Selection
Genetic Algorithms are optimization algorithms that
maximize or minimize a given function. Selection operator
deserves a special position in genetic algorithm since it is the
one which mainly determines the evolutionary search spaces.
It is used to improve the chances of the survival of the fittest
individuals. There are many traditional selection mechanisms
used and many user specified selection mechanisms specific to
the problem definition [5].
The selection operator mainly works at the level of
chromosomes. The goodness of each individual depends on its
fitness. Fitness value may be determined by an objective
function or by a subjective judgment specific to the problem.
As the generations pass, the members of the population should
get fitter and fitter (i.e. closer and closer to the solution).
Selection is one of the important operations in the GA process.
Different selection mechanisms work well under different
situations. Appropriate method has to be chosen for the
specific problem to increase the optimality of the solution. For
example, the proportional roulette has been used in many
problems [6] and it outperformed the other strategies in the
salesman problem, achieving best solution quality with low
computing times [7].
The selection mechanisms are shown in Fig. 1.
C. Cross over
Crossover operator plays an important role in producing a
new generation. The crossover operator is a genetic operator
that combines (mates) two chromosomes (parents) to produce
a new chromosome (offspring). The idea behind crossover is
that the new chromosome may be better than both of the
parents if it takes the best characteristics from each of the
parents. Crossover occurs during evolution according to a user
definable crossover probability. There is number of cross over
operators [8], [9] such as:
4. Arithmetic Crossover
11001011 + 11011111 = 11001001 (AND)
5. Heuristic Crossover
6. Ring Crossover [8].
A number of test functions with various levels of difficulty
has been selected as a test polygon for determine the
performance of crossover operators [8], A new crossover
operator and probability selection technique is proposed by
[10] based on the population diversity using a fuzzy logic
controller, also the a new cross over operator introduced and
used in the information retrieval (IR) [11].
D. Mutation
Mutation involves the modification of the value of each
gene of a solution with some probability pm, (the mutation
II. GA EXAMPLE
B. Crossover
The crossover between two parents or two chromosomes
(prnt andprnt ) is the operation of intersection between tow
chromosomes to obtain new two children (offspring)
(ofs andofs ).To do the crossover we need to determine the
two individuals (prnt and prnt ) to be used as input to the
cross over function, also we need to determine the cross over
probability which has to be high (pc 0.7), and to determine
the number of bits for each variable in the individual nb for
coding.
,
and
each has
1
Compute the nearest integer to the
(i.e. the number of bits in each variable to
,
values
crossed over)
_ , of
1is a vector used to store the values of .
_
, to store the values of
at
in the
location
in _
de2bi: is to change the values from decimal to binary (code the
value) with the given number of bits
bi2de: is to change the values from binary to decimal (encode
the value)
1 1: _
:
equal the bits from 1 to the bit
number _
,
,
, ,
Example of cross over:
Let:
11 105 50
22 63 35
0.7
5 7 6 ,
1
5 0.7
2
7 0.7
3
6 0.7
_
4 5 4
2
1 ,5
2 11 , 5
0
1 ,5
2 22 , 5
1
2
1
2
0 1 0 1 0
10
1
2
1 0 1 1 1
23
2 ,7
2 105 , 7
2
1 1 0 1 0 0
2
2 ,7
2 63 , 7
0 1 1 1 1 1
2
2
1 1 0 1 0 1 1
2
2
0 1 1 1 1 0 1
3 ,6
2 50 , 6
2
1 1 0 0 1 0
2
3 ,6
2 35 , 6
1 0 0 0 1 1
3
2
1 1 0 0 1 1
3
2
1 0 0 0 1 0
11 105 50
22 63 35
10 107 51
23 61 34
4
5
4
1
0
0
1
1
1
1
0
1
1
107
61
Fig. 10 Crossover flow chart
51
34
C. Mutation
The mutation is an operation occurred to the individual
(chromosome) prnt which change the value of one bit ofs .
To do the mutation in a certain generation, all individuals
indvt are used as input to the mutation function; also the
number of bits of each variable nb has to be known, then in
the function the following are selected randomly:
1- The individual
.
2- The variable in the individual
.
3- The bit in the variable
.
,
,
[144].
Particle swaarm optimizaation has ro
oots in two main
component metthodologies. P
Perhaps more obvious are its ties
to artificial life (A-life) in ggeneral, and too bird flockinng, fish
s
theoory in particullar. It is also related,
r
schhooling, and swarming
hoowever, to evvolutionary coomputation, and has ties to
t both
genetic algorithm
ms and evoluttionary prograamming [15].
Hill climbinng is a veryy old and simple searcch and
opptimization algorithm for single objecttive functionss f. In
priinciple, hill cllimbing algoriithms perform
m a loop in whhich the
cuurrently know
wn best soluttion individuaal p
is used
u
to
prooduce one offfspring pnew
w. If this new individual iss better
thaan its parent, it replaces itt. Then, the cycle
c
starts all
a over
again. In this seense, it is sim
milar to an evoolutionary alggorithm
wiith a populatioon size psof 1..
Also, many other
o
methodss have been used
u
widely inn many
appplications succh as random ooptimization, simulated annnealing
annd extremely optimization
o
[14].
IV. GENEETIC ALGORITH
HM IN WATER
R PIPE SYSTEM
MS
Water distriibution systeems are usu
ually designned to
addequately satissfy the water rrequirements for
f a combinaation of
doomestic, comm
mercial, publicc and fire fightting purposes [16].
Millions of dollars are spennt each year on
o water distriibution
sysstems. Pipes optimization
o
ttechniques proovide an oppoortunity
forr potential savvings in costss for water sup
pply systems. These
opptimization techniques
t
include linear program
mming,
noonlinear progrramming, dynnamic program
mming, enum
merative
appproaches, annd genetic algorithms. The formerr four
tecchniques havee been appliedd to pipe netw
work optimizaation in
thee research literature over the last 30 years
y
or so. Genetic
G
alggorithms proovide a new
w approach to pipe network
opptimization [177].
A relatively comprehensiv
c
ve approach foor the use of genetic
g
alggorithms for pipe
p
networks optimization has been devveloped
ovver the last tenn years [4], [188]-[25].
Goldberg annd Kuo applied GAs to
o the steady
y state
opptimization off a serial liquiid pipeline. Thhe system connsisted
off 10 pipes andd 10 compressor stations each
e
containinng four
m
the power
puumps in seriess. The objecttive was to minimize
reqquirements, while suppllying a sppecified flow
w and
maaintaining alloowable pressures. The thrree operators found
near-optimal puump [4].
Murphy andd Simpson uused SGA (Structured
(
Genetic
G
f
the optim
mal solution of
o the networrk. The
Allgorithm) to find
meethod chooses the optimaal combinatioon among thee eight
altternative decisions possible for each off the eight deecision
vaariables (pipes) [18].
Jung and Kaarney describbe the optimaal selection of
o pipe
n
consiidering steadyy state and traansient
diaameters in a network
annalysis in waater distributiion systems. Two evoluttionary
appproaches, naamely geneticc algorithms (GA) and particle
p
sw
warm optimizaation (PSO) aare used as opptimization methods
m
to obtain pipe diiameters. Bothh optimization
n programs, innspired
byy natural evvolution andd adaptation
n, show exxcellent
performance foor solving m
moderately complex
c
reall-world
Fig. 11 The m
mutation flow chart
c
III. METH
HOD FOR SOLV
VING OPTIMIZA
ATION PROBLE
EMS
Ant Colony Optimization is based on the
t metaphor of ants
I order to doo so, an ant will
w leave thee anthill
seeeking food. In
annd begin to wander
w
into a random direction. While thhe little
innsect paces arround, it lays a trail of pheeromone. Thuus, after
thhe ant has fouund some foood, it can tracck its way baack. By
dooing so, it disttributes anotheer layer of pheeromone on thhe path.
A ant that sennses the pheroomone will foollow its traill with a
An
ceertain probabiility. Each annt that finds thhe food will excrete
soome pheromonne on the pathh. By time, thee pheromone density
off the path willl increase and more and mo
ore ants will foollow it
too the food andd back. The higher
h
the pheeromone denssity, the
m
more
likely will
w
an ant stay on a trail.
t
Howevver, the
phheromones vaaporize after some time. If all the food
f
is
coollected, they will no longger be reneweed and the paath will
diisappear afterr a while. N
Now, the antss will head to
t new,
raandom locationns [13], [14].
Particle Sw
warm Optimiization1 (PS
SO), developped by
Ebberhart and Kennedy,
K
is a form of sw
warm intelligeence in
w
which
the behavior of a bioloogical social system
s
like a flock
f
of
biirds or a schoool of fish is siimulated. Wheen a swarm loooks for
foood, its individ
duals will sprread in the envvironment andd move
arround indepeendently. Eacch individuall has a deg
gree of
freedom or ranndomness in itts movementss which enablles it to
mulations. So, sooner or laater, one of theem will
finnd food accum
finnd somethingg digestible annd, being social, announcess this to
itss neighbors. These
T
can thenn approach the source of foood, too
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
V. CONCLUSION
[19]
[20]
[21]
[22]
[23]
[24]
[25]