IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-15644-1_21.html
   My bibliography  Save this book chapter

Mixed-Integer Linear Programming Formulations for the Inbound Container Remarshaling Problem in an Automated Container Terminal

In: City, Society, and Digital Transformation

Author

Listed:
  • Bo Jin

    (Shenzhen University)

  • Zhishan Yu

    (Shenzhen University)

  • Mingzhu Yu

    (Shenzhen University)

Abstract

In this paper, we study the inbound container remarshaling problem in an automated container terminal, which jointly optimizes the allocation of inbound containers and the scheduling of an automated stacking crane. The randomness of the future retrieval order of inbound containers and the time limit of the remarshaling process are both considered, and the goal is to minimize the expected time to retrieve all containers in the future. Two mixed-integer linear programming formulations, named the move-based and allocation-based models, are proposed. The move-based model encodes a feasible solution to the problem into a sequence of moves. The allocation-based model decomposes the problem into a master problem that focuses only on the final allocation of containers and a subproblem of scheduling the automated stacking crane. We prove that the subproblem can be solved in linear time by transforming it into a Eulerian graph, and then use its analytical solution to simplify the time constraint in the master problem. Numerical experiments show the outperformance of the proposed models over the existing mixed-integer programming model in the literature.

Suggested Citation

  • Bo Jin & Zhishan Yu & Mingzhu Yu, 2022. "Mixed-Integer Linear Programming Formulations for the Inbound Container Remarshaling Problem in an Automated Container Terminal," Lecture Notes in Operations Research, in: Robin Qiu & Wai Kin Victor Chan & Weiwei Chen & Youakim Badr & Canrong Zhang (ed.), City, Society, and Digital Transformation, chapter 0, pages 277-292, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-15644-1_21
    DOI: 10.1007/978-3-031-15644-1_21
    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.

    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:lnopch:978-3-031-15644-1_21. 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.