IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i1d10.1057_palgrave.jors.2601473.html
   My bibliography  Save this article

The single-assignment hub covering problem: Models and linearizations

Author

Listed:
  • B Y Kara

    (Bilkent University)

  • B C Tansel

    (Bilkent University)

Abstract

We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem that is different from earlier integer programming formulations. Both new and old formulations are nonlinear binary integer programs. We give three linearizations for the old model and one linearization for the new one and test their computational performances based on 80 instances of the CAB data set. Computational results indicate that the linear version of the new model performs significantly better than the most successful linearization of the old model both in terms of average and maximum CPU times as well as in core storage requirements.

Suggested Citation

  • B Y Kara & B C Tansel, 2003. "The single-assignment hub covering problem: Models and linearizations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 59-64, January.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:1:d:10.1057_palgrave.jors.2601473
    DOI: 10.1057/palgrave.jors.2601473
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601473
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601473?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. James F. Campbell, 1996. "Hub Location and the p -Hub Median Problem," Operations Research, INFORMS, vol. 44(6), pages 923-935, December.
    2. Bahar Y. Kara & Barbaros Ç. Tansel, 2001. "The Latest Arrival Hub Location Problem," Management Science, INFORMS, vol. 47(10), pages 1408-1420, October.
    3. Aykin, Turgut, 1995. "The hub location and routing problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 200-219, May.
    4. Kuby, Michael J. & Gray, Robert Gordon, 1993. "The hub network design problem with stopovers and feeders: The case of Federal Express," Transportation Research Part A: Policy and Practice, Elsevier, vol. 27(1), pages 1-12, January.
    5. 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.
    6. 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.
    7. 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.
    8. Morton E. O'Kelly & Harvey J. Miller, 1991. "Solution Strategies For The Single Facility Minimax Hub Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 70(4), pages 367-380, October.
    9. Kara, Bahar Y. & Tansel, Barbaros C., 2000. "On the single-assignment p-hub center problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 648-655, September.
    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. B Wagner, 2008. "Model formulations for hub covering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 932-938, July.
    2. 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.
    3. 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.
    4. Zhang, M. & Pel, A.J., 2016. "Synchromodal hinterland freight transport: Model study for the port of Rotterdam," Journal of Transport Geography, Elsevier, vol. 52(C), pages 1-10.
    5. 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.
    6. Zheng, Jianfeng & Zhang, Wenlong & Qi, Jingwen & Wang, Shuaian, 2019. "Canal effects on a liner hub location problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 230-247.
    7. Miguel A. Pozo & Justo Puerto & Antonio M. Rodríguez Chía, 2021. "The ordered median tree of hubs location problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 78-105, April.
    8. Landete, Mercedes & Peiró, Juanjo, 2024. "Some new clique inequalities in four-index hub location models," European Journal of Operational Research, Elsevier, vol. 318(3), pages 768-777.
    9. Domínguez-Bravo, Carmen-Ana & Fernández, Elena & Lüer-Villagra, Armin, 2024. "Hub location with congestion and time-sensitive demand," European Journal of Operational Research, Elsevier, vol. 316(3), pages 828-844.
    10. 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.
    11. 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.
    12. Mahmutogullari, Ali Irfan & Kara, Bahar Y., 2016. "Hub location under competition," European Journal of Operational Research, Elsevier, vol. 250(1), pages 214-225.
    13. 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.
    14. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    15. 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.
    16. Rath, Srushti & Chow, Joseph Y.J., 2022. "Air taxi skyport location problem with single-allocation choice-constrained elastic demand for airport access," Journal of Air Transport Management, Elsevier, vol. 105(C).
    17. Hande Yaman & Oya Ekin Karasan & Bahar Y. Kara, 2012. "Release Time Scheduling and Hub Location for Next-Day Delivery," Operations Research, INFORMS, vol. 60(4), pages 906-917, August.
    18. Meuffels, W.J.M. & Fleuren, H.A. & Cruijssen, F. & van Dam, E.R., 2009. "Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics," Other publications TiSEM e146d914-9638-4ae0-9587-b, Tilburg University, School of Economics and Management.
    19. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    20. Esmizadeh, Yalda & Bashiri, Mahdi & Jahani, Hamed & Almada-Lobo, Bernardo, 2021. "Cold chain management in hierarchical operational hub networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    21. Bernd Wagner, 2004. "A Note on "The Latest Arrival Hub Location Problem"," Management Science, INFORMS, vol. 50(12), pages 1751-1752, December.
    22. Yaman, Hande, 2009. "The hierarchical hub median problem with single assignment," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 643-658, July.
    23. Madani, Seyed Reza & Shahandeh Nookabadi, Ali & Hejazi, Seyed Reza, 2018. "A bi-objective, reliable single allocation p-hub maximal covering location problem: Mathematical formulation and solution approach," Journal of Air Transport Management, Elsevier, vol. 68(C), pages 118-136.
    24. Kahalimoghadam, Masoud & Thompson, Russell G. & Rajabifard, Abbas, 2024. "Determining the number and location of micro-consolidation centres as a solution to growing e-commerce demand," Journal of Transport Geography, Elsevier, vol. 117(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 & 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. 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.
    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. Mahmutogullari, Ali Irfan & Kara, Bahar Y., 2016. "Hub location under competition," European Journal of Operational Research, Elsevier, vol. 250(1), pages 214-225.
    5. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    6. Hande Yaman & Oya Ekin Karasan & Bahar Y. Kara, 2012. "Release Time Scheduling and Hub Location for Next-Day Delivery," Operations Research, INFORMS, vol. 60(4), pages 906-917, August.
    7. 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.
    8. Campbell, Ann Melissa & Lowe, Timothy J. & Zhang, Li, 2007. "The p-hub center allocation problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 819-835, January.
    9. 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.
    10. Erdoğan, Güneş & Battarra, Maria & Rodríguez-Chía, Antonio M., 2022. "The hub location and pricing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1035-1047.
    11. Bahar Y. Kara & Barbaros Ç. Tansel, 2001. "The Latest Arrival Hub Location Problem," Management Science, INFORMS, vol. 47(10), pages 1408-1420, October.
    12. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Competitive hub location problem: Model and solution approaches," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 237-261.
    13. Mohammad Mahdi Nasiri & Amir Khaleghi & Kannan Govindan & Ali Bozorgi-Amiri, 2023. "Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms," Operational Research, Springer, vol. 23(2), pages 1-62, June.
    14. 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.
    15. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    16. Kara, Bahar Y. & Tansel, Barbaros C., 2000. "On the single-assignment p-hub center problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 648-655, September.
    17. 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.
    18. 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.
    19. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
    20. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.

    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:pal:jorsoc:v:54:y:2003:i:1:d:10.1057_palgrave.jors.2601473. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.