Skip to main content
SpringerLink
Log in

An efficient heuristic for a hub location routing problem

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

Abstract

This paper examines a new model for hub location known as the hub location routing problem. The problem shares similarities with the well studied uncapacitated single allocation p-hub median problem except that the hubs are now connected to each other by a cyclical path (or tour) known as the global route, each cluster of non-hub nodes and assigned hub is also connected by a single tour known as a local route, and the length of the local routes is constrained to a maximum number of nodes. Thus, aside from the normal tasks of hub selection and allocation of non-hub nodes, up to p + 1 travelling salesman problems need to be solved. A heuristic based on the general variable neighborhood search framework is proposed here to solve this very complicated problem. The improvement phase of the algorithm uses a sequential variable neighborhood descent with multiple neighborhoods required to suit the complex nature of the problem. A best sequencing of the neighborhoods is established through empirical testing. The perturbation phase known as the shaking procedure also uses a well-structured selection of neighborhoods in order to effectively diversify the search to different regions of the solution space. Extensive computational testing shows that the new heuristic significantly outperforms the state-of-the-art. Out of 912 test instances from the literature, we are able to obtain 691 new best known solutions. Not only are the improvements in objective values quite impressive, but also these new solutions are obtained in a small fraction of the time required by the competing algorithms.

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

Fig. 1

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  Google Scholar 

  2. Amaldass, N.I.L., Lucas, C., Mladenovic, N.: Variable neighbourhood search for financial derivative problem. Yugosl. J. Oper. Res. 29(3), 359–373 (2019)

    Article  MathSciNet  Google Scholar 

  3. Brimberg, J., Mišković, S., Todosijević, R., Urošević, D.: The uncapacitated r-allocation p-hub center problem. Int. Trans. Oper. Res. (2020). https://doi.org/10.1111/itor.12801

    Article  Google Scholar 

  4. 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. 11(2), 313–327 (2017)

    Article  MathSciNet  Google Scholar 

  5. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2), 377–388 (2017)

    Article  MathSciNet  Google Scholar 

  6. Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: A non-triangular hub location problem. Optim. Lett. (2019). https://doi.org/10.1007/s11590-019-01392-2

    Article  MATH  Google Scholar 

  7. Duarte, A., Sánchez-Oro, J., Mladenović, N., Todosijević, R.: Variable neighborhood descent. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341–367. Springer, Cham (2018)

    Chapter  Google Scholar 

  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  Google Scholar 

  9. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Baatar, H.: Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Work. Pap. Ser. 1, 1–18 (2011)

    Google Scholar 

  10. Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096–1109 (2013)

    Article  Google Scholar 

  11. Gavriliouk, E.O.: Aggregation in hub location problems. Comput. Oper. Res. 36(12), 3136–3142 (2009)

    Article  Google Scholar 

  12. Gelareh, S., Gendron, B., Hanafi, S., Monemi, R.N., Todosijević, R.: The selective traveling salesman problem with draft limits. J. Heuristics 26, 339–352 (2020)

    Article  Google Scholar 

  13. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423–454 (2017)

    Article  MathSciNet  Google Scholar 

  14. Hoff, A., Peiró, J., Corberán, Á., Martí, R.: Heuristics for the capacitated modular hub location problem. Comput. Oper. Res. 86, 94–109 (2017)

    Article  MathSciNet  Google Scholar 

  15. Hwang, Y.H., Lee, Y.H.: Uncapacitated single allocation p-hub maximal covering problem. Comput. Ind. Eng. 63(2), 382–389 (2012)

    Article  Google Scholar 

  16. 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  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  18. Karakostas, P., Sifaleras, A., Georgiadis, M.C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263–279 (2019)

    Article  Google Scholar 

  19. Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem. Expert Syst. Appl. 153, 113444 (2020)

    Article  Google Scholar 

  20. Lopes, M.C., de Andrade, C.E., de Queiroz, T.A., Resende, M.G., Miyazawa, F.K.: Heuristics for a hub location-routing problem. Networks 68(1), 54–90 (2016)

    Article  MathSciNet  Google Scholar 

  21. Martí, R., Corberán, Á., Peiró, J.: Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58, 53–66 (2015)

    Article  MathSciNet  Google Scholar 

  22. 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  Google Scholar 

  23. Mikić, M., Todosijević, R., Urošević, D.: Less is more: general variable neighborhood search for the capacitated modular hub location problem. Comput. Oper. Res. 110, 101–115 (2019)

    Article  MathSciNet  Google Scholar 

  24. Mjirda, A., Todosijević, R., Hanafi, S., Hansen, P., Mladenović, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3), 615–633 (2017)

    Article  MathSciNet  Google Scholar 

  25. Mladenović, N., Alkandari, A., Pei, J., Todosijević, R., Pardalos, P.M.: Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27(1), 480–493 (2020)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  27. Mladenović, N., Todosijević, R., Urošević, D.: An efficient gvns for solving traveling salesman problem with time windows. Electron. Notes Discrete Math. 39, 83–90 (2012)

    Article  MathSciNet  Google Scholar 

  28. Mladenović, N., Todosijević, R., Urošević, D.: An efficient general variable neighborhood search for large travelling salesman problem with time windows. Yugosl. J. Oper. Res. 23(1), 19–30 (2013)

    Article  MathSciNet  Google Scholar 

  29. Peiró, J., Corberán, A., Martí, R.: Grasp for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43(1), 50–60 (2014)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  31. Talbi, E.G., Todosijević, R.: The robust uncapacitated multiple allocation p-hub median problem. Comput. Ind. Eng. 110, 322–332 (2017)

    Article  Google Scholar 

  32. Todosijević, R., Mjirda, A., Mladenović, M., Hanafi, S., Gendron, B.: A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11(6), 1047–1056 (2017)

    Article  MathSciNet  Google Scholar 

  33. Todosijević, R., Mladenović, M., Hanafi, S., Mladenović, N., Crévits, I.: Adaptive general variable neighborhood search heuristics for solving the unit commitment problem. Int. J. Electr. Power Energy Syst. 78, 873–883 (2016)

    Article  Google Scholar 

  34. Todosijević, R., Urošević, D., Mladenović, N., Hanafi, S.: A geneal vaiable neighbohood seach fo solving the uncapacitated r-allocation p-hub median poblem. Optim. Lett. 11(6), 1109–1121 (2017)

    Article  MathSciNet  Google Scholar 

  35. Weng, K., Yang, C., Ma, Y.: Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem. In: Huang, D.S., Li, K., Irwin, G.W. (eds.) Intelligent Computing, pp. 737–744. Springer, Berlin, Heidelberg (2006)

  36. Yaman, H.: Allocation strategies in hub networks. Eur. J. Oper. Res. 211(3), 442–451 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research is supported by ELSAT2020 (Eco-mobilité, Logistique, Scurité and Adaptabilité des Transports l’horizon 2020) Project co-financed by European Union, France and Région Hauts-de-France.

Author information

Authors and Affiliations

  1. LAMIH UMR CNRS 8201-Université Polytechnique Hauts-de-France, 59313, Valenciennes Cedex 9, France

    Mustapha Ratli, Abdessamad Ait El Cadi & Raca Todosijević

  2. Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade, Serbia

    Dragan Urošević

  3. Royal Military College of Canada, Kingston, ON, Canada

    Jack Brimberg

  4. Khalifa University, Abu Dhabi, UAE

    Nenad Mladenović

Authors
  1. Mustapha Ratli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dragan Urošević
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdessamad Ait El Cadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jack Brimberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Raca Todosijević
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raca Todosijević.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ratli, M., Urošević , D., El Cadi, A.A. et al. An efficient heuristic for a hub location routing problem. Optim Lett 16, 281–300 (2022). https://doi.org/10.1007/s11590-020-01675-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-020-01675-z

Keywords

Search

Navigation