z-logo
Premium
An approach to a problem in network design using genetic algorithms
Author(s) -
Palmer Charles C.,
Kershenbaum Aaron
Publication year - 1995
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230260305
Subject(s) - genetic algorithm , heuristic , mathematical optimization , algorithm , computer science , tree (set theory) , mathematics , combinatorics
This paper describes a new approach to finding solutions to the optimal communication spanning tree problem (OCSTP) using a genetic algorithm. The difficulties posed by this problem are reviewed and a genetic algorithm that consistently finds very good, if not optimal, solutions to it is presented. Finally, a comparison of the genetic algorithm's solutions to those produced by a good heuristic is given that demonstrates the genetic algorithm's ability to find solutions at least equivalent to, if not superior to, those found by the heuristic.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here