Abstract
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.
Keywords
- Maximum coverage problem
- Uncapacitated Single Allocation p-hub
- Variable Neighborhood Search
Supported by Ufop, Fapemig, Capes and CNPq.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin, Fakultä II - Mathematik und Naturwissenschaften (2007)
Campbell, J.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)
Ernst, T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139–154 (1996)
Gendreau, M., Potvin, J.-Y.: Tabu search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 37–55. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_2
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)
Kara, B.Y., Tansel, B.C.: The single-assignment hub covering problem: models and linearizations. J. Oper. Res. Soc. 54(1), 59–64 (2003)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
O’Kelly, M.E.: Activity levels at hub facilities in interacting networks. Geogr. Anal. 18(4), 343–356 (1986)
O’Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393–404 (1987)
Peker, M., Kara, B.Y.: The P-Hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158–172 (2015)
Silva, M.R., Cunha, C.B.: A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. Eur. J. Oper. Res. 262(3), 954–965 (2017)
Acknowledgements
The authors acknowledge the UFOP, Fapemig, CAPES and CNPq for supporting this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Butinholi, M.d.A., Martins, A.X., de Oliveira, P.B., Martino, D.P. (2020). Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem. In: Benmansour, R., Sifaleras, A., Mladenović, N. (eds) Variable Neighborhood Search. ICVNS 2019. Lecture Notes in Computer Science(), vol 12010. Springer, Cham. https://doi.org/10.1007/978-3-030-44932-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-44932-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44931-5
Online ISBN: 978-3-030-44932-2
eBook Packages: Computer ScienceComputer Science (R0)