Variable length encoded genetic algorithm for optimal electrical distribution network routing

James R.E. Fletcher, Tyrone Fernando, Herbert H.C. Iu, Mark Reynolds, Shervin Fani

Research output: Chapter in Book/Conference paperConference paperpeer-review

2 Citations (Scopus)

Abstract

We describe a genetic algorithm approach to the practical problem of electrical distribution network routing through areas of relatively sparse population. The objective is evaluated through minimizing the total network investment cost, comprised of capital and operational costs, over the selected time period. The genetic algorithm benefits from a variable length genome, a number of interesting mutations based on Steiner points and careful management of population diversity. Evaluation on a real network benchmark shows improved performance to previous approaches under the assumption of free path traversal, and warrants further investigation.

Original languageEnglish
Title of host publication2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings
Place of PublicationUSA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1-8
Number of pages8
Volume2018-January
ISBN (Electronic)9781538627259
DOIs
Publication statusPublished - 2 Feb 2018
Event2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Honolulu, United States
Duration: 27 Nov 20171 Dec 2017

Conference

Conference2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017
Country/TerritoryUnited States
CityHonolulu
Period27/11/171/12/17

Fingerprint

Dive into the research topics of 'Variable length encoded genetic algorithm for optimal electrical distribution network routing'. Together they form a unique fingerprint.

Cite this