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...
Kaydedildi:
Yazar: | Nazif, Habibeh |
---|---|
Materyal Türü: | Tez |
Dil: | English |
Baskı/Yayın Bilgisi: |
2010
|
Online Erişim: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Benzer Materyaller
-
Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
Yazar:: Nazif, Habibeh
Baskı/Yayın Bilgisi: (2010) -
Optimised crossover genetic algorithms for combinatorial optimisation problems /
Yazar:: Nazif, Habibeh. -
Genetic algorithms with optimised crossover operator
Yazar:: Nazif, Habibeh, ve diğerleri
Baskı/Yayın Bilgisi: (2009) -
Optimised crossover genetic algorithm for capacitated vehicle routing problem
Yazar:: Nazif, Habibeh, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Fuzzy genetic algorithms for combinatorial optimisation problems
Yazar:: Varnamkhasti, Mohammad Jalali
Baskı/Yayın Bilgisi: (2012)