Drafs a Routing Algorithm Based on Distributed Food Sources Using Ant Colony Optimization

Volume 8, Issue 3, pp 265-281 http://dx.doi.org/10.22436/jmcs.08.03.10

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2433 Downloads
• 4472 Views

Authors

Arash Ghorbannia Delavar - Computer Science Department, Payame Noor Universtiy, PO BOX 19395-3697, Tehran, Iran. Emetis Niazmand - Computer Science Department, Payame Noor Universtiy, PO BOX 19395-3697, Tehran, Iran. Javad Bayrampoor - Computer Science Department, Payame Noor Universtiy, PO BOX 19395-3697, Tehran, Iran. Vahe Aghazarian - Islamic Azad University, Central Tehran Branch, Tehran, Iran.

Abstract

Distribution in routing algorithms based on food sources is a critical issue and the desired result could not be achieved through the old algorithms. For this purpose, participation of all sources through balanced distribution has been made in this proposed algorithm. In this paper, an improved routing algorithm based on distributed food sources is presented using the ant colony optimization. DRAFS algorithm helps us find the shortest path in order that we can generate a competence function, with the help of index parameters, to provide an optimal solution compared with other algorithms. Observing the distance and time parameters in finding the optimal solution, we introduce a target function which is accompanied by an increase in the algorithm efficiency. Comparing DRAFS algorithm with the previous routing algorithms, we have enjoyed the ants’ collaboration mechanism that results in the ants with high efficiency guiding the ants with low efficiency. Consequently, an optimal quality is achieved in the algorithm compared with the existing solutions. Finally, these two techniques help us improve the efficiency and reliability of the algorithm and, in comparison with previous algorithms, provide a distributed food source to reduce time accessibility to the source in large datasets.

Share and Cite

Keywords

• Ant colony optimization
• Distributed food sources
• Ants’ collaboration.

MSC

•  68T20
•  68W20
•  90C59

References

• [1] C. J. Liao, Y. L. Tsai, C. W. Chao, An ant colony optimization algorithm for setup coordination in a two-stage production system, Applied Soft Computing, 11 (2011), 4521–4529.
  • View Article
  • Google Scholar


• [2] V. A. Gromov, A. N. Shulga, Chaotic time series prediction with employment of ant colony optimization, Expert Systems with Applications, 39 (2012), 8474–8478.
  • View Article
  • Google Scholar


• [3] Z. Zhang, Z. Feng , Two-stage updating pheromone for invariant ant colony optimization algorithm, Expert Systems with Applications, 39 (2012), 706–712.
  • View Article
  • Google Scholar


• [4] S. Ilie, C. Bădică, Multi-agent approach to distributed ant colony optimization, Science of Computer Programming, 78 (2013), 762–774.
  • View Article
  • Google Scholar


• [5] S. Ilie, A. Bădică, C. Bădică, Distributed agent-based ant colony optimization for solving traveling salesman problem on a partitioned map, in: Proceedings of the International Conference on Web Intelligence, Mining and Semantics, WIMS ’11, ACM, 23 (2011), 1–23
  • View Article
  • Google Scholar


• [6] G. Reinelt, Tsplib — a traveling salesman library, ORSA Journal on Computing, 3 (1991), 376–384.
  • View Article
  • Google Scholar


• [7] A. Ghorbannia Delavar, V. Aghazarian, S. Sadighi, ERPSD: A New Model for Developing Distributed, Secure, and Dependable Organizational Software , CSIT (2009)
  • Google Scholar


• [8] A. Puris, R. Bello, F. Herrera, Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP Expert Systems with Applications, , 37 (2010), 5443–5453.
  • View Article
  • Google Scholar


• [9] R. J. Mullen, D. Monekosso, S. Barman, P. Remagnino, A review of ant algorithms, Expert Systems with Applications, 36 (2009), 9608–9617.
  • View Article
  • Google Scholar


• [10] A. Puris, R. Bello, Y. Martinez, A. Nowe, Two-stage ant colony optimization for solving the traveling salesman problem, In Nature inspired problem-solving methods in knowledge engineering, Second international work conference on the interplay between natural and artificial computation, La Manga del Mar Menor, Spain, IWINAC , (2007), 307–316.
  • View Article
  • Google Scholar


• [11] M. Birattari, P. Pellegrini, M. Dorigo , On the invariance of ant colony optimization, IEEE Transactions on Evolutionary Computation, 11 (2007), 732–742.
  • View Article
  • Google Scholar


• [12] M. Dorigo, C. Blum, Ant colony optimization theory: A survey, Theoretical Computer Science, 344 (2005), 243-278.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [13] Y. Bai, W. Zhang, Z. Jin, An new self-organizing maps strategy for solving the traveling salesman problem, Chaos, Solitons and Fractals, 28 (2006), 1082–1089.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [14] S. Depickere, D. Fresneau, J. Deneubourg, Effect of social and environmental factors on ant aggregation: A general response?, Journal of Insect Physiology, 54 (2008), 1349–1355.
  • View Article
  • Google Scholar


• [15] S. Ilie, C. Bădică , Distributed multi-agent system for solving traveling salesman problem using ant colony optimization, in: M. Essaaidi, M. Malgeri, C. Bădică (Eds.), Intelligent Distributed Computing IV, in: Studies in Computational Intelligence, Springer, Berlin/Heidelberg, 315 (2010), 119–129.
  • View Article
  • Google Scholar
  • MATH


• [16] S. Ilie, C. Bădică , Effectiveness of solving traveling salesman problem using ant colony optimization on distributed multi-agent middleware, in: Proceedings of the International Multi conference on Computer Science and Information Technology, (2010), 197–203.
  • View Article
  • Google Scholar


• [17] M. Pedemonte, S. Nesmachnow, H. Cancela, A survey on parallel ant colony optimization, Applied Soft Computing, 11 (2011), 5181–5197.
  • View Article
  • Google Scholar


• [18] R. Laura, B. Matteo, R. Gianluca, On ant routing algorithms in ad hoc networks with critical connectivity, Ad Hoc Networks (Elsevier), 6 (2008), 827–859.
  • View Article
  • Google Scholar


• [19] S. Misra, S. K. Dhurandher, M. S. Obaidat, K. Verma, P. Gupta, A low-overhead fault-tolerant routing algorithm for mobile ad hoc networks: A scheme and its simulation analysis, Simulation Modelling Practice and Theory, 18 (2010), 637–649.
  • View Article
  • Google Scholar


• [20] A. Ghorbannia Delavar, S. Hoseyny, R. Maghsoudi, BCO-Based Optimized Heuristic Strategies for QoS Routing, The Journal of Mathematics and Computer Science, 5 (2012), 105-114.
  • Google Scholar