Transactions of the Korean Society of Mechanical Engineers A (대한기계학회논문집A)

The Korean Society of Mechanical Engineers (대한기계학회)
권호 표지
DOI QR코드

DOI QR Code

Local Solution of a Sequential Algorithm Using Orthogonal Arrays in a Discrete Design Space

이산설계공간에서 직교배열표를 이용한 순차적 알고리듬의 국부해

  • 이정욱 (한양대학교 최적설계신기술센터) ;
  • 박경진 (한양대학교 기계정보경영학부)
  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained by using the SOA algorithm

Keywords

References

  1. Arora, J.S., 1989, Introduction to Optimum Design, McGraw-Hill, New York
  2. Haug, E.J. and Arora, J.S., 1979, Applied Optimal Design, John Wiley & Sons, Inc., New York
  3. Vanderplaats, G.N., 1984, Numerical Optimization Techniques for Engineering Design, McGraw-Hill, New York
  4. Haftka, R.T., Gurdal, Z. and Kamat, M., 1990, Elements of Structural Optimization, Kluwer Academic Publishers, Dordrecht
  5. Kirsch, U., 1981, Optimum Structural Design, McGraw-Hill, New York
  6. Arora, J.S. and Huang, M.W., 1994, 'Methods for Optimization of Nonlinear Problems with Discrete Variables: a review,' Structural Optimization, Vol. 8, pp. 69-85 https://doi.org/10.1007/BF01743302
  7. Huang, M.W. and Arora, J.S., 1997, 'Optimal Design with Discrete Variables: Some Numerical Experiments,' International Journal for Numerical Methods Engineering, Vol. 40, pp. 165-188 https://doi.org/10.1002/(SICI)1097-0207(19970115)40:1<165::AID-NME60>3.0.CO;2-I
  8. Thanedar, P.B. and Vanderplaats, G.N., 1994, 'A Survey of Discrete Variable Optimization for Structural Design,' Journal of Structural Engineering, ASCE, Vol. 121, pp. 301-306 https://doi.org/10.1061/(ASCE)0733-9445(1995)121:2(301)
  9. Land, A.H. and Doig, A., 1960, 'An Automatic Method of Solving Discrete Programming Problems,' Econometrica, Vol. 28, No. 4, pp. 297-520 https://doi.org/10.2307/1910129
  10. Salajegheh, E. and Vanderplaats, G.N., 1993, 'Optimum Design of Structures with Discrete Sizing and Shape Variables,' Structural Optimization, Vol. 6, No. 2, pp. 79-85 https://doi.org/10.1007/BF01743339
  11. Dakin, R.J., 1965, 'A Tree Search Algorithm for Mixed Integer Programming Problems,' Computer Journal, Vol. 8, No. 1, pp. 250-255 https://doi.org/10.1093/comjnl/8.3.250
  12. Kirkpatrick, S., Gelatt, C.D. and M.P. Vecchi, 1983, 'Optimization by Simulated Annealing,' Science, Vol. 220, pp. 671-680 https://doi.org/10.1126/science.220.4598.671
  13. Gidas, B., 1985, 'Non-stationary Markov Chains and Convergence of the Annealing Algorithms,' Journal of Statistical Physics, Vol. 39, pp. 73-131 https://doi.org/10.1007/BF01007975
  14. Mitra, D., Romeo, F. and Sangiovanni-Vincentelli, A.L., 1986, 'Convergence and Finite-time Behavior of Simulated Annealing,' Advances in applied Probability, Vol. 18, pp. 747-771 https://doi.org/10.2307/1427186
  15. Hajek, B., 1998, 'Cooling Schedules for Optimal Annealing,' Mathematics of Operations Research, Vol. 13, pp. 311-329 https://doi.org/10.1287/moor.13.2.311
  16. Holland, J.H., 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press, Michigan
  17. Michalewicz, Z. and Janikow, C.Z., 1991, 'Handling Constraints in Genetic Algorithms,' Proceeding 4th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, CA., pp. 151-157
  18. Goldberg, D.E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, New York
  19. Kido, T., Kitano, H. and Nakanishi, M., 1993, 'A Hybrid Search for Genetic Algorithms: Combining Genetic Algorithms, Tabu Search, and Simulated Annealing,' Proceeding 5th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, CA
  20. Lee, K.H., Eom, I.S., Park, GJ. and Lee, W.I., 1996, 'Robust Design for Unconstrained Optimization Problems Using the Taguchi Method,' AIAA, Vol. 34, No. 5, pp. 1059-1063 https://doi.org/10.2514/3.13187
  21. Lee, K.H. and Park, GJ., 2002, 'Robust Optimization in Discrete Design Space for Constrained Problems,' AIAA, Vol. 40, No. 4, pp. 774-780 https://doi.org/10.2514/2.1712
  22. Ku, K.J., Rao, S.S. and Chen, L., 1998, 'Taguchi-Aided Search Method for Design Optimization of Engineering Systems,' Engineering Optimization, Vol. 30, pp. 1-23 https://doi.org/10.1080/03052159808941235
  23. Yi, J.W., Park, J.S., Lee, K.H. and Park, G.J., 2001, 'Development of an Optimization Algorithm Using Orthogonal Arrays in Discrete Design Space,' Transactions of the KSME A, Vol. 25, No. 10, pp. 1621-1626