• 제목/요약/키워드: Constraint Optimization Problem

검색결과 347건 처리시간 0.022초

Structural dynamic optimization with probability constraints of frequency and mode

  • Chen, Jian-Jun;Che, Jian-Wen;Sun, Huai-An;Ma, Hong-Bo;Cui, Ming-Tao
    • Structural Engineering and Mechanics
    • /
    • 제13권5호
    • /
    • pp.479-490
    • /
    • 2002
  • The structural dynamic optimization problem based on probability is studied. Considering the randomness of structural physical parameters and the given constraint values, we develop a dynamic optimization mathematical model of engineering structures with the probability constraints of frequency, forbidden frequency domain and the vibration mode. The sensitivity of structural dynamic characteristics based on probability is derived. Two examples illustrate that the optimization model and the method applied are rational and efficient.

구부러진 3차원 박판 구조물의 고유 진동수 극대화를 위한 보강재 배치 최적화 (Stiffener Layout Optimization to Maximize Natural Frequencies of a Curved Three-Dimensional Shell Structure)

  • 이준호;박윤식;박영진
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2004년도 추계학술대회논문집
    • /
    • pp.954-957
    • /
    • 2004
  • Based on the authors' previous work, where a geometric constraint handling technique for stiffener layout optimization problem using geometry algorithms was proposed, stiffener layout optimization to maximize natural frequencies of a curved three-dimensional shell structure was performed with a projection method. The original geometry of the shell structure was first projected on a two-dimensional plane, and then the whole optimization process was performed with the projected geometry of the shell except that the original shell structure was used for the eigenproblem solving. The projection method can be applied to baseline structures with a one-to-one correspondence between original and projected geometries such as automobile hoods and roofs.

  • PDF

A Conflict Detection Method Based on Constraint Satisfaction in Collaborative Design

  • Yang, Kangkang;Wu, Shijing;Zhao, Wenqiang;Zhou, Lu
    • Journal of Computing Science and Engineering
    • /
    • 제9권2호
    • /
    • pp.98-107
    • /
    • 2015
  • Hierarchical constraints and constraint satisfaction were analyzed in order to solve the problem of conflict detection in collaborative design. The constraints were divided into two sets: one set consisted of known constraints and the other of unknown constraints. The constraints of the two sets were detected with corresponding methods. The set of the known constraints was detected using an interval propagation algorithm, a back propagation (BP) neural network was proposed to detect the set with the unknown constraints. An immune algorithm (IA) was utilized to optimize the weights and the thresholds of the BP neural network, and the steps were designed for the optimization process. The results of the simulation indicated that the BP neural network that was optimized by IA has a better performance in terms of convergent speed and global searching ability than a genetic algorithm. The constraints were described using the eXtensible Markup Language (XML) for computers to be able to automatically recognize and establish the constraint network. The implementation of the conflict detection system was designed based on constraint satisfaction. A wind planetary gear train is taken as an example of collaborative design with a conflict detection system.

Optimum parameterization in grillage design under a worst point load

  • Kim Yun-Young;Ko Jae-Yang
    • 한국항해항만학회지
    • /
    • 제30권2호
    • /
    • pp.137-143
    • /
    • 2006
  • The optimum grillage design belongs to nonlinear constrained optimization problem. The determination of beam scantlings for the grillage structure is a very crucial matter out of whole structural design process. The performance of optimization methods, based on penalty functions, is highly problem-dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm ($R{\mu}GA$) is proposed to find the optimum beam scantlings of the grillage structure without handling any of penalty functions. $R{\mu}GA$ can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. Direct stiffness method is used as a numerical tool for the grillage analysis. In optimization study to find minimum weight, sensitivity study is carried out with varying beam configurations. From the simulation results, it has been concluded that the proposed $R{\mu}GA$ is an effective optimization tool for solving continuous and/or discrete nonlinear real-world optimization problems.

Implementation of Strength Pareto Evolutionary Algorithm II in the Multiobjective Burnable Poison Placement Optimization of KWU Pressurized Water Reactor

  • Gharari, Rahman;Poursalehi, Navid;Abbasi, Mohammadreza;Aghaie, Mahdi
    • Nuclear Engineering and Technology
    • /
    • 제48권5호
    • /
    • pp.1126-1139
    • /
    • 2016
  • In this research, for the first time, a new optimization method, i.e., strength Pareto evolutionary algorithm II (SPEA-II), is developed for the burnable poison placement (BPP) optimization of a nuclear reactor core. In the BPP problem, an optimized placement map of fuel assemblies with burnable poison is searched for a given core loading pattern according to defined objectives. In this work, SPEA-II coupled with a nodal expansion code is used for solving the BPP problem of Kraftwerk Union AG (KWU) pressurized water reactor. Our optimization goal for the BPP is to achieve a greater multiplication factor ($K_{eff}$) for gaining possible longer operation cycles along with more flattening of fuel assembly relative power distribution, considering a safety constraint on the radial power peaking factor. For appraising the proposed methodology, the basic approach, i.e., SPEA, is also developed in order to compare obtained results. In general, results reveal the acceptance performance and high strength of SPEA, particularly its new version, i.e., SPEA-II, in achieving a semioptimized loading pattern for the BPP optimization of KWU pressurized water reactor.

Resource Allocation for Relay-Aided Cooperative Systems Based on Multi-Objective Optimization

  • Wu, Runze;Zhu, Jiajia;Hu, Hailin;He, Yanhua;Tang, Liangrui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권5호
    • /
    • pp.2177-2193
    • /
    • 2018
  • This paper studies resource allocation schemes for the relay-aided cooperative system consisting of multiple source-destination pairs and decode-forward (DF) relays. Specially, relaying selection, multisubcarrier pairing and assignment, and power allocation are investigated jointly. We consider a combinatorial optimization problem on quality of experience (QoE) and energy consumption based on relay-aided cooperative system. For providing better QoE and lower energy consumption we formulate a multi-objective optimization problem to maximize the total mean opinion score (MOS) value and minimize the total power consumption. To this end, we employ the nondominated sorting genetic algorithm version II (NSGA-II) and obtain sets of Pareto optimal solutions. Specially, two formulas are devised for the optimal solutions of the multi-objective optimization problems with and without a service priority constraint. Moreover, simulation results show that the proposed schemes are superior to the existing ones.

일반 그래프 최적화를 활용한 그래프 기반 SLAM 구현 (The Implementation of Graph-based SLAM Using General Graph Optimization)

  • 고낙용;정준혁;정다빈
    • 한국전자통신학회논문지
    • /
    • 제14권4호
    • /
    • pp.637-644
    • /
    • 2019
  • 본 논문은 일반 그래프 최적화(g2o, General Graph Optimization)를 사용하여 그래프 기반 SLAM을 구현한 결과를 기술한다. 일반 그래프 최적화는 SLAM을 노드와 엣지의 그래프를 통하여 표현한다. 노드는 시간에 따른 로봇의 위치를 나타내며, 엣지는 노드들 사이의 구속 조건을 나타낸다. 구속 조건은 센서에 의한 측정값에 의해 결정된다. 일반 그래프 최적화는 구속 조건에 의해 결정되는 성능지표를 최적화하여 SLAM 문제를 해결한다. 실현된 일반 그래프 최적화 방법을 SLAM 방법의 성능 시험용으로 공개된 실험 데이터를 사용하여 검증하였다.

다중 섬 유전자 알고리즘 기반 A60 급 격벽 관통 관의 방화설계에 대한 이산변수 근사최적화 (Approximate Optimization with Discrete Variables of Fire Resistance Design of A60 Class Bulkhead Penetration Piece Based on Multi-island Genetic Algorithm)

  • 박우창;송창용
    • 한국기계가공학회지
    • /
    • 제20권6호
    • /
    • pp.33-43
    • /
    • 2021
  • A60 class bulkhead penetration piece is a fire resistance system installed on a bulkhead compartment to protect lives and to prevent flame diffusion in a fire accident on a ship and offshore plant. This study focuses on the approximate optimization of the fire resistance design of the A60 class bulkhead penetration piece using a multi-island genetic algorithm. Transient heat transfer analysis was performed to evaluate the fire resistance design of the A60 class bulkhead penetration piece. For approximate optimization, the bulkhead penetration piece length, diameter, material type, and insulation density were considered discrete design variables; moreover, temperature, cost, and productivity were considered constraint functions. The approximate optimum design problem based on the meta-model was formulated by determining the discrete design variables by minimizing the weight of the A60 class bulkhead penetration piece subject to the constraint functions. The meta-models used for the approximate optimization were the Kriging model, response surface method, and radial basis function-based neural network. The results from the approximate optimization were compared to the actual results of the analysis to determine approximate accuracy. We conclude that the radial basis function-based neural network among the meta-models used in the approximate optimization generates the most accurate optimum design results for the fire resistance design of the A60 class bulkhead penetration piece.

Joint Transmitter and Receiver Optimization for Improper-Complex Second-Order Stationary Data Sequence

  • Yeo, Jeongho;Cho, Joon Ho;Lehnert, James S.
    • Journal of Communications and Networks
    • /
    • 제17권1호
    • /
    • pp.1-11
    • /
    • 2015
  • In this paper, the transmission of an improper-complex second-order stationary data sequence is considered over a strictly band-limited frequency-selective channel. It is assumed that the transmitter employs linear modulation and that the channel output is corrupted by additive proper-complex cyclostationary noise. Under the average transmit power constraint, the problem of minimizing the mean-squared error at the output of a widely linear receiver is formulated in the time domain to find the optimal transmit and receive waveforms. The optimization problem is converted into a frequency-domain problem by using the vectorized Fourier transform technique and put into the form of a double minimization. First, the widely linear receiver is optimized that requires, unlike the linear receiver design with only one waveform, the design of two receive waveforms. Then, the optimal transmit waveform for the linear modulator is derived by introducing the notion of the impropriety frequency function of a discrete-time random process and by performing a line search combined with an iterative algorithm. The optimal solution shows that both the periodic spectral correlation due to the cyclostationarity and the symmetric spectral correlation about the origin due to the impropriety are well exploited.

TABU 알고리즘을 이용한 대공간 구조물의 최적설계 (Optimum Design of the Spatial Structures using the TABU Algorithm)

  • 조용원;이상주;한상을
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
    • /
    • pp.273-280
    • /
    • 2005
  • The design of structural engineering optimization is to minimize the cost. This problem has many objective functions formulating section and shape as a function of the included discrete variables. simulated annealing, genetic algerian and TABU algerian are searching methods for optimum values. The object of this reserch Is comparing the result of TABU algorithm, and verifying the efficiency of TABU algorithm in structural optimization design field. For the purpose, this study used a solid truss of 25 elements having 10 nodes, and size optimization for each constraint and load condition of Geodesic ome, and shape optimization of Cable Dome for verifying spatial structures by the application of TABU algorithm.

  • PDF