An Improved and Realized Volatility Strategy of the Ant Colony Optimization Algorithm

Article Preview

Abstract:

In order to overcome the shortcomings of precocity and stagnation in ant colony optimization algorithm, an improved algorithm is presented. Considering the impact that the distance between cities on volatility coefficient, this study presents an model of adjusting volatility coefficient called Volatility Model based on ant colony optimization (ACO) and Max-Min ant system. There are simulation experiments about TSP cases in TSPLIB, the results show that the improved algorithm effectively overcomes the shortcoming of easily getting an local optimal solution, and the average solutions are superior to ACO and Max-Min ant system.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

849-853

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Thomas Stutzle, Holger H Hoos. MAX-MIN ant system[J]. future Generation Computer Systems, 2000, 16(8): 889-914.

DOI: 10.1016/s0167-739x(00)00043-1

Google Scholar

[2] Dorigo M, Maniezzo V, Colomi A. The Ant System: Optimization by A Colony of Cooperating Angents[J]. IEEE Transactions on Systems, Man & Cybernetics-Part B, 1996, 26(1): 29-41.

DOI: 10.1109/3477.484436

Google Scholar

[3] Marco Dorigo, Thomas Stutzle. Ant Colony Optimization[M]. Cambridge: The MIT Press, (2004).

Google Scholar

[4] Shang Gao, Jingyu Yang. Swarm Intelligence Algorithms and Applications[M]. Beijing: China Water Resources and Electricity Press, 2006: 1-13, 127-130.

Google Scholar

[5] Liang Ma, Gang Zhu, Aibing Ning. Ant Colony Optimization Algorithm [M]. Beijing: Science Press, 2008: 15-27.

Google Scholar

[6] Dorigo M, Gambardella L M. Ant Colony System: a CooperativeLearning Approach to the Traveling Salesman Problem[J]. IEEE Transactions on Evolutionary Computing, 1997, 1(1) 53-66.

DOI: 10.1109/4235.585892

Google Scholar

[7] Minseok Seo, Daecheol Kim. Ant colony optimization with parameterized search space for the job shop scheduling problem[J]. International Journal of Production Research, 2010, 48(4): 1143-1154.

DOI: 10.1080/00207540802538021

Google Scholar

[8] Rongwei Gan, Qingshun Guo, Huiyou Chang, Yang Yi. Improved ant colony optimization algorithm for the traveling salesman problems[J]. Journal of Engineering and Electronics, 2010, 21(2): 329-333.

DOI: 10.3969/j.issn.1004-4132.2010.02.025

Google Scholar

[9] Song Zheng, Dibo Hou, Zekui Zhou. Ant colony algorithm with dynamic transition probability[J]. Control and Decision, 2008, 23(2): 225-228.

Google Scholar

[10] Hongjian Chen, Leng Chen, Xiaohua Xu, Li Tu. An Improved Augment Ant Colony Algorithm[J]. Computer Engineering, 2005, 31(2): 176-178.

Google Scholar

[11] Chang Su, Jun Tu. An Adaptive Max-Min Ant Colony Algorithm[J]. Pattern Recognition and Artificial Intelligence, 2007, 20(5): 688-691.

Google Scholar

[12] Huaping Leng, Minghui Wang, Yongquan Yu. Max-Min Ant System And Solution To K-Tsp problem[J]. Computer Applications and Software, 2008, 25(2): 242-244.

Google Scholar