A Study on the Optimization of the Constrained Routing Problem Based on Genetic-Ant Colony Algorithm

Author

Zeng, Xuan ; Tu, Zhenyu

Author_Institution

Sch. of Mech. & Electr. Eng., Nanchang Inst. of Technol., Nanchang, China

fYear

2010

fDate

13-15 Dec. 2010

Firstpage

860

Lastpage

863

Abstract

For the multi-constrained routing problem, there are several constrained parameters such as the bandwidth, delay, packet loss rate, delay jitter, the QoS parameters influence each other. It has been proved as a NP-Complete problem, traditional linear method often have some difficulties in solving this problem. The application of ant colony algorithm or genetic algorithm often has a slow convergence speed and might fall into the local optimal point. This paper introduces a hybrid algorithm (Genetic-Ant Colony Algorithm) which can reach the global optimum within a short time.

Keywords

computational complexity; genetic algorithms; quality of service; telecommunication network topology; NP-complete problem; QoS; constrained parameter; delay jitter; genetic algorithm; genetic ant colony algorithm; hybrid algorithm; multiconstrained routing problem; optimization; packet loss rate; traditional linear method; Bandwidth; Biological cells; Delay; Genetics; Jitter; Optimization; Routing; Ant Colony Algorithm; Constrained Routing; Genetic Algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-4244-8891-9

Electronic_ISBN

978-0-7695-4281-2

Type

conf

DOI

10.1109/ICGEC.2010.218

Filename

5715568