• 제목/요약/키워드: method optimization

Search Result 9,117, Processing Time 0.033 seconds

Topology Optimization of Shell Structures Using Adaptive Inner-Front(AIF) Level Set Method (적응적 내부 경계를 갖는 레벨셋 방법을 이용한 쉘 구조물의 위상최적설계)

  • Park, Kang-Soo;Youn, Sung-Kie
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.157-162
    • /
    • 2007
  • A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, in this regard, an inner-front creation algorithm is proposed. in which the sizes. shapes. positions, and number of new inner-fronts during the optimization process can be globally and consistently identified by considering both the value of a given criterion for inner-front creation and the occupied volume (area) of material domain. To facilitate the inner-front creation process, the inner-front creation map which corresponds to the discrete valued criterion of inner-front creation is applied to the level set function. In order to regularize the design domain during the optimization process, the edge smoothing is carried out by solving the edge smoothing partial differential equation (PDE). Updating the level set function during the optimization process, in the present work, the least-squares finite element method (LSFEM) is employed. As demonstrative examples for the flexibility and usefulness of the proposed method. the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

  • PDF

Computational enhancement to the augmented lagrange multiplier method for the constrained nonlinear optimization problems (구속조건식이 있는 비선형 최적화 문제를 위한 ALM방법의 성능향상)

  • 김민수;김한성;최동훈
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.15 no.2
    • /
    • pp.544-556
    • /
    • 1991
  • The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

A new optimization method for improving the performance of neural networks for optimization (최적화용 신경망의 성능개선을 위한 새로운 최적화 기법)

  • 조영현
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.12
    • /
    • pp.61-69
    • /
    • 1997
  • This paper proposes a new method for improving the performances of the neural network for optimization using a hyubrid of gradient descent method and dynamic tunneling system. The update rule of gradient descent method, which has the fast convergence characteristic, is applied for high-speed optimization. The update rule of dynamic tunneling system, which is the deterministic method with a tunneling phenomenon, is applied for global optimization. Having converged to the for escaping the local minima by applying the dynamic tunneling system. The proposed method has been applied to the travelling salesman problems and the optimal task partition problems to evaluate to that of hopfield model using the update rule of gradient descent method.

  • PDF

Topology Design Optimization of Heat Conduction Problems using Adjoint Sensitivity Analysis Method

  • Kim, Min-Geun;Kim, Jae-Hyun;Cho, Seon-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.23 no.6
    • /
    • pp.683-691
    • /
    • 2010
  • In this paper, using an adjoint variable method, we develop a design sensitivity analysis(DSA) method applicable to heat conduction problems in steady state. Also, a topology design optimization method is developed using the developed DSA method. Design sensitivity expressions with respect to the thermal conductivity are derived. Since the already factorized system matrix is utilized to obtain the adjoint solution, the cost for the sensitivity computation is trivial. For the topology design optimization, the design variables are parameterized into normalized bulk material densities. The objective function and constraint are the thermal compliance of structures and allowable material volume respectively. Through several numerical examples, the developed DSA method is verified to yield very accurate sensitivity results compared with finite difference ones, requiring less than 0.25% of CPU time for the finite differencing. Also, the topology optimization yields physical meaningful results.

Lightweight Design of Shell Structures Using Adaptive Inner-Front Level Set Based Topology Optimization (AIFLS-TOP) (적응적 내부 경계 레벨셋 기반 위상최적화를 이용한 쉘 구조물의 경량화 설계)

  • Park, Kang-Soo;Youn, Sung-Kie
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.12
    • /
    • pp.1180-1187
    • /
    • 2007
  • In the present work, topology optimization method using adaptive inner-front level set method is presented. In the conventional level set based topology optimization method, there exists an incapability for inner-front creation during optimization process. In this regard, as a new attempt to avoid and to overcome the limitation, an inner-front creation algorithm is proposed. In the inner-front creation algorithm, the strain energy density of a structure along with volume constraint is considered. Especially, to facilitate the inner-front creation process during the optimization process, the inner-front creation map which corresponds to the discrete valued function of strain energy density is constructed. In the evolution of the level set function during the optimization process, the least-squares finite element method (LSFEM) is employed. As an application to shell structures, the lightweight design of doubly curved shell and segmented mirror is carried out.

