Directed mutation in genetic algorithms
β Scribed by Dinabandhu Bhandari; Nikhil R. Pal; Sankar K. Pal
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 801 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Bertoni, A. and M. Dorigo, Implicit parallelism in genetic algorithms (Research Note), Artificial Intelligence 61 (1993) 307-314. This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n3/c,VTl to the number of schemata usefu
A new genetic algorithm based on multi-niche crowding is capable of efficiently locating all the peaks of a multi-modal function. By associating these peaks with the utility accrued from different sets of decision variables it is possible to extend the use of genetic algorithms to multi-criteria dec