Solving p-Hub Median Problem via Artificial Bee Colony Algorithm Considering Different Search Strategies
Betül Yıldırım1*, Latife Görkemli2
1Nuh Naci Yazgan University , Kayseri , Turkey
2Erciyes University , Kayseri , Turkey
* Corresponding author: byildirim@nny.edu.tr
Presented at the International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA2019), Ürgüp, Turkey, Jul 05, 2019
SETSCI Conference Proceedings, 2019, 8, Page (s): 75-79 , https://doi.org/10.36287/setsci.4.5.017
Published Date: 12 October 2019
The hub location problem deals with locating hub facilities and allocating non-hub nodes to hub. Hub location problem is classified as p-hub median problem, p-hub center problem, hub covering problem and hub location problem with fixed cost in the literature. In this paper, multiple allocation p-hub median problem type is discussed. Artificial bee colony algorithm is used to solve multiple allocation p-hub median problem. The artificial bee colony algorithm which is orginally developed for solving continuous optimization problems is adapted to handle the discrete structure of the hub location problem. Different search strategies are considered in order to obtain more efficient solutions. With individually coded approaches, the performances of the algorithm are tested and its effectiveness are demonstrated.
Keywords - Hub Location Problems, p-Hub Median Problems, Artificial Bee Colony Algorithm, Optimization, Multiple Allocation
[1] S. Alumur, B.Y. Kara, “Network hub location problems: The state of the art,” European Journal of Operational Research, vol. 190, pp. 1-21, 2008.
[2] M. E. O’Kelly, “The location of interacting hub facilities,” Transportation Science, vol. 20, pp.92-105, 1986.
[3] J. F. Campbell, “Location and allocation for distribution systems with transhipments and transportation economies of scale,” Annals of Operations Research, vol.40, pp.77-99, 1992.
[4] J. F. Campbell, “Integer programming formulations of discrete Hub location problem,” European Journal of Operational Research, vol.72, pp. 387-405, 1994.
[5] N. Boland, M. Krishnamoorthy, A. T. Ernst and J. Ebery, “Preprocessing and cutting for multiple allocation hub location problems,” European Journal of Operational Research, vol.155,pp.638-653, 2004.
[6] J. Kratica, “An electromagnetism-like metaheuristic for the uncapacitated multiple allocation p-hub median problem,”Computers &Industrial Engineering, vol. 66, pp.1015-1024, 2013.
[7] D. Karaboğa, B. Görkemli, C. Öztürk, N. Karaboğa, “A comprehensive Survey: artificial bee colony (ABC) algorithm and applications”, Artificial Intelligence Review, vol. 42, pp. 21-57, 2014.
[8] D. Karaboğa, B. Baştürk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm” J. Glob Optim, vol.39, pp. 459-471, 2007.
[9] D. Karaboğa, Yapay Zeka Optimizasyon Algoritmaları, İstanbul, Atlas Yayın Dağıtım, 2004.
[10] B. Akay, “Nümerik optimizasyon problemlerinde yapay arı kolonisi algoritmasının performans analizi,” Phd thesi, Erciyes Üniversitesi Fen Bilimleri Enstitüsü, Kayseri, Türkiye, 2009.
[11] Z. Stanimirovic, “An efficient genetic algorithm for the uncapacitated Multiple allocation p-hub median problem,”Control and Cybernetics, Vol. 37, pp. 669-692, 2008.
![]() |
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |