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

Hub location-allocation in intermodal logistic networks

Author

Listed:
  • Ishfaq, Rafay
  • Sox, Charles R.

Abstract

Within the context of intermodal logistics, the design of transportation networks becomes more complex than it is for single mode logistics. In an intermodal network, the respective modes are characterized by the transportation cost structure, modal connectivity, availability of transfer points and service time performance. These characteristics suggest the level of complexity involved in designing intermodal logistics networks. This research develops a mathematical model using the multiple-allocation p-hub median approach. The model encompasses the dynamics of individual modes of transportation through transportation costs, modal connectivity costs, and fixed location costs under service time requirements. A tabu search meta-heuristic is used to solve large size (100 node) problems. The solutions obtained using this meta-heuristic are compared with tight lower bounds developed using a Lagrangian relaxation approach. An experimental study evaluates the performance of the intermodal logistics networks and explores the effects and interactions of several factors on the design of intermodal hub networks subject to service time requirements.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:210:y:2011:i:2:p:213-230
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00615-6
    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. Rodríguez, V. & Alvarez, M.J. & Barcos, L., 2007. "Hub location under capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(5), pages 495-505, September.
    3. Limbourg, S. & Jourquin, B., 2009. "Optimal rail-road container terminal locations on the European network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(4), pages 551-563, July.
    4. Cunha, Claudio B. & Silva, Marcos Roberto, 2007. "A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil," European Journal of Operational Research, Elsevier, vol. 179(3), pages 747-758, June.
    5. Sue Abdinnour-Helm & M.A. Venkataramanan, 1998. "Solution approaches to hub location problems," Annals of Operations Research, Springer, vol. 78(0), pages 31-50, 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. 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.
    8. Bookbinder, James H. & Fox, Neil S., 1998. "Intermodal routing of Canada-Mexico shipments under NAFTA," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 34(4), pages 289-303, December.
    9. 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.
    10. Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
    11. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    12. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    13. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
    14. Lozano, Angelica & Storchi, Giovanni, 2001. "Shortest viable path algorithm in multimodal networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(3), pages 225-241, March.
    15. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    16. 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.
    17. Racunica, Illia & Wynter, Laura, 2005. "Optimal location of intermodal freight hubs," Transportation Research Part B: Methodological, Elsevier, vol. 39(5), pages 453-477, June.
    18. Sohn, Jinhyeon & Park, Sungsoo, 1998. "Efficient solution procedure and reduced size formulations for p-hub location problems," European Journal of Operational Research, Elsevier, vol. 108(1), pages 118-126, July.
    19. Groothedde, Bas & Ruijgrok, Cees & Tavasszy, Lóri, 2005. "Towards collaborative, intermodal hub networks: A case study in the fast moving consumer goods market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 567-583, November.
    20. Klincewicz, J. G., 1991. "Heuristics for the p-hub location problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 25-37, July.
    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. Etemadnia, Hamideh & Goetz, Stephan J. & Canning, Patrick & Tavallali, Mohammad Sadegh, 2015. "Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: An LP-MIP heuristic approach," European Journal of Operational Research, Elsevier, vol. 244(2), pages 648-661.
    2. Ishfaq, Rafay & Sox, Charles R., 2012. "Design of intermodal logistics networks with hub delays," European Journal of Operational Research, Elsevier, vol. 220(3), pages 629-641.
    3. Sun, Li & Zhao, Lindu & Hou, Jing, 2015. "Optimization of postal express line network under mixed driving pattern of trucks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 147-169.
    4. Ghane-Ezabadi, Mohammad & Vergara, Hector A., 2016. "Decomposition approach for integrated intermodal logistics network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 53-69.
    5. He, Yan & Wu, Tao & Zhang, Canrong & Liang, Zhe, 2015. "An improved MIP heuristic for the intermodal hub location problem," Omega, Elsevier, vol. 57(PB), pages 203-211.
    6. 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.
    7. Zahiri, B. & Tavakkoli-Moghaddam, R. & Mohammadi, M. & Jula, P., 2014. "Multi-objective design of an organ transplant network under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 101-124.
    8. 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.
    9. Rothenbächer, Ann-Kathrin & Drexl, Michael & Irnich, Stefan, 2016. "Branch-and-price-and-cut for a service network design and hub location problem," European Journal of Operational Research, Elsevier, vol. 255(3), pages 935-947.
    10. Teye, Collins & Bell, Michael G.H. & Bliemer, Michiel C.J., 2017. "Entropy maximising facility location model for port city intermodal terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 1-16.
    11. 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.

    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:210:y:2011:i:2:p:213-230. See general information about how to correct material in RePEc.

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

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.