Professional Documents
Culture Documents
Genetic Algorithm Notes
Genetic Algorithm Notes
Design Phase I
1. Problem Formulation
- define problem
- select objectives & constraints
- identify design options
2. Problem Optimization
- select potential solution
- use simulation model to evaluate potential solution and retrieve data/information
3. Final Solution
Decision Variable
Potential solution (size of search space) = no. of options no. of decision variables
Steps of GA
-Determines the minimum objective function in the current generation
-Tournament Selection
- cross over
- mutation
Coding Scheme’s:
Binary: binary coding also discretised search space because binary coding causes redundancy
to the search, end up having search space with large portion of the area with void, or no
solution
Real Number: real number discretised search space, solutions with real number may not exist
in the real world or not commercially available
Integer:
Sensitivity Analysis
- number of evaluation
- population
- crossover rate
- mutation rate
Constraint Method
Impact of penalty function
If the penalty is too small:
The algorithm fails to differentiate infeasible solutions from the feasible solutions
Common GA operator
Crossover (exploration and exploitation, 0.6 - 0.8)
- encourages convergence on a specific point in the search space
- When the number of decision variables are small, crossover rate has a big impact because
the majority of the genes in the sequence will be exchanged (encourages exploration)
Selection (exploitation)
Elitism (exploitation)
- archives the best solution of each generation
Common GA parameter
-population size
-probability of crossover
- probability of mutation
Random Seed
does not control GA search behaviour, it represents different initial search starting point,
pinpoints different locations on the fitness landscape. it represents the random and stochastic
nature of the GA
Sensitivity Analysis
- look at the average of objective function (the lower the better)
- the variability (range of minimum and maximum)
- if two points of the convergence are found, choose the one with the lower number because
the computation cost is lower
Equifinality
A given end state can be reached by many potential means
Integer
Real number
Binary coding
2. If you are asked to determine the water allocation volume to different farmers in an
irrigation district within a growth season, which of the following coding scheme should be
used?
Integer
Real number
Binary coding
3. For an optimization run, if the population used is 50, cross over probability is 0.9,
mutation probability is 0.1 and total generation is 100, which of the following statement
could be correct?
This is because cross over and mutation do not happen all the time so some of the
solutions are carried over to the next generation/iterations and it is unnecessary to evaluate
it again.
5. For the following pareto-optimal front obtained from minimizing both objective functions,
if the GHG objective is converted to the constraint when the constraint method is used,
which of the following sets of constraint values may lead to all solutions?
100, 110, 120, 130, …., 990
100, 500, 900
100,300, 900
100, 700, 900
Geotechnical
Advantages
• Non-destructive and/or non-invasive • Fast and economical testing
• Applicable to soils and rocks
• Disadvantages
• No samples or direct physical penetration • Models assumed for interpretation
• Affected by cemented layers or inclusions • Results influenced by water, clay, & depth
Lecture 5-2
Profiling using qc and Rf
insignificant in soil with drained response to cone penetration, or where the undrained
shear strength is high
Lecture 6-1
Estimating/measuring permeability
1. Laboratory method
- constant head test (suitable for sandy soils with high permeability)
- falling-head test (suitable for clayey soils with low permeability)
2. In-situ method
- pumping-well test
1. relatively reliable in-situ average permeability
2. high cost, long time
- infilling-well test
1.
3. Empirical method
Falling Head Test
Lecture 6-2
Darcy’s Law does NOT apply to dense clay and turbulent flow.
Lecture 7-2
Seepage force j: the pushing and dragging to the skeleton per unit volume by the flow.
Heaving –
Boiling- when the upward seepage force exceeds downward force (effective weight )of the
soil
Piping – fine particles in cohesionless soils translate through the pores of large particles
and pipe forms
Lecture 8-1
Types of Landslide
Fall:
is the detachment of soil or rock from steep slopes along the surface.
Topple:
is the forward rotation of soil or rock mass about a point.
Slide:
is the downslope displacement of soil or rock masses. It can be: rotational, translational, and
debris slide
Spread:
is the sudden movement of water bearing rock masses.
Flow:
is the continuous movement of soil masses where shear surfaces are short lived.
Lecture 8-2