Skip to main content
Log in

Initial design domain reset method for genetic algorithm with parallel processing

  • Published:
KSME International Journal Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Gang-Gyoo Jin, 2000, Genetic Algorithms and Their Applications, Kyowoo publishing, pp. 55–69.

  • Hyung-Wook Park, Min-SooKim and Dong-Hoon Choi, 2002, “A New Decomposition Method for Parallel Processing Multi-Level Optimization,”KSME International Journal, Vol. 16, No. 5, pp. 609–618.

    Article  Google Scholar 

  • Jasbir s. Arora, 1994,Introduction to Optimum Design, McGraw-Hill Book Co., p. 279.

  • Jung-Muk Choi, 2002, “A Study on Improvement of Genetic Algorithm Operation Using the Restarting Strategy,”Journal of the Computational Strutural Engineering Institute of Korea, 6 Vol. 15, No. 2, pp. 305–313.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Korea Advanced Institute of Science and Technology, 2000, “Development of Hi-Speed Parallel Evolutionary Computation S/W and Its Application Techniques,” Report, Ministry of Science & Technology. MPI On-Line Document, http ://www-unix. mcs.anl.gov/mpi/index.html.

  • Sang-Ho Lee, 2002, “Introduction to Parallel Computer and Parallel Programming Technique,”Journal of the KSME, Vol. 42, No. 1, pp. 36–42.

    Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • Young-Kong Ahn, Young-Chan Kim and BoSuk Yang, 2003, “Optimal Design of a Squeeze Film Damper Using an Enhanced Genetic Algorithm,”KSME International Journal, Vol. 17, No. 12, pp. 1938–1948.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to O-Kaung Lim.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lim, OK., Hong, KS., Lee, HS. et al. Initial design domain reset method for genetic algorithm with parallel processing. KSME International Journal 18, 1121–1130 (2004). https://doi.org/10.1007/BF02983286

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02983286

Key Words

Navigation