• Title/Summary/Keyword: optimal network

Search Result 3,098, Processing Time 0.037 seconds

Optimal design of the network service for the Electric Power Automation IT Infra. (전력자동화 통신망 인프라를 이용한 네트워크 서비스 최적 구축 방안)

  • Park, Soo-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.730-731
    • /
    • 2011
  • EPA(Electric Power Automation IT Infra) is a System for Protective Information Transmitter & Receiver and network service. KEPCO(Korea Electric Power Corporation) is building up a high-speed communication network to accept Smart Grid Infra expansion and various terminal communication media characteristic. Recently, MSPP(Multi Service Provisioning Platform) System is establishted to network service. But there are many considerations for optimal design of network service for the Electric Power Automation IT Infra.

  • PDF

A service Restoration and Optimal Reconfiguration of Distribution Network Using Genetic Algorithm and Tabu Search (유전 알고리즘과 Tabu Search를 이용한 배전계통 사고복구 및 최적 재구성)

  • Cho, Chul-Hee;Shin, Dong-Joon;Kim, Jin-O
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.2
    • /
    • pp.76-82
    • /
    • 2001
  • This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.

  • PDF

Clustering of Incomplete Data Using Autoencoder and fuzzy c-Means Algorithm (AutoEncoder와 FCM을 이용한 불완전한 데이터의 군집화)

  • 박동철;장병근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.700-705
    • /
    • 2004
  • Clustering of incomplete data using the Autoencoder and the Fuzzy c-Means(PCM) is proposed in this paper. The Proposed algorithm, called Optimal Completion Autoencoder Fuzzy c-Means(OCAEFCM), utilizes the Autoencoder Neural Network (AENN) and the Gradiant-based FCM (GBFCM) for optimal completion of missing data and clustering of the reconstructed data. The proposed OCAEFCM is applied to the IRIS data and a data set from a financial institution to evaluate the performance. When compared with the existing Optimal Completion Strategy FCM (OCSFCM), the OCAEFCM shows 18%-20% improvement of performance over OCSFCM.

An Application of the Optimal Routing Algorithm for Radial Power System using Improved Branch Exchange Technique (개선된 선로교환 기법을 이용한 방사상 전력계통의 최적 라우팅 알고리즘의 적용)

  • Kim, Byeong-Seop;Sin, Jung-Rin;Park, Jong-Bae
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.6
    • /
    • pp.302-310
    • /
    • 2002
  • This paper presents an application of a improved branch exchange (IBE) algorithm with a tie branch power (TBP) flow equation to solve the Optimal Routing problem for operation of a radial Power system including power distribution system. The main objective of the Optimal Routing problem usually is to minimize the network real power loss and to improve the voltage profile in the network. The new BE algorithm adopts newly designed methods which are composed by decision method of maximum loss reduction and new index of loss exchange in loop network Thus, the proposed algorithm in this paper can search the optimal topological structures of distribution feeders by changing the open/closed states of the sectionalizing and tie switches. The proposed algorithm has been evaluated with the practical IEEE 32, 69 bus test systems and KEPCO 148 bus test system to show favorable performance gained.

Synthetically Optimal Tie Switches Selection Algorithm Considering Important Elements in Distribution Power System (배전계통 운영의 중요요소들을 고려한 상시연계점 선정 종합 최적화 알고리즘)

  • Kim, June-Ho;Lim, Hee-Taek;Yu, Nam-Cheol;Lim, Il-Hyung;Choi, Myeon-Song;Lee, Seung-Jae;Ha, Bok-Nam
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.11
    • /
    • pp.2079-2088
    • /
    • 2009
  • The optimal operation in distribution system is to select tie switches considering important elements(Load balance, Loss minimization, Voltage drop, Restoration index..) in distribution system. Optimal Tie Switches Selection is very important in operation of distribution system because that is closely related with efficiency and reliability. In this paper, a new algorithm considering important elements is proposed to find optimal location of tie switches. In the case study, the proposed algorithm has been testified using real distribution network of KEPCO for verifying algorithm and complex network for applying future distribution network.

