• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.18-21
• /
• 2003

Fused Deposition Modeling (FDM) parts are made by piling up thin layers that cause the stair stepping effect at the surface of FDM parts. This effect brings about poor surface roughness of the part and requires additional post machining such as manual finishing that is detrimental to the part geometry and time consuming. Determining optimal build orientation for FDM parts can be one solution to minimize the post machining. However, by using the CAD model, calculating the optimal build orientation is impractical due to heavy computing process. In order to calculate the optimal build orientation with high speed. the surface roughness model based on measured data and interpolation is newly developed in this research. Also. the genetic algorithm (GA) is applied for acquiring reliable solution. Finally, It is verified from the test that the presented approach is very efficient for reducing the additional post machining process fer FDM parts.

• 한국컴퓨터정보학회논문지
• /
• 제19권9호
• /
• pp.161-168
• /
• 2014

공항에 불규칙한 시간간격으로 접근하는 항공기들을 최소의 비용으로 착륙시키는 항공기 착륙 문제 (ALP)는 최적 해를 구하기 어려워 다양한 메타휴리스틱 방법들이 제안되고 있다. 본 논문에서는 ALP에 대해 O(nlog n)의 다항시간으로 최적 해를 구하는 휴리스틱 알고리즘을 제안한다. 제안된 알고리즘은 착륙 목표시간 오름차순으로 정렬시키고, 항공기들 간의 분리 시간과 착륙 비용을 고려하여 착륙순서를 변경시킨 최적화 과정을 수행하는 방법을 적용하였다. ALP에 대한 예제 데이터인 Airland1 ~ Airland8에 대해 소요비용이 0이 되는 활주로 개수 m까지 25개 데이터를 실험한 결과 모든 데이터에 대해 최적 해를 구하였다. 특히, Airland8의 m = 1 데이터에 대해서는 기존에 알려진 최적 해를 개선하였다.

• 융합신호처리학회논문지
• /
• 제9권2호
• /
• pp.129-134
• /
• 2008

본 논문에서는 적자생존 원리에 기반한 유전자 알고리즘을 이용하여 일차원 비선형 광자 결정 구조에 대해 분석하고, 광 트랜지스터로의 적용 가능성을 컴퓨터 시뮬레이션에 의해 증명한다. 이와 같은 형태의 최적 설계는 해석식이 필요한 steepest decent 최적 알고리즘과 달리 유전자 알고리즘은 탁월한 성능을 낼 수 있으며, 광 트랜지스터 뿐만 아니라 다른 광자 결정 광소자의 설계에 유용하게 적용될 수 있다. 또한, global minimum 최적해 부근에서 여러 가지의 해가 얻어지기 때문에 광 트랜지스터가 어떤 모양을 가져야 되는지 분석하는데 많은 도움을 주는 장점을 갖는다. 완전 광 필터 트랜지스터를 설계하기 위해 신경회로망 모델을 이용하여 초기 설계를 수행한 후, 유전자 알고리즘에 의해 최종적인 최적화 설계가 수행된다. 시뮬레이션으로부터 얻어진 일차원 광자 결정 트랜지스터의 스위칭 On/Off 비는 약 27dB 였다.

• Communications for Statistical Applications and Methods
• /
• 제5권3호
• /
• pp.581-589
• /
• 1998

An algorithm is proposed for the $L_1$-estimation with linear equality and inequality constraints in linear regression model. The algorithm employs a linear scaling transformation to obtain the optimal solution of linear programming type problem. And a special scheme is used to maintain the feasibility of the updated solution at each iteration. The convergence of the proposed algorithm is proved. In addition, the updating and orthogonal decomposition techniques are employed to improve the computational efficiency and numerical stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4640-4661
• /
• 2018

To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

• 한국군사과학기술학회지
• /
• 제20권4호
• /
• pp.566-578
• /
• 2017

For optimizing the operation plan when strike packages attack multiple targets, this article suggests a new mathematical model and a parallel hybrid genetic algorithm (PHGA) as a solution methodology. In the model, a package can assault multiple targets on a sortie and permitted the use of mixed munitions for a target. Furthermore, because the survival probability of a package depends on a flight route, it is formulated as a mixed integer programming which is synthesized the models for vehicle routing and weapon-target assignment. The hybrid strategy of the solution method (PHGA) is also implemented by the separation of functions of a GA and an exact solution method using ILOG CPLEX. The GA searches the flight routes of packages, and CPLEX assigns the munitions of a package to the targets on its way. The parallelism enhances the likelihood seeking the optimal solution via the collaboration among the HGAs.

• 한국컴퓨터정보학회논문지
• /
• 제20권1호
• /
• pp.111-118
• /
• 2015

본 논문은 광통신망에서 (s,t)에 대한 다중 패킷 통신 요구에 대해 최적의 광 경로를 설정하고, 최소 파장 수를 배정하는 경로설정과 파장 배정 문제 (RWAP)를 다룬다. RWAP는 지금까지 다항시간으로 최적 해를 구하는 알고리즘이 알려져 있지 않은 NP-완전으로 근사 해를 다항시간으로 구하고 있다. 본 논문은 주어진 망의 모든 (s,t)에 대해 최단 광 경로로 동일한 홉 수를 갖는 주경로와 대체경로를 사전에 결정하고, (s,t)에 대한 실제 특정 다중 패킷 통신이 요구될 때 이들 이중 경로를 이용하여 최대로 이용되는 간선의 이용횟수를 b개로 줄이고, b개의 파장 수 상자에 중복 간선 없이 담는 방법으로 O(kn) 계산 복잡도로 최적 해를 구할 수 있었다. 2개의 실험 데이터 망에 적용한 결과, 제안된 알고리즘은 기존에 알려진 최적 해를 얻을 수 있음을 보였다.

• Journal of Electrical Engineering and Technology
• /
• 제10권1호
• /
• pp.56-63
• /
• 2015

The optimization is an important role in wide geographical distribution of electrical power market, finding the optimum solution for the operation and design of power systems has become a necessity with the increasing cost of raw materials, depleting energy resources and the ever growing demand for electrical energy. In this paper, the real coded biogeography based optimization is proposed to minimize the operating cost with optimal setting of equality and inequality constraints of thermal power system. The proposed technique aims to improve the real coded searing ability, unravel the prematurity of solution and enhance the population assortment of the biogeography based optimization algorithm by using adaptive Gaussian mutation. This algorithm is demonstrated on the standard IEEE-30 bus system and the comparative results are made with existing population based methods.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권6호
• /
• pp.325-332
• /
• 2003

The loss minimization is one of the most important problems to save the operational cost in distribution systems. This paper presents an efficient method for optimal feeder reconfiguration of distribution systems. Chaos search algorithm (CSA) is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. In optimization problem, the CSA searches the global optimal solution on the basis of regularity in chaotic motions and easily escapes from local or near optimal solution. The CSA is tested on 15 buses and 32 buses distribution systems, and the results indicate that it is able to determine appropriate switching options for global optimum reconfiguration.

• 한국생산제조학회지
• /
• 제24권2호
• /
• pp.211-216
• /
• 2015

Recently, because of the growth in the leisure industry and interest in health, the demand for bicycles has increased. In this research, considering the vertical load on a bike frame under static state conditions, the deflection and mass of the bike frame were minimized by satisfying the service condition and performing optimization. The thickness of the bicycle-frame tube was set to a design variable, and its sensitivity was confirmed by an analysis of means (ANOM). To optimize the solution, a response-surface-method (RSM) model was constructed using D-Optimal and central composite design(CCD). The optimization was performed using a non-dominant sorting genetic algorithm (NSGA-II), and the optimal solution was verified by finite-element analysis.