An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network

Jun Bi; Jie Zhang; Wen Le Xu

doi:10.4028/www.scientific.net/AMM.121-126.1296

Paper Titles

Double-Crossed Step-Stress Accelerated Life Testing for Pneumatic Cylinder
p.1274

A Robust High Density 7T Subthreshold SRAM Bitcell with Partial Dynamic Threshold Voltage Connection Scheme
p.1279

The Research on Autofocus System of Miniature Five-Coordinate Image Measuring Machine
p.1286

Research of Reliability on the Switch Phase-Sensitive Circuit of the Equipment
p.1291

An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network
p.1296

Numerical Simulation of the Influence of Deposits on Heat Transfer Process in a Heat Recovery Steam Generator
p.1301

The Product-Mix Optimization with outside Processing Based on Theory of Constraints Oriented Cloud Manufacturing
p.1306

Design Optimization of Cutting Parameters when Drilling Metal Matrix Composites
p.1311

Study on Three-Dimension Computer Aided Process Planning System
p.1316

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 121-126An Improved Ant Colony Algorithm for the Shortest...

An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network

Abstract:

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are done in Beijing road network in China. The results of experiments show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge at the global optimum for the shortest path.

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 121-126)

Pages:

1296-1300

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.121-126.1296

Citation:

Cite this paper

Online since:

October 2011

Authors:

Jun Bi, Jie Zhang, Wen Le Xu

Keywords:

Ant Colony System, Road Network, Shortest Path

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Zakzouk, A.A.A., Zaher, H.M., El-Deen, R.A.Z. The 7th International Conference on Informatics and Systems , March, (2010): 28-30.

Google Scholar

[2] Along Yang, Lixin Gao , Yanping Luo. The 2nd International Conference on Computer Modeling and Simulation, (2010): 526 – 530.

Google Scholar

[3] Xiao-Min Hu, Jun Zhang. IEEE Transactions onSystems, Man, and Cybernetics, Part B: Cybernetics, (2010), 40(6): 1555 - 1566.

DOI: 10.1109/tsmcb.2010.2043094

Google Scholar

[4] Dorigo M, Maniezzo V, Colorni A. IEEE Transactions on Systems, Man, and Cybernetics-part B, (1996), 26(1): 29-41.

DOI: 10.1109/3477.484436

Google Scholar

[5] Zhang Rongqun, Zhu Daolin ; Studies on the Design and Development of Statistical Map Production System Based on MapInfo, WRI World Congress on Software Engineering, May, (2009): 345 – 349.

DOI: 10.1109/wcse.2009.303

Google Scholar

[6] Shiu Yin Yuen , Chi Kin Chow. IEEE Transactions on Evolutionary Computation, (2009), 13(2): 454-472.

DOI: 10.1109/tevc.2008.2003008

Google Scholar