Soper, Alan ORCID: 0000-0002-0901-9803 and McKenzie, S. (1997) The use of a biased heuristic by a genetic algorithm applied to the design of multipoint connections in a local access network. IET Seminar Digest, 446. pp. 113-116. ISSN 0537-9989 (doi:https://doi.org/10.1049/cp:19971165)

Full text not available from this repository.

Abstract

This paper presents a genetic algorithm for finding a constrained minimum spanning tree. The problem is of relevance in the design of minimum cost communication networks, where there is a need to connect all the terminals at a user site to a terminal concentrator in a multipoint (tree) configuration, while ensuring that link capacity constraints are not violated. The approach used maintains a distinction between genotype and phenotype, which produces superior results to those found using a direct representation in a previous study.

Item Type:	Article
Additional Information:	2nd IEE International Conference on Genetic Algorighms in Engineering Systems: Innovations and Applications, 2-4 September 1997, Glasgow, UK
Uncontrolled Keywords:	computer networks, genetic algorithms,
Subjects:	Q Science > QA Mathematics
Pre-2014 Departments:	School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Computer & Computational Science Research Group School of Computing & Mathematical Sciences > Department of Computer Science School of Computing & Mathematical Sciences > Department of Computer Systems Technology School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Related URLs:	Organisation
Last Modified:	30 Sep 2019 13:43
URI:	http://gala.gre.ac.uk/id/eprint/364

Actions (login required)

View Item