IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v28y2017i3d10.1007_s10845-015-1035-7.html
   My bibliography  Save this article

Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm

Author

Listed:
  • ChengJi Liang

    (Shanghai Maritime University)

  • MiaoMiao Li

    (Shanghai Maritime University)

  • Bo Lu

    (Dalian University
    UCAS)

  • Tianyi Gu

    (Shanghai International Port Group Co., Ltd)

  • Jungbok Jo

    (Dongseo University)

  • Yi Ding

    (Shanghai Maritime University)

Abstract

Solving the problem of allocating and scheduling quay cranes (QCs) is very important to ensure favorable port service. This work proposes a bi-criteria mixed integer programming model of the continual and dynamic arrival of several vessels at a port. A multi-objective genetic algorithm is applied to solve the problem in three cases. The results thus obtained confirm the feasibility and effectiveness of the model and GA. Additionally, the multi-objective solution considering both the total duration for which vessels stay in the port and QCs move is the best, as determined by comparing with considering only the total time for which vessels stay in the port or QCs move, as it considers, and it balances these two objectives.

Suggested Citation

  • ChengJi Liang & MiaoMiao Li & Bo Lu & Tianyi Gu & Jungbok Jo & Yi Ding, 2017. "Dynamic configuration of QC allocating problem based on multi-objective genetic algorithm," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 847-855, March.
    • Handle: RePEc:spr:joinma:v:28:y:2017:i:3:d:10.1007_s10845-015-1035-7
    DOI: 10.1007/s10845-015-1035-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1035-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-015-1035-7?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.

    References listed on IDEAS

    as
    1. Kim, Kap Hwan & Park, Young-Man, 2004. "A crane scheduling method for port container terminals," European Journal of Operational Research, Elsevier, vol. 156(3), pages 752-768, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    2. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    3. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    4. Maloni, Michael J. & Jackson, Eric C., 2007. "Stakeholder Contributions to Container Port Capacity: A Survey of Port Authorities," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 46(1).
    5. Xin Jia Jiang & Yanhua Xu & Chenhao Zhou & Ek Peng Chew & Loo Hay Lee, 2018. "Frame Trolley Dispatching Algorithm for the Frame Bridge Based Automated Container Terminal," Transportation Science, INFORMS, vol. 52(3), pages 722-737, June.
    6. Dusan Ku & Tiru S. Arthanari, 2016. "On double cycling for container port productivity improvement," Annals of Operations Research, Springer, vol. 243(1), pages 55-70, August.
    7. Noura Al-Dhaheri & Ali Diabat, 2017. "A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints," Annals of Operations Research, Springer, vol. 248(1), pages 1-24, January.
    8. Chen, Jiang Hang & Lee, Der-Horng & Cao, Jin Xin, 2011. "Heuristics for quay crane scheduling at indented berth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1005-1020.
    9. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    10. Henry Lau & Ying Zhao, 2008. "Integrated scheduling of handling equipment at automated container terminals," Annals of Operations Research, Springer, vol. 159(1), pages 373-394, March.
    11. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    12. Lijun Yue & Houming Fan & Chunxin Zhai, 2019. "Joint Configuration and Scheduling Optimization of a Dual-Trolley Quay Crane and Automatic Guided Vehicles with Consideration of Vessel Stability," Sustainability, MDPI, vol. 12(1), pages 1-16, December.
    13. Cheng Hong & Yufang Guo & Yuhong Wang & Tingting Li, 2023. "The Integrated Scheduling Optimization for Container Handling by Using Driverless Electric Truck in Automated Container Terminal," Sustainability, MDPI, vol. 15(6), pages 1-22, March.
    14. Wu, Lingxiao & Ma, Weimin, 2017. "Quay crane scheduling with draft and trim constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 38-68.
    15. Harry Geerlings & Robert Heij & Ron van Duin, 2018. "Opportunities for peak shaving the energy demand of ship-to-shore quay cranes at container terminals," Journal of Shipping and Trade, Springer, vol. 3(1), pages 1-20, December.
    16. Frank Meisel & Christian Bierwirth, 2013. "A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals," Transportation Science, INFORMS, vol. 47(2), pages 131-147, May.
    17. Debjit Roy & René De Koster & René Bekker, 2020. "Modeling and Design of Container Terminal Operations," Operations Research, INFORMS, vol. 68(3), pages 686-715, May.
    18. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    19. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    20. Liu, Ming & Chu, Feng & Zhang, Zizhen & Chu, Chengbin, 2015. "A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 52-74.

    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:spr:joinma:v:28:y:2017:i:3:d:10.1007_s10845-015-1035-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.