Advertisement

Optimal population size under constant computation cost

  • Ryohei Nakano
  • Yuval Davidor
  • Takeshi Yamada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 866)

Abstract

Optimal setting of genetic algorithm parameters has been the subject of numerous studies; however, the optimality of a population size is still a controversial subject. This work addresses the issue of optimal population size under the constraint of a constant computation cost. Given a problem P to be solved, a GA (genetic algorithm) as a problem solver, and a computation cost C to spend, how should we schedule the problem solving? Under the constant C, there is a trade-off between a population size s. and the number r of GA runs. Focusing on this trade-off, the present paper claims there exists the optimal sopt for the given P and GA under the constant C; here, the optimality means maximum of the expected probability of obtaining acceptable solutions. To explain how the optimality comes about we propose the statistical model of GA runs, prove the existence of sopt and get more insight in a specific case. Then experiments were performed using a difficult job shop scheduling problem. The experiments showed the plausibility of the proposed model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Giffler and G.L. Thompson. Algorithms for solving production scheduling problems. Oper. Res., 8:487–503, 1969.Google Scholar
  2. 2.
    D.E. Goldberg. Optimal initial population size for binary-coded genetic algorithms. Technical Report Report No.85001, TCGA, 1985.Google Scholar
  3. 3.
    D.E. Goldberg. Sizing populations for serial and parallel genetic algorithms. In Proc. 3rd Int. Conf. on Genetic Algorithms (Arlington, Va.), pages 70–79, 1989.Google Scholar
  4. 4.
    J.H. Holland. Adaptation in natural and artificial systems. Unuv. of Michigan Press, 1975.Google Scholar
  5. 5.
    J.F. Muth and Thompson.G.L. Industrial scheduling. Prentice-Hall, Englewood Cliffs, N.J., 1963.Google Scholar
  6. 6.
    R. Nakano and T. Yamada. Conventional genetic algorithm for job shop poblems. In Proc. 4th Int. Conf. on Genetic Algorithms (San Diego, CA.), pages 474–479, 1991.Google Scholar
  7. 7.
    G.G. Robertson. Population size in classifier systems. In Proc. 5th Int. Conf. on Machine Learning (Los Altos, CA), pages 142–152, 1988.Google Scholar
  8. 8.
    J.D. Schaffer, R.A. Caruane, J. Esheman, L, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In Proc. 3rd Int. Conf. on Genetic Algorithms (Arlington, Va.), pages 51–60, 1989.Google Scholar
  9. 9.
    T Yamada and R. Nakano. A genetic algorithm applicable to large-scale job-shop problems. In Proc. 2nd Conf. on Parallel Problem Solving from Nature (Brussels, Belgium), pages 281–290, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ryohei Nakano
    • 1
  • Yuval Davidor
    • 2
  • Takeshi Yamada
    • 1
  1. 1.NTT Communication Science LaboratoriesKyotoJapan
  2. 2.Department of Applied Mathematics and Computer ScienceThe Weizmann InstituteRehovotIsrael

Personalised recommendations