loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
The Solution for Link Enhancement Problem Based on Ant Algorithm
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
ASCII Text
x 
 
Yuhua Liu, Kaihua Xu, Haiyan Zhu, "The Solution for Link Enhancement Problem Based on Ant Algorithm," Computer and Information Technology, International Conference on, pp. 447-453, Fifth International Conference on Computer and Information Technology (CIT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2005.191,
author = {Yuhua Liu and Kaihua Xu and Haiyan Zhu},
title = {The Solution for Link Enhancement Problem Based on Ant Algorithm},
journal ={Computer and Information Technology, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2432-X},
pages = {447-453},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2005.191},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Technology, International Conference on
TI - The Solution for Link Enhancement Problem Based on Ant Algorithm
SN - 0-7695-2432-X
SP447
EP453
A1 - Yuhua Liu,
A1 - Kaihua Xu,
A1 - Haiyan Zhu,
PY - 2005
KW - Topology structure expansion
KW - Ant algorithm
KW - Link enhancement
KW - Heuristic method
VL - 0
JA - Computer and Information Technology, International Conference on
ER -
 
Yuhua Liu, Department of Computer Science, Central China Normal University
Kaihua Xu, The Institute of Digital Space, Central China Normal University
Haiyan Zhu, The Institute of Digital Space, Central China Normal University

In this paper, we discuss the essential of Traveling Salesman Problem (TSP) and Link Enhancement Problem. We present a solution for Link Enhancement Problem based on ant algorithm. To deal with the restriction condition, we propose two different kinds of strategies. By the simulation experiment, the algorithm is proved to be feasible. With the result of simulation experiment, we analyze the enactment of the parameters, and compare the performance of the two strategies.

Index Terms:
Topology structure expansion, Ant algorithm, Link enhancement, Heuristic method
Citation:
Yuhua Liu, Kaihua Xu, Haiyan Zhu, "The Solution for Link Enhancement Problem Based on Ant Algorithm," cit, pp.447-453, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.