IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v39y2022i06ns021759592250004x.html
   My bibliography  Save this article

Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem

Author

Listed:
  • Feifeng Zheng

    (Glorious Sun School of Business & Management, Donghua University, Shanghai 200051, P. R. China)

  • Zhaojie Wang

    (Glorious Sun School of Business & Management, Donghua University, Shanghai 200051, P. R. China)

  • E. Zhang

    (School of Information Management & Engineering, Shanghai University of Finance and Economics, Shanghai 200433, P. R. China)

  • Ming Liu

    (School of Economics & Management, Tongji University, Shanghai 200092, P. R. China)

Abstract

This work investigates the problem of vessel fleet deployment for liner shipping. The objective is to minimize the total cost, i.e., the sum of vessel chartering cost and vessel-route operating cost. In the considered problem, the shipment demand for each route is uncertain and its distribution is unknown. Due to lacking historical data, we use the moment-based ambiguity set to characterize the unknown distributions of demands. We then introduce a distributionally robust model and propose a new approximation approach to solve this problem. Finally, numerical experiments are conducted to demonstrate the performance of our approximation approach.

Suggested Citation

  • Feifeng Zheng & Zhaojie Wang & E. Zhang & Ming Liu, 2022. "Distributionally Robust Joint Chance Constrained Vessel Fleet Deployment Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(06), pages 1-19, December.
    • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:06:n:s021759592250004x
    DOI: 10.1142/S021759592250004X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759592250004X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759592250004X?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.

    Citations

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


    Cited by:

    1. Belleh Fontem, 2023. "Robust Chance-Constrained Geometric Programming with Application to Demand Risk Mitigation," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 765-797, May.

    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:wsi:apjorx:v:39:y:2022:i:06:n:s021759592250004x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.