• 대한기계학회논문집A
• /
• 제34권5호
• /
• pp.567-573
• /
• 2010

본 연구에서는 토리구형 돔 형상을 갖는 연소관의 치수 최적화를 통한 경량화와 구조 안전성을 평가하였다. 치수최적화 설계는 빠른 설계 검증을 위하여 볼트의 단면적 비가 고려된 2차원 축대칭 유한요소 모델을 이용하여 수행하였다. 이때, 해석 프로그램은 ANSYS APDL(Ansys Parameter Design Language)을 이용하였고, 해석법은 sub-problem법과 first-order법을 선택하여 수행하였다. 설계 변수로는 연소관의 돔과 실린더 부위의 두께를 선정하였다. 수정된 2차원 축대칭 유한요소 모델은 3차원 유한요소 모델과의 결과 비교를 통하여 신뢰성을 확인하였고, 초기설계 단계에서 수정된 2차원 축대칭 유한요소 모델을 이용하여 연소관의 구조 안전성 평가와 빠르고 정확한 경량화 설계를 수행할 수 있었다. 연소관의 안전계수에 따른 최적화 해석 결과 최대 17.6%의 무게 절감 효과를 확인하였다.

• 대한기계학회논문집A
• /
• 제37권1호
• /
• pp.31-37
• /
• 2013

본 연구의 목적은 최적화 해석 기법을 이용하여 복합재 압력용기의 스커트 치수를 도출하는 것이다. 복합재 압력용기 스커트 최적화 해석은 부분문제 근사법을 사용하였으며, APDL(ANSYS Parametric Design Language)을 이용하여 해석의 모든 과정을 일괄처리하였다. 설계변수로는 압력용기 스커트 부위의 두께와 길이를 선정하였으며, 내압에 의해 발생하는 변위와 무게를 각각 목적함수로 하여 최적화 해석을 통해 최적의 스커트 치수를 도출하였다. 그 결과 복합재 압력용기의 스커트 무게를 최대 4.38% 절감할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.197-198
• /
• 2008

In this paper, we study an opportunistic scheduling scheme for the OFDMA system with streaming services. The service is modeled by using the appropriate utility function. We formulate a stochastic optimization problem that aims at maximizing network utility while satisfying the QoS requirement of each user. The problem is solved by using the dual approach and the stochastic sub-gradient algorithm.

• ETRI Journal
• /
• 제24권3호
• /
• pp.251-254
• /
• 2002

We developed a method for optimal superframe design in the multi-frequency time division multiple access (MF-TDMA) return-link of a satellite multimedia interactive network called a digital video broadcasting return channel over satellite (DVB-RCS) sub-network. To find the optimal superframe pattern with the maximum data throughput, we formulated the design problem as a non-linear combinatorial optimization problem. We also devised the proposed simple method so that it would have field applicability for improving radio resource utilization in the MF-TDMA return link.

• 산업공학
• /
• 제23권2호
• /
• pp.147-155
• /
• 2010

Reliability allocation is defined as a problem of determination of the reliability for subsystems and components to achieve target system reliability. The determination of both optimal component reliability and the number of component redundancy allowing mixed components to maximize the system reliability under resource constraints is called reliability-redundancy allocation problem(RAP). The main objective of this study is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for reliability-redundancy allocation problem that decides both optimal component reliability and the number of component redundancy to maximize the system reliability under cost and weight constraints. The global optimal solutions of each example are obtained by using CPLEX 11.1. The component structure, reliability, cost, and weight were computed by using HPGA and compared the results of existing metaheuristic such as Genetic Algoritm(GA), Tabu Search(TS), Ant Colony Optimization(ACO), Immune Algorithm(IA) and also evaluated performance of HPGA. The result of suggested algorithm gives the same or better solutions when compared with existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improve solution through swap, 2-opt, and interchange processes. In order to calculate the improvement of reliability for existing studies and suggested algorithm, a maximum possible improvement(MPI) was applied in this study.

• Korean Journal of Chemical Engineering
• /
• 제35권11호
• /
• pp.2150-2156
• /
• 2018

We suggest a systematic method for obtaining the optimal compression ratio in the multi-stage closed-loop compression process of carbon dioxide. Instead of adopting the compression ratio of 3 to 4 by convention, we propose a novel approach based on mathematical analysis and simulation. The mathematical analysis prescribes that the geometric mean is a better initial value than the existing empirical value in identifying the optimal compression ratio. In addition, the optimization problem considers the initial installation cost as well as the energy required for the operation. We find that it is best to use the fifth stage in the general closed-loop type carbon dioxide multi-stage compression process.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.141-155
• /
• 2006

In this paper, we address an extended hub-and-spoke transportation network design problem (EHSNP). In the existing hub location problems, the location and number of spokes, and shipments on spokes are given as input data. These may, however, be viewed as the variables according to the areas which they cover. Also, the vehicle routing in each spoke needs to be considered to estimate the network cost more correctly. The EHSNP is a problem of finding the location of hubs and spokes, and pickup/delivery routes from each spoke, while minimizing the total related transportation cost in the network. The EHSNP is an integrated problem that consists of several interrelated sub-problems. To solve EHSNP, we present an approach based on a symbiotic evolutionary algorithm (symbiotic EA), which are known as an efficient tool to solve complex integrated optimization problems. First, we propose a framework of symbiotic EA for EHSNP and its genetic elements suitable for each sub-problem. To analyze the proposed algorithm, the extensive experiments are performed with various test-bed problems. The results show that the proposed algorithm is promising in solving the EHSNP.

• 전산구조공학
• /
• 제10권2호
• /
• pp.255-263
• /
• 1997

실제로 구조시스템들의 최적설계는 설계변수가 연속값이 아닌 이산값을 요하는 경우가 대부분이다. 본 논문은 이산형 설계변수를 갖는 비대칭 복합 적층평판에 대해 선형 근사화방법을 이용한 이산최적설계를 수행하였으며, 이 방법이 매우 효율적임을 보였다. 대상 문제는 축력, 전단력, 그리고 휨과 비틀림 모멘트의 평면 내하중들(in-plane loads)의 다중하중조건을 받는 것으로 고려하였으며, 복합 적층평판을 구성하는 플라이들에 대한 최대변형률 규준을 설계 제약조건으로 부과하였다. 이산 최적화를 위한 초기 접근방법으로 단 한번의 연속변수 최적화 과정이 FDM(Feasible Direction Method)을 이용하여 수행되었으며, 차후 이산 및 연속변수를 포함하는 비선형 이산최적화문제를 SLDP(Sequential Linear Discrete Programming)방법에 의해 선형 근사화된 혼합정수계획문제로 형성하여 풀었다. 수치예에서 6개의 플라이로 구성된 비대칭 복합 적층평판을 대상으로 회전식 적층배열([(90-.theta.)/-(60+.theta.)/-.theta./-(45+.theta.)/(45-.theta.)]/sub s/)에 따른 이산최적해를 구하였다. 효율성 입증을 위해 똑같은 문제를 비선형 분기한계법을 이용하여 풀었으며, 그 결과를 비교 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3921-3944
• /
• 2015

Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.