Skip to main content
SpringerLink
Log in

A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub median problem

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

Abstract

The \(p\)-hub median problem 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 at minimum cost. We accept general assumption that transportation between non-hub nodes is possible only via \(r\)-hub nodes, to which non-hub nodes are assigned. In this paper we propose a general variable neighborhood search heuristic to solve the problem in an efficient and effective way. Moreover, for the first time full nested variable neighborhood descent is applied as a local search within Variable neighborhood search. Computational results outperform the current state-of-the-art results obtained by GRASP based heuristic.

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. Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190, 1–21 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Campbell, J.F.: Location and allocation for distribution systems with transshipments and transportation economies of scale. Ann. Oper. Res. 40, 77–99 (1992)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Campbell, J.F.: Hub location and the \(p\)-hub median problem. Oper. Res. 44, 923–935 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Campbell, J.F., O’Kelly, M.E.: Twenty-five years of hub location research. Transp. Sci. 46(2), 153–169 (2012)

    Article  Google Scholar 

  6. Carrizosa, E., Mladenović, N., Todosijević, R.: Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur. J. Oper. Res. 230(2), 356–363 (2013)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Ernst, A., Krishnamoorthy, M.: An exact solution approach based on shortest paths for \(p\)-hub median problems. INFORMS J. Comput. 10, 149–162 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ernst, A., Krishnamoorthy, M.: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problems. Eur. J. Oper. Res. 4, 100–112 (1998)

    Article  MATH  Google Scholar 

  10. Filipović, V.: An electromagnetism metaheuristic for the uncapacitated multiple allocation hub location problem. Serdica J. Comput. 5(3), 261–272 (2011)

    Google Scholar 

  11. Hansen, P., Mladenović, N.: J-Means: A new local search heuristic for minimum sum-of-squares clustering. Pattern Recogn. 34, 405–413 (2001)

    Article  MATH  Google Scholar 

  12. Hansen, P., Mladenović, N.: First vs. best improvement: an empirical study. Discrete Appl. Math. 154, 802–817 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

  15. Ilić, A., Urosević, 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 

  16. Kratica, J.: An electromagnetism-like metaheuristic for the uncapacitated multiple allocation \(p\)-hub median problem. Comput. Ind. Eng. 66(4), 1015–1024 (2013)

    Article  Google Scholar 

  17. Kratica, J., Stanimirović, Z., Tosić, D., Filipović, V.: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem. Eur. J. Oper. Res. 182(1), 15–28 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

  19. Lopez, C.O., Beasley, J.E.: A note on solving MINLPs using formulation space search. Optim. Lett. 8(3), 1167–1182 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Love, R.F., Morris, J.G., Wesolowski, G.O.: Facilities Location: Models and Methods. Elsevier Science Publishing Co., New York (1988)

    MATH  Google Scholar 

  21. Milanović, M.: A new evolutionary based approach for solving the uncapacitated multiple allocation \(p\)-hub median problem. In: Gao XZ, et al., editors. Soft Computing in Industrial Applications, AISC75. Berlin: Springer-Verlag; 2010.p. 81–88

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

    Article  MathSciNet  MATH  Google Scholar 

  23. Mladenović, N., Brimberg, J., Hansen, P., Moreno-Pérez, J.A.: The \(p\)-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927–939 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Mladenović, N., Todosijević, R., Urošević, D.: An efficient General variable neighborhood search for large TSP problem with time windows. Yugosl. J. Oper. Res. 22, 141–151 (2012)

    MATH  Google Scholar 

  25. Mladenović, N., Todosijević, R., Urošević, D.: Two level General variable neighborhood search for attractive traveling salesman problem. Comput. Oper. Res. 52, 341–348 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  26. Mladenović, N., Urošević, D., Perez-Brito, D.: Variable neighborhood search for Minimum Linear Arrangement Problem. Yugosl. J. Oper. Res. (2014). doi:10.2298/YJOR140928038M

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

    Article  MathSciNet  MATH  Google Scholar 

  28. Peiró, J., Corberan, A., Marti, R.: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem. Comput. Oper. Res. 43, 50–60 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  29. Urošević, D.: Variable Neighborhood search for maximum diverse grouping problem. Yugosl. J. Oper. Res. 24, 21–33 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The present research work has been partly supported by International Campus on Safety and Intermodality in Transportation, and by an international Chaire from “Nord-Pas-de-Calais” Region et the University of Valenciennes (France).

Author information

Authors and Affiliations

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

    Raca Todosijević, Nenad Mladenović & Saïd Hanafi

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

    Dragan Urošević

Authors
  1. Raca Todosijević
    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. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saïd Hanafi
    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

Todosijević, R., Urošević, D., Mladenović, N. et al. A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub median problem. Optim Lett 11, 1109–1121 (2017). https://doi.org/10.1007/s11590-015-0867-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0867-6

Keywords

Search

Navigation