IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v21y2026i1p54-88.html

Container vehicle scheduling problem with port congestion by using a knowledge-based greedy heuristic

Author

Listed:
  • Sang-u Song
  • Jun-Hee Han
  • Yoonjea Jeong

Abstract

This paper addresses a container vehicle scheduling problem within the context of congestion at port terminals and formulates a mathematical model aimed at minimising vehicle usage time by efficiently organising the vehicle schedules. The model incorporates congestion information within terminals. A binary integer programming model is employed to propose the scheduling scheme as well as realistic constraints. Given the complexity of the proposed optimisation model, we develop a knowledge-based greedy heuristic to solve it within reasonable timeframes based on three properties derived from the optimal solution. This heuristic significantly improves vehicle utilisation by considering realistic constraints and port congestion. The performance of the heuristic is verified through comparative studies between the mathematical model and the heuristic. Overall, this paper enhances port logistics efficiency by integrating realistic constraints and time-dependent congestion into container vehicle scheduling, effectively addressing the demands of transportation companies and smart port operations. [Submitted: 5 September 2024; Accepted: 18 December 2024]

Suggested Citation

  • Sang-u Song & Jun-Hee Han & Yoonjea Jeong, 2026. "Container vehicle scheduling problem with port congestion by using a knowledge-based greedy heuristic," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 21(1), pages 54-88.
    • Handle: RePEc:ids:eujine:v:21:y:2026:i:1:p:54-88
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=151154
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:ids:eujine:v:21:y:2026:i:1:p:54-88. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.