z-logo
open-access-imgOpen Access
Optimal topological design of power communication networks using genetic algorithm
Author(s) -
Abdolhamid Eshraghniaye Jahromi,
Zohreh Besharati Rad
Publication year - 2013
Publication title -
scientia iranica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.299
H-Index - 51
eISSN - 2345-3605
pISSN - 1026-3098
DOI - 10.1016/j.scient.2013.01.003
Subject(s) - genetic algorithm , computer science , power (physics) , topology (electrical circuits) , mathematical optimization , mathematics , physics , machine learning , combinatorics , quantum mechanics
An electric power supply is the backbone of development in advanced as well as in developing economies. An integral part of ensuring a secure power supply system is a power communication system. Due to the high and sustained performance requirements of power communication systems, electric companies prefer to construct their own communication networks privately rather than relying solely on a public communication system. The focus of this paper is on the optimal topological design of a power communication network. Based on advanced optimization models in public communication networks, and taking into account the specific Quality of Service, as demanded by various applications, such as protection, SCADA, voice, etc., an optimization model (PC/ISO) has been developed. The PC/ISO requires tedious numerical processing. Hence, a Genetic Algorithm (GA) is proposed to solve the optimization problem. In order to demonstrate the application of the proposed model for a power system communication network design and in order to evaluate GA solver results, a case study on designing the optimal communication network topology of one of the Iranian Regional Electric Companies has been conducted. The results suggest that the PC/ISO model and its GA solver are entirely viable and offer a simple, accurate, and cost effective solution

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here