IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-50958-3_7.html
   My bibliography  Save this book chapter

An Optimization Approach for the Train Load Planning Problem in Seaport Container Terminals

In: Collaborative Logistics and Intermodality

Author

Listed:
  • Daniela Ambrosino

    (University of Genoa)

  • Davide Anghinolfi

    (University of Genoa)

  • Massimo Paolucci

    (University of Genoa)

  • Silvia Siri

    (University of Genoa)

Abstract

In this work an optimization approach for defining loading plans for trains in seaport container terminals is presented. The problem consists in defining the assignment of containers of different length, weight and value to wagon slots of a train, in order to maximize the total value loaded on the train and to minimize unproductive movements, both in the stacking area and of the crane during the loading process. Due to the difficulty in solving this problem for real scenarios, a MIP heuristic solution approach based on a randomized matheuristics is proposed. Computational results are presented and discussed, showing the effectiveness of the proposed heuristic solution method.

Suggested Citation

  • Daniela Ambrosino & Davide Anghinolfi & Massimo Paolucci & Silvia Siri, 2021. "An Optimization Approach for the Train Load Planning Problem in Seaport Container Terminals," Springer Books, in: Jorge E. Hernández & Dong Li & José Elias Jimenez-Sanchez & Miguel Gaston Cedillo-Campos & Luo Wenpi (ed.), Collaborative Logistics and Intermodality, pages 121-133, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-50958-3_7
    DOI: 10.1007/978-3-030-50958-3_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Train Loading Problem; MIP heuristics;

    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:spr:sprchp:978-3-030-50958-3_7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.