Research and Application of an Improved Ant Colony Algorithm

Lan Shi; Shang Po Yang

doi:10.4028/www.scientific.net/AMM.543-547.1864

Paper Titles

Event Step Method on Computer Simulation of Discrete Event System
p.1848

Service Completion Event Processing on Computer Simulation for Discrete Event System
p.1852

Two Phase Recommendation Algorithm Based on Clustering User Interest and Trust
p.1856

Cubic Uniform B-Spline Curve and Surface with Multiple Shape Parameters
p.1860

Research and Application of an Improved Ant Colony Algorithm
p.1864

A Novel Hybrid Algorithm for Equalization of WBAN Channel
p.1868

Fast Discretization Algorithm of Densely Subdivided NURBS Curves
p.1872

Pedestrian Evacuation Simulation Based on Dynamic Parameter Model with Friction
p.1876

Bi-Cubic Interpolation Algorithm Based on Non-Subsampled Contourlet Transformation
p.1880

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547Research and Application of an Improved Ant Colony...

Research and Application of an Improved Ant Colony Algorithm

Abstract:

Ant colony algorithm is a bionic algorithm which is used to optimize the shortest path in graph. But the traditional ant colony algorithm has some disadvantages, such as slow convergence speed, easy to fall into local optimum, high complexity and so on. In this paper, it focus on the problems of slow convergence speed and easily falling into local optimum and contribute the local pheromone updating strategy and global pheromone updating strategy, it also optimize the routing formula and local search method after analyzing the problems. It conducts some simulation experiments about our optimization scheme and the traditional ant colony algorithm in Matlab environment, by comparing the results of experiments, the optimization scheme proposed can get a better search path in different examples and the μ (t) function can effectively reduce iterations.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

1864-1867

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.1864

Citation:

Cite this paper

Online since:

March 2014

Authors:

Lan Shi*, Shang Po Yang

Keywords:

Ant Colony Algorithm, Iteration, Pheromone Update, Shortest Path

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Marco Dorigo, Vittorio Maniezzo, Alberto Colorni. Ant System: Optimizaion by a Colony of Cooperating Agents [J], IEEE Transactions on Systems, man, and Cybernetics, 1996, 26(1): 1-13.

DOI: 10.1109/3477.484436

Google Scholar

[2] Anitha J. Ant colony optimization using pheromone updating strategy to solve job shop scheduling[A], 7th International Conference on Intelligent Systems and Control[C], 2013, 367-372.

DOI: 10.1109/isco.2013.6481181

Google Scholar

[3] Shokouhifar M, Sabet S. A pheromone-mutation based ant colony optimization for TSP[A], International Symposium on Innovations in Intelligent Systems and Applications[C], 2012, 1-5.

DOI: 10.1109/inista.2012.6247040

Google Scholar

[4] Euchi J, Yassine A, Chabchoub H. On the performance of artificial ant colony to solve the dynamic vehicle routing problem[A], 4th International Conference on Logistics [C], 2011, 38-43.

DOI: 10.1109/logistiqua.2011.5939400

Google Scholar

[5] Yongqing Huang, Changyong Liang, Xiangde Zhang. Parameter Establishment of an Ant System Based on Uniform Design [J], Control and Decision , 2006, 21(1): 93-96.

Google Scholar

[6] http: /www. iwr. uni-heidelberg. de/groups/comopt/software/TSPLIB95/tsp/U.

Google Scholar