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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2010
|
| 在線閱讀: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|