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

The capacitated single-allocation hub location problem revisited: A note on a classical formulation

Author

Listed:
  • Correia, Isabel
  • Nickel, Stefan
  • Saldanha-da-Gama, Francisco

Abstract

In this paper a well-known formulation for the capacitated single-allocation hub location problem is revisited. An example is presented showing that for some instances this formulation is incomplete. The reasons for the incompleteness are identified leading to the inclusion of an additional set of constraints. Computational experiments are performed showing that the new constraints also help to decrease the computational time required to solve the problem optimally.

Suggested Citation

  • Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2010. "The capacitated single-allocation hub location problem revisited: A note on a classical formulation," European Journal of Operational Research, Elsevier, vol. 207(1), pages 92-96, November.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:1:p:92-96
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00314-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
    3. Ernst, Andreas T. & Krishnamoorthy, Mohan, 1998. "Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 100-112, January.
    4. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka & O'Kelly, Morton, 1996. "Tight linear programming relaxations of uncapacitated p-hub median problems," European Journal of Operational Research, Elsevier, vol. 94(3), pages 582-593, November.
    5. Boland, Natashia & Krishnamoorthy, Mohan & Ernst, Andreas T. & Ebery, Jamie, 2004. "Preprocessing and cutting for multiple allocation hub location problems," European Journal of Operational Research, Elsevier, vol. 155(3), pages 638-653, June.
    6. A.T. Ernst & M. Krishnamoorthy, 1999. "Solution algorithms for the capacitated single allocation hub location problem," Annals of Operations Research, Springer, vol. 86(0), pages 141-159, January.
    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. Meltem Peker & Bahar Y. Kara & James F. Campbell & Sibel A. Alumur, 2016. "Spatial Analysis of Single Allocation Hub Location Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1075-1101, December.
    2. Farid Momayezi & S. Kamal Chaharsooghi & Mohammad Mehdi Sepehri & Ali Husseinzadeh Kashan, 2021. "The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm," Operational Research, Springer, vol. 21(1), pages 139-166, March.
    3. 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.
    4. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    5. Firoozeh Kaveh & Reza Tavakkoli-Moghaddam & Chefi Triki & Yaser Rahimi & Amin Jamili, 2021. "A new bi-objective model of the urban public transportation hub network design under uncertainty," Annals of Operations Research, Springer, vol. 296(1), pages 131-162, January.
    6. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2018. "A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities," Omega, Elsevier, vol. 74(C), pages 122-134.
    7. Aros-Vera, Felipe & Marianov, Vladimir & Mitchell, John E., 2013. "p-Hub approach for the optimal park-and-ride facility location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 277-285.
    8. Bhatt, Sneha Dhyani & Sinha, Ankur & Jayaswal, Sachin, 2024. "The capacitated r-hub interdiction problem with congestion: Models and solution approaches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    9. 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.
    10. Mehmet R. Taner & Bahar Y. Kara, 2016. "Endogenous Effects of Hubbing on Flow Intensities," Networks and Spatial Economics, Springer, vol. 16(4), pages 1151-1181, December.

    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. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    2. 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.
    3. 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.
    4. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    6. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2009. "The design of single allocation incomplete hub networks," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 936-951, December.
    7. Yuan, Yun & Yu, Jie, 2018. "Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 85-103.
    8. S Alumur & B Y Kara, 2009. "A hub covering network design problem for cargo applications in Turkey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1349-1359, October.
    9. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.
    10. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    11. García, Sergio & Landete, Mercedes & Marín, Alfredo, 2012. "New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 48-57.
    12. F. Parvaresh & S. Hashemi Golpayegany & S. Moattar Husseini & B. Karimi, 2013. "Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing," Networks and Spatial Economics, Springer, vol. 13(4), pages 445-470, December.
    13. 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.
    14. 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.
    15. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
    16. Hu, Qing-Mi & Hu, Shaolong & Wang, Jian & Li, Xiaoping, 2021. "Stochastic single allocation hub location problems with balanced utilization of hub capacities," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 204-227.
    17. 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.
    18. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    19. Gelareh, Shahin & Nickel, Stefan, 2011. "Hub location problems in transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1092-1111.
    20. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.

    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:207:y:2010:i:1:p:92-96. 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.