Research on ACO Algorithm Based on Scholarship Mechanism

Article Preview

Abstract:

Currently ,most of traditional Ant Colony Optimization algorithms that we are using were proved to be some critical issues, such as slow convergence and long time computation, search stagnation etc. A new improved ACO algorithm based on scholarship mechanism to balance between the search data processing and stagnation was addressed.Besides,the improved ACO alorithm was deeply analyzed and proved that the optimal solution can maintain ability for other path detection.The theoretical analysis and comparative experiments demonstrate that the imroved ACO has much better performance and can be used to solve the problems of convergence and search stagnation efficiently.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

741-744

Citation:

Online since:

October 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Dr. R. Anitha M. Subha, An Emerging Ant Colony Optimization Routing Algorithm (Acora) For Manets, Journal of Computer Applications, Vol-II, No. 3, July-Sep (2009).

Google Scholar

[2] Brijesh Bhatt Vasundhara Uchhula, Comparison of different Ant Colony Based Routing, IJCA Special Issue on MANETs, (2010).

Google Scholar

[3] Ku Ruhana Ku-Mahamud Alaa Aljanaby, An Exploration Technique for the Interacted Multiple Ant Colonies Optimization Framework, International Conference on Intelligent Systems, Modelling and Simulation, (2010).

DOI: 10.1109/isms.2010.28

Google Scholar

[4] A. Schulter, C. Westphall, Intrusion Detection Techniques in Grid and Cloud Computing Environment,. IT Professional , Sep. (2009).

Google Scholar

[5] R. S. Chang, J. S. Chang, P. S. Lin. An ant algorithm for balanced job scheduling in grids. Future Generation Computer System, 2009, 25(1): 20–27.

DOI: 10.1016/j.future.2008.06.004

Google Scholar

[6] F. Chicano, E. Alba. Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models. Information Processing Letters, 2008, 106(7): 221–231.

DOI: 10.1016/j.ipl.2007.11.015

Google Scholar

[7] S. U. Seckiner, M. Kurt. Ant colony optimization for the job rotation scheduling problem. Applied Mathematics and Computation, 2008, 201(1/2): 149–160.

DOI: 10.1016/j.amc.2007.12.006

Google Scholar

[8] X.Y. Yang B.X. Chen F.L. Qi. High-resolution algorithm based on temporal-spatial extrapolation.Journal of Systems Engineering and Electronics, 2010, 2l(1): 9-15.

Google Scholar

[9] C. E Juang P.H. Chang. Designing fuzzy-rule-based systems using continuous ant-colony optimization.IEEE Trans. on Fuzzy Systems, 2010, 18(1): 138~149.

DOI: 10.1109/tfuzz.2009.2038150

Google Scholar

[10] Tavares J, Pereira F B. Designing Pheromone Update Strategies with Strongly Typed Genetic Programming[J]. Lecture Notes in Computer Science, 2011, 662l: 85-96.

DOI: 10.1007/978-3-642-20407-4_8

Google Scholar