Skip to main content

Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem

  • 337 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 12010)


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

Supported by Ufop, Fapemig, Capes and CNPq.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


  1. Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universität Berlin, Fakultä II - Mathematik und Naturwissenschaften (2007)

    Google Scholar 

  2. Campbell, J.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)

    CrossRef  Google Scholar 

  3. Ernst, T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139–154 (1996)

    CrossRef  Google Scholar 

  4. 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).

    CrossRef  MATH  Google Scholar 

  5. 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)

    CrossRef  MathSciNet  Google Scholar 

  6. Kara, B.Y., Tansel, B.C.: The single-assignment hub covering problem: models and linearizations. J. Oper. Res. Soc. 54(1), 59–64 (2003)

    CrossRef  Google Scholar 

  7. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    CrossRef  MathSciNet  Google Scholar 

  8. O’Kelly, M.E.: Activity levels at hub facilities in interacting networks. Geogr. Anal. 18(4), 343–356 (1986)

    CrossRef  Google Scholar 

  9. O’Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393–404 (1987)

    CrossRef  MathSciNet  Google Scholar 

  10. Peker, M., Kara, B.Y.: The P-Hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158–172 (2015)

    CrossRef  Google Scholar 

  11. 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)

    CrossRef  MathSciNet  Google Scholar 

Download references


The authors acknowledge the UFOP, Fapemig, CAPES and CNPq for supporting this research.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Matheus de Araujo Butinholi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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.

Download citation

  • DOI:

  • 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)