• Title, Summary, Keyword: Optimal Algorithm

Search Result 6,099, Processing Time 0.065 seconds

Fuzzy genetic algorithm for optimal control (최적 제어에 대한 퍼지 유전 알고리즘의 적용 연구)

  • 박정식;이태용
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.297-300
    • /
    • 1997
  • This paper uses genetic algorithm (GA) for optimal control. GA can find optimal control profile, but the profile may be oscillating feature. To make profile smooth, fuzzy genetic algorithm (FGA) is proposed. GA with fuzzy logic techniques for optimal control can make optimal control profile smooth. We describe the Fuzzy Genetic Algorithm that uses a fuzzy knowledge based system to control GA search. Result from the simulation example shows that GA can find optimal control profile and FGA makes a performance improvement over a simple GA.

  • PDF

The Optimal Algorithm for Assignment Problem (할당 문제의 최적 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.9
    • /
    • pp.139-147
    • /
    • 2012
  • This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.

Optimal Oil Temperature at the Main Transformer Cooling System (주변압기 냉각시스템의 최적오일온도)

  • Han, Do-Young;Won, Jae-Young
    • Proceedings of the SAREK Conference
    • /
    • /
    • pp.955-960
    • /
    • 2009
  • In order to improve the efficiency of the main transformer in a tilting train, the optimal operation of a cooling system is necessary. Mathematical models of a main transformer cooling system were developed. These include models for the main transformer, the oil pump, the oil cooler, and the blower. The optimal oil temperature algorithm was also developed. This consists of the optimal setpoint algorithm and the control algorithm. A simulation program was developed by using mathematical models and the optimal oil temperature algorithm. Simulation results showed that the dynamic behavior of a main transformer cooling system was predicted well by mathematical models and a main transformer cooling system was controlled effectively by the optimal oil temperature algorithm.

  • PDF

Advanced Algorithm for $H_{\infty}$ Optimal controller synthesis ($H_{\infty}$ 최적 제어기 구성을 위한 개선된 알고리즘)

  • 김용규;양도철;유창근;장호성
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.149-152
    • /
    • 2002
  • The aim of this study is to analyse the problems occurred by using classical algorithm to synthesize the H$\infty$ optimal controller. The obtained result of analysis applied to the composition of algorithm for the new H$\infty$ optimal controller which was introduced in this study. The study investigates and compares H$\infty$ optimal controller formed by new algorithm with the one formed by classical algorithm. In particular, robustness related to the robust control is systematically described by using the composition of algorithm for the classical H$\infty$ optimal controller. In addition, the flow charts classified into classical algorithm and new one are discussed to synthesize the H$\infty$ optimal controller.

  • PDF

Optimal Capacitor Placement Considering Voltage-stability Margin with Hybrid Particle Swarm Optimization

  • Kim, Tae-Gyun;Lee, Byong-Jun;Song, Hwa-Chang
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.786-792
    • /
    • 2011
  • The present paper presents an optimal capacitor placement (OCP) algorithm for voltagestability enhancement. The OCP issue is represented using a mixed-integer problem and a highly nonlinear problem. The hybrid particle swarm optimization (HPSO) algorithm is proposed to solve the OCP problem. The HPSO algorithm combines the optimal power flow (OPF) with the primal-dual interior-point method (PDIPM) and ordinary PSO. It takes advantage of the global search ability of PSO and the very fast simulation running time of the OPF algorithm with PDIPM. In addition, OPF gives intelligence to PSO through the information provided by the dual variable of the OPF. Numerical results illustrate that the HPSO algorithm can improve the accuracy and reduce the simulation running time. Test results evaluated with the three-bus, New England 39-bus, and Korea Electric Power Corporation systems show the applicability of the proposed algorithm.

Cellular Parallel Processing Networks-based Dynamic Programming Design and Fast Road Boundary Detection for Autonomous Vehicle (셀룰라 병렬처리 회로망에 의한 동적계획법 설계와 자율주행 자동차를 위한 도로 윤곽 검출)

  • 홍승완;김형석
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.7
    • /
    • pp.465-472
    • /
    • 2004
  • Analog CPPN-based optimal road boundary detection algorithm for autonomous vehicle is proposed. The CPPN is a massively connected analog parallel array processor. In the paper, the dynamic programming which is an efficient algorithm to find the optimal path is implemented with the CPPN algorithm. If the image of road-boundary information is utilized as an inter-cell distance, and goals and start lines are positioned at the top and the bottom of the image, respectively, the optimal path finding algorithm can be exploited for optimal road boundary detection. By virtue of the parallel and analog processing of the CPPN and the optimal solution of the dynamic programming, the proposed road boundary detection algorithm is expected to have very high speed and robust processing if it is implemented into circuits. The proposed road boundary algorithm is described and simulation results are reported.

Determining the Optimal Basis in Karmarkar's Algorithm (Karmarkar 기법의 최적기저 결정에 관한 연구)

  • Kim, Byeong-Jae;Park, Soon-Dal
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.16 no.1
    • /
    • pp.89-96
    • /
    • 1991
  • When a feasible solution approaches to the optimal extreme point in Karmakar's algorithm, components of the search direction vector for a solution converge at a certain value according to the corresponding columns of the optimal basis and the optimal nonbasis. By using this convergence properties of Karmarkar's algorithm, we can identify columns of the optimal basis before the final stage of the algorithm. The complexity of Karmarker's algorithm with newly proposed termination criterion does not increase. A numerical experiments for the problems which were generated by random numbers are also illustrated. Experimental results show that the number of iterations required for determining columns of the optimal basis depends on problems. For all cases, however, columns of the optimal basis are exactly verified when this termination criterion is used.

  • PDF

An Optimal Algorithm for Aircraft Scheduling Problem by Column Generation (열(列) 생성(生成) 기법(技法)에 의한 항공기(航空機) 운항계획(運航計劃) 문제(問題)의 최적해법(最適解法))

  • Ki, Jae-Seug;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.4
    • /
    • pp.13-22
    • /
    • 1993
  • The aircraft scheduling, which is used to determine flight frequency, departure times and aircraft type assignments, is main problem of airline's planning. This paper proposes a new algorithm for aircraft scheduling that is to maximize airline profits. This paper proposes a column generation algorithm to get an optimal solution of the continous relaxation not using all the feasible variables, but using only a limited number of variables that is generated whenever it is necessary. Using this algorithm, proposes an optimal algorithm to get an optimal integer solution of aircraft scheduling problem efficiently. The effectiveness of the column generation algorithm and the optimal algorithm is illustrated by the computational results obtained from a series of real airline problems.

  • PDF

Efficient Bidirectional Search Algorithm for Optimal Route (최적 경로를 보장하는 효율적인 양방향 탐색 알고리즘)

  • 황보택근
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.6
    • /
    • pp.745-752
    • /
    • 2002
  • A* algorithm is widely used in optimal car route search which is a kind of informed search, since the locations of starting and ending points are known a priori. Unidirectional A* algorithm requires considerable search time but guarantees a optimal path, bidirectional A* algorithm does not guarantee a optimal path and takes even longer search time than unidirectional search to guarantee a optimal path. In this paper, a new bidirectional A* algorithm which requites less search time and guarantees a optimal path is proposed. To evaluate the efficiency of the proposed algorithm, several experiments are conducted in real road map and the results show that the algorithm is very effective in terms of finding a optimal path and search time.

  • PDF

Optimal strapdown coning compensation algorithm (최적 스트랩다운 원추 보상 알고리듬)

  • Park, Chan-Gook;Kim, Kwang-Jin;Lee, Jang-Gyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.2 no.3
    • /
    • pp.242-247
    • /
    • 1996
  • In this paper, an optimal coning compensation algorithm for strapdown system is proposed by minimizing the coning error. The proposed algorithm is derived as a generalized form in that it contains the class of the existing coning algorithms and allows the design of optimal algorithm for various combinations of gyro samples. It is shown the magnitude of resulting algorithm errors depends mainly on the total number of gyro samples including present and previous gyro samples. Based on the results, the proposed algorithm enables the algorithm designers to develop the effective coning compensation algorithm according to their attitude computation specifications with ease. In addition, the multirate method which can efficiently implement the algorithm is presented.

  • PDF