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

Berth scheduling by customer service differentiation: A multi-objective approach

Author

Listed:
  • Golias, Mihalis M.
  • Boile, Maria
  • Theofanis, Sotirios

Abstract

In this paper the discrete and dynamic berth allocation problem is formulated as a multi-objective combinatorial optimization problem where vessel service is differentiated upon based on priority agreements. A genetic algorithms based heuristic is developed to solve the resulting problem. A number of numerical experiments showed that the heuristic performed well in solving large, real life instances. The heuristic provided a complete set of solutions that enable terminal operators to evaluate various berth scheduling policies and select the schedule that improves operations and customer satisfaction. The proposed algorithm outperformed a state of the art metaheuristic and provided improved results when compared to the weighted approach.

Suggested Citation

  • Golias, Mihalis M. & Boile, Maria & Theofanis, Sotirios, 2009. "Berth scheduling by customer service differentiation: A multi-objective approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 878-892, November.
    • Handle: RePEc:eee:transe:v:45:y:2009:i:6:p:878-892
    as

    Download full text from publisher

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

    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. Albert W. Veenstra & Rogier L. A. Harmelink, 2022. "Process mining ship arrivals in port: the case of the Port of Antwerp," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 24(3), pages 584-601, September.
    2. Yu, Jingjing & Tang, Guolei & Song, Xiangqun, 2022. "Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    3. Wang, Shuaian & Meng, Qiang & Liu, Zhiyuan, 2013. "A note on “Berth allocation considering fuel consumption and vessel emissions”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 48-54.
    4. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    5. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship fleet deployment with container transshipment operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 470-484.
    6. Kaveshgar, Narges & Huynh, Nathan, 2015. "Integrated quay crane and yard truck scheduling for unloading inbound containers," International Journal of Production Economics, Elsevier, vol. 159(C), pages 168-177.
    7. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    8. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
    9. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    10. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    11. Jingjing Tong & Heather Nachtmann, 2017. "Cargo prioritization and terminal allocation problem for inland waterway disruptions," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 403-427, August.
    12. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2013. "Marine container terminal configurations for efficient handling of mega-containerships," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 141-158.
    13. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
    14. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    15. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    16. Xin Wen & Qiong Chen & Yu-Qi Yin & Yui-yip Lau, 2023. "Green Vessel Scheduling with Weather Impact and Emission Control Area Consideration," Mathematics, MDPI, vol. 11(24), pages 1-25, December.

    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:45:y:2009:i:6:p:878-892. 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.