![]() |
![]() |
|
Genetic Algorithms allow extremely complex problems to be automatically solved using basic aspects of natural evolution. Solutions are found by generating a pool of potential solutions and repeatedly keeping the best, while replacing the worst (with new combinations and random modifications of the best) until a final solution is reached. Given enough time, genetic algorithms can solve extremely difficult problems. One advantage is that once an acceptable solution is found, the search can stopped or continued in order to find an even better solution. Genetic algorithms have been used to design aircraft wing shape for optimum performance, create schedules for complex series of activities, and even simulate natural evolution’s design of creatures capable of swimming or walking. We are available for courses on genetic algorithms and consulting on genetic algorithm problems. |
|||||||
Copyright
©2003 by MHB, Inc. All rights reserved. MATLAB and SIMULINK are registered trademarks of The MathWorks, Inc. |