Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016 (2016), Article ID 5136327, 12 pages
http://dx.doi.org/10.1155/2016/5136327
Research Article

AntStar: Enhancing Optimization Problems by Integrating an Ant System and Algorithm

College of Computer and Information Sciences (CCIS), King Saud University, P.O. Box 5117, Riyadh 11543, Saudi Arabia

Received 13 September 2015; Revised 17 December 2015; Accepted 24 December 2015

Academic Editor: Stéphane Caro

Copyright © 2016 Mohammed Faisal et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29–41, 1996. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Dorigo and M. Birattari, “Ant colony optimization,” in Encyclopedia of Machine Learning, pp. 36–39, Springer, 2010. View at Google Scholar
  3. J. Kennedy, “Particle swarm optimization,” in Encyclopedia of Machine Learning, pp. 760–766, Springer, New York, NY, USA, 2010. View at Publisher · View at Google Scholar
  4. D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. tr06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005. View at Google Scholar
  6. X.-S. Yang, “Firefly algorithms for multimodal optimization,” in Stochastic Algorithms: Foundations and Applications, vol. 5792 of Lecture Notes in Computer Science, pp. 169–178, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. H. Shah-Hosseini, “The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm,” International Journal of Bio-Inspired Computation, vol. 1, no. 1-2, pp. 71–79, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Shah-Hosseini, “Problem solving by intelligent water drops,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 3226–3231, IEEE, Singapore, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Głąbowski, B. Musznicki, P. Nowak, and P. Zwierzykowski, “Shortest path problem solving based on ant colony optimization metaheuristic,” Image Processing & Communications, vol. 17, pp. 7–17, 2012. View at Google Scholar
  10. Y.-T. Hsiao, C.-L. Chuang, and C.-C. Chien, “Ant colony optimization for best path planning,” in Proceedings of the IEEE International Symposium on Communications and Information Technologies (ISCIT '04), vol. 1, pp. 109–113, IEEE, Sapporo, Japan, October 2004. View at Publisher · View at Google Scholar · View at Scopus
  11. G.-Z. Tan, H. He, and A. Sloman, “Ant colony system algorithm for real-time globally optimal path planning of mobile robots,” Acta Automatica Sinica, vol. 33, no. 3, pp. 279–285, 2007. View at Publisher · View at Google Scholar
  12. O. Montiel, U. Orozco-Rosas, and R. Sepúlveda, “Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles,” Expert Systems with Applications, vol. 42, no. 12, pp. 5177–5191, 2015. View at Publisher · View at Google Scholar
  13. M. A. Contreras-Cruz, V. Ayala-Ramirez, and U. H. Hernandez-Belmonte, “Mobile robot path planning using artificial bee colony and evolutionary programming,” Applied Soft Computing Journal, vol. 30, pp. 319–328, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Mo and L. Xu, “Research of biogeography particle swarm optimization for robot path planning,” Neurocomputing, vol. 148, pp. 91–99, 2015. View at Publisher · View at Google Scholar · View at Scopus
  15. N. S. Pal and S. Sharma, “Robot path planning using swarm intelligence: a survey,” International Journal of Computer Applications, vol. 83, no. 12, pp. 5–12, 2013. View at Publisher · View at Google Scholar
  16. P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968. View at Publisher · View at Google Scholar
  17. J.-L. Deneubourg, J. M. Pasteels, and J.-C. Verhaeghe, “Probabilistic behaviour in ants: a strategy of errors?” Journal of Theoretical Biology, vol. 105, no. 2, pp. 259–271, 1983. View at Publisher · View at Google Scholar · View at Scopus
  18. J. L. Deneubourg and S. Goss, “Collective patterns and decision-making,” Ethology Ecology & Evolution, vol. 1, no. 4, pp. 295–311, 1989. View at Publisher · View at Google Scholar
  19. S. Goss, R. Beckers, J.-L. Deneubourg, S. Aron, and J. M. Pasteels, “How trail laying and trail following can solve foraging problems for ant colonies,” in Behavioural Mechanisms of Food Selection, vol. 20 of NATO ASI Series, pp. 661–678, Springer, Berlin, Germany, 1990. View at Publisher · View at Google Scholar
  20. E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, Oxford, UK, 1999.
  21. A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed optimization by ant colonies,” in Proceedings of the 1st European Conference on Artificial Life, pp. 134–142, Paris, France, December 1991.
  22. M. M. Flood, “The traveling-salesman problem,” Operations Research, vol. 4, pp. 61–75, 1956. View at Publisher · View at Google Scholar · View at MathSciNet
  23. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, Cambridge, Mass, USA, 2001.
  25. J. J. Watkins, Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, Princeton, NJ, USA, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  26. H. Kellerer, U. Pferschy, and D. Pisinger, Introduction to NP-Completeness of Knapsack Problems, Springer, 2004.
  27. S. Khan, M. Bilal, M. Sharif, M. Sajid, and R. Baig, “Solution of n-Queen problem using ACO,” in Proceedings of the IEEE 13th International Multitopic Conference (INMIC '09), pp. 1–5, IEEE, Islamabad, Pakistan, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. H. Shah-Hosseini, “Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem,” International Journal of Intelligent Computing and Cybernetics, vol. 1, no. 2, pp. 193–212, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet