Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu Jun 2001

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu

Research Collection School Of Computing and Information Systems

We explore the use of GAs for solving a network optimization problem, the degree-constrained minimum spanning tree problem. We also examine the impact of encoding, crossover, and mutation on the performance of the GA. A specialized repair heuristic is used to improve performance. An experimental design with 48 cells and ten data points in each cell is used to examine the impact of two encoding methods, three crossover methods, two mutation methods, and four networks of varying node sizes. Two performance measures, solution quality and computation time, are used to evaluate the performance. The results obtained indicate that encoding has …


Traveling Salesman Problem For Surveillance Mission Using Particle Swarm Optimization, Barry R. Secrest Mar 2001

Traveling Salesman Problem For Surveillance Mission Using Particle Swarm Optimization, Barry R. Secrest

Theses and Dissertations

The surveillance mission requires aircraft to fly from a starting point through defended terrain to targets and return to a safe destination (usually the starting point). The process of selecting such a flight path is known as the Mission Route Planning (MRP) Problem and is a three-dimensional, multi-criteria (fuel expenditure, time required, risk taken, priority targeting, goals met, etc.) path search. Planning aircraft routes involves an elaborate search through numerous possibilities, which can severely task the resources of the system being used to compute the routes. Operational systems can take up to a day to arrive at a solution due …


Implementation And Analysis Of The Parallel Genetic Rule And Classifier Construction Environment, David M. Strong Mar 2001

Implementation And Analysis Of The Parallel Genetic Rule And Classifier Construction Environment, David M. Strong

Theses and Dissertations

This paper discusses the Genetic Rule and Classifier Construction Environment (GRaCCE), which is an alternative to existing decision rule induction (DRI) algorithms. GRaCCE is a multi-phase algorithm which uses evolutionary search to mine classification rules from data. The current implementation uses a genetic algorithm based 0/1 search to reduce the number of features to a minimal set of features that make the most significant contributions to the classification of the input data set. This feature selection increases the efficiency of the rule induction algorithm that follows. However, feature selection is shown to account for more than 98 percent of the …


Form Invariance And Implicit Parallelism, Michael D. Vose, Alden H. Wright Jan 2001

Form Invariance And Implicit Parallelism, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

Holland’s schema theorem (an inequality) may be viewed as an attempt to understand genetic search in terms of a coarse graining of the state space. Stephens and Waelbroeck developed that perspective, sharpening the schema theorem to an equality. Of particular interest is a “form invariance” of their equations; the form is unchanged by the degree of coarse graining. This paper establishes a similar form invariance for the more general model of Vose et al. and uses the attendant machinery as a springboard for an interpretation and discussion of implicit parallelism.