IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v209y2026ics1366554526000347.html

Integrated optimization of berth allocation and green energy bunkering for vessels

Author

Listed:
  • Wang, Tingsong
  • Zhou, Yuhang
  • Xing, Zheng

Abstract

Optimizing port operational efficiency is essential for sustainable maritime logistics. However, traditional methods that address berth allocation or bunkering scheduling separately often produce suboptimal results due to their interdependencies, leading to low port turnaround efficiency. To address this, this paper proposes an integrated problem that jointly considers berth allocation, bunkering mode selection, and bunkering scheduling. The problem is formulated as a mixed-integer programming (MIP) model to minimize system costs, including vessel delay, berth deviation, and bunkering vessel operating costs under practical constraints. Then, an enhanced adaptive large neighborhood search (ALNS) algorithm with specialized operators and perturbation mechanisms is developed to solve it. Computational experiments demonstrate that the proposed algorithm performs well, and the model significantly reduces total costs compared with the two-step solution approach, especially under elevated port operational loads. Sensitivity analyses reveal how the numbers of berths and bunkering vessels jointly influence overall performance, offering practical insights for improving operational coordination and promoting sustainable port management.

Suggested Citation

  • Wang, Tingsong & Zhou, Yuhang & Xing, Zheng, 2026. "Integrated optimization of berth allocation and green energy bunkering for vessels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 209(C).
  • Handle: RePEc:eee:transe:v:209:y:2026:i:c:s1366554526000347
    DOI: 10.1016/j.tre.2026.104694
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526000347
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104694?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:eee:transe:v:209:y:2026:i:c:s1366554526000347. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.