IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2012001.html
   My bibliography  Save this paper

Efficient metaheuristics to solve the intermodal terminal location problem

Author

Listed:
  • SÖRENSEN, Kenneth
  • VANOVERMEIRE, Christine
  • BUSSCHAERT, Sylvie

Abstract

Determining the optimal number and location of intermodal transshipment terminals is a decision that strongly influences the viability of the intermodal transportation alternative. In this paper, we develop a model and an optimization method that provides policy makers with a tool to help them take these decisions. The objective of the terminal location problem described in this paper is to determine which of a set of potential terminal locations to use and which not and how to route the supply and demand of a set of customers (representing zones of supply and demand) through the network (by both uni- and intermodal transport) so as to minimize the total cost. We develop two different metaheuristic procedures that both consist of two phases: a solution construction phase and a solution improvement phase. The first metaheuristic constructs solutions using a GRASP procedure, the second one uses the relatively unknown attribute based hill climber (ABHC) heuristic. Innovative in our approach is the integration of a fast heuristic procedure to approximate the total cost given the set of open terminals. Both metaheuristics are compared to the results of an MIP solver. A thorough performance assessment uncovers that both metaheuristics generate close-to-optimal solutions in very short computing times. An argument in favor of the ABHC approach is that it is parameter-free and hence more transparent and likely to be accepted in a business or policy environment.

Suggested Citation

  • SÖRENSEN, Kenneth & VANOVERMEIRE, Christine & BUSSCHAERT, Sylvie, 2012. "Efficient metaheuristics to solve the intermodal terminal location problem," Working Papers 2012001, University of Antwerp, Faculty of Business and Economics.
  • Handle: RePEc:ant:wpaper:2012001
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docman/irua/1de478/0fefbdc2.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ján Ližbetin & Ondrej Stopka, 2020. "Application of Specific Mathematical Methods in the Context of Revitalization of Defunct Intermodal Transport Terminal: A Case Study," Sustainability, MDPI, vol. 12(6), pages 1-22, March.
    2. Fateme Fotuhi & Nathan Huynh, 2017. "Reliable Intermodal Freight Network Expansion with Demand Uncertainties and Network Disruptions," Networks and Spatial Economics, Springer, vol. 17(2), pages 405-433, June.
    3. 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.
    4. Snežana Tadić & Mladen Krstić & Violeta Roso & Nikolina Brnjac, 2019. "Planning an Intermodal Terminal for the Sustainable Transport Networks," Sustainability, MDPI, vol. 11(15), pages 1-20, July.
    5. Amir Gharehgozli & Nima Zaerpour & Rene Koster, 2020. "Container terminal layout design: transition and future," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 22(4), pages 610-639, December.
    6. Ján Ližbetin, 2019. "Methodology for Determining the Location of Intermodal Transport Terminals for the Development of Sustainable Transport Systems: A Case Study from Slovakia," Sustainability, MDPI, vol. 11(5), pages 1-17, February.
    7. 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.

    More about this item

    Keywords

    Intermodal transportation; Terminal location; Metaheuristics;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ant:wpaper:2012001. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.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.