Skip to main content
Top

2016 | OriginalPaper | Chapter

Quick Convergence Algorithm of ACO Based on Convergence Grads Expectation

Authors : Zhongming Yang, Yong Qin, Huang Han, Yunfu Jia

Published in: Computational Intelligence and Intelligent Systems

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

While the ACO can find the optimal path of network, there are too many iterative times and too slow the convergence speed is also very slow. This paper proposes the Q-ACO QoSR based on convergence expectation with the real-time and the high efficiency of network. This algorithm defines index expectation function of link, and proposes convergence expectation and convergence grads. This algorithm can find the optimal path by comparing the convergence grads in a faster and bigger probability. This algorithm improves the ability of routing and convergence speed.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Colorni, A., Dorigo, M., Maniezzo, V., et al.: Distributed optimization by ant colonies. In: Proceedings of the 1st European Conference on Artificial Life, pp. 134–142(1991) Colorni, A., Dorigo, M., Maniezzo, V., et al.: Distributed optimization by ant colonies. In: Proceedings of the 1st European Conference on Artificial Life, pp. 134–142(1991)
2.
go back to reference Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agent. IEEE Trans. Syst. Man Cybern. Part B 26(1), 29–41 (1996)CrossRef Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agent. IEEE Trans. Syst. Man Cybern. Part B 26(1), 29–41 (1996)CrossRef
3.
go back to reference Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167–176 (1999)CrossRefMATH Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167–176 (1999)CrossRefMATH
4.
5.
go back to reference Colorni, A., Dorigo, M., Maniezzo, V., et al.: Ant system for job-shop scheduling. Belg. J. Oper. Res. Statist. Comput. Sci. 34, 39–53 (1994)MATH Colorni, A., Dorigo, M., Maniezzo, V., et al.: Ant system for job-shop scheduling. Belg. J. Oper. Res. Statist. Comput. Sci. 34, 39–53 (1994)MATH
6.
go back to reference Cui, X., Lin, C.: A Constrained quality of service routing algorithm with multiple objectives. J. Comput. Res. Develop. 41(8), 1368–1375 (2004) Cui, X., Lin, C.: A Constrained quality of service routing algorithm with multiple objectives. J. Comput. Res. Develop. 41(8), 1368–1375 (2004)
7.
go back to reference Cui, X., Lin, C.: Multicast QoS routing optimization based on multi-objective genetic algorithm. Chin. J. Comput. 41(7), 1144–1150 (2004) Cui, X., Lin, C.: Multicast QoS routing optimization based on multi-objective genetic algorithm. Chin. J. Comput. 41(7), 1144–1150 (2004)
8.
go back to reference Cui, Y., Wu, J., Xu, K., Xu, M.: Research on internetwork QoS routing algorithms: a survey. J. Softw. 13(11), 2065–2073 (2002) Cui, Y., Wu, J., Xu, K., Xu, M.: Research on internetwork QoS routing algorithms: a survey. J. Softw. 13(11), 2065–2073 (2002)
9.
go back to reference Li, Y., Ma, Z.: A mitigating stagnation-based ant colony optimization routing algorithm. In: Proceedings of ISCIT (2005), pp. 34–37 (2005) Li, Y., Ma, Z.: A mitigating stagnation-based ant colony optimization routing algorithm. In: Proceedings of ISCIT (2005), pp. 34–37 (2005)
10.
go back to reference Wang, Z., Zhang, D., A Qos multicast routing algorithm based on ant colony algorithm. In: IEEE 1007(2005), pp. 1007–1009 (2005) Wang, Z., Zhang, D., A Qos multicast routing algorithm based on ant colony algorithm. In: IEEE 1007(2005), pp. 1007–1009 (2005)
11.
go back to reference Li, L., Yang, X., et al.: Research of multi-path routing protocol based on parallel ant colony algorithm optimization in mobile ad hoc networks. In: Fifth International Conference on Information Technology: New Generations (2008), pp. 1006–1010 (2008) Li, L., Yang, X., et al.: Research of multi-path routing protocol based on parallel ant colony algorithm optimization in mobile ad hoc networks. In: Fifth International Conference on Information Technology: New Generations (2008), pp. 1006–1010 (2008)
12.
go back to reference Qi, J., Zhang, S., Sun, Y., Lei, Y.: Cognitive networks multi-constraint QoS routing algorithm based on autonomic ant colony algorithm. J. Nanjing University Posts Telecommun. (Nat. Sci.) 32(6), 86–91 (2012) Qi, J., Zhang, S., Sun, Y., Lei, Y.: Cognitive networks multi-constraint QoS routing algorithm based on autonomic ant colony algorithm. J. Nanjing University Posts Telecommun. (Nat. Sci.) 32(6), 86–91 (2012)
13.
go back to reference Wang, H., Li, Y.: Quantum ant colony algorithm for QoS best routing problem. Comput. Simul.31(3), 295–298 (2014) Wang, H., Li, Y.: Quantum ant colony algorithm for QoS best routing problem. Comput. Simul.31(3), 295–298 (2014)
15.
go back to reference Hao, Z.-F., Huang, H., Zhang, X., Tu, K.: A time complexity analysis of ACO for linear functions. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 513–520. Springer, Heidelberg (2006)CrossRef Hao, Z.-F., Huang, H., Zhang, X., Tu, K.: A time complexity analysis of ACO for linear functions. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 513–520. Springer, Heidelberg (2006)CrossRef
16.
go back to reference Han, H., Hao, Z., et al.: The convergence speed of ant colony optimization. Chin. J. Comput. 8, 1345–1353 (2007) Han, H., Hao, Z., et al.: The convergence speed of ant colony optimization. Chin. J. Comput. 8, 1345–1353 (2007)
17.
go back to reference Zhang, M.: Research of virtual machine load balancing based on ant colony optimization in cloud computing and muiti-dimensional QoS. Comput. Sci. 40, 60–62 (2013) Zhang, M.: Research of virtual machine load balancing based on ant colony optimization in cloud computing and muiti-dimensional QoS. Comput. Sci. 40, 60–62 (2013)
18.
go back to reference Duan, W., Fu, X., et al.: QoS constraints task scheduling based on genetic algorithm and ant colony algorithm under cloud computing environment. J. Comput. Appl. 34, 66–69 (2014) Duan, W., Fu, X., et al.: QoS constraints task scheduling based on genetic algorithm and ant colony algorithm under cloud computing environment. J. Comput. Appl. 34, 66–69 (2014)
Metadata
Title
Quick Convergence Algorithm of ACO Based on Convergence Grads Expectation
Authors
Zhongming Yang
Yong Qin
Huang Han
Yunfu Jia
Copyright Year
2016
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-0356-1_13

Premium Partner