Genetic algorithms and network ring design

White, A. R. P., Mann, J. W. and Smith, G. D. (1999) Genetic algorithms and network ring design. Annals of Operations Research, 86. pp. 347-371.

Full text not available from this repository.

Abstract

Optimal network ring design is a difficult problem characterised by the requirement tocompare a large number of potential solutions (network designs). The problem of networkring design can be described as consisting of three parts: routing, link capacity assignmentand ring determination. It has traditionally been broken down into a number of subproblems,solved in sequence, and usually by heuristics, thereby leading to locally‐optimal designsolutions. Genetic Algorithms (GAs) have shown themselves to be efficient at searchinglarge problem spaces and have been successfully used in a number of engineering problemareas, including telecommunications network design. We present an approach of a GA tothe network ring design problem in which the GA representation encapsulates all aspects ofthe problem and solves them simultaneously. A novel, hybrid bit and permutation representationis described, along with the fitness function for the design problem. Results ofapplying this representation to a number of test networks are presented and compared withheuristic design methods.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
Depositing User:	EPrints Services
Date Deposited:	01 Oct 2010 13:42
Last Modified:	24 Sep 2024 10:29
URI:	https://ueaeprints.uea.ac.uk/id/eprint/3660
DOI:	10.1023/A:1018919205346

Actions (login required)

View Item