Abstract
Genetic algorithms have attracted a good deal of interest in the heuristic search community. Yet there are several different types of genetic algorithms with varying performance and search characteristics. In this article we look at three genetic algorithms: an elitist simple genetic algorithm, the CHC algorithm and Genitor. One problem in comparing algorithms is that most test problems in the genetic algorithm literature can be solved using simple local search methods. In this article, the three algorithms are compared using new test problems that are not readily solved using simple local search methods. We then compare a local search method to genetic algorithms for geometric matching and examine a hybrid algorithm that combines local and genetic search. The geometric matching problem matches a model (e.g., a line drawing) to a subset of lines contained in a field of line fragments. Local search is currently the best known method for solving general geometric matching problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bäck, T., Hoffmeister, F., and Schwefel, H.P. (1991). A survey of evolution strategies. In L. Booker and R. Belew (Eds.),Proceedings of the Fourth International Conference on Gas (pp. 2–9). San Mateo, CA: Morgan Kaufmann.
Back, T., and Schwefel, H.P. (1993). An overview of evolutionary algorithms for parameter optimization.Evolutionary computation, 1, 1–23.
Beveridge, J. Ross. (1993). Local search algorithms for geometric object recognition: Optimal correspondence and pose. Ph. D. thesis, University of Massachusetts at Amherst.
Beveridge, J. Ross, and Riseman, E.M. (1995). Optimal geometric model matching under full 3D perspective.CVGIP: Image Understanding. (Short version in IEEE Second CAD-Based Vision Workshop).
Beveridge, J. Ross, Weiss, Rich, and Riseman, Edward M. (1989). Optimization of two-dimensional model matching. InProceedings: Image Understanding Workshop (pp. 815–830): Los Altos, CA: DARPA, Morgan Kaufmann.
Beveridge, J. Ross, Weiss, Rich, and Riseman, Edward M. (1989). Optimization of two-dimensional model matching. In Hatem Nasr (Ed.),Selected Papers on Automatic Object Recognition (originally appeared in DARPA Image Understanding Workshop). SPIE Milestone Series. Bellingham, WA: SPIE.
Bolles, R.C., and Cain, R.A. (1982). Recognizing and locating partially visible objects: The local-feature-focus method.International Journal of Robotics Research, 1(3), 57–82.
Collins, R.T., and Beveridge, J. Ross. (1993). Matching perspective views of coplanar structures using projective unwarping and similarity matching. InProceedings: 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 240–245). New York: IEEE.
Davis, Lawrence. (1991a). Bit-climbing, representational bias, and test suite design. In L. Booker and R. Belew (Eds.),Proceedings of the Fourth International Conference on GAs (pp. 18–23). San Mateo, CA: Morgan Kaufmann.
Davis, Lawrence. (1991b).Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold.
DeJong, Ken. (1975). An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Department of Computer and Communication Sciences, Ann Arbor.
Eshelman, Larry. (1991). The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In G. Rawlins (Ed.),FOGA-1 (pp. 265–283). San Mateo, CA: Morgan Kaufmann.
Fennema, Claude, Hanson, Allen, Riseman, Edward, Beveridge, J.R., and Kumar, R. (1990). Model-directed mobile robot navigation.IEEE Trans. on System. Man and Cybernetics, 20(6), 1352–1369.
Fogel, D.B. (1994). Evolutionary programming: An introduction and some current directions.Statistics and Computing, 4, 113–130.
Fogel, L.J., Owens, A.J., and Walsh, M.J. (1966).Artificial Intelligence Through Simulated Evolution. New York: Wiley.
Glover, F. (1994). Genetic algorithms and scatter search: Unsuspected potentials.Statistics and Computing, 4, 131–140.
Goldberg, David. (1989).Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley.
Goldberg, David. (1990). A note on Boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. Technical Report No. 90003, Department of Engineering Mechanics, University of Alabama.
Grimson, W. Eric L. (1990).Object Recognition by Computer: The Role of Geometric Constraints. Cambridge, MA: MIT Press.
Holland, John. (1975).Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press.
Kernighan, B.W., and Lin, S. (1972). An efficeint heuristic procedure for partitioning graphs.Bell Systems Technical Journal, 49, 291–307.
Lowe, David G. (1985).Perceptual Organization and Visual Recognition. Boston: Kluwer.
Mühlenbein, H. (1991). Evolution in time and space: The parallel genetic algorithm. In G. Rawlins (Ed.),FOGA-1 (pp. 316–337). San Mateo: Morgan Kaufmann.
Mühlenbein, H., and Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm.Journal of Evolutionary Computation, 1(1), 25–49.
Mathias, Keith E., and Whitley, L. Darrell. (1994). Transforming the search space with Gray coding. In J.D. Schaffer (Ed.),IEEE International Conference on Evolutionary Computation (pp. 513–518). IEEE Service Center.
Mathias, Keith E., Whitley, L. Darrell, Stork, Christof, and Kusuma, Tony. (1994). Staged hybrid genetic search for seismic data imaging. In J.D. Schaffer (Ed.),IEEE International Conference on Evolutionary Computation (pp. 356–361). IEEE Service Center.
Papadimitriou, Christos H., and Steiglitz, Kenneth. (1982).Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall.
Shaffer, J. David, Caruana, Richard A., Eshelmen, Larry J., and Das, Rajarshi. (1989). A study of control parameters affecting online performance of genetic algorithms for function optimization. In J.D. Schaffer (Ed.),Proceedings of the Third International Conference on GAs (pp. 51–60). San Mateo, CA: Morgan Kaufmann.
Starkweather, Timothy, Whitley, L. Darrell, and Mathias, Keith E. (1990). Optimization using distributed genetic algorithms. In H.P. Schwefel and R. Männer (Eds.),Parallel Problem Solving from Nature (pp. 176–185). Berlin: Springer/Verlag.
Syswerda, Gilbert. (1989). Uniform crossover in genetic algorithms. In J.D. Schaffer (Ed.),Proceedings of the Third International Conference on GAs. San Mateo, CA: Morgan Kaufmann.
Whitley, L. Darrell. (1989). The GENITOR algorithm and slective pressure: Why rank based allocation of reproductive trials is best. In J.D. Schaffer (Ed.),Proceedings of the Third International Conference on Gas (pp. 116–121). Morgan Kaufmann.
Whitley, L. Darrell. (1994). A genetic algorithm tutorial.Statistics and Computing, 4, 65–85.
Whitley, Darrell, and Kauth, Joan. (1988). GENITOR: A different genetic algorithm. InProceedings of the 1988 Rocky Mountain Conference on Artificial Intelligence. City: Publisher.
Whitley, Darrell, Mathia, Keith, Rana, Soraya, and Dzubera, John. (1995). Building better test functions. In L. Eshelman (Ed.),Proceedings of the Sixth International Conference on Gas. City: Morgan Kaufmann.
Whitley, Darrell, Mathias, Keith, Rana, Soraya, and Dzubera, John. (1995). Evaluating evolutionary algorithms. Manuscript.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Whitley, D., Beveridge, R., Graves, C. et al. Test driving three 1995 genetic algorithms: New test functions and geometric matching. J Heuristics 1, 77–104 (1995). https://doi.org/10.1007/BF02430367
Issue Date:
DOI: https://doi.org/10.1007/BF02430367