• 제목/요약/키워드: OPTIMIZATION

검색결과 21,596건 처리시간 0.044초

Genetic algorithm-based geometric and reinforcement limits for cost effective design of RC cantilever retaining walls

  • Mansoor Shakeel;Rizwan Azam;Muhammad R. Riaz
    • Structural Engineering and Mechanics
    • /
    • 제86권3호
    • /
    • pp.337-348
    • /
    • 2023
  • The optimization of reinforced concrete (RC) cantilever retaining walls is a complex problem and requires the use of advanced techniques like metaheuristic algorithms. For this purpose, an optimization model must first be developed, which involves mathematical complications, multidisciplinary knowledge, and programming skills. This task has proven to be too arduous and has halted the mainstream acceptance of optimization. Therefore, it is necessary to unravel the complications of optimization into an easily applicable form. Currently, the most commonly used method for designing retaining walls is by following the proportioning limits provided by the ACI handbook. However, these limits, derived manually, are not verified by any optimization technique. There is a need to validate or modify these limits, using optimization algorithms to consider them as optimal limits. Therefore, this study aims to propose updated proportioning limits for the economical design of a RC cantilever retaining wall through a comprehensive parametric investigation using the genetic algorithm (GA). Multiple simulations are run to examine various design parameters, and trends are drawn to determine effective ranges. The optimal limits are derived for 5 geometric and 3 reinforcement variables and validated by comparison with their predecessor, ACI's preliminary proportioning limits. The results indicate close proximity between the optimized and code-provided ranges; however, the use of optimal limits can lead to additional cost optimization. Modifications to achieve further optimization are also discussed. Besides the geometric variables, other design parameters not covered by the ACI building code, like reinforcement ratios, bar diameters, and material strengths, and their effects on cost optimization, are also discussed. The findings of this investigation can be used by experienced engineers to refine their designs, without delving into the complexities of optimization.

A new hybrid meta-heuristic for structural design: ranked particles optimization

  • Kaveh, A.;Nasrollahi, A.
    • Structural Engineering and Mechanics
    • /
    • 제52권2호
    • /
    • pp.405-426
    • /
    • 2014
  • In this paper, a new meta-heuristic algorithm named Ranked Particles Optimization (RPO), is presented. This algorithm is not inspired from natural or physical phenomena. However, it is based on numerous researches in the field of meta-heuristic optimization algorithms. In this algorithm, like other meta-heuristic algorithms, optimization process starts with by producing a population of random solutions, Particles, located in the feasible search space. In the next step, cost functions corresponding to all random particles are evaluated and some of those having minimum cost functions are stored. These particles are ranked and their weighted average is calculated and named Ranked Center. New solutions are produced by moving each particle along its previous motion, the ranked center, and the best particle found thus far. The robustness of this algorithm is verified by solving some mathematical and structural optimization problems. Simplicity of implementation and reaching to desired solution are two main characteristics of this algorithm.

ON DUALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Kim, Moon Hee
    • 충청수학회지
    • /
    • 제26권4호
    • /
    • pp.723-734
    • /
    • 2013
  • A robust optimization problem, which has a maximum function of continuously differentiable functions as its objective function, continuously differentiable functions as its constraint functions and a geometric constraint, is considered. We prove a necessary optimality theorem and a sufficient optimality theorem for the robust optimization problem. We formulate a Wolfe type dual problem for the robust optimization problem, which has a differentiable Lagrangean function, and establish the weak duality theorem and the strong duality theorem which hold between the robust optimization problem and its Wolfe type dual problem. Moreover, saddle point theorems for the robust optimization problem are given under convexity assumptions.

시뮬레이티드 어닐링에 의한 인공위성 구조체 최적화 (Optimization of Satellite Structures by Simulated Annealing)

  • 임종빈;지상현;박정선
    • 대한기계학회논문집A
    • /
    • 제29권2호
    • /
    • pp.262-269
    • /
    • 2005
  • Optimization of a satellite structure under severe space launching environments is performed considering various design constraints. Simulate annealing, one of combinatorial optimization techniques, is used to optimize the satellite. The optimization results by the simulated annealing are compared to those by the method of modified feasible direction and genetic algorithm. Ten bar truss structure is optimized for feasibility study of the simulated annealing. Finally, the satellite structure is optimized by the simulated annealing algorithm under space environment. Weights of the satellite upper platform and propulsion module are minimized with consideration of several static and dynamic constraints. MSC/NASTRAN is used to find the static and dynamic responses. Simulated annealing has been programmed and integrated with the finite element analysis program for optimization. It is shown that the simulated annealing algorithm can be extended to the optimization of space structures.

MODELING AND OPTIMIZATION OF THE AIR- AND GAS-SUPPLYING NETWORK OF A CHEMICAL PLANT

  • Han, In-Su;Han, Chong-Hun;Chung, Chang-Bock
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.377-382
    • /
    • 2004
  • This paper presents a novel optimization method for the air- and gas-supplying network comprised of several air compression systems and air and gas streams in an industrial chemical plant. The optimization is based on the hybrid model developed by Han and $Han^1$ for predicting the power consumption of a compression system. A constrained optimization problem was formulated to minimize the total electric power consumption of all the compression systems in the air- and gas-supplying network under various operating constraints and was solved using a successive quadratic optimization algorithm. The optimization approach was applied to an industrial terephthalic acid manufacturing plant to achieve about 10% reduction in the total electric power consumption under varying ambient conditions.

  • PDF

구조 최적 설계기법을 이용한 ULSAB 개념의 자동차 도어 설계 (The Automotive Door Design with the ULSAB Concept Using Structural Optimization)

  • 신정규;송세일;이권희;박경진
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2000년도 봄 학술발표회논문집
    • /
    • pp.187-194
    • /
    • 2000
  • Weight reduction for an automobile body is being sought for the fuel efficiency and the energy conservation. One way of the efforts is adopting Ultra Light Steel Auto Body (ULSAB) concept. The ULSAB concept can be used for the light weight of an automobile door with the tailor welded blank (TWB). A design process is defined for the TWB. The inner panel of door is designed by the TWB and optimization. The design starts from an existing component. At first, the hinge and inner reinforcements are removed. In the conceptual design stage, topology optimization is conducted to find the distribution of variable thicknesses. The number of parts and the welding lines are determined from the topology design. In the detailed design process, size optimization is carried out to find thickness while stiffness constraints are satisfied. The final parting lines are determined by shape optimization.

  • PDF

A Novel Hybrid Intelligence Algorithm for Solving Combinatorial Optimization Problems

  • Deng, Wu;Chen, Han;Li, He
    • Journal of Computing Science and Engineering
    • /
    • 제8권4호
    • /
    • pp.199-206
    • /
    • 2014
  • The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

Physics-based Surrogate Optimization of Francis Turbine Runner Blades, Using Mesh Adaptive Direct Search and Evolutionary Algorithms

  • Bahrami, Salman;Tribes, Christophe;von Fellenberg, Sven;Vu, Thi C.;Guibault, Francois
    • International Journal of Fluid Machinery and Systems
    • /
    • 제8권3호
    • /
    • pp.209-219
    • /
    • 2015
  • A robust multi-fidelity optimization methodology has been developed, focusing on efficiently handling industrial runner design of hydraulic Francis turbines. The computational task is split between low- and high-fidelity phases in order to properly balance the CFD cost and required accuracy in different design stages. In the low-fidelity phase, a physics-based surrogate optimization loop manages a large number of iterative optimization evaluations. Two derivative-free optimization methods use an inviscid flow solver as a physics-based surrogate to obtain the main characteristics of a good design in a relatively fast iterative process. The case study of a runner design for a low-head Francis turbine indicates advantages of integrating two derivative-free optimization algorithms with different local- and global search capabilities.

이동 통신 시스템에서 기지국 위치의 최적화 (Base Station Location Optimization in Mobile Communication System)

  • 변건식;이성신;장은영;오정근
    • 한국전자파학회논문지
    • /
    • 제14권5호
    • /
    • pp.499-505
    • /
    • 2003
  • 이동 무선 통신 시스템을 설계할 때 기지국의 위치는 매우 중요한 파라미터 중 하나이다. 기지국 위치를 설계할 때 여러 가지 복잡한 변수들을 잘 조합하여 코스트가 최소가 되도록 설계해야 한다. 이러한 문제를 해결하는데 필요한 알고리즘이 조합 최적화 알고리즘이며, 지금까지 조합 최적화 기술로 Random Walk, Simulated Annealing, Tabu Search, Genetic Algorithm과 같은 전역 최적화 기술이 사용되어 왔다. 본 논문은 이동 통신시스템의 기지국 위치 최적화에 위의 4가지 알고리즘들을 적용하여 각 알고리즘의 결과를 비교 분석하며 알고리즘에 의한 최적화 과정을 보여준다.

선택적 요소방법을 이용한 형상 최적 설계 기법 개발 (Development of Shape Optimization Scheme Using Selective Element Method (Application to 2-D Problems))

  • 심진욱;신정규;박경진
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집C
    • /
    • pp.531-536
    • /
    • 2001
  • The structural shape optimization is a useful tool for engineers to determine the shape of a structure. During the optimization process, relocations of nodes happen successively. However, excessive movement of nodes often results in the mesh distortion and eventually deteriorates the accuracy of the optimum solution. To overcome this problem, an efficient method for the shape optimization has been developed. The method starts from the design domain which is large enough to hold the possible shape of the structure. The design domain has pre-defined uniform fine meshes. At every cycle, the method judges whether all the elements are inside of the structure or not. Elements inside of the structure are assigned with real material properties, however elements outside of the structure are assigned with nearly zero values. The performance of the method is evaluated through various examples.

  • PDF