An Overview of Optimization of Structures Subjected to Transient Loads (동하중을 받는 구조물의 최적화에 관한 연구동향)

  • Park Gyung-Jin;Kang Byung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.3 s.234
    • /
    • pp.369-386
    • /
    • 2005
  • Various aspects of structural optimization techniques under transient loads are extensively reviewed. The main themes of the paper are treatment of time dependent constraints, calculation of design sensitivity, and approximation. Each subject is reviewed with the corresponding papers that have been published since 1970s. The treatment of time dependent constraints in both the direct method and the transformation method is discussed. Two ways of calculating design sensitivity of a structure under transient loads are discussed - direct differentiation method and adjoint variable method. The approximation concept mainly focuses on re- sponse surface method in crashworthiness and local approximation with the intermediate variable Especially, as an approximated optimization technique, Equivalent Static Load method which takes advantage of the well-established static response optimization technique is introduced. And as an application area of dynamic response optimization technique, the structural optimization in flexible multibody dynamic systems is re- viewed in the viewpoint of the above three themes

EP Based PSO Method for Solving Multi Area Unit Commitment Problem with Import and Export Constraints

  • Venkatesan, K.;Selvakumar, G.;Rajan, C. Christober Asir
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.415-422
    • /
    • 2014
  • This paper presents a new approach to solve the multi area unit commitment problem (MAUCP) using an evolutionary programming based particle swarm optimization (EPPSO) method. The objective of this paper is to determine the optimal or near optimal commitment schedule for generating units located in multiple areas that are interconnected via tie lines. The evolutionary programming based particle swarm optimization method is used to solve multi area unit commitment problem, allocated generation for each area and find the operating cost of generation for each hour. Joint operation of generation resources can result in significant operational cost savings. Power transfer between the areas through the tie lines depends upon the operating cost of generation at each hour and tie line transfer limits. Case study of four areas with different load pattern each containing 7 units (NTPS) and 26 units connected via tie lines have been taken for analysis. Numerical results showed comparing the operating cost using evolutionary programming-based particle swarm optimization method with conventional dynamic programming (DP), evolutionary programming (EP), and particle swarm optimization (PSO) method. Experimental results show that the application of this evolutionary programming based particle swarm optimization method has the potential to solve multi area unit commitment problem with lesser computation time.

An enhanced simulated annealing algorithm for topology optimization of steel double-layer grid structures

  • Mostafa Mashayekhi;Hamzeh Ghasemi
    • Advances in Computational Design
    • /
    • v.9 no.2
    • /
    • pp.115-136
    • /
    • 2024
  • Stochastic optimization methods have been extensively studied for structural optimization in recent decades. In this study, a novel algorithm named the CA-SA method, is proposed for topology optimization of steel double-layer grid structures. The CA-SA method is a hybridized algorithm combining the Simulated Annealing (SA) algorithm and the Cellular Automata (CA) method. In the CA-SA method, during the initial iterations of the SA algorithm, some of the preliminary designs obtained by SA are placed in the cells of the CA. In each successive iteration, a cell is randomly chosen from the CA. Then, the "local leader" (LL) is determined by selecting the best design from the chosen cell and its neighboring ones. This LL then serves as the leader for modifying the SA algorithm. To evaluate the performance of the proposed CA-SA algorithm, two square-on-square steel double-layer grid structures are considered, with discrete cross-sectional areas. These numerical examples demonstrate the superiority of the CA-SA method over SA, and other meta-heuristic algorithms reported in the literature in the topology optimization of large-scale skeletal structures.

2-D Robust Design Optimization on Unstructured Meshes

  • Lee Sang Wook;Kwon Oh Joon
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.240-242
    • /
    • 2003
  • A method for performing two-dimensional lift-constraint drag minimization in inviscid compressible flows on unstructured meshes is developed. Sensitivities of objective function with respect to the design variables are efficiently obtained by using a continuous adjoint method. In addition, parallel algorithm is used in multi-point design optimization to enhance the computational efficiency. The characteristics of single-point and multi-point optimization are examined, and the comparison of these two method is presented.

  • PDF

Discrete Optimization of Tall Steel Frameworks under Multiple Drift Constraints (다중변위 구속조건하에서 고층철골조의 이산형 최적화)

  • 이한주;김호수
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.254-261
    • /
    • 1998
  • This study presents a discrete optimization of tall steel buildings under multiple drift constraints using a dual method. Dual method can replace the primary optimization problem with a sequence of approximate explicit subproblems. Since each subproblem is convex and separable, it can be efficiently solved by using a dual formulation. Specifically, this study considers the discrete-optimization problem due to the commercial standard steel sections to select member sizes. The results by the proposed method will be compared with those of the conventional optimality criteria method

  • PDF