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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Lärdomsprov |
| Språk: | English |
| Publicerad: |
2010
|
| Länkar: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|