• 제목/요약/키워드: Constrained Optimization Problems

검색결과 120건 처리시간 0.023초

Three-dimensional Topology Optimization using the CATO Algorithm

  • LEE, Sang Jin;BAE, Jung Eun
    • Architectural research
    • /
    • 제11권1호
    • /
    • pp.15-23
    • /
    • 2009
  • An application of the constrained adaptive topology optimization (CATO) algorithm is described for three-dimensional topology optimization of engineering structures. The enhanced assumed strain lower order solid finite element (FE) is used to evaluate the values of objective and constraint functions required in optimization process. The strain energy (SE) terms such as elastic and modal SEs are employed as the objective function to be minimized and the initial volume of structures is introduced as the constraint function. The SIMP model is adopted to facilitate the material redistribution and also to produce clearer and more distinct structural topologies. The linearly weighted objective function is introduced to consider both static and dynamic characteristics of structures. Several numerical tests are tackled and it is used to investigate the performance of the proposed three-dimensional topology optimization process. From numerical results, it is found to be that the CATO algorithm is easy to implement and extremely applicable to produce the reasonable optimum topologies for three dimensional optimization problems.

Synthesis of four-bar linkage motion generation using optimization algorithms

  • Phukaokaew, Wisanu;Sleesongsom, Suwin;Panagant, Natee;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제4권3호
    • /
    • pp.197-210
    • /
    • 2019
  • Motion generation of a four-bar linkage is a type of mechanism synthesis that has a wide range of applications such as a pick-and-place operation in manufacturing. In this research, the use of meta-heuristics for motion generation of a four-bar linkage is demonstrated. Three problems of motion generation were posed as a constrained optimization probably using the weighted sum technique to handle two types of tracking errors. A simple penalty function technique was used to deal with design constraints while three meta-heuristics including differential evolution (DE), self-adaptive differential evolution (JADE) and teaching learning based optimization (TLBO) were employed to solve the problems. Comparative results and the effect of the constraint handling technique are illustrated and discussed.

A CP-BASED OPTIMIZATION MODEL FOR CONSTRUCTION RESCHEDULING PROBLEMS

  • Shu-Shun Liu;Kuo-Chuan Shih
    • 국제학술발표논문집
    • /
    • The 1th International Conference on Construction Engineering and Project Management
    • /
    • pp.941-946
    • /
    • 2005
  • It is essential for project managers to make schedule adjustment based on their professional experience, in terms of rescheduling action discussed in this paper. This paper discusses the topics of resource-constrained construction rescheduling by modifying the concepts of manufacturing rescheduling. Moreover, the influence factors of construction rescheduling problems are investigated and identified in this paper. According to initial schedule plan and present progress, a new rescheduling mechanism based on Constraint Programming (CP) techniques is developed to reschedule projects with the objective of minimizing total project cost or duration, under three rescheduling policies. Through case study, the behavior of three different rescheduling policies is analyzed and discussed in this paper.

  • PDF

제약조건 처리기법에 따른 하모니써치 알고리즘의 효율성 평가 : 관로 최소비용설계 문제의 적용 (Efficiency Evaluation of Harmony Search Algorithm according to Constraint Handling Techniques : Application to Optimal Pipe Size Design Problem)

  • 유도근;이호민;이의훈;김중훈
    • 한국산학기술학회논문지
    • /
    • 제16권7호
    • /
    • pp.4999-5008
    • /
    • 2015
  • 제약조건이 있는 공학 최적화 문제에서 보다 좋은 결과를 얻기 위해서는 효율적인 제약조건 처리기법의 적용은 필수적이다. 본 연구에서는 네 가지의 제약조건 처리기법을 적용하여 메타휴리스틱 최적화 기법으로 널리 사용되고 있는 Harmony Search 알고리즘의 최적화 효율성을 평가하였다. 평가를 위해 대표적인 이산형 최적화 문제 중 하나인 상수관로 최소비용설계 문제를 적용하였다. 적용결과 전통적인 제약조건 처리방법으로 사용되던 벌칙함수에 비해 제안된 제약조건 처리기법의 결과가 효율적임을 확인하였다. 특히, ${\varepsilon}$-Constrained Method의 경우 기존방법에 비하여 효율적이고 안정적인 결과를 도출하였다. 제안된 방법은 새로운 최적화 알고리즘의 개발 필요 없이 HS의 성능을 증가시킬 수 있다는 점에서 의의가 있다고 판단된다. 또한 400개 이상의 결정변수를 가지는 대규모 문제의 적용을 통하여, 제안된 방법이 대규모 공학 최적화 문제에서도 활용이 가능함을 확인하였다.

JACOBI DISCRETE APPROXIMATION FOR SOLVING OPTIMAL CONTROL PROBLEMS

  • El-Kady, Mamdouh
    • 대한수학회지
    • /
    • 제49권1호
    • /
    • pp.99-112
    • /
    • 2012
  • This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

근사 최적화를 활용한 뻐꾸기 탐색법의 성능 개선 (Surrogate-Based Improvement on Cuckoo Search for Global Constrained Optimization)

  • 이세정
    • 한국CDE학회논문집
    • /
    • 제19권3호
    • /
    • pp.245-252
    • /
    • 2014
  • Engineering applications of global optimization techniques are recently abundant in the literature and it may be caused by both new methodologies arising and faster computers coming out. Many of the optimization techniques are based on natural or biological phenomena. This study put focus on enhancing the performace of Cuckoo Search (CS) among them since it has the least number of parameters to tune. The proposed enhancement can be achieved by applying surrogate-based optimization at every cycle of CS, which fortifies the exploitation capability of the original method. The enhanced algorithm has been applied several engineering design problems with constraints. The proposed method shows comparable or superior performance to the original method.

Design of multi-span steel box girder using lion pride optimization algorithm

  • Kaveh, A.;Mahjoubi, S.
    • Smart Structures and Systems
    • /
    • 제20권5호
    • /
    • pp.607-618
    • /
    • 2017
  • In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

순차적 근사최적화 기법을 이용한 방열판 최적설계 (Optimal Design of a Heat Sink using the Sequential Approximate Optimization Algorithm)

  • 박경우;최동훈
    • 설비공학논문집
    • /
    • 제16권12호
    • /
    • pp.1156-1166
    • /
    • 2004
  • The shape of plate-fin type heat sink is numerically optimized to acquire the minimum pressure drop under the required temperature rise. In constrained nonlinear optimization problems of thermal/fluid systems, three fundamental difficulties such as high computational cost for function evaluations (i.e., pressure drop and thermal resistance), the absence of design sensitivity information, and the occurrence of numerical noise are commonly confronted. Thus, a sequential approximate optimization (SAO) algorithm has been introduced because it is very hard to obtain the optimal solutions of fluid/thermal systems by means of gradient-based optimization techniques. In this study, the progressive quadratic response surface method (PQRSM) based on the trust region algorithm, which is one of sequential approximate optimization algorithms, is used for optimization and the heat sink is optimized by combining it with the computational fluid dynamics (CFD).

시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발 (A Two-phase Method for the Vehicle Routing Problems with Time Windows)

  • 홍성철;박양병
    • 산업공학
    • /
    • 제17권spc호
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

보 보강재 배치 최적화 문제에서의 기하구속조건 처리기법 (A Geometry Constraint Handling Technique in Beam Stiffener Layout Optimization Problem)

  • 이준호;박영진;박윤식
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2004년도 춘계학술대회논문집
    • /
    • pp.870-875
    • /
    • 2004
  • Beam stiffeners have frequently been used for raising natural frequencies of base structures. In stiffener layout optimization problems, most of the previous researches considering the position and/or the length of the stiffener as design variables dealt with structures having just simple convex shapes such as a square or rectangle. The reason is concave shape structures have difficulties ill formulating geometry constraints. In this paper, a new geometry constraint handling technique, which can define both convex and concave feasible lesions and measure a degree of geometry constraint violation, is proposed. Evolution strategies (ESs) is utilized as an optimization tool. In addition, the constraint-handling technique of EVOSLINOC (EVOlution Strategy for scalar optimization with Lineal and Nonlinear Constraints) is utilized to solve constrained optimization problems. From a numerical example, the proposed geometry constraint handling technique is verified and proves that the technique can easily be applied to structures in net only convex but also concave shapes, even with a protrusion or interior holes.

  • PDF