Investigation of Code Complexity of an Innovative Algorithm Based on ACO in Weighted Graph Traversing and Compare it to Traditional ACO and Bellman-Ford

Author： Ahangarikiasari Hojjatollah   Saraji Mehdi Rahmani   Torabi Mohammad  

Publisher： American Scientific Publishers

ISSN： 2326-750X

Source： Journal of Bioinformatics and Intelligent Control, Vol.2, Iss.1, 2013-03, pp. : 73-78

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

ACO-based BW algorithm for parameter estimation of hidden Markov models

By Ju Qingmiao Wang; Shiguang  

International Journal of Computer Applications in Technology, Vol. 41, Iss. 3-4, 2011-09 ,pp. : 281-286

Inderscience Publishers

Access to resources Recommend Favorite

ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

By  

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 3, Iss. 3, 2011-07 ,pp. : 20-30

IGI Global_journal

Access to resources Recommend Favorite

Using the ACO algorithm for path searches in social networks

By Rivero Jessica  

Applied Intelligence, Vol. 36, Iss. 4, 2012-06 ,pp. : 899-917

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid ACO/PSO algorithm and its applications

By Zhang Yi   Zhang Meng   Liang Yan-chun  

International Journal of Modelling, Identification and Control, Vol. 8, Iss. 4, 2009-12 ,pp. : 309-316

Inderscience Publishers

Access to resources Recommend Favorite

Solving 0-1 knapsack problem by continuous ACO algorithm

By Changdar Chiranjit   Mahapatra G.S.   Pal Rajat Kumar  

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 3-4, 2013-11 ,pp. : 333-349

Inderscience Publishers

Access to resources Recommend Favorite