Publication Type
Journal Article
Version
publishedVersion
Publication Date
2-2007
Abstract
A supervised genetic algorithm (SGA) is proposed to solve the quality of service (QoS) routing problems in computer networks. The supervised rules of intelligent concept are introduced into genetic algorithms (GAs) to solve the constraint optimization problem. One of the main characteristics of SGA is its searching space can be limited in feasible regions rather than infeasible regions. The superiority of SGA to other GAs lies in that some supervised search rules in which the information comes from the problems are incorporated into SGA. The simulation results show that SGA improves the ability of searching an optimum solution and accelerates the convergent process up to 20 times.
Keywords
QoS routing, Supervised genetic algorithm, Supervised search rules
Discipline
Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
Journal of Tianjin Polytechnic University
Volume
13
Issue
1
First Page
48
Last Page
52
ISSN
1671-024X
Publisher
Tianjin Polytechnic University
Citation
1
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Included in
Operations Research, Systems Engineering and Industrial Engineering Commons, Theory and Algorithms Commons