Incremental Genetic Algorithm
Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. In many cases, problems undergo frequent minor modifications, each producing a new problem version. If these problems are not small in size, it becomes costly to use a g...
Saved in:
| Main Author: | Mansour, Nashat (author) |
|---|---|
| Other Authors: | Awad, Mohamad (author), El-Fakih, Khaled (author) |
| Format: | article |
| Published: |
2006
|
| Online Access: | http://hdl.handle.net/10725/2960 http://iajit.org/PDF/vol.3,no.1/7-Nashat.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Incremental & classical genetic algorithm. (c2001)
by: Awad, Mohamad M.
Published: (2001) -
An incremental approach for test scheduling and synthesis using genetic algorithms
by: Harmanani, H.
Published: (2017) -
An incremental approach for test synthesis and scheduling using genetic algorithms. (c2002)
by: Hajar, Aouni
Published: (2002) -
Parallel genetic algorithm for disease-gene association
by: Mansour, Nashat
Published: (2011) -
A hybrid genetic algorithm for task allocation in multicomputers
by: Mansour, Nashat
Published: (2018)