The Routing Optimization Based on Improved Artificial Fish Swarm Algorithm

Author

Shan, Xiaojuan ; Jiang, Mingyan ; Li, Jingpeng

Author_Institution

Sch. of Inf. Sci. & Eng., Shandong Univ., Jinan

Volume

1

fYear

0

fDate

0-0 0

Firstpage

3658

Lastpage

3662

Abstract

A novel algorithm named artificial fish swarm algorithm (AFSA) is discussed to solve the problem of routing optimization in computer communication networks. An improved AFSA (IAFSA) with the taboo table and a new parameter is proposed to increase the global optimum capability and the neighborhood search ability of AFSA. A mathematical model of routing optimization based on the minimal time delay is established. By description and analysis of AFSA, its principle and convergence capability are given. The experiment demonstrates that IAFSA has better capability and rapidity to search the global optimum. Summarization of AFSA´s characteristics and ideas for improvement are presented according to the comparative result between AFSA and genetic algorithm

Keywords

artificial life; computer networks; particle swarm optimisation; telecommunication network routing; artificial fish swarm algorithm; computer communication networks; routing optimization; taboo table; Communication networks; Computer networks; Delay effects; Electronic mail; Genetic algorithms; Information science; Marine animals; Mathematical model; Routing; Systems engineering and theory; artificial fish swarm algorithm; combinatorial optimization; genetic algorithm; routing optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1713052

Filename

1713052