• 한국산업정보학회논문지
• /
• 제10권4호
• /
• pp.54-64
• /
• 2005

인체 하지 근골격 시스템의 수학적 모델에 대해 최적제어 기법을 이용하여 최대 높이뛰기 운동을 재현하였다. 근육의 비선형 동적특성에 의해 순동역학 접근방법을 사용하였으며 최적제어는 최적화 프로그램인 마이크로 유전알고리즘과 VF02 비선형 최적화 프로그램을 적용하였다. 최대 높이뛰기 운동을 위한 근골격 모델에서 유전알고리즘만으로는 최적해를 얻을 수가 없었다. 유전알고리즘의 해를 비선형 최적화 프로그램의 초기 예측값으로 하여 도약시간에 따른 최적의 운동 신경자극도를 결정하였다. 이러한 접근방법은 초기의 인위적 예측값 없이 최대높이뛰기 운동에 대한 전역해를 제공하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 A
• /
• pp.3-5
• /
• 2001

When a fault occurs on distribution network. blackout region may happen, then it should be restored as fast as possible to minimize interruption of electric service. In this paper. A near optimal method to restore distribution network is proposed. For an optimal restoration, the number or switching operations must be minimized. The proposed method generates a general restoration plan for any distribution network fault and designed to reduce switching operations considering available load transfers. In this method overall process time can reduce with heuristic rules, which make a reduction of search space before restoration process. To achieve a near optimal solution, multiple load transfer algorithm is proposed too.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.35-39
• /
• 2004

In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

• 한국경영과학회지
• /
• 제29권3호
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• 한국경영과학회지
• /
• 제12권2호
• /
• pp.42-50
• /
• 1987

This objective of this paper is to develop an efficient method with small memory requirement for a feed-mixing problem on a micro computer. First this method uses the decomposition principle to reduce the memory requirement. Next, the decomposition principle is modified to fit the problem. Further four different variations in solving subproblems are designed in order to improve efficiency of the principle. According to the test with respect to the processing time, the best variation is such that the dual simplex method is used, and the optimal basis of a previous subproblem is used as an initial basis, and the master problem is (M +1) dimensional. In general, the convergence of solution becomes slower near the optimal value. This paper introduces a termination criterion for a sufficiently good solution. According to the test, 5%-tolerence is acceptable with respect to the relation between the processing time and optimal value.

• 대한전기학회논문지:전력기술부문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.117-129
• /
• 1998

This study is concerned with developing a heuristic for a web-based vehicle routing problem using mixed genetic algorithm(VRPMGA) which determines each vehicle route in order to minimize the transportation costs, subject to meeting the demands of all delivery points. VRP is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a mixed genetic algorithm by partitioned strategy which can give a good solution in comparatively brief time. The good features of the VRPMGA are, fristly, the ability of early convergence and, secondly, the capability of producing multiple, alternative, and near-optimal solutions. The VRPMGA is a useful algorithm that can be appliable to VRP and TSP. Finally, the computational test were performed using the benchmark problems and the proposed heuristic is compared with the other existing algorithms (COSA). The result of computational tests shows that proposed heuristic gives good solutions, in much shorter time, which are same as the best known solutions in the pervious research.

• 한국정보통신학회논문지
• /
• 제19권4호
• /
• pp.794-799
• /
• 2015

인도어 무선 통신 시스템에서 셀 아웃티지를 효율적으로 관리하기 위하여, 갑작스런 네트워크 결함을 신속하게 해결해야 한다. 본 논문에서는, 사용자들에게 끊김없는 서비스 제공을 위하여 근접-최적 셀 아웃티지 관리 (NoCOM: Near-Optimal Cell Outage Management) 기법을 제안한다. 시스템 용량, 사용자 공평성, 사용자 서비스 품질 보장 등을 동시에 고려하여, 제안 기법에서는 non-convex 최적화 문제를 기반으로 근접-최적 서브채널과 파워 해를 찾아 이를 사용자에게 반복적으로 할당한다. 시뮬레이션을 통하여 평균 셀 용량, 사용자 공평성, 계산 복잡도 관점에서 제안하는 기법의 우수성을 증명한다.

• 한국소음진동공학회논문집
• /
• 제13권10호
• /
• pp.785-790
• /
• 2003

This paper presents an approach to optimally design the air-hearing surface (ABS) of the optical flying head for near-field recording technology (NFR) NFR is an optical recording technology using very small beam spot size by overcoming the limit of beam diffraction. One of the most important problems in NFR Is a head disk interface (HDI) issue over the recording band during the operation. A multi-criteria optimization problem is formulated to enhance the flying performances over the entire recording band during the steady state. The optimal solution of the slider, whose target flying height is 50 nm, is automatically obtained. The flying height during the steady state operation becomes closer to the target values than those for the Initial one. The pitch and roll angles are also kept within suitable ranges over the recording band. Especially. all of the all-hearing stiffness are drastically increased by the optimized geometry of the air hearing surface.

• 한국정보통신학회논문지
• /
• 제17권4호
• /
• pp.847-856
• /
• 2013

본 논문에서는 실내 환경에서 위치 인식을 고려한 AP 배치 기법을 제안하고 성능평가를 수행하였다. 제안한 기법은 위치 인식율과 AP 기반 무선 네트워크의 성능 및 비용을 고려하여 근사 최적 AP 구성 형태를 생성하는 메타휴리스틱 알고리즘과 AP 배치 과정을 빠르게 수렴하게 하는 결정론적 알고리즘으로 구성된다. 실내 공간과 유사한 시뮬레이션 환경을 구축하여 제안한 AP 배치 기법의 성능 평가를 수행하였으며, 제안한 기법은 빠른 시간 내에 우수한 결과를 생성하였다.