The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection

IEEE Transactions on Systems, Man and Cybernetics

Volumn 24, Issue 1, 1994, Pages 73-86

  Potts, J Craig ^a   Giddens, Terri D ^a   Yadav, Surya B ^b  

^a WEST TEXAS A AND M UNIVERSITY   (United States)

^b TEXAS TECH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS;

ARTIFICIAL SELECTION; GENETIC ALGORITHM BASED ON MIGRATION AND ARTIFICIAL SELECTION (GAMAS); MIGRATION; PREMATURE CONVERGENCE;

ALGORITHMS;

EID: 0028341951     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.259687     Document Type: Article

References (49)

1. D. H. Ackley, “Stochastic iterated genetic hillclimbing,” Carnegie-Mellon Mellon University, CMU-CS-87-107, 1987.
2. C. A. Andenbrandt, “An extension the theory of convergence and a proof of the time complexity of genetic algorithms,” Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed., pp. 53–68, 1991.
3. T. Back and F. Hoffmeister, “Extended selection mechanisms in genetic algorithms,” in Proc. 4th Int. Conf. Genetic Algorithms, Univ. of California, San Diego, CA, 1991, pp. 99–99.
4. J. E. Baker, “Reducing bias and inefficiency in the selection algorithm,” in Proc. 2nd Ann. Conf. Genetic Algorithms, Mass. Inst. Technol., Cambridge, MA, 1985, pp. 14–21.
5. C. L. Bridges and D. E. Goldberg, “An analysis of reproduction and crossover in a binary-coded genetic algorithm,” in Proc. 2nd Annu. Conf. Genetic Algorithms, 1987, pp. 9–12.
6. R. G. Casey, “Allocation of copies of a file in an information system,” presented at the Spring Joint Comput. Conf., 1972.
7. Y. Davidor, “Analogous crossover,” in Proc. 3rd Int. Conf. Genetic Algorithms, George Mason Univ., Arlington, VA, 1989, pp. 98–103.
8. L. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand trand Reinhold, 1991.
9. “Applying adatpive algorithms to epistatic domains,” in Ninth Int. Joint Conf. Arti. Intell., Los Angeles, pp. 162–164, 1985.
10. “Adapting operator probabilities in genetic algorithms,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 61–69.
11. K. Deb and D. E. Goldberg, “An investigation of niche and species formation in genetic function optimization,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 42–50.
12. K. A. De Jong, “An analysis of the behavior of a class of genetic adaptive systems,” Ph.D. dissertation, Univ. Michigan. Dissertation Abstracts International, 36(10), 5140b. (University Microfilms No. 76–9381), 1975.
13. “Adaptive system design: A genetic approach,” IEEE Trans. Syst. Man Cyhern., vol. SMC-10, pp. 566–574, 1980.
14. L. Dowdy and D. Foster, “Comparative models of the file assignment problem,” Computing Surveys, Sept. 1981, pp. 287–313.
15. G. Edlin, Genetic Principles, Human and Social Consequences. Boston and Portola Valley: Jones and Bartlett, 1984.
16. L. J. Eshelman, R. A. Caruana, and J. D. Schaffer, “Biases in the crossover landscape,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 10–19.
17. Larry Eshelman, “The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination,” Foundations of Genetic Algorithms, pp. 265–283, 1991.
18. L. J. Eshelman and J. D. Shaffer, “Preventing premature convergence in Genetic algorithms by preventing incest,” in Proc. 4th Int. Conf. Genetic Algorithms, 1991; pp. 115–122.
19. T. C. Fogarty, “Varying the probability of mutation in the genetic algorithm,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 104–109.
20. D. E. Goldberg, “Genetic algorithms and rule learning in dynamic system control,” in Proc. Int. Conf. Genetic Algorithms and Their Applications, 1985, pp. 8–15.
21. D. E. Goldberg and J. Richardson, “Genetic algorithms with sharing for multimodal function optimization,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 41–49.
22. D. E. Goldberg and R. Lingle, “Alleles, loci, and the traveling salesman problem,” in Proc. Int. Conf. Genetic Algorithms and Their Applications, 1985, Pittsburg, PA, pp. 154–159.
23. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
24. “Genetic algorithms with sharing for multimodal function optimization,” in Genetic Algorithms and Their Applications: Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 41–49.
25. D. E. Goldberg and A. L. Thomas, Genetic Algorithms: A Bibliography 1962–1986 (TCGA Report No. 86001). Tuscaloosa, AL: University of Alabama, The Clearinghouse for Genetic Algorithms.
26. D. E. Goldberg and K. Deb, “A comparison analysis of selection schemes used in genetic algorithms,” Foundations of Genetic Algorithms, G. J. E. Rawlings, Ed., pp. 69–93, 1991.
27. D. E. Goldberg and P. Segrest, “Finite Markov chain analysis of genetic algorithms,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 1–8.
28. J. J. Grefenstette, “Optimization of control parameters for genetic algorithms,” IEEE Trans. Syst. Man Cybern., vol. SMC-16, pp. 122– 128,128, Jan./Feb. 1986.
29. J. J. Grefenstette and J. E. Baker, “How genetic algorithms work: A critical look at implicit parallelism,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 20–27.
30. J. J. Grefenstette, R. R. Gopal, and D. Van Gucht, “Genetic algorithms for the traveling salesman problem,” in Proc. Int. Conf. Genetic Algorithms and Their Applications, 1985, pp. 160–168.
31. J. H. Holland, “Genetic algorithms and the optimal allocations of trials,” SIAM J. Computing, vol. 2, no. 2, pp. 88–105, 1973.
32. J. H. Holland, Adaptation in Natural and Artificial Sytems. Ann Arbor, MI: University of Michigan Press, 1975.
33. “Genetic algorithms and classifier systems: Foundations and future directions,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 82–89.
34. S. J. Louis and G. J. E. Rawlins, “Designer genetic algorithms in structure design,” in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 53–60.
35. M. L. Mauldin, “Maintaining diversity in genetic search,” in Proc. Nat. Conf. Arti. Intell., 1984, pp. 247–250.
36. I. M. Oliver, D. J. Smith, and J. H. Holland, “A study of permutation crossover operators on the traveling salesman problem,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 82–89.
37. G. D. Oosthuizen, “SUPERGRAN: A connectionist approach to learning, integrating genetic algorithms, and graph induction,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 132–139.
38. A. V. Sannier II and E. D. Goodman, “Genetic learning procedures in distributed environments,” in Proc. 2nd Int. Conf Genetic Algorithms, 1987, pp. 162–169.
39. J. D. Schaffer and A. Morishima, “An adaptive crossover distribution mechanism for genetic algorithms,” in Proc. 2nd Int. Conf Genetic Algorithms, 1987; pp. 36–40.
40. J. D. Schaffer, R. A. Caruana, L. J. Eshelman, and R. Das, “A study of control parameters affecting online performance of genetic algorithms for function optimization,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 51–60.
41. W. M. Spears and K. A. De Jong, “An analysis of multi-point cross-over,” Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. pp. 301–315, 1991.
42. J. Y. Suh and D. Van Gucht, “Incorporating heuristic information into genetic search,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 100–107.
43. G. Syswerda, “Uniform crossover in genetic algorithms,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989; pp. 2–9.
44. “Schedule optimization using genetic algorithms,” in Hand-book of Genetic Algorithms, L. Davis, Ed. New York: Van Nostrand trand Reinhold, 1990, pp. 332–349.
45. R. Tanese, “Distributed genetic algorithms,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 434–439.
46. “Parallel genetic algorithm for a hypercube,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 177–183.
47. B. W. Wah, “File placement on distributed computer systems,” IEEE Trans. Comput., vol. 17, pp. 23–30, Jan. 1984.
48. D. Whitley, “Using reproductive evaluation to improve genetic search and heuristic discovery,” in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 108–115.
49. “The GENITOR algorithm and selection pressure: Why rank-based based allocation of reproductive trials is best,” in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 116–121.