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

Solving a capacitated hub location problem

Author

Listed:
  • Rodriguez-Martin, Inmaculada
  • Salazar-Gonzalez, Juan Jose

Abstract

No abstract is available for this item.

Suggested Citation

  • Rodriguez-Martin, Inmaculada & Salazar-Gonzalez, Juan Jose, 2008. "Solving a capacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 468-479, January.
    • Handle: RePEc:eee:ejores:v:184:y:2008:i:2:p:468-479
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01164-7
    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. T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
    2. Holmberg, Kaj, 1999. "Exact solution methods for uncapacitated location problems with convex transportation costs," European Journal of Operational Research, Elsevier, vol. 114(1), pages 127-140, April.
    3. Bennett, Derek P. & Yano, Candace A., 2004. "A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors," European Journal of Operational Research, Elsevier, vol. 156(3), pages 643-664, August.
    4. 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.
    5. 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.
    6. 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.
    7. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    8. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    9. Mayer, Gabriela & Wagner, Bernd, 2002. "HUBLocator : an exact solution method for the multiple allocation hub location problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 18962, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    10. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    11. Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
    12. Ebery, Jamie & Krishnamoorthy, Mohan & Ernst, Andreas & Boland, Natashia, 2000. "The capacitated multiple allocation hub location problem: Formulations and algorithms," European Journal of Operational Research, Elsevier, vol. 120(3), pages 614-631, February.
    13. Wu, Peiling & Hartman, Joseph C. & Wilson, George R., 2003. "A demand-shifting feasibility algorithm for Benders decomposition," European Journal of Operational Research, Elsevier, vol. 148(3), pages 570-583, August.
    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. 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.
    2. Lin, Cheng-Chang & Lee, Shwu-Chiou, 2010. "The competition game on hub network design," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 618-629, May.
    3. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    4. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T. & Raoufi, R., 2014. "Multimodal freight transportation planning: A literature review," European Journal of Operational Research, Elsevier, vol. 233(1), pages 1-15.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    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. 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.
    10. 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.
    11. Mari'n, Alfredo & Canovas, Lazaro & Landete, Mercedes, 2006. "New formulations for the uncapacitated multiple allocation hub location problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 274-292, July.
    12. Ghaffarinasab, Nader & Motallebzadeh, Alireza, 2018. "Hub interdiction problem variants: Models and metaheuristic solution algorithms," European Journal of Operational Research, Elsevier, vol. 267(2), pages 496-512.
    13. Shahabi, Mehrdad & Unnikrishnan, Avinash, 2014. "Robust hub network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 356-373.
    14. 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.
    15. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    16. Yaman, Hande & Kara, Bahar Y. & Tansel, Barbaros Ç., 2007. "The latest arrival hub location problem for cargo delivery systems with stopovers," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 906-919, October.
    17. Samir Elhedhli & Huyu Wu, 2010. "A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 282-296, May.
    18. 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.
    19. 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.
    20. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.

    More about this item

    Statistics

    Access and download statistics

    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:184:y:2008:i:2:p:468-479. 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.