• Title/Summary/Keyword: 모사 풀림

Search Result 7, Processing Time 0.022 seconds

Development and Efficiency Evaluation of Metropolis GA for the Structural Optimization (구조 최적화를 위한 Metropolis 유전자 알고리즘을 개발과 호율성 평가)

  • Park Kyun-Bin;Kim Jeong-Tae;Na Won-Bae;Ryu Yeon-Sun
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.19 no.1 s.71
    • /
    • pp.27-37
    • /
    • 2006
  • A Metropolis genetic algorithm (MGA) is developed and applied for the structural design optimization. In MGA, favorable features of Metropolis criterion of simulated annealing (SA) are incorporated in the reproduction operations of simple genetic algorithm (SGA). This way, the MGA maintains the wide varieties of individuals and preserves the potential genetic information of early generations. Consequently, the proposed MGA alleviates the disadvantages of premature convergence to a local optimum in SGA and time consuming computation for the precise global optimum in SA. Performances and applicability of MGA are compared with those of conventional algorithms such as Holland's SGA, Krishnakumar's micro GA, and Kirkpatrick's SA. Typical numerical examples are used to evaluate the computational performances, the favorable features and applicability of MGA. The effects of population sizes and maximum generations are also evaluated for the performance reliability and robustness of MGA. From the theoretical evaluation and numerical experience, it is concluded that the proposed MGA Is a reliable and efficient tool for structural design optimization.

A Rapid Local Modification Algorithm for NURBS surface (NURBS 곡면의 고속 부분 수정 알고리듬 개발)

  • 김호찬;최홍태;김준안;이석희
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.1402-1405
    • /
    • 2004
  • Algorithms on modification of NURBS surface requires modeling history to change its boundary conditions. The history is stored when the surface is modeled and saved in the corresponding model file. But when the model is transferred to other systems the history generally cannot be recognized. So modification algorithms without history is highly required. Previous works on the field is concentrated in the point based modification without any restriction condition. Therefore this study is intended to develope a curved based modification algorithm with restriction conditions. A rapid modification algorithm is suggested, implemented and tested.

  • PDF

Assembly Sequence Planning for Multiple Robots Along a Conveyer Line (다수의 로봇을 이용한 컨베어상의 조립순서 계획)

  • 박장현
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.4
    • /
    • pp.111-117
    • /
    • 1998
  • In order to increase productivity of an assembly system composed of multiple robots along a conveyer line, an efficient sequence planning is necessary because the assembly time is dependent upon the assembly sequence. In this paper, a two-robot assembly system is considered in which two robots operate simultaneously and transfer parts from the part feeders to the workpiece on the conveyer one by one. In this case, the distance from the feeder to the workpiece varies with time because the workpiece moves at a constant speed on the conveyer. Hence, the sequence programming is not a trivial problem. Also, the two robots may interfere with each other kinematically and dynamically due to the simultaneous operation, so the sequence should be programmed to avoid the interferences. In this paper, the task sequence optimization problem is formulated and is solved by employing the simulated annealing which has been shown to be effective for solving large combinatorial optimizations.

  • PDF

An Effective Method for the Nesting on Several Irregular Raw Sheets (임의 형상의 여러 원자재 위에서의 효과적인 배치방안)

  • 조경호;이건우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.8
    • /
    • pp.1854-1868
    • /
    • 1995
  • An effective nesting algorithm has been proposed to allocate the arbitrary shapes on one or several raw sheets by applying the well-known simulated annealing algorithm as the optimization technique. In this approach, both the shapes to be allocated and the raw sheets are represented as the grid-based models. This algorithm can accommodate every possible situations encountered in cutting apparel parts from the raw leather sheets. In other words, the usage of the internal hole of a shape for other small shapes, handling of the irregular boundaries and the interior defects of the raw sheets, and the simultaneous allocation on more than one raw sheets have been tackled on successfully in this study. Several computational experiments are presented to verify the robustness of the proposed algorithm.

Inverse Analysis Approach to Flow Stress Evaluation by Small Punch Test (소형펀치 시험과 역해석에 의한 재료의 유동응력 결정)

  • Cheon, Jin-Sik
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.7 s.178
    • /
    • pp.1753-1762
    • /
    • 2000
  • An inverse method is presented to obtain material's flow properties by using small punch test. This procedure employs, as the objective function of inverse analysis, the balance of measured load-di splacement response and calculated one during deformation. In order to guarantee convergence to global minimum, simulated annealing method was adopted to optimize the current objective function. In addition, artificial neural network was used to predict the load-displacement response under given material parameters which is the most time consuming and limits applications of global optimization methods to these kinds of problems. By implementing the simulated annealing for optimization along with calculating load-displacement curve by neural network, material parameters were identified irrespective of initial values within very short time for simulated test data. We also tested the present method for error-containing experimental data and showed that the flow properties of material were well predicted.

A Study on Configuration Optimization for Rotorcraft Fuel Cells based on Neural Network (인공신경망을 이용한 연료셀 형상 최적화 연구)

  • Kim, Hyun-Gi;Kim, Sung-Chan;Lee, Jong-Won;Hwang, In-Hee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.1
    • /
    • pp.51-56
    • /
    • 2012
  • Crashworthy fuel cells have been widely implemented to rotorcraft and rendered a great contribution for improving the survivability of crews and passengers. Since the embryonic stage of military rotorcraft history began, the US army has developed and practised a detailed military specification documenting the unique crashworthiness requirements for rotorcraft fuel cells to prevent most fatality due to post-crash fire. Foreign manufacturers have followed their long term experience to develop their fuel cells, and have reflected the results of crash impact tests on the trial-and-error based design and manufacturing procedures. Since the crash impact test itself takes a long-term preparation efforts together with costly fuel cell specimens, a series of numerical simulations of the crash impact test with digital mock-ups is necessary even at the early design stage to minimize the possibility of trial-and-error with full-scale fuel cells. In the present study a number of numerical simulations on fuel cell crash impact tests are performed with a crash simulation software, Autodyn. The resulting equivalent stresses are further analysed to evaluate a number of appropriate design parameters and the artificial neural network and simulated annealing method are simultaneously implemented to optimize the crashworthy performance of fuel cells.

Tool Path Optimization for NC Turret Operation Using Simulated Annealing (풀림모사 기법을 이용한 NC 터릿 작업에서의 공구경로 최적화)

  • 조경호;이건우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.5
    • /
    • pp.1183-1192
    • /
    • 1993
  • Since the punching time is strongly related to the productivity in sheet metal stamping, there have been a lot of efforts to obtain the optimal tool path. However, most of the conventional efforts have the basic limitations to provide the global optimal solution because of the inherent difficulties of the NP hard combinatorial optimization problem. The existing methods search the optimal tool path with limiting tool changes to the minimal number, which proves not to be a global optimal solution. In this work, the turret rotation time is also considered in addition to the bed translation time of the NCT machine, and the total punching time is minimized by the simulated annealing algorithm. Some manufacturing constraints in punching sequences such as punching priority constraint and punching accuracy constraint are incorporated automatically in optimization, while several user-interactions to edit the final tool path are usually required in commercial systems.