Initial Design Domain Reset Method for Genetic Algorithm with Parallel Processing

  • Lim, O-Kaung (School of Mechanical Engineering, Pusan National University) ;
  • Hong, Keum-Shik (School of Mechanical Engineering, Pusan National University) ;
  • Lee, Hyuk-Soo (School of Mechanical Engineering, Pusan National University) ;
  • Park, Eun-Ho (School of Mechanical Engineering, Pusan National University)
  • Published : 2004.07.01

Abstract

The Genetic Algorithm (GA), an optimization technique based on the theory of natural selection, has proven to be a relatively robust means of searching for global optimum. It converges to the global optimum point without auxiliary information such as differentiation of function. In the case of a complex problem, the GA involves a large population number and requires a lot of computing time. To improve the process, this research used parallel processing with several personal computers. Parallel process technique is classified into two methods according to subpopulation's size and number. One is the fine-grained method (FGM), and the other is the coarse-grained method (CGM). This study selected the CGM as a parallel process technique because the load is equally divided among several computers. The given design domain should be reduced according to the degree of feasibility, because mechanical system problems have constraints. The reduced domain is used as an initial design domain. It is consistent with the feasible domain and the infeasible domain around feasible domain boundary. This parallel process used the Message Passing Interface library.

Keywords

References

  1. Gang Gyoo Jin, 2000, Genetic Algorithms and Their Applications, Kyowoo publishing, pp. 55-69
  2. Hyung Wook Park, Min Soo Kim, Dong Hoon Choi, 2002, 'A New Decomposition Method for Parallel Processing Multi-Level Optimization,' KSME International Journal, Vol. 16, No. 5, pp. 609-618
  3. Jasbir s. Arora, 1994, Introduction to Optimum Design, McGraw-Hill Book Co., p.279
  4. Jung Muk Choi, 2002, 'A Study on Improvement of Genetic Algorithm Operation Using the Restarting Strategy,' Journal of the Computational Structural Engineering Institute of Korea, 6 Vol. 15, No. 2, pp. 305-313
  5. Jung Sun Park, Seok Bong Song, 2002, 'Optimization of a Composite Laminated Structure by Network-Based Genetic Algorithm,' KSME International Journal, Vol. 16 No. 8, pp. 1038-1038
  6. Kogiso, N., Watson, L. T., Gurdal, Z. and Haftka, R. T., 1994, 'Genetic Algorithm with Local Improvement Design,' Structural Optimization, Vol. 7, pp. 207-218 https://doi.org/10.1007/BF01743714
  7. Korea Advanced Institute of Science and Technology, 2000, 'Ministry of Science & Technology,Development of Hi-Speed Parallel Evolutionary Computation S/W and Its Application Techniques,' Report, Ministry of Science & Technology
  8. MPI On-Line Document, http;//www-unix.mcs,anl.gov/mpi/index.html
  9. Sang Ho Lee, 2002, 'Introduction to Parallel Computer and Parallel Programming Technique,' Journal of the KSME, Vol. 42, No. 1, pp. 36-42
  10. Willi Hock, Klaus Schittkowski, 1981, Lecture Note in Economics and Mathematical Systems ; 187 Test Examples for Nonlinear Programming Codes, Springer-Verlag Berlin Heidelberg, p. 59
  11. Young Kong Ahn, Young Chan Kim, Bo Suk Yang, 2003, 'Optimal Design of a Squeeze Film Damper Using an Enhanced Genetic Algorithm,' KSME International Journal, Vol. 17, No. 12, pp. 1938-1948