A non-revisiting genetic algorithm

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 4583-4590

  Yuen, Shiu Yin ^a   Chow, Chi Kin ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY PARTITIONING TREE; STOCHASTIC ALGORITHMS;

COMPUTATIONAL METHODS; RANDOM PROCESSES;

GENETIC ALGORITHMS;

EID: 55749094180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4425072     Document Type: Conference Paper

References (17)

1. F. Glover, "Tabu search: 1.," ORSA Journal on Computing, vol. 1, no. 3, pp. 190-206, 1989.
2. R.C. Eberhart and J. Kennedy, "A new optimizer using particle swarm theory," Proc. 6th Int. Symp. Micromachine Human Sci, vol. 1, pp. 39-43, 1995.
3. D.H. Wolpert and W.G. Macready, "No free lunch theorems for optimization," IEEE Trans, on Evolutionary Computation, vol. 1, no. 1,pp. 67-82, 1997.
4. J.H. Holland, Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, 1975.
5. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing, Springer 2003.
6. M.L. Mauldin, "Maintaining diversity in genetic search," Proc. National Conference on Artificiallntelligence, pp. 247-250, 1984.
7. L. Davis, Handbook of genetic algorithms, Van Nostrand Reinhold, New York, 1991.
8. S. Ronald, "Duplicate genotypes in a Genetic algorithm," Proc. IEEE Int. Conf. on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pp. 793-98, 1998.
9. nd Int. Conf. on Genetic Algorithms, Lawrence Erlbaum, pp. 41-49, 1987.
10. rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 116-121, 1989.
11. L.J. Eshelman, "The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination," Foundation of Genetic Algorithms, G.J. E. Rawlins, Ed., California: Morgan Kaufmann, pp. 265-283, 1991.
12. S.W. Mahfoud, "Crowding and preselection revisited," Parallel Problem Solvingfrom Nature 2, R Manner and B. Manderick, Eds., Amsterdam: North-Holland, pp. 27-36, 1992.
13. T. Back, "The interaction of mutation rate, selection and self-adaptation within a genetic algorithm", Parallel Problem Solving from Nature 2, R Manner and B. Manderick, Eds., Amsterdam: North-Holland, pp. 85-94, 1992.
14. T.E. Davis and J.C. Principe, "A Markov chain framework for the simple genetic algorithm," Evolutionary Computation, vol. 1(3), pp. 269-288, 1993.
15. A.E. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms", IEEE Transactions on Evolutionary Computation, vol. 3(2), pp. 124-141, 1999.
16. J. Knowles and D. Corne, "Properties of an adaptive archiving algorithm for storing nondominated vectors," IEEE Trans, on Evolutionary Computation, Vol. 7, no. 2, pp. 100-116, 2003.
17. nd Workshop on the Foundations of Genetic Algorithms (FOGA), D. Whitley, Ed., Morgan Kaufmann, San mateo, CA, pp. 109-126, 1993.