A genetic algorithm with disruptive selection

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 26, Issue 2, 1996, Pages 299-307

  Kuo, Ting ^a   Hwang, Shu Yuen ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ESTIMATION; FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING; SAMPLING;

CONVERGENCE ANALYSIS; DECEPTIVE FUNCTION; DISRUPTIVE SELECTION; NONMONOTONIC FITNESS FUNCTION;

GENETIC ALGORITHMS;

EID: 0030128491     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.485880     Document Type: Article

References (33)

1. D. H. Ackley, A Connectionist Machine for Genetic Hillclimbing. Boston, MA: Kluwer, 1987.
2. J. E. Baker, "Adaptive selection methods for genetic algorithms," in Proc. First Int. Conf. on Genetic Algorithms and Their Applications. Hillsdale, NJ: Lawrence Erlbaum, 1985, pp. 101-111.
3. _, "Reducing bias and inefficiency in the selection algorithm," in Proc. Second Int. Conf. on Genetic Algorithms and Their Application. Hillsdale, NJ: Lawrence Erlbaum, 1987, pp. 14-21.
4. B. Bhanu, S. Lee, and J. Ming, "Self-optimizing image segmentation system using a genetic algorithm," in Proc. Fourth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 362-369.
5. G. A. Cleveland and S. F. Smith, "Using genetic algorithms to schedule flow shop releases," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989, pp. 160-169.
6. K. Deb, J. Horn, and D. E. Goldberg, "Multimodal deceptive functions," Univ. of Illinois at Urbana-Champaign, IlliGAL Report no. 92003, 1992.
7. K. A. DeJong, "An analysis of the behavior of a class of genetic adaptive systems," Ph.D. dissertation, Univ. Mich., Ann Arbor, MI, 1975.
8. _, "Learning with genetic algorithms: An overview," Machine Learning, vol. 3, pp. 121-138, 1988.
9. M. Dorigo and U. Schnepf, "Genetic-based machine learning and behavior-based robotics: A new synthesis," IEEE Trans. Syst., Man, Cybern., vol. 23, no. 1, pp. 141-154, 1993.
10. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer, "Biases in the crossover landscape," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA, Morgan Kaufmann, 1989, pp. 10-19.
11. D. E. Goldberg and R. Lingle, Jr., "Alleles, loci, and traveling salesman problem," in Proc. First Int. Conf. on Genetic Algorithms and Their Applications. Hillsdale, NJ: Lawrence Erlbaum, 1985, pp. 154-159.
12. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
13. D. E. Goldberg and K. Deb, "A comparative analysis of selection schemes used in genetic algorithms," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, 1991, pp. 69-93.
14. J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. V. Gucht, "Genetic algorithms for the traveling salesman problem," in Proc. First Int. Conf. on Genetic Algorithms and Their Applications. Hillsdale, NJ: Lawrence Erlbaum, 1985, pp. 160-168.
15. J. J. Grefenstette, "Optimization of control parameters for genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. SMC-16, no. 1, pp. 122-128, 1986.
16. _, "Credit assignment in rule discovery systems based on genetic algorithms," Machine Learning, vol. 3, pp. 225-245, 1988.
17. J. J. Grefenstette and J. E. Baker, "How genetic algorithms work: A critical look at implicit parallelism," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989, pp. 20-27.
18. J. J. Grefenstette, "Deception considered harmful," in Foundations of Genetic Algorithms 2, D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1992, pp. 75-91.
19. S. A. Harp, T. Samad, and A. Guha, "Towards the genetic synthesis of neural networks," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989, pp. 360-369.
20. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Mich. Press, 1975.
21. _, "Searching nonlinear functions for high values," Appl. Math. Comp., vol. 32, pp. 255-274, 1989.
22. C. L. Karr, "Design of an adaptive fuzzy logic controller using a genetic algorithm," in Proc. Fourth Int. Conf. on Genetic Algorithms.. San Mateo, CA: Morgan Kaufmann, 1991, pp. 450-457.
23. K. Kristinsson and G. A. Dumont, "System identification and control using genetic algorithms," IEEE Trans. Syst., Man, and Cybern., vol. 22, no. 5, pp. 1033-1046, 1992.
24. T. Kuo and S. Y. Hwang, "A genetic algorithm with disruptive selection," in Proc. Fifth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1993, pp. 65-69.
25. G. E. Liepins and M. D. Vose, "Deceptiveness and genetic algorithm dynamics," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, 1991, pp. 36-50.
26. B. F. J. Manly, The Statistics of Natural Selection on Animal Populations. London, UK: Chapman and Hall, 1984.
27. G. F. Miller, P. M. Todd, and S. U. Hegde, "Designing neural networks using genetic algorithms," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA, Morgan Kaufmann, 1989, pp. 379-384.
28. J. D. Schaffer and A. Morishima, "An adaptive crossover distribution mechanism for genetic algorithms," in Proc. Second Int. Conf. on Genetic Algorithms and Their Applications. Hillsdale, NJ: Lawrence Erlbaum Associates, 1987, pp. 36-40.
29. G. Syswerda, "Uniform crossover in genetic algorithms," in Proc. Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1989, pp. 2-9.
30. G. Syswerda and J. Palmucci, "The application of genetic algorithms to resource scheduling," in Proc. Fourth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 502-508.
31. D. Whitley and J. Kauth, "GENITOR: a different genetic algorithm," in Proc. Rocky Mountain Conf. on Artificial Intelligence, 1988, pp. 118-130.
32. D. Whitley, "Fundamental principles of deception in genetic search," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kaufmann, 1991, pp. 221-241.
33. S. W. Wilson, "GA-easy does not imply steepest-ascent optimizable," in Proc. Fourth Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 85-89.