Genetic algorithms for continuous problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2338, Issue , 2002, Pages 176-184

  Parker, James R ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; DIGITAL ARITHMETIC;

ADAPTIVE GA; CONTINUOUS OPTIMIZATION PROBLEMS; CONTINUOUS PROBLEMS; CROSSOVER OPERATIONS; ENCODING AND DECODING; FIXED POINTS; FLOATING POINT NUMBERS; MULTI MODAL FUNCTION;

GENETIC ALGORITHMS;

EID: 84974710148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47922-8_15     Document Type: Conference Paper

References (8)

1. Bohachevsky, I.O., Johnson, M.E. and Stein, M.L., Generalized simulated annealing for function optimization., Technometrics, Vol. 28, Pp. 209-217, 1986.
2. Stetson, P.B., DAOPHOT: A computer program for crowded-field stellar photometry., Pub. A. S. P., Vol. 191, 1987. Pp. 191-222
3. Parker, J.R., Algorithms for Image Processing and Computer Vision., John Wiley & Sons, New York. 1997.
4. Davis, L. (ed), Handbook of Genetic Algorithms., Van Nostrand Reinhold, New York NY, 1991.
5. Goldberg, D.E., Genetic Algorithms, Optimization, and Machine Learning., Addison-Wesley, Reading MA. 1989.
6. Holland, J.H., Adaptation in Natural and Artificial Systems., University of Michigan Press, Ann Arbor, MI. 1975.
7. Groisman, G. and Parker, J.R., Computer Assisted Photometry Using Simulated Annealing., Computers in Physics, Vol. 7 No. 1, Jan/Feb 1993. Pp. 87-96.
8. Mitchell, M., An introduction to genetic algorithms., The MIT Press, Cambridge, Mass., 1996