Empirical investigation of the benefits of partial lamarckianism

Evolutionary Computation

Volumn 5, Issue 1, 1997, Pages 31-60

  Houck, Christopher R ^a   Kay, Michael G ^a   Joines, Jeffery A ^a   Wilson, James R ^a  

^a North Carolina State University   (United States)

Author keywords

Baldwin effect; Hybrid genetic algorithms; Lamarckian evolution; Local improvement procedures

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPARATIVE STUDY; EVOLUTION; GENOTYPE; MUTATION; NONLINEAR SYSTEM; PHENOTYPE;

ALGORITHMS; EVOLUTION; GENOTYPE; MODELS, GENETIC; MUTATION; NONLINEAR DYNAMICS; PHENOTYPE;

EID: 0031082512     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1997.5.1.31     Document Type: Article

References (23)

1. Chu, P., & Beasley, J. (1995). A genetic algorithm for the generalized assignment problem (Tech. Rep.). London: The Management School Imperial College.
2. Cooper, L. (1972). The transportation-location problems. Operations Research, 20, 94-108.
3. Corana, A., Marchesi, M., Martini, C., & Ridella, S. (1987). Minimizing multimodal functions of continuous variables with the "simulated annealing" algorithm. ACM Transactions on Mathematical Software, 13(3), 262-280.
4. Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
5. Duncan, D. (1975). t-tests and intervals for comparisons suggested by the data. Biometrics, 31, 339-359.
6. Einot, I., & Gabriel, K. (1975). A study of the powers of several methods of multiple comparisons. Journal of the American Statistical Association, 70(351), 574-583.
7. Goldberg, D. (1989). Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison-Wesley.
8. Grace, A. (1992). Optimization toolbox user's guide. Natick, MA: Math Works.
9. Gruau, F., & Whitley, D. (1993). Adding learning to the cellular development of neural networks. Evolutionary Computation, 1, 213-233.
10. Hinton, G., & Nolan, S. (1987). How learning can guide evolution. Complex Systems, 1, 495-502.
11. Holland, J. (1975). Adaptation in natural and artificial systems. PhD thesis, University of Michigan, Ann Arbor.
12. Homaifar, A., Guan, S., & Liepins, G. E. (1993). A new approach on the traveling salesman problem by genetic algorithms. In S. Forrest (Ed.), Proceedings of the 5th International Conference on Genetic Algorithms (pp. 460-466). San Mateo, CA: Morgan Kaufmann.
13. Houck, C. R., Joines, J. A., & Kay, M. G. (1996). Comparison of genetic algorithms, random restart, and two-opt switching for solving large location-allocation problems. Computers and Operations Research, 23(6), 587-596.
14. Joines, J., Culbreth, C., & King, R. (1996). Manufacturing cell design: An integer programming model employing genetic algorithms. HE Transactions, 28(1), 69-85.
15. Joines, J., & Houck, C. (1994). On the use of non-stationary penalty functions to solve constrained optimization problems with genetic algorithms. In Z. Michalowicz, J. D. Schaffer, H.-P. Schwefel, D. G. Fogel, & H. Kitano (Eds)., Proceedings of the First IEEE Conference on Evolutionary Computation (Vol. 2, pp. 579-584). Piscataway, NJ: IEEE Press.
16. Joines, J., King, R., & Culbreth, C. (1995). The use of a local improvement beuristic with a genetic algorithm for manufacturing cell design. (Tech. Rep. NCSU-IE 95-06). Department of Industrial Engineering. Raleigh, NC: North Carolina State University.
17. Lawrence, C., Zhou, J. L. & Tits, A. L. (1994). User's guide for CFSQP version 2.4: A C code for solving (large scale) constrained nonlinear (minimax) optimization problems, generating iterates satisfying all inequality constraints (Tech. Rep. TR-94016rl). College Park, MD: University of Maryland, Electrical Engineering Department and Institute for Systems Research.
18. Love, R., & Juel, H. (1982). Properties and solution methods for large location-allocation problems with rectangular distances. Journal of the Operations Research Society, 33, 443-452.
19. Love, R., & Morris, J. (1975). A computational procedure for the exact solution of location-allocation problems with rectangular distances. Naval Research Logistics Quarterly, 22, 441-453.
20. Michalewicz, Z. (1996). Genetic algorithms + data structures = evolutionary programs. (3rd ed.). New York: Springer-Verlag.
21. Michalewicz, Z., & Nazhiyath, G. (1995). Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In D. B. Fogel (Ed.), Proceedings of the Second IEEE International Conference on Evolutionary Computation (Vol. 1, pp. 647-651). Piscataway, NJ: IEEE Press.
22. Mitchell, M. (1996). An introduction to genetic algorithms. Cambridge, MA: MIT Press.
23. More, J.J., Garbow, B., & Hillstrom, K. (1981). Testing unconstrained optimization software. ACM Transactions on Mathematical Software, 7(1), 17-41.