• 한국융합학회논문지
• /
• 제11권4호
• /
• pp.11-16
• /
• 2020

해양 오염사고를 대비한 계획으로, 최적화된 배치안들을 수집하여 분석하는 연구가 필수적이지만, 해양 오염사고 대응을 위한 최적을 배치안을 다양화하고 분석한 연구는 아직 선행되지 않았다. 이러한 필요성에 따라, 우리는 방제자원 배치 최적화를 위한 유전알고리즘을 고안하고 이를 통해 최적의 방제 자원 배치안을 10,000 개 도출하였다. k-평균 알고리즘으로 군집화한 결과, 예상 최대 유출지역인 여수, 대산, 울산에 대하여 두 개의 군집으로 확연히 구분되었다. 우리는 이러한 군집을 새몬 맵핑을 통해 이차원으로 사영하여 배치안의 분포도를 분석하였고, 군집에 포함되는 배치안들이 그렇지 않은 배치안보다 시뮬레이션의 결과가 우수함을 확인했다. 향후, 본 연구를 기반으로 성능이 우수한 근사모델을 구현하는 것이 가능할 것으로 보인다.

• 제어로봇시스템학회논문지
• /
• 제11권1호
• /
• pp.77-83
• /
• 2005

This paper deals with determination of motions of a humanoid robot using genetic algorithm. A humanoid robot has some problems of the structural instability basically. So, we have to consider the stable walking gait in gait planning. Besides, it is important to make the smoothly optimal gait for saving the electric power. A mobile robot has a battery to move autonomously. But a humanoid robot needs more electric power in order to drive many joints. So, if movements of walking joints don't maintain optimally, it is difficult for a robot to have working time for a long time. Also, if a gait trajectory doesn't have optimal state, the expected life span of joints tends to be decreased. To solve these problems, the genetic algorithm is employed to guarantee the optimal gait trajectory. The fitness functions in a genetic algorithm are introduced to find out optimal trajectory, which enables the robot to have the less reduced jerk of joints and get smooth movement. With these all process accomplished by a PC-based program, the optimal solution could be obtained from the simulation. In addition, we discuss the design consideration for the joint motion and distributed computation of the humanoid, ISHURO, and suggest its result such as the structure of the network and a disturbance observer.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 정기총회 및 창립40주년기념 학술대회 학회본부
• /
• pp.97-100
• /
• 1987

An improved hydrothermal unit commitment algorithm is proposed for the purpose of optimal operation of electric power system. Especially, Dynamic Programming Method which is main scheme of the algorithm is modified to assure the feasible solution all the time. The effectiveness of the algorithm has been demonstrated by applying to a sample system.

• 한국전자통신학회논문지
• /
• 제2권3호
• /
• pp.174-179
• /
• 2007

본 논문에서는 유전자 알고리듬을 이용하여 전력, 면적, 속도를 고려한 저전력 모듈 선택을 제안한다. 제안한 알고리듬은 최적의 모듈 선택을 통해서 전력 소모를 최소화 할 수 있다. 비교 실험에서는 최적 모듈 선택을 고려한 알고리듬은 최대 전력 감소량은 26.9 %를 얻을 수 있었고, 반면에 최소 전력 감소량은 9.0% 얻었다. 모든 벤치마크 평균 전력 감소량은 15.525%가 되었다.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.235-245
• /
• 2008

The purpose of this paper is to develop a genetic algorithm to determine the optimal locations of base stations and relay stations in Wibro MMR Network. Various issues related to the genetic algorithm such as solution representation, selection method, crossover operator, mutation operator, and a heuristic method for improving the quality of solutions are presented. The computational results are presented for determining optimal parameters for the genetic algorithm, and show the convergence of the genetic algorithm.

• 산업공학
• /
• 제17권spc호
• /
• pp.28-36
• /
• 2004

The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.

• 한국정밀공학회지
• /
• 제29권4호
• /
• pp.469-478
• /
• 2012

This study aims to discover the optimal pipe layout for a ship, which generally needs a lot of time, efforts and experiences. Genetic algorithm was utilized to search for the optimum. Here the optimum stands for the minimum pipe length between two given points. Genetic algorithm is applied to planar pipe layout problems to confirm plausible and efficiency. Sub-programs are written to find optimal layout for the problems. Obstacles are laid in between the starting point and the terminal point. Pipe is supposed to bypass those obstacles. Optimal layout between the specified two points can be found using the genetic algorithm. Each route was searched for three case models in two-dimensional plane. In consequence of this, it discovered the optimum route with the minimized distance in three case models. Through this study, it is possible to apply optimization of ship pipe route to an actual ship using genetic algorithm.

• 한국정보시스템학회지:정보시스템연구
• /
• 제28권4호
• /
• pp.175-197
• /
• 2019

Purpose This study develops a heuristic algorithm to solve the time-resource tradeoffs in project scheduling problems with a real basis. Design/methodology/approach Resource constrained project scheduling problem with time-resource tradeoff is well-known as one of the NP-hard problems. Previous researchers have proposed heuristic that minimize Makespan of project scheduling by deriving optimal combinations from finite combinations of time and resource. We studied to solve project scheduling problems by deriving optimal values from infinite combinations. Findings We developed heuristic algorithm named Push Algorithm that derives optimal combinations from infinite combinations of time and resources. Developed heuristic algorithm based on simulated annealing shows better improved results than genetic algorithm and further research suggestion was discussed as a project scheduling problem with multiple resources of real numbers.

• 전기학회논문지
• /
• 제59권5호
• /
• pp.866-870
• /
• 2010

This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.

• 대한임베디드공학회논문지
• /
• 제8권4호
• /
• pp.219-225
• /
• 2013

This paper presents a method using Maximum-Likelihood Linear Regression (MLLR) adaptation to improve recognition performance of Limabeam algorithm for speech recognition using microphone array. From our investigation on Limabeam algorithm, we can see that the performance of filtering optimization depends strongly on the supporting optimal state sequence and this sequence is created by using Viterbi algorithm trained with HMM model. So we propose an approach using MLLR adaptation for the recognition of speech uttered in a new environment to obtain better optimal state sequence that support for the filtering parameters' optimal step. Experimental results show that the system embedded with MLLR adaptation presents the word correct recognition rate 2% higher than that of original calibrate Limabeam and also present 7% higher than that of Delay and Sum algorithm. The best recognition accuracy of 89.4% is obtained when we use 4 microphones with 5 utterances for adaptation.