• 한국공간구조학회:학술대회논문집
• /
• 한국공간구조학회 2006년도 춘계 학술발표회 논문집 제3권1호(통권3호)
• /
• pp.227-232
• /
• 2006

This paper investigate the optimum thickness distribution of plate structure with different essential boundary conditions in the fundamental natural frequency maximization problem. In this study, the fundamental natural frequency is considered as the objective function to be maximized and the initial volume of structures is used as the constraint function. The computer-aided geometric design (CAGD) such as Coon's patch representation is used to represent the thickness distribution of plates. A reliable degenerated shell finite element is adopted calculate the accurate fundamental natural frequency of the plates. Robust optimization algorithms implemented in the optimizer DoT are adopted to search optimum thickness values during the optimization iteration. Finally, the optimum thickness distribution with respect to different boundary condition

• 대한조선학회논문집
• /
• 제44권2호
• /
• pp.130-138
• /
• 2007

A coupled variational equation for fluid-structure interaction (FSI) problems is derived from a steady state Navier-Stokes equation for incompressible Newtonian fluid and an equilibrium equation for geometrically nonlinear structures. For a fully coupled FSI formulation, between fluid and structures, a traction continuity condition is considered at interfaces where a no-slip condition is imposed. Under total Lagrange formulation in the structural domain, finite rotations are well described by using the second Piola-Kirchhoff stress and Green-Lagrange strain tensors. An adjoint shape design sensitivity analysis (DSA) method based on material derivative approach is applied to the FSI problem to develop a shape design optimization method. Demonstrating some numerical examples, the accuracy and efficiency of the developed DSA method is verified in comparison with finite difference sensitivity. Also, for the FSI problems, a shape design optimization is performed to obtain a maximal stiffness structure satisfying an allowable volume constraint.

• ETRI Journal
• /
• 제37권3호
• /
• pp.471-479
• /
• 2015

Traditional designs of cognitive radio (CR) focus on maximizing system throughput. In this paper, we study the joint overlay and underlay power allocation problem for orthogonal frequency-division multiple access-based CR. Instead of maximizing system throughput, we aim to maximize system energy efficiency (EE), measured by a "bit per Joule" metric, while maintaining the minimal rate requirement of a given CR system, under the total power constraint of a secondary user and interference constraints of primary users. The formulated energy-efficient power allocation (EEPA) problem is nonconvex; to make it solvable, we first transform the original problem into a convex optimization problem via fractional programming, and then the Lagrange dual decomposition method is used to solve the equivalent convex optimization problem. Finally, an optimal EEPA allocation scheme is proposed. Numerical results show that the proposed method can achieve better EE performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.2914-2935
• /
• 2016

With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

• 한국철도학회논문집
• /
• 제9권2호
• /
• pp.206-211
• /
• 2006

This thesis presents railroad crew restoring problem, which is to determine the railroad plan allocation. This problem is constructed that determine the sequence of duties that railroad crews have to perform. We analyze characteristic of this problem and railroad industry. It's hard to consider many constraint conditions. We propose Integer Programming model and easy methodology to be considered all given operation rules. This problem is known to be NP-hard. We develop a genetic algorithm, which is proved to be powerful in solving optimization problems. We proposed the effective mathematical model and algorithm about making crew restoring in real industry.

• 한국지능시스템학회논문지
• /
• 제15권3호
• /
• pp.355-356
• /
• 2005

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

• 한국강구조학회 논문집
• /
• 제16권1호통권68호
• /
• pp.123-134
• /
• 2004

본 연구에서는 효율적인 형상최적화를 위해 다단계 분할기법으로 트러스 구조물의 형상 최적화를 시도하였다. 1단계에서는 단면적을 설계변수로 하여 중량, 또는 체적을 목적함수로 하고 다하중 재하조건 하의 거동제약조건과 부가적인 제약조건을 고려하여 비선형 최적화 문제를 형성한다. 이 비선형 계획문제를 축차 선형계획 문제로 변환하여 개선된 허용방향법으로 최적화하였다. 이때 필요한 도함수는 다른 연구와 달리 효율적이라고 알려진 거동공간법으로 구하였고, 최적화 과정 중 이를 이용하여 부재력를 근사화 함으로써 계산의 효율성을 높였다. 2단계에서는 형상 설계변수만을 고려한 무제약 최적화 문제로 형성한 후 일방향 탐사기법을 적용하여 형상을 최적화하였다. 이와 같이 구성된 본 연구의 알고리즘을 몇 가지 트러스 구조물에 적용하여 본 알고리즘의 적용성과 효율성 및 타당성을 증명하였다.

• 한국전산구조공학회논문집
• /
• 제26권4호
• /
• pp.213-221
• /
• 2013

이 논문에서는 반무한 고체영역의 표면에서 측정한 변위응답의 시간이력으로부터 유한요소망 연속기법을 이용해 탄성파 속도의 공간적 분포를 추정하는 역해석 문제를 소개한다. 반무한 영역에서의 역해석을 위해서는 해석 대상이 되는 유한영역의 경계에서 파동의 반사가 일어나지 않도록 하는 것이 중요하다. 이를 위해 유한영역의 경계면에 perfectly-matchedlayers(PMLs)라는 수치적 파동흡수층을 도입하였고, PML을 경계로 하는 유한영역에서 역해석 문제를 정의하였다. 이 문제를 탄성파동방정식을 구속조건으로 하는 최적화 문제로 표현하였으며, 라그랑주 승수법에 기초한 비구속 최적화 기법에 의해 탄성파속도의 최적 분포를 결정하였다. 해의 정확도와 수렴성을 높이기 위해 유한요소망 연속기법을 도입하여 점진적으로 밀도가 증가하는 유한요소망에 대해 연속적으로 역해석을 수행하였다. 1차원 예제들을 통해 유한요소망 연속기법을 이용한 역해석으로부터 탄성파속도의 분포를 정확히 추정할 수 있음을 확인하였으며, 측정 응답에 노이즈가 존재하는 경우에도 제안한 역해석 기법은 목표 탄성파속도 분포에 근사한 결과를 도출하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2422-2443
• /
• 2020

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

• 대한기계학회논문집A
• /
• 제20권6호
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.