IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04046268.html
   My bibliography  Save this paper

A new vocation queuing model to optimize truck appointments and yard handling-equipment use in dual transactions systems of container terminals

Author

Listed:
  • Na Li

    (Dalian Maritime University)

  • Hercules Haralambides

    (Dalian Maritime University, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Haotian Sheng

    (Dalian Maritime University)

  • Zhihong Jin

    (Dalian Maritime University)

Abstract

In a dual transaction at a marine terminal, an external truck drops off one container and picks up another on a single trip. To ensure a successful dual transaction operation and smooth external truck arrivals, a bi-objective mixed integer programming model is developed that optimizes the allocation of appointment quotas simultaneously with the deployment of (yard) cargo handling equipment. Our model addresses the challenges posed by the different types of truck movement in the terminal, i.e., delivery, pickup, and dual transaction. These require different handling equipment, various deadlines, and multiple priorities. To estimate the queuing length of external trucks in single or dual transactions (as well as that of internal trucks), a novel three-level vocation queuing model is set up. For the bi-objectives optimization, we propose a revised non-dominated genetic algorithm to obtain the approximate optimal solution. Experimental results prove the efficiency and effectiveness of the method. It shows that the newly built vocation queuing model can estimate the prioritized queuing process more effectively in three respects: a) the 3-level queuing; b) discrete truck arrivals in the queuing system; c) non-interruption of servers. Our quota optimization design improves the model's applicability to real cases, especially in the case of dual transactions. It is demonstrated that the method proposed in the paper could help terminal operators allocate quotas and simultaneously match the capacity of yard handling, thus improving truck services and terminal profitability.

Suggested Citation

  • Na Li & Hercules Haralambides & Haotian Sheng & Zhihong Jin, 2022. "A new vocation queuing model to optimize truck appointments and yard handling-equipment use in dual transactions systems of container terminals," Post-Print hal-04046268, HAL.
  • Handle: RePEc:hal:journl:hal-04046268
    DOI: 10.1016/j.cie.2022.108216
    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.

    Citations

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


    Cited by:

    1. Michael F. Gorman & John-Paul Clarke & René Koster & Michael Hewitt & Debjit Roy & Mei Zhang, 2023. "Emerging practices and research issues for big data analytics in freight transportation," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(1), pages 28-60, March.
    2. Li, Shuqin & Jia, Shuai & Tao, Yi & Lin, Xudong, 2024. "Gate appointment design in a container terminal: A robust optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    3. Buddhi A. Weerasinghe & H. Niles Perera & Xiwen Bai, 2024. "Optimizing container terminal operations: a systematic review of operations research applications," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 26(2), pages 307-341, June.

    More about this item

    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:hal:journl:hal-04046268. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.