Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 824196, 9 pages
http://dx.doi.org/10.1155/2014/824196
Research Article

A Modified Artificial Bee Colony Algorithm for -Center Problems

Department of Industrial Engineering, Uludag University, Görükle Campus, 16059 Bursa, Turkey

Received 31 August 2013; Accepted 11 November 2013; Published 29 January 2014

Academic Editors: A. G. Hernández-Díaz and W. Szeto

Copyright © 2014 Alkın Yurtkuran and Erdal Emel. 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. D. Chen and R. Chen, “New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems,” Computers and Operations Research, vol. 36, no. 5, pp. 1646–1655, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, USA, 1st edition, 1979.
  3. B. Pelegrin, “Heuristic methods for the p-center problem,” RAIRO Recherche Operationelle, vol. 25, pp. 65–72, 1991. View at Google Scholar
  4. Z. Drezner, “The p-center problem: heuristic and optimal algorithms,” Journal of the Operational Research Society, vol. 35, no. 8, pp. 741–748, 1984. View at Google Scholar · View at Scopus
  5. R. Chandrasekaran and A. Tamir, “Polynomially bounded algorithms for locating p-centers on a tree,” Mathematical Programming, vol. 22, no. 1, pp. 304–315, 1982. View at Publisher · View at Google Scholar · View at Scopus
  6. M. S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications, John Wiley & Sons, New York, NY, USA, 2011.
  7. G. Y. Handler, “P-center problems,” in Discrete Location Theory, P. B. Mirchandani and R. L. Francis, Eds., pp. 305–347, John Wiley & Sons, NewYork, NY, USA, 1990. View at Google Scholar
  8. N. Mladenović, M. Labbé, and P. Hansen, “Solving the p-center problem with Tabu search and variable neighborhood search,” Networks, vol. 42, no. 1, pp. 48–64, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. C. Caruso, A. Colorni, and L. Aloi, “Dominant, an algorithm for the p-center problem,” European Journal of Operational Research, vol. 149, no. 1, pp. 53–64, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. J. A. Pacheco and S. Casado, “Solving two location models with few facilities by using a hybrid heuristic: a real health resources case,” Computers and Operations Research, vol. 32, no. 12, pp. 3075–3091, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. T. Davidović, D. Ramljak, M. Šelmić, and D. Teodorović, “Bee colony optimization for the p-center problem,” Computers and Operations Research, vol. 38, no. 10, pp. 1367–1376, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. TR06, Erciyes University Press, Erciyes, Turkey, 2005. View at Google Scholar
  13. D. Karaboga and B. Basturk, “On the performance of artificial bee colony (ABC) algorithm,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 687–697, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. 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
  15. G. Zhu and S. Kwong, “Gbest-guided artificial bee colony algorithm for numerical function optimization,” Applied Mathematics and Computation, vol. 217, no. 7, pp. 3166–3173, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. W.-F. Gao and S.-Y. Liu, “A modified artificial bee colony algorithm,” Computers and Operations Research, vol. 39, no. 3, pp. 687–697, 2012. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Gao and S. Liu, “Improved artificial bee colony algorithm for global optimization,” Information Processing Letters, vol. 111, no. 17, pp. 871–882, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. G. Li, P. Niu, and X. Xiao, “Development and investigation of efficient artificial bee colony algorithm for numerical function optimization,” Applied Soft Computing Journal, vol. 12, no. 1, pp. 320–332, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. F. Kang, J. Li, and Z. Ma, “Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions,” Information Sciences, vol. 181, no. 16, pp. 3508–3531, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Singh, “An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem,” Applied Soft Computing Journal, vol. 9, no. 2, pp. 625–631, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. B. Alatas, “Chaotic bee colony algorithms for global numerical optimization,” Expert Systems with Applications, vol. 37, no. 8, pp. 5682–5687, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. W. F. Gao, S. Y. Liu, and L. L. Huang, “A novel artificial bee colony algorithm with Powell's method,” Applied Soft Computing, vol. 13, no. 9, pp. 3763–3775, 2013. View at Google Scholar
  23. Y. Xu, P. Fan, and L. Yuan, “A simple and efficient artificial bee colony algorithm,” Mathematical Problems in Engineering, vol. 2013, Article ID 526315, 9 pages, 2013. View at Publisher · View at Google Scholar
  24. B. Akay and D. Karaboga, “A modified Artificial Bee Colony algorithm for real-parameter optimization,” Information Sciences, vol. 192, pp. 120–142, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. M. H. Kashan, N. Nahavandi, and A. H. Kashan, “DisABC: a new artificial bee colony algorithm for binary optimization,” Applied Soft Computing Journal, vol. 12, no. 1, pp. 342–352, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. W. Y. Szeto, Y. Wu, and S. C. Ho, “An artificial bee colony algorithm for the capacitated vehicle routing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 126–135, 2011. View at Publisher · View at Google Scholar · View at Scopus
  27. M. S. Uzer, N. Yilmaz, and O. Inan, “Feature selection method based on artificial bee colony algorithm and support vector machines for medical datasets classification,” The Scientific World Journal, vol. 2013, Article ID 419187, 10 pages, 2013. View at Publisher · View at Google Scholar
  28. A. Alvarado-Iniesta, J. L. Garcia-Alcaraz, M. I. Rodriguez-Borbon, and A. Maldonado, “Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm,” Expert Systems with Applications, vol. 40, no. 12, pp. 4785–4790, 2013. View at Google Scholar
  29. J. Ji, H. Wei, C. Liu, and B. Yin, “Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem,” Mathematical Problems in Engineering, vol. 2013, Article ID 676275, 13 pages, 2013. View at Publisher · View at Google Scholar
  30. Q.-K. Pan, M. Fatih Tasgetiren, P. N. Suganthan, and T. J. Chua, “A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem,” Information Sciences, vol. 181, no. 12, pp. 2455–2468, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. L. Wang, G. Zhou, Y. Xu, S. Wang, and M. Liu, “An effective artificial bee colony algorithm for the flexible job-shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 60, no. 1–4, pp. 303–315, 2012. View at Publisher · View at Google Scholar · View at Scopus
  32. M. F. Tasgetiren, Q.-K. Pan, P. N. Suganthan, and A. H.-L. Chen, “A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops,” Information Sciences, vol. 181, no. 16, pp. 3459–3475, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. M. Fatih Tasgetiren, Q. K. Pan, P. N. Suganthan, and A. Oner, “A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion,” Applied Mathematical Modelling, vol. 37, no. 10-11, pp. 6758–6779, 2013. View at Google Scholar
  34. D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, “A comprehensive survey: artificial bee colony (ABC) algorithm and applications,” Artificial Intelligence Review, pp. 1–37, 2012. View at Publisher · View at Google Scholar · View at Scopus
  35. J. C. Bean, “Genetic algorithms and random keys for sequencing and optimization,” ORSA Journal on Computing, vol. 6, no. 2, pp. 154–160, 1994. View at Google Scholar
  36. L. V. Snyder and M. S. Daskin, “A random-key genetic algorithm for the generalized traveling salesman problem,” European Journal of Operational Research, vol. 174, no. 1, pp. 38–53, 2006. View at Publisher · View at Google Scholar · View at Scopus
  37. J. J. M. Mendes, J. F. Gonçalves, and M. G. Resende, “A random key based genetic algorithm for the resource constrained project scheduling problem,” Computers and Operations Research, vol. 36, no. 1, pp. 92–109, 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. T. F. Noronha, M. G. Resende, and C. C. Ribeiro, “A biased random-key genetic algorithm for routing and wavelength assignment,” Journal of Global Optimization, vol. 50, no. 3, pp. 503–518, 2011. View at Publisher · View at Google Scholar · View at Scopus
  39. P.-C. Chang, S.-H. Chen, and C.-Y. Fan, “A hybrid electromagnetism-like algorithm for single machine scheduling problem,” Expert Systems with Applications, vol. 36, no. 2, pp. 1259–1267, 2009. View at Publisher · View at Google Scholar · View at Scopus
  40. A. Yurtkuran and E. Emel, “A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems,” Expert Systems with Applications, vol. 37, no. 4, pp. 3427–3433, 2010. View at Publisher · View at Google Scholar · View at Scopus
  41. J. F. Gonçalves and M. G. Resende, “A parallel multi-population biased random-key genetic algorithm for a container loading problem,” Computers and Operations Research, vol. 39, no. 2, pp. 179–190, 2012. View at Publisher · View at Google Scholar · View at Scopus
  42. J. E. Beasley, “A note on solving large p-median problems,” European Journal of Operational Research, vol. 21, no. 2, pp. 270–273, 1985. View at Google Scholar · View at Scopus
  43. J. J. Dongarra, “Performance of various computers using standard linear equations software,” ACM SIGARCH Computer Architecture News, vol. 20, no. 3, pp. 22–44, 1992. View at Google Scholar