IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v197y2025ics1366554525000870.html
   My bibliography  Save this article

Deep Q-network and knowledge jointly-driven ship operational efficiency optimization in a seaport

Author

Listed:
  • Guo, Wenqiang
  • Zhang, Xinyu
  • Ge, Ying-En
  • Du, Yuquan

Abstract

This study addresses a ship operational efficiency optimization problem for a seaport. Given the number of planned inbound ships, the problem optimizes the inbound sequence of all ships and their speed profiles at different inbound stages. A mixed-integer nonlinear programming model is presented to minimize both the total time of ships’ port entry process (TTEP) and the total fuel consumption (TFC) of the ships. A novel deep Q-network and knowledge jointly-driven cooperative metaheuristic algorithm (DQNKD-CMA) is designed to solve the model. Experimental results based on real scenarios set in Tianjin Port demonstrate that DQNKD-CMA exhibits favorable performance in solving the problem. The proposed method improves ship inbound efficiency and reduces carbon emissions through operational measures, providing a cost-effective alternative to energy-saving equipment and alternative fuels for ship emission mitigation. This study offers a significant set of implications to shipping and port operators who face new carbon emission reduction challenges.

Suggested Citation

  • Guo, Wenqiang & Zhang, Xinyu & Ge, Ying-En & Du, Yuquan, 2025. "Deep Q-network and knowledge jointly-driven ship operational efficiency optimization in a seaport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
    • Handle: RePEc:eee:transe:v:197:y:2025:i:c:s1366554525000870
    DOI: 10.1016/j.tre.2025.104046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525000870
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104046?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 search for a different version of it.

    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:197:y:2025:i:c:s1366554525000870. 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.