Advertisement

Restart scheduling for genetic algorithms

  • Alex S. Fukunaga
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1498)

Abstract

In order to escape from local optima, it is standard practice to periodically restart heuristic optimization algorithms such as genetic algorithm according to some restart criteria/policy. This paper addresses the issue of finding a good restart strategy in the context of resource-bounded optimization scenarios, in which the goal is to generate the best possible solution given a fixed amount of time. We propose the use of a restart scheduling strategy which generates a static restart strategy with optimal expected utility, based on a database of past performance of the algorithm on a class of problem instances. We show that the performance of static restart schedules generated by the approach can be competitive to that of a commonly used dynamic restart strategy based on detection of lack of progress.

Keywords

Genetic Algorithm Problem Instance Expected Utility Dynamic Strategy Objective Function Evaluation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Chien, J. Gratch, and M. Burl. On the efficient allocation of resources for hypothesis evaluation: A statistical approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(7):652–665, 1995.CrossRefGoogle Scholar
  2. 2.
    R.J. Collins and D.R. Jefferson. Selection in massively parallel genetic algorithms. In Proc. International Conf. on Genetic Algorithms (ICGA), pages 249–256, 1991.Google Scholar
  3. 3.
    Y. Davidor, T. Yamada, and R. Nakano. The ECOlogical Framework II: Improving GA performance at virtually zero cost. In Proc. International Conf. on Genetic Algorithms (ICGA), pages 171–176, 1993.Google Scholar
  4. 4.
    K. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Department of Computer and Communication Sciences, Ann Arbor, Michigan, 1975.Google Scholar
  5. 5.
    L.J. Eshelman and J.D. Schaffer. Preventing premature convergence in genetic algorithms by preventing incest. In Proc. International Conf. on Genetic Algorithms (ICGA), pages 115–122, 1991Google Scholar
  6. 6.
    D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.Google Scholar
  7. 7.
    B.A. Huberman, R.M. Lukose, and T. Hogg. An economics approach to hard computational problems. Science, 275(5269):51–4, January 1997.CrossRefGoogle Scholar
  8. 8.
    M. Hulin. An optimal stop criterion for genetic algorithms: a Bayesian approach. In Proc. International Conf. on Genetic Algorithms (ICGA), pages 135–141, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Alex S. Fukunaga
    • 1
  1. 1.Jet Propulsion LaboratoryCalifornia Institute of TechnologyPasadena

Personalised recommendations