Skip to main content
Log in

General variable neighborhood search for the uncapacitated single allocation p-hub center problem

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

Abstract

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). For the local search step we develop a nested variable neighborhood descent strategy. The proposed approach is tested on benchmark instances from the literature and found to outperform the state-of-the-art heuristic based on ant colony optimization. We also test our heuristic on large scale instances that were not previously considered as test instances for the USApHCP. Moreover, exact solutions were reached by our GVNS for all instances where optimal solutions are known.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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 

  2. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem. Optim. Lett. (2015). doi:10.1007/s11590-015-0973-5

  3. 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 

  4. Campbell, J.F., Ernst, A., Krishnamoorthy, M.: Hub location problems. In: Hamacher, H., Drezner, Z., (eds.). Location theory: applications and theory, pp. 373–406. Springer, Berlin (2001)

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

    Article  MATH  Google Scholar 

  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, pp. 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. Gavriliouk, E.O.: Aggregation in hub location problems. Comput. Oper. Res. 36(12), 3136–3142 (2009)

    Article  MATH  Google Scholar 

  11. Hamacher, H.W., Meyer, T.: Hub cover and hub center problems. Technical Report 98, FB Mathematik TU Kaiserslautern (2006)

  12. Hansen, P., Mladenović, N.: Developments of variable neighborhood search. In: Ribeiro, C., Hansen, P. (eds.) Essays, surveys in metaheuristics, pp. 415–440. Kluwer, Amsterdam (2002)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Lazić, J., Todosijević, R., Hanafi, S., Mladenović, N.: Variable and single neighbourhood diving for MIP feasibility. Yugosl. J. Oper. Res. (2015). doi:10.2298/YJOR140417027L

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. 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 

  18. Kara, B.Y., Tansel, B.C.: On the single-assignment p-hub center problem. Eur. J. Oper. Res. 125(3), 648–655 (2000)

    Article  MATH  Google Scholar 

  19. 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 

  20. O’Kelly, M.E., Miller, H.J.: Solution strategies for the single facility minimax hub location problem. Papers Reg. Sci. 70(4), 367–380 (1991)

    Article  Google Scholar 

  21. 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 in part at the National Research University Higher School of Economics, Nizhni Novgorod, Russia and supported by RSF 14-41-00039. This research has also been supported in part by a Natural Sciences and Engineering Research Council of Canada Discovery Grant (NSERC #205041-2014)

Author information

Authors and Affiliations

Authors

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. General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim Lett 11, 377–388 (2017). https://doi.org/10.1007/s11590-016-1004-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-016-1004-x

Keywords

Navigation