Research on Network Routing Optimisation Based on Improved Genetic Algorithm

Abstract:

Aiming at QoS multi-objective optimisation,this paper presents an improved genetic algorithm,which has been applied to solving the routing optimisation problem. This algorithm meets the requirements of bandwidth,delay and cost on the basis of router mathematical model. Also,it sets the targets of resource consumption and equilibrium load distribution,which makes the resource consumption least and balances the load distribution,thus, the occurrence of network congestion is reduced. Simulation proves that it has the advantages to certain extent.

• Periodical: Applied Mechanics and Materials (Volumes 380-384)
• Pages: 1362-1365
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.380-384.1362
• Online since: August 2013
• Authors: Lan Qin Yang, Xiao Yun Wang
• Keywords: Genetic Algorithm (GA), Network Congestion, Routing Optimisation

References

[1] Zhizhong Yin. Application of FPGA control DC motor servo system [J]. Inner Mongolia Science and Technology and Economy, 2008 177 (23) 101-103.

[2] Joerg Christian Wolf, Phil Hall, Paul Robinson, Phil Culverhouse. Bioloid based Humanoid Soccer Robot Design, (2007).

[3] Zhizhong Yin. Application of FPGA control DC motor servo system [J]. Inner Mongolia Science and Technology and Economy, 2008 177 (23) 101-103.

[4] Cheng R, Gen M, Tsujimura Y A Tutorial Survey of Job Computes& Industrial Engineering 1999 33(2): 343-364.

[5] Pan Q K, Tasgetiren M F, Liang Y C. A Discrete Particle Swarm Optimization Algorithm for the No Wait Flow Shop Scheduling Problem with Makespan Criterion[C]/Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group, UKPLANSIG2005, London, (2005).

DOI: 10.1007/s00170-007-1099-4

[6] PA N Quan-ke, WANG Wen-hong, ZHU Jian-ying, ZHAO Bao-hua. Hybrid heuristics based on optimization and variable neighborhood particle swarm search for Job Shop scheduling[J]. Computer Integrated Manufacturing Systems. 2007 13(2): 323-328.

[7] PAN Quan-ke, ZHU Jian-ying. The effective hybrid procedures based on evolutionary algorithms and simulated annealing algorithms for Job Shop scheduling problems[J]. Chinese Journal of Mechanical Engineering 2005, 41(6): 2242227.

DOI: 10.3901/jme.2005.06.224

[8] Kennedy J, Eberhart R. A discrete binary version of the particle swarm Multiconference algorithm [A]. Proceedings of the World on Systemics Cybernetics and Informatics[C]. Piscataway, 1997. 4104-4109. NJ: IEEE Service Center.

DOI: 10.1109/icsmc.1997.637339

[9] Cagnina L, Esquivel S, Gallard R. Particle swarm optimization for Proceeding of sequencing the 2004 Computation[C]. USA，2004 problems: Acasestudy[A]. Congresson Evolutionary 536- 541.

DOI: 10.1109/cec.2004.1330903

[10] Gao Shang, Han Bin, Wu Xiao-un, etc. Solving traveling salesman problem by hybrid particle swarm optimization algorithm[J]. Control and Decision, 2004, 19 (11): 1286-1289.

[11] Fan Kun, Zhang Ren-qian, Xia Guo-ping. Solving a Class of Job Shop Scheduling Problem based on Improved BPSO Algorithm[J]. Journal of System Engineering Theoryand Practice, 2007, 11.

DOI: 10.1016/s1874-8651(08)60067-8

[12] Liu Zhi-xiong. Solving scheduling problem of theparticle swarm algorithm coding method [J]. Journal of wuhan university of science and technology. 2010 (02), 33-1.

[13] Clerc, M. Discrete particle swarm optimization[A]. OnwuboluGC, Babu BV. New Optimization Techniques in Engineering[ C] . Springer-Verlag, 2004, 219- 240.

[14] Corce F D, Tadei R，Volta G. A genetic algorithm for the Job Shop problem[J]. Computers and Operations Research, 1995, 22(1): 15-24.

DOI: 10.1016/0305-0548(93)e0015-l

[15] LAARHOVEN P V，AARTS E，L ENSTRA J K. Job Shop scheduling by simulated annealing [J]. Operations Research，1992, 40 (1): 1132125.

DOI: 10.1287/opre.40.1.113