Optimization of the p-Hub Median Problem via Artificial Immune Systems
10th International Conference, ICCL 2019,Barranquilla, Colombia, September 30 – October 2, 2019 Proceedings, Sept. 21, 2019
Recent advances in logistics, transportation and in telecommunications offer great opportunities to citizens and organizations in a globally-connected world, but they also arise a vast number of complex challenges that decision makers must face. In this context, a popular optimization problem with practical applications to the design of hub-and-spoke networks is analyzed: the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) where a fixed number of hubs have unlimited capacity, each non-hub node is allocated to a single hub and the number of hubs is known in advance. An immune inspired metaheuristic is proposed to solve the problem in deterministic scenarios. In order to show its efficiency, a series of computational tests are carried out using small and large size instances from the Australian Post dataset with node sizes up to 200. The results contribute to a deeper understanding of the effectiveness of the employed metaheuristic for solving the USApHMP in small and large networks.