Optimal Traffic Control Method by the Cost-analytic Operations Model in Heterogeneous Network Environment (다중 네트워크 환경하에서의 한계 비용 함수에 의한 최적 트래픽 제어 기법)

  • Kim, Jae-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10A
    • /
    • pp.941-949
    • /
    • 2007
  • By the newly emerging Network access technology, we face the new heterogeneous network environment. The required level of service quality and diversity are now multiplied by the increment of wireless service subscribers. Focusing on the co-existence of multiple access network technology and the complex service needs of users, the wireless service operators should present the stable service quality for every user. The service operators should build the new operation framework which combines the pre-established networks and newly adopted ones. Our problem is finding the optimal heterogeneous network operation framework. We suggest a market-based marginal cost function for evaluating the relative value of resource of each network and develop the whole new heterogeneous network operation framework.

Development of Optimal Network Model for Conjunctive Operation of Water Supply System with Multiple Sources (다수원 상수도시스템 연계운영을 위한 최적 네트워크 모형 구축)

  • Ryu, Tae-Sang;Ha, Sung-Ryong;Cheong, Tae-Sung
    • Journal of Korea Water Resources Association
    • /
    • v.44 no.12
    • /
    • pp.1001-1013
    • /
    • 2011
  • Development of an optimal water supply system considering water quantity, quality, and economical efficiency is needed to decide optimal available area by combine water supply systems in overlapped area where are more than 2 water sources. The EPAnet and the KModSim were coupled to develop optimal network model. The developed network model was calibrated by measured data from water supply system in Geoje City, Korea in 2007 which have three water sources such as Sadeong booster pumping station, Guchun dam reservoir and Yoncho dam reservoir. The optimum network model was validated by operating results of 2011 to assess the economically optimized service area and optimal pump combination under the given hydraulic operating rules developed in this study. The developed model can be applied into designing water supply systems and operating rules for the conjunctive operation since the model can give the optimal solution satisfied with water quantity, economical efficiency and quality.

Optimal Graph Partitioning by Boltzmann Machine (Boltzmann Machine을 이용한 그래프의 최적분할)

  • Lee, Jong-Hee;Kim, Jin-Ho;Park, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.7
    • /
    • pp.1025-1032
    • /
    • 1990
  • We proposed a neural network energy function for the optimal graph partitioning and its optimization method using Boltzmann Machine. We composed a Boltzmann Machine with the proposed neural network energy function, and the simulation results show that we can obtain an optimal solution with the energy function parameters of A=50, B=5, c=14 and D=10, at the Boltzmann Machine parameters of To=80 and \ulcorner0.07 for a 6-node 3-partition problem. As a result, the proposed energy function and optimization parameters are proved to be feasible for the optimal graph partitioning.

  • PDF

Network Selection Algorithm for Heterogeneous Wireless Networks Based on Multi-Objective Discrete Particle Swarm Optimization

  • Zhang, Wenzhu;Kwak, Kyung-Sup;Feng, Chengxiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1802-1814
    • /
    • 2012
  • In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

A Naural Network-Based Computational Method for Generating the Optimized Robotic Assembly Sequence (자동조립에서의 신경회로망의 계산능력을 이용한 조립순서 최적화)

  • 홍대선;조형석
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.7
    • /
    • pp.1881-1897
    • /
    • 1994
  • This paper presents a neural network-based computational scheme to generate the optimized robotic assembly sequence for an assembly product consisting of a number of parts. An assembly sequence is considered to be optimal when it meets a number of conditions : it must satisfy assembly constraints, keep the stability of in-process subassemblies, and minimize assembly cost. To derive such an optimal sequence, we propose a scheme using both the Hopfield neural network and the expert system. Based upon the inferred precedence constraints and the assembly costs from the expert system, we derive the evolution equation of the network. To illustrate the suitability of the proposed scheme, a case study is presented for industrial product of an electrical relay. The result is compared with that obtained from the expert system.