Simulation Optimization of Manufacturing System using Real-coded Genetic Algorithm

실수 코딩 유전자 알고리즘을 이용한 생산 시스템의 시뮬레이션 최적화

  • Published : 2005.09.30


In this paper, we optimize simulation model of a manufacturing system using the real-coded genetic algorithm. Because the manufacturing system expressed by simulation model has stochastic process, the objective functions such as the throughput of a manufacturing system or the resource utilization are not optimized by simulation itself. So, in order to solve it, we apply optimization methods such as a genetic algorithm to simulation method. Especially, the genetic algorithm is known to more effective method than other methods to find global optimum, because the genetic algorithm uses entity pools to find the optimum. In this study, therefore, we apply the real-coded genetic algorithm to simulation optimization of a manufacturing system, which is known to more effective method than the binary-coded genetic algorithm when we optimize the constraint problems. We use the reproduction operator of the applied real-coded genetic algorithm as technique of the remainder stochastic sample with replacement and the crossover operator as the technique of simple crossover. Also, we use the mutation operator as the technique of the dynamic mutation that configures the searching area with generations.


  1. 공성곤, 김인택, 박대희, 박주영, 신요안, 유전자 알고리즘, 그린, 2002
  2. 진강규, 유전알고리즘과 그 응용, 교우사, 2000
  3. A. Wright, Genetic algorithms for real parameter optimization, Foundations of Genetic Algorithms, 1st Workshop on the Foundations of Genetic Algorithms and Classifier Systems, Morgan Kaufmann Publishers, pp. 205-218, 1990
  4. A. Wright, Genetic algorithms for real parameter optimization, Foundations of genetic algorithms, G. Rswlins (Ed.), Morgen Kaufmann publishers, CA, 1991
  5. C. Z. Janikow and Z. Michalewicz, An Experimental comparison of binary and floating point representations in genetic algorithms, Proceedings of 4th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, 1991
  6. D. E. Goldberg, Optimal initial population size for binary-coded genetic algorithms, TCGA Reprt No. 85001, University of Alabama, 1985
  7. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley, N.Y., 1989a
  8. D. E. Goldberg, Sizing populations for serial and parallel genetic algorithms, Proceedings of 3rd International Conference on Genetic Algorithms and Their Applications, pp. 70-79, 1989b
  9. J. M. Yunker and J. D. Tew, Simulation optimization by genetic search, Mathematics and Computers in Simulation, 37(1), pp. 17-28, 1994
  10. L. Davis, Handbook of genetic algorithms, Van Nostrand Reinhold, 1991
  11. M. S. Meketon, Optimization in simulation A survey of recent results, Proceedings of 1987 Winter Simulation Conference, pp. 58-67, 1987
  12. N. C. Ho, S. S. Lee, and Y. L. Loh, A two-stage approach for optimizing simulation experiments, Annals of CIRP, 42(1), pp. 501-504, 1993
  13. N. J. Radcliffe, Equivalence class analysis of genetic algorithms, Complex Systems, 5(2), pp. 183-205. 1991
  14. S. G, Lee, L. P. Khoo, and X. F. Yin, Optimizing an assembly line through simulation augmented by genetic algorithms, International Journal of Advanced Manufacturing Technology, 16, 220-228, 2000
  15. W. D. Kelton, R. P. Sadowski, and D. A. Sadowski, Simulation with arena 2d, McGraw-Hill, 2002