IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v246y2015i1p186-198.html
   My bibliography  Save this article

Exact and heuristic algorithms for the design of hub networks with multiple lines

Author

Listed:
  • Martins de Sá, Elisangela
  • Contreras, Ivan
  • Cordeau, Jean-François

Abstract

In this paper we study a hub location problem in which the hubs to be located must form a set of interconnecting lines. The objective is to minimize the total weighted travel time between all pairs of nodes while taking into account a budget constraint on the total set-up cost of the hub network. A mathematical programming formulation, a Benders-branch-and-cut algorithm and several heuristic algorithms, based on variable neighborhood descent, greedy randomized adaptive search, and adaptive large neighborhood search, are presented and compared to solve the problem. Numerical results on two sets of benchmark instances with up to 70 nodes and three lines confirm the efficiency of the proposed solution algorithms.

Suggested Citation

  • Martins de Sá, Elisangela & Contreras, Ivan & Cordeau, Jean-François, 2015. "Exact and heuristic algorithms for the design of hub networks with multiple lines," European Journal of Operational Research, Elsevier, vol. 246(1), pages 186-198.
    • Handle: RePEc:eee:ejores:v:246:y:2015:i:1:p:186-198
    DOI: 10.1016/j.ejor.2015.04.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715003100
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.04.017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Marí­n, íngel & Jaramillo, Patricia, 2008. "Urban rapid transit network capacity expansion," European Journal of Operational Research, Elsevier, vol. 191(1), pages 45-60, November.
    3. Ivan Contreras, 2015. "Hub Location Problems," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 311-344, Springer.
    4. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    5. J. F. Campbell & A. T. Ernst & M. Krishnamoorthy, 2005. "Hub Arc Location Problems: Part I---Introduction and Results," Management Science, INFORMS, vol. 51(10), pages 1540-1555, October.
    6. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    7. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    8. Ivan Contreras & Elena Fernández, 2014. "Hub Location as the Minimization of a Supermodular Set Function," Operations Research, INFORMS, vol. 62(3), pages 557-570, June.
    9. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    10. Perea, Federico & Mesa, Juan A. & Laporte, Gilbert, 2014. "Adding a new station and a road link to a road–rail network in the presence of modal competition," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 1-16.
    11. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    12. J. F. Campbell & A. T. Ernst & M. Krishnamoorthy, 2005. "Hub Arc Location Problems: Part II---Formulations and Optimal Algorithms," Management Science, INFORMS, vol. 51(10), pages 1556-1571, October.
    13. Bruno, Giuseppe & Ghiani, Gianpaolo & Improta, Gennaro, 1998. "A multi-modal approach to the location of a rapid transit line," European Journal of Operational Research, Elsevier, vol. 104(2), pages 321-332, January.
    14. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    15. Contreras, Ivan & Fernández, Elena & Marín, Alfredo, 2010. "The Tree of Hubs Location Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 390-400, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    2. Bütün, Cihan & Petrovic, Sanja & Muyldermans, Luc, 2021. "The capacitated directed cycle hub location and routing problem under congestion," European Journal of Operational Research, Elsevier, vol. 292(2), pages 714-734.
    3. Niknamfar, Amir Hossein & Niaki, Seyed Taghi Akhavan, 2016. "Fair profit contract for a carrier collaboration framework in a green hub network under soft time-windows: Dual lexicographic max–min approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 129-151.
    4. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    5. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    6. Setiawan, Fran & Bektaş, Tolga & Iris, Çağatay, 2025. "The role of hubs and economies of scale in network expansion," Omega, Elsevier, vol. 131(C).
    7. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    8. Silva, Marcos Roberto & Cunha, Claudio B., 2017. "A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 954-965.
    9. Liting Chen & Sebastian Wandelt & Weibin Dai & Xiaoqian Sun, 2022. "Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 834-856, March.
    10. Fernández, Elena & Sgalambro, Antonino, 2020. "On carriers collaboration in hub location problems," European Journal of Operational Research, Elsevier, vol. 283(2), pages 476-490.
    11. AL Athamneh, Raed & Tanash, Moayad & Bani Hani, Dania & Rawshdeh, Mustafa & Alawin, Abdallah & Albataineh, Zaid, 2023. "Variable Neighborhood Search Algorithm for the Single Assignment Incomplete Hub Location Problem with Modular Capacities and Direct Connections," Operations Research Perspectives, Elsevier, vol. 11(C).
    12. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    13. Arthur Mahéo & Philip Kilby & Pascal Van Hentenryck, 2019. "Benders Decomposition for the Design of a Hub and Shuttle Public Transit System," Service Science, INFORMS, vol. 53(1), pages 77-88, February.
    14. Mohammadi, Mehrdad & Jula, Payman & Tavakkoli-Moghaddam, Reza, 2019. "Reliable single-allocation hub location problem with disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 90-120.
    15. Zhang, Yimeng & Li, Xinlei & van Hassel, Edwin & Negenborn, Rudy R. & Atasoy, Bilge, 2022. "Synchromodal transport planning considering heterogeneous and vague preferences of shippers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    2. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    3. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    4. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    5. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    6. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2018. "Exact solution of hub network design problems with profits," European Journal of Operational Research, Elsevier, vol. 266(1), pages 57-71.
    7. Bütün, Cihan & Petrovic, Sanja & Muyldermans, Luc, 2021. "The capacitated directed cycle hub location and routing problem under congestion," European Journal of Operational Research, Elsevier, vol. 292(2), pages 714-734.
    8. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    9. Lüer-Villagra, Armin & Marianov, Vladimir, 2013. "A competitive hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 231(3), pages 734-744.
    10. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    11. Landete, Mercedes & Muñoz-Ocaña, Juan M. & Rodríguez-Chía, Antonio M. & Saldanha-da-Gama, Francisco, 2024. "Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 187(C).
    12. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    13. Nader Azizi, 2019. "Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods," Annals of Operations Research, Springer, vol. 272(1), pages 159-185, January.
    14. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    15. Alumur, Sibel A. & Yaman, Hande & Kara, Bahar Y., 2012. "Hierarchical multimodal hub location problem with time-definite deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1107-1120.
    16. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2012. "Multimodal hub location and hub network design," Omega, Elsevier, vol. 40(6), pages 927-939.
    17. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    18. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    19. Arthur Mahéo & Philip Kilby & Pascal Van Hentenryck, 2019. "Benders Decomposition for the Design of a Hub and Shuttle Public Transit System," Service Science, INFORMS, vol. 53(1), pages 77-88, February.
    20. Meng, Qiang & Wang, Xinchang, 2011. "Intermodal hub-and-spoke network design: Incorporating multiple stakeholders and multi-type containers," Transportation Research Part B: Methodological, Elsevier, vol. 45(4), pages 724-742, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:246:y:2015:i:1:p:186-198. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.