Genetic Algorithms in Engineering Design

Main.GeneticAlgorithms History

Hide minor edits - Show changes to output

January 11, 2013, at 02:26 PM by -
Deleted lines 16-17:

January 11, 2013, at 02:24 PM by -
Changed lines 20-22 from:
!!!! Additional Information

* [[ | Box Car 2D Genetic Algorithm Example

 <div id="disqus_thread"></div>
   <script type="text/javascript">
        var disqus_shortname = 'apmonitor'; // required: replace example with your forum shortname

        /* * * DON'T EDIT BELOW THIS LINE * * */
        (function() {
            var dsq = document.createElement('script'); dsq.type = 'text/javascript'; dsq.async = true;
            dsq.src = 'http://' + disqus_shortname + '';
] || document.getElementsByTagName('body')[0]).appendChild(dsq);
    <noscript>Please enable JavaScript to view the <a href="">comments powered by Disqus.</a></noscript>
    <a href="" class="dsq-brlink">comments powered by <span class="logo-disqus">Disqus</span></a>
January 09, 2013, at 12:35 AM by -
Changed line 22 from:
[[ | Box Car 2D Genetic Algorithm Example]]
* [[ | Box Car 2D Genetic Algorithm Example]]
January 09, 2013, at 12:35 AM by -
Added lines 17-22:


!!!! Additional Information

[[ | Box Car 2D Genetic Algorithm Example]]
December 22, 2012, at 04:15 PM by -
Added lines 1-16:
(:title Genetic Algorithms in Engineering Design:)
(:keywords genetic algorithms, continuous optimization, mathematical modeling, discrete optimization, nonlinear, optimization, engineering optimization, interior point, active set, differential, algebraic, modeling language, university course:)
(:description One often encounters problems in which design variables must be selected from among a set of discrete values:)

[[Attach:chap5_genetic_algorithms.pdf | Chapter 5: Genetic Algorithms]]

Gradient-based algorithms have some weaknesses relative to engineering optimization.  Specifically, it is difficult to use gradient-based algorithms for optimization problems with:
# discrete-valued design variables
# large number of design variables
# multiple local minima, maxima, and saddle points
# nondifferentiable objectives and constraints
# analysis programs which crash for some designs

In recent years, a new family of optimization algorithms has emerged for dealing with the above characteristics. These algorithms are known as evolutionary algorithms.  Evolutionary algorithms mimic the optimization process in nature as it optimizes biological species in order to maximize survival of the fittest. One type of evolutionary algorithm is the genetic algorithm. We will examine genetic algorithms in detail. 

We express appreciation to Professor Richard J. Balling of the Civil and Environmental Engineering Department at BYU for allowing us to use this chapter.