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...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Thesis |
| Jezik: | English |
| Izdano: |
2010
|
| Online dostop: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Komentirajte kot prvi!