• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.2
• /
• pp.105-110
• /
• 2015

This study proposes the more improved mathematical model than conventional that for the 3-DOF Helicopter System in Quanser Inc., and checks the validity about the proposed model by performance comparison between the controller based on the conventional model and that based on the proposed model. Research process is next : First, analyze the dynamics for the 3-DOF helicopter system and establish the linear mathematical model. Second, check the eliminated nonlinear-elements in linearization process for establishing the linear mathematical model. And establish the improved mathematical model including the parameters corresponding to the eliminated nonlinear-elements. At that time, it is used for modeling that Particle Swarm Optimization algorithm the meta-heuristic global optimization method. Finally, design the controller based on the proposed model, and verify the validity of the proposed model by comparison about the experimental results between the designed controller and the controller based on the conventional model.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.645-653
• /
• 2002

The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

• Steel and Composite Structures
• /
• v.34 no.4
• /
• pp.467-485
• /
• 2020

Genetic Algorithm (GA) is a meta-heuristic algorithm which is capable of providing robust solutions for optimal design of structural components, particularly those one needs considering many design requirements. Hence, it has been successfully used by engineers in the typology optimization of structural members. As a novel approach, this study employs GA in order for conducting a case study with high constraints on the optimum mechanical properties of reinforced concrete (RC) beams under different load combinations. Accordingly, unified optimum sections through a computer program are adopted to solve the continuous beams problem. Genetic Algorithms proved in finding the optimum resolution smoothly and flawlessly particularly in case of handling many complicated constraints like a continuous beam subjected to different loads as moments shear - torsion regarding the curbs of design codes.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.12
• /
• pp.856-864
• /
• 2019

The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.388-388
• /
• 2019

하도 홍수추적의 방법은 크게 수리학적 방법과 수문학적 방법으로 구분할 수 있다. 수리학적 홍수추적 방법은 정확하지만 대량의 자료가 필요하고 시간이 오래 걸린다. 이와 반대로 수문학적 홍수추적 방법은 정확성은 떨어지지만 소량의 자료만 있으면 되고 시간이 적게 걸린다. 여러 수문학적 홍수추적에 관한 연구들이 있으며 대표적으로 Muskingum 방법이 있다. Muskingum 방법 중 Linear Muskingum Model(LMM)은 방정식의 구조적 한계 때문에 정확한 홍수추적이 어려웠고, 이를 개선하기위하여 Nonlinear Muskingum Model(NLMM), Nonlinear Muskingum Model Incorporation Lateral Flow(NLMM-L) 및 Advanced Nonlinear Muskingum Model Incorporating Lateral Flow(ANLMM-L)이 제안되었다. 본 연구는 수문학적 홍수추적 중 Muskingum 방법의 결과 차이가 어떤 요인으로 인해 발생하는지 검토하였다. 최적화 알고리즘으로 화음탐색법(Harmony Search, HS)을 사용하였으며 LMM, NLMM, NLMM-L 및 ANLMM-L의 매개변수를 산정하였다. 각 방법에 적용 시 HS의 매개변수에 변화를 주어 민감도 분석을 실시하였으며, 분석을 위한 홍수자료는 The Willson Flood data (1947)를 선택하였다. 오차비교방법은 Sum of Squares(SSQ), Root Mean Square Errors(RMSE), Nash-Sutcliffe Efficiency(NSE)를 비교하였다. 비교 결과 알고리즘의 성능에 의한 차이보다 홍수추적 방법의 차이가 더 영향이 큰 것으로 나타났다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2701-2717
• /
• 2023

In this paper, a hybrid fuzzy-based method is suggested for determining India's best system for power generation. This suggested approach was created using a fuzzy-based combination of the Giza Pyramids Construction (GPC) and Recalling-Enhanced Recurrent Neural Network (RERNN). GPC is a meta-heuristic algorithm that deals with solutions for many groups of problems, whereas RERNN has selective memory properties. The evaluation of the current load requirements and production profile information system is the main objective of the suggested method. The Central Electricity Authority database, the Indian National Load Dispatch Centre, regional load dispatching centers, and annual reports of India were some of the sources used to compile the data regarding profiles of electricity loads, capacity factors, power plant generation, and transmission limits. The RERNN approach makes advantage of the ability to analyze the ideal power generation from energy data, however the optimization of RERNN factor necessitates the employment of a GPC technique. The proposed method was tested using MATLAB, and the findings indicate that it is effective in terms of accuracy, feasibility, and computing efficiency. The suggested hybrid system outperformed conventional models, achieving the top result of 93% accuracy with a shorter computation time of 6814 seconds.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Journal of Electrical Engineering and Technology
• /
• v.13 no.3
• /
• pp.1043-1051
• /
• 2018

The coordination of directional overcurrent relay (DOCR) is employed in this work, considering gray wolf optimizer (GWO), a recently designed optimizer that employs the hunting and leadership attitude of gray wolves for searching a global optimum. In power system protection coordination problem, the objective function to be optimized is the sum of operating time of all the main relays. The coordination of directional overcurrent relays is formulated as a linear programming problem. The proposed optimization technique aims to minimize the time dial settings (TDS) of the relays. The calculation of the Time Dial Setting (TDS) setting of the relays is the core of the coordination study. In this article two case studies of IEEE 6-bus system and IEEE 30-bus system are utilized to see the efficiency of this algorithm and the results had been compared with the other algorithms available in the reference and it was observed that the proposed scheme is quite competent for dealing with such problems. From analyzing the obtained results, it has been found that the GWO approach provides the most globally optimum solution at a faster convergence speed. GWO has achieved a lot of relaxation due to its easy implementation, modesty and robustness. MATLAB computer programming has been applied to see the effectiveness of this algorithm.

• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.2
• /
• pp.311-316
• /
• 2016

Network intrusion detection system based on machine learning method such as artificial neural network is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features, which guarantees accuracy and efficienty, from generally used many features to detect network intrusion requires extensive computing resources. In this paper, we deal with a optimal feature selection problem to determine 6 denial service attacks and normal usage provided by NSL-KDD data. We propose a optimal feature selection algorithm. Proposed algorithm is based on the multi-start local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In order to evaluate the performance of our proposed algorithm, comparison with a case of all 41 features used against NSL-KDD data is conducted. In addtion, comparisons between 3 well-known machine learning methods (multi-layer perceptron., Bayes classifier, and Support vector machine) are performed to find a machine learning method which shows the best performance combined with the proposed feature selection method.