This paper addresses the Uncapacitated Single Allocation p-hub Maximal Covering Problem (USApHMCP), which aims to determine the best allocation for the p-hubs within a node network in order to maximize the network coverage. We proposed a search strategy-based heuristic Basic Variable Neighborhood Search (VNS) to solve the problem. Two different sets of test instances from the literature, Civil Aeronautics Board (CAB) and Australian Post (AP), were used to evaluate the performance of VNS and to compare it with the Tabu Search (TS) metaheuristic. In most instances, the bounds obtained by VNS and TS were the same but, on the other hand, for some of them, VNS presented a slight advantage and vice versa. That is, both algorithms are convenient to solve the proposed problem.
Maximum coverage problem Uncapacitated Single Allocation p-hub Variable Neighborhood Search
This is a preview of subscription content, log in to check access.
The authors acknowledge the UFOP, Fapemig, CAPES and CNPq for supporting this research.
Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin, Fakultä II - Mathematik und Naturwissenschaften (2007)Google Scholar
Campbell, J.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)CrossRefGoogle Scholar
Ernst, T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139–154 (1996)CrossRefGoogle Scholar
Janković, O., Mišković, S., Stanimirović, Z., Todosijević, R.: Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems. Ann. Oper. Res. 259(1–2), 191–216 (2017)MathSciNetCrossRefGoogle Scholar
Kara, B.Y., Tansel, B.C.: The single-assignment hub covering problem: models and linearizations. J. Oper. Res. Soc. 54(1), 59–64 (2003)CrossRefGoogle Scholar