Chromosome Reuse in genetic algorithms

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

Volumn 2723, Issue , 2003, Pages 695-705

  Acan, Adnan ^a   Tekol, Yüce ^a  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CHROMOSOMES; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION PROBLEMS; CURRENT GENERATION; NOVEL GENETIC ALGORITHM; RECOMBINATION PROCESS; REUSE STRATEGY; SEARCH DIRECTION;

ALGORITHMS;

EID: 21144441305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_85     Document Type: Article

References (21)

1. Holland, J.H.: Adaptation in Natural and Artificial Systems: An introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, MIT Press, (1992).
2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, (1989).
3. Eshelman, L., Schaffer, J.: Foundations of Genetic Algorithms 2. In: L. Whitley (editor): pp. 187-202, Morgan Kaufmann Publishers, San Mateo, CA, (1993).
4. Back, T.: Evolutionary Algorithms in Theory and Practice, Oxford University Press, (1996).
5. Gen, M., Runwei, C.: Genetic Algorithms in Engineering Design, John Wiley & Sons. Inc., (1997).
6. Miettinen, K., Neitaanmaki, P., Makela, M.M., Periaux, J.: Evolutionary Algorithms in Engineering and Computer Science, John Wiley & Sons Ltd., (1999).
7. Cantu-Paz, E., Mejia-Olvera, M.: Designing efficient master-slave parallel genetic algorithms, IlliGAL Report No. 97004, Illinois Genetic Algorithm Laboratory, Urbana, IL, (1997).
8. Whitley, D., Starkweather, T.: GenitorII: A distributed genetic algorithm, Journal of Experimental and Theoretical Artificial Intelligence, (1990).
9. Eggermont, J., Lenaerts, T.: Non-stationary function optimization using evolutionary algorithms with a case-based memory, url:http://citeseer.nj.nec.com/484021.html.
10. Goldberg, D. E., Smith, R. E.: Non-stationary function optimization using genetic algorithms and with dominance and diploidy, Genetic Algorithms and their Applcations: Proceedings of the Second International Conference on Genetic Algorithms, p. 217-223, (1987).
11. Goldberg, D. E., Deb, K., Korb, B.: Messy Genetic Algorithms: Motivation, analysis, and the first results, Complex Systems, Vol. 3, No. 5, p. 493-530, (1989).
12. Lewis, J., Hart, E., Ritchie, G.: A comparison of dominance mechanisms and simple mutation on non-stationary problems, in Eiben, A. E., Back, T., Schoenauer, M., Schwefel, H. (Editors): Parallel Problem Solving from Nature- PPSN V, p. 139-148, Berlin, (1998).
13. Ryan, C., Collins, J. J.: Polygenic inheritance- a haploid scheme that can outperform diploidy, in Eiben, A. E., Back, T., Schoenauer, M., Schwefel, H. (Editors): Parallel Problem Solving from Nature- PPSN V, p. 178-187, Berlin, (1998)
14. Ryan, C.: The degree of oneness, Firts Online Workshop on Soft Computing, Aug. 19-30, (1996).
15. Ramsey, C.L., Grefenstette, J. J.: Case-based initialization of GAs, in Forest, S., (Editor): Proceedings of the Fifth International Conference on Genetic Algorithms, p. 84-91, San Mateo, CA, (1993).
16. Louis, S., Li, G.: Augmenting genetic algorithms with memory to solve travelling salesman problem, (1997).
17. Louis, S. J., Johnson, J.: Solving similar problems using genetic algorithms and case-based memory, in Back, T., (Editor):Proceedings of the Seventh International Conference on Genetic Algorithms, p. 84-91, San Fransisco, CA, (1997).
18. Luger, G.F.: Artificial Intelligence, 4th edition, Addison-Wesley, (2002).
19. S. Russel and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice-Hall, (1995).
20. http://www.f.utb.cz/people/zelinka/soma/func.html.
21. Kim, H.S., Cho, S.B: An Efficient genetic algorithm with less fitness valuations by clustering, Proc. of the 2001 IEEE Congress on Evolutionary Computation, p.887-894, Seoul, Korea, May 27-30, (2001).