DocumentCode
493484
Title
The Solving of Multi-Objective Network Designing Problem Based on Genetic Algorithm
Author
Lianshuan, Shi ; Liang, Yuan ; Zengyan, Li ; Dai Yi
Author_Institution
Comput. Dept., Tianjin Univ. of Technol. & Educ., Tianjin
Volume
1
fYear
2009
fDate
7-8 March 2009
Firstpage
446
Lastpage
449
Abstract
The genetic algorithm is used to solve the multi-objective networks design problem that requires selecting a best route to make a balance with cost and delay of the route. Firstly, the mathematical model of the problem is given, then the nondominated sorting generate algorithm is used to solve the model. The algorithm uses coding method with integer to form chromosomes and an initial population is generated randomly that satisfies all constraints. In selecting process, two objective-value delay and cost are calculated, the chromosomes are ranked according to the objective value, then the better chromosomes is selected for the crossover processing by the roulette method. The single point crossover based on deleting the cricoidpsilas genes is used in crossover process. Several examples of network design are given and the computing result shows that the approximate global optimal solution of the problem can be quickly obtained, and the solutions are obtained with high accuracy.
Keywords
computer networks; genetic algorithms; telecommunication network routing; coding method; crossover process; genetic algorithm; mathematical model; multiobjective network designing problem; network route optimisation; roulette method; routing deley; Algorithm design and analysis; Biological cells; Computer networks; Computer science education; Costs; Delay; Educational technology; Evolution (biology); Genetic algorithms; Mathematical model; Genetic algorithm; Multi-Objective optimization; Network optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-3581-4
Type
conf
DOI
10.1109/ETCS.2009.108
Filename
4958811
Link To Document