IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v50y2004i12p1751-1752.html
   My bibliography  Save this article

A Note on "The Latest Arrival Hub Location Problem"

Author

Listed:
  • Bernd Wagner

    (Darmstadt University of Technology, Hochschulstrasse 1, 64289 Darmstadt, Germany)

Abstract

Kara and Tansel (Management Science, Volume 47, 2001, 1408--1420) introduce the latest arrival hub location problem as a more realistic way of modeling cargo delivery. The key feature of the new model is that each link in the network is served by a single vehicle that makes exactly one trip. As a result, the traffic requiring a particular link may be forced to wait for all other traffic requiring the same link to arrive. Therefore, the travel time between a particular pair of nodes depends not just on travel times of the links on the path taken, but also on these forced "waiting times," which are called transient times in Kara and Tansel (2001). We show, however, that if the objective function depends only on the maximum travel time, this "new" model is essentially the same as the classical model that ignores the transient times. Our result implies that two of the three versions of the latest arrival hub location problem proposed by Kara and Tansel, including the one to which they devote most of their paper, are equivalent to their classical counterparts.

Suggested Citation

  • Bernd Wagner, 2004. "A Note on "The Latest Arrival Hub Location Problem"," Management Science, INFORMS, vol. 50(12), pages 1751-1752, December.
  • Handle: RePEc:inm:ormnsc:v:50:y:2004:i:12:p:1751-1752
    DOI: 10.1287/mnsc.1040.0312
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1040.0312
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.1040.0312?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. Bahar Y. Kara & Barbaros Ç. Tansel, 2001. "The Latest Arrival Hub Location Problem," Management Science, INFORMS, vol. 47(10), pages 1408-1420, October.
    4. 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.
    5. Wagner, Bernd, 2004. "Model formulations for hub covering problems," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20662, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    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. 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.
    2. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    3. 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.
    4. Jiang, Jianlin & Lee, Loo Hay & Chew, Ek Peng & Gan, Chee Chun, 2015. "Port connectivity study: An analysis framework from a global container liner shipping network perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 47-64.
    5. 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.
    6. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.
    7. Yaman, Hande, 2009. "The hierarchical hub median problem with single assignment," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 643-658, July.

    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. 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.
    3. 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.
    4. 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.
    5. Mahmutogullari, Ali Irfan & Kara, Bahar Y., 2016. "Hub location under competition," European Journal of Operational Research, Elsevier, vol. 250(1), pages 214-225.
    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. 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.
    8. 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.
    9. 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).
    10. Yang, Lingxiao & Zheng, Jianfeng & Wang, Jian & Hu, Xiaowei, 2023. "The maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    11. Ghaffarinasab, Nader & Kara, Bahar Y. & Campbell, James F., 2022. "The stratified p-hub center and p-hub maximal covering problems," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 120-148.
    12. Yaman, Hande, 2009. "The hierarchical hub median problem with single assignment," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 643-658, July.
    13. 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.
    14. 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.
    15. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    16. 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.
    17. 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.
    18. 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.
    19. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.
    20. 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.

    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:inm:ormnsc:v:50:y:2004:i:12:p:1751-1752. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.