• 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.

• Journal of Information Technology Services
• /
• v.17 no.4
• /
• pp.101-117
• /
• 2018

Companies are responding appropriately to the rapidly changing business environment and striving to lead those changes. As part of that, we are meeting our strategic goals through IT projects, which increase the number of simultaneous projects and the importance of project portfolio management for successful project execution. It also strives for efficient deployment of human resources that have the greatest impact on project portfolio management. In the early stages of project portfolio management, it is very important to establish a reasonable manpower plan and allocate performance personnel. This problem is a problem that can not be solved by linear programming because it is calculated through the standard deviation of the input ratio of professional manpower considering the uniformity of load allocated to the input development manpower and the importance of each project. In this study, genetic algorithm, one of the heuristic methods, was applied to solve this problem. As the objective function, we used the proper input ratio of projects, the input rate of specialist manpower for important projects, and the equal load of workload by manpower. Constraints were not able to input duplicate manpower, Was used as a condition. We also developed a program for efficient application of genetic algorithms and confirmed the execution results. In addition, the parameters of the genetic algorithm were variously changed and repeated test results were selected through the independent sample t test to select optimal parameters, and the improvement effect of about 31.2% was confirmed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.354-359
• /
• 2013

In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

• Journal of the Korea Concrete Institute
• /
• v.18 no.2 s.92
• /
• pp.151-159
• /
• 2006

The guide line of the SFRC mix design was not established, and the convenience of the practical application on the spot is not so good. In this paper, hence, the program which is optimized to result the mix proportion by the flexural strength and toughness, was developed to apply to SFRC on the practical spot. This program could minimize the number of trial mixes and get an economical and appropriate mixture. In addition, the theoretical background on which the program is based, will be the basis of the embodied method to mixing SFRC. Additionally, new algorithm, in this paper, was used to develop the mix proportioning program of SFRC. The new algorithm is the Harmony Search which is the heuristic method mimicking the improvisation of music players, Musical performances seek a best state determined by aesthetic estimation, as the optimization algorithms seek a best state determined by objected function value. And, it was developed the program about single fiber reinforced concrete, beside to the hybrid fiber reinforced concrete that two kinds of steel fibers, which have the different geometry, was reinforced. This will be able to keep the world trend to study, hence, offers the basis of the next research about hybrid fiber reinforced concrete.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.146-170
• /
• 2017

Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.