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...
Αποθηκεύτηκε σε:
Κύριος συγγραφέας: | Nazif, Habibeh |
---|---|
Μορφή: | Thesis |
Γλώσσα: | English |
Έκδοση: |
2010
|
Διαθέσιμο Online: | http://ethesis.upm.edu.my/id/eprint/6001/1/FS_2010_53.pdf |
Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
Παρόμοια τεκμήρια
-
Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
ανά: Nazif, Habibeh
Έκδοση: (2010) -
Optimised crossover genetic algorithms for combinatorial optimisation problems /
ανά: Nazif, Habibeh. -
Genetic algorithms with optimised crossover operator
ανά: Nazif, Habibeh, κ.ά.
Έκδοση: (2009) -
Optimised crossover genetic algorithm for capacitated vehicle routing problem
ανά: Nazif, Habibeh, κ.ά.
Έκδοση: (2012) -
Fuzzy genetic algorithms for combinatorial optimisation problems
ανά: Varnamkhasti, Mohammad Jalali
Έκδοση: (2012)