Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. Most of the current methods of crossover determine o®spring by using a stochastic approach and without reference to the objective func...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2010
|
| Online Access: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|