Skip to main content
SpringerLink
Log in

A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs such that the maximum cost between origin-destination pairs is minimum. It is assumed that transportation between non-hub nodes is possible only via chosen hub nodes. In this paper we propose a basic variable neighborhood search (VNS) heuristic for solving this NP hard problem. In addition we apply two mathematical formulations of the UMApHCP in order to detect limitations of the current state-of-the-art solver used for this problem. The heuristics are tested on benchmark instances for p-hub problems. The obtained results reveal the superiority of the proposed basic VNS over the state-of-the-art as well as over a multi-start local search heuristic developed by us in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Applications and Algorithms. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1–21 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brimberg, J., Hansen, P., Mladenovic, N.: Attraction probabilities in variable neighborhood search. 4OR 8(2):181–194 (2010)

  4. Bryan, D.L., O’Kelly, M.E.: Hub-and-spoke networks in air transportation: an analytical review. J. Reg. Sci. 39(2), 275–295 (1999)

    Article  Google Scholar 

  5. Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub location problems. In: Hamacher, H.W., Drezner, Z. (eds.) Facility Location: Applications and Theory, pp. 373–407 (2002)

  6. Chung, S.-H., Myung, Y.-S., Tcha, D.-W.: Optimal design of a distributed network with a two-level hierarchical structure. Eur. J. Oper. Res. 62(1), 105–115 (1992)

    Article  MATH  Google Scholar 

  7. Dongarra, J.J.: Performance of Various Computers Using Standard Linear Equations Software. CS-89- 85, University of Manchester (2014)

  8. Ernst, A.T., Hamacher, H., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7), 2230–2241 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Ernst, A.T., Krishnamoorthy, M.: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104(1), 100–112 (1998)

    Article  MATH  Google Scholar 

  11. Hansen, P., Mladenovic, N., Brimberg, J., Perez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 61–86. Springer, US (2010)

    Chapter  Google Scholar 

  12. Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. 4OR, 6(4):319–360 (2008)

  13. Hansen, P., Mladenović, N., Pérez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Ilić, A., Urošević, D., Brimberg, J., Mladenović, N.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289–300 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Meyer, T., Ernst, A.T., Krishnamoorthy, M.: A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12), 3143–3151 (2009)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Mladenović, N., Todosijević, R., Urošević, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160–171 (2016)

  18. Todosijević, R., Urošević, D., Mladenović, N., Hanafi, S.: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub median problem. Optim. Lett. (2015). doi:10.1007/s11590-015-0867-6

Download references

Acknowledgments

This work was conducted at the National Research University Higher School of Economics, Nizhni Novgorod, Russia and supported by RSF 14-41-00039.

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, The Royal Military College of Canada, Kingston, ON, Canada

    Jack Brimberg

  2. LAMIH-UVHC, Le Mont Houy Valenciennes, Cedex 9, France

    Nenad Mladenović & Raca Todosijević

  3. Mathematical Institute, Serbian Academy of Science and Arts, Belgrade, Serbia

    Nenad Mladenović & Dragan Urošević

Authors
  1. Jack Brimberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raca Todosijević
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dragan Urošević
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raca Todosijević.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Brimberg, J., Mladenović, N., Todosijević, R. et al. A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim Lett 11, 313–327 (2017). https://doi.org/10.1007/s11590-015-0973-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0973-5

Keywords

Search

Navigation