The Application of Amended MMAS in TSP with Dual Constraints

Author

Shao, Xiaolu ; Yang, Aiping ; Dai, Wenzhan

Author_Institution

Dept. of Autom., Zhejiang Sci-Tech Univ., Hangzhou, China

Volume

3

fYear

2009

fDate

14-16 Aug. 2009

Firstpage

75

Lastpage

78

Abstract

In this paper TSP (Traveling Salesman Problem) under dual constraints which any ant of colony can get stagnation or delay at any time but traffic network obstruction is not allowed is discussed in detail .The amended algorithm of MMAS (Max-Min Ant System) is put forward based on virtual broken factor. Compared with some other algorithms, it effectively protects network from potential safety hazard even case under which most ants come to standstill in the same time. Simulation results show it is very effective solution for TSP optimal problem under constraints.

Keywords

genetic algorithms; travelling salesman problems; amended MMAS; ant colony; dual constraint TSP; max min ant system; traffic network obstruction; traveling salesman problem; virtual broken factor; Automation; Communication system traffic control; Computer applications; Delay effects; Electronic mail; Finance; Forward contracts; Protection; Telecommunication traffic; Traveling salesman problems; Dual Constraints; MMAS; TSP;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2009. ICNC '09. Fifth International Conference on

Conference_Location

Tianjin

Print_ISBN

978-0-7695-3736-8

Type

conf

DOI

10.1109/ICNC.2009.463

Filename

5362648