Share Email Print

Proceedings Paper

Step towards optimal topology of communication networks
Author(s): Zbigniew Michalewicz
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Genetic algorithms are adaptive algorithms which find solutions to problems by an evolutionary process based on natural selection. They can be used to find approximate solutions to optimization problems in cases where finding the precise optimum is prohibitively expensive, or where no algorithm is known. This paper discusses the use of (nonstandard) genetic algorithms for solving an optimization problem for a communication network. In the implementation of the system, a graph representation of a solution of the problem was used, as opposed to the representations based on bit strings (as is done in most work on genetic algorithms). This work is also a part of a larger project to create a new programming environment to support all kinds of optimization problems.

Paper Details

Date Published: 1 August 1991
PDF: 11 pages
Proc. SPIE 1470, Data Structures and Target Classification, (1 August 1991); doi: 10.1117/12.44844
Show Author Affiliations
Zbigniew Michalewicz, Univ. of North Carolina (United States)

Published in SPIE Proceedings Vol. 1470:
Data Structures and Target Classification
Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top