计算机科学 ›› 2021, Vol. 48 ›› Issue (11A): 22-29.doi: 10.11896/jsjkx.201200167

• 智能计算 • 上一篇    下一篇

集装箱码头岸桥最优调度理论研究和高效算法

高熙, 孙未未   

  1. 复旦大学计算机科学技术学院 上海201203
    上海市数据科学重点实验室(复旦大学) 上海201203
    上海智能电子与系统研究院 上海200433
  • 出版日期:2021-11-10 发布日期:2021-11-12
  • 通讯作者: 孙未未(wwsun@fudan.edu.cn)
  • 作者简介:xgao18@fudan.edu.cn
  • 基金资助:
    国家自然科学基金(61772138)

Theoretical Research and Efficient Algorithm of Container Terminal Quay Crane Optimal Scheduling

GAO Xi, SUN Wei-wei   

  1. School of Computer Science,Fudan University,Shanghai 201203,China
    Shanghai Key Laboratory of Data Science,Fudan University,Shanghai 201203,China
    Shanghai Institute of Intelligent Electronics and Systems,Shanghai 200433,China
  • Online:2021-11-10 Published:2021-11-12
  • About author:GAO Xi,born in 1996,postgraduate.His main research interests include intelligent transport and so on.
    SUN Wei-wei,born in 1973,Ph.D,professor,is senior member of China Computer Federation.His main research interests include intelligent transport and big spatial-temporal data.
  • Supported by:
    National Natural Science Foundation of China(61772138).

摘要: 岸桥调度问题是集装箱码头中最核心的调度问题之一。现有研究成果无法在可行时间内计算出对较大规模业务的最优调度,因此现有岸桥调度算法普遍采用启发式策略,以保障在可行时间内计算出一种调度。首先从理论角度证明了完工时间下界的正确性,设计了一种最优调度构造方法,完备了岸桥调度问题的理论体系;其次,在此理论工作基础上,设计了线性时间复杂度的算法求出最优调度;最后,用实验验证了所提方法在解的质量和效率上显著优于现有方法。

Abstract: Quay crane scheduling problem is one of the most important scheduling problems in container terminals.The existing research results can not calculate the optimal scheduling of large-scale business in the feasible time,so the existing quay crane scheduling algorithms generally adopt heuristic strategies to ensure that scheduling can be calculated in the feasible time.In this paper,firstly,the correctness of the lower bound of completion time is proved theoretically,an optimal scheduling construction method is designed and the theoretical system of quay crane scheduling problem is completed.Secondly,based on the theoretical work,an algorithm of linear time complexity is designed to find the optimal scheduling.Finally,experiments show that the proposed method is significantly better than the existing methods in terms of solution quality and efficiency.

Key words: Linear algorithm, Lower bound of completion time, Optimal solution, Quay crane scheduling

中图分类号: 

  • TP399
[1]ZHANG S,LV M Q,DAI J H,et al.Research on Quay Crane Scheduling Optimization Based on the Uncertainty of Operation Time[J].Industrial Engineering and Management,2020,25(5):54-62.
[2]Statistics of Container Terminal Throughput for Main Ports in China (Jul.,2020)[J].Containerization,2020,31(8):34-35.
[3]ZHAO C.The Way to Improve the Port[J].Industry City,2020(10):54-55.
[4]LU S X,LV C H,QING T.An Algorithm Based on Make Span Lower Bound for Quay Crane Schedule Problem in Container Terminals[J].Operations Research Transactions,2020,24(3):67-76.
[5]LIU J,WAN Y W,WANG L.Quay crane Scheduling at Container Terminals to Minimize the Maximum Relative Tardiness of Vessel Departures[J].Naval Research Logs,2006,53(1):60-74.
[6]MIAO W L.Quay Crane Scheduling with Non-Interference Constraints in Port Container Terminals[J]. Transportation Research Part E Logistics & Transportation Review,2008,44(1):124-135.
[7]KAVESHGAR N,NUYNH N,RAHIMIAN S K.An Efficient Genetic Algorithm for Solving the Quay Crane Scheduling Problem[J].Expert Systems With Applications,2012,39(18):13108-13117.
[8]CHUNG S H,FELIX T,CHAN S.A Workload Balancing Genetic Algorithm for the Quay Crane Scheduling Problem[J].International Journal of Production Research,2013,51(16):4820-4834.
[9] SU N Y,ZHANG M J,JOHNSTON M,et al.Hybrid Evolutionary Computation Methods for Quay Crane Scheduling Problems[J].Computers and Operations Research,2013,40(8):2083-2093.
[10]LEE D H,WANG H Q,MIAO L X.Quay Crane Schedulingwith Handling Priority in Port Container Terminals.Engineering Optimization,2008,40(2):179-189.
[11]KIM K H,PARK Y M.A Crane Scheduling Method for Port Container Terminals [J].European Journal of Operational Research,2004,156(3):752-768.
[12]ZHU Y,LIM A.Crane Scheduling with Non-Crossing Con-straint.Journal of the Operational Research Society,2006,57(12):1464-1471.
[13]PETERKOFSKY R I,DAGANZO C F.A Branch and Bound Solution Method for the Crane Scheduling Problem[J]. Transportation Research Part B Methodological,1990,24(3):159-172.
[14]MOCCIA L,CORDEAU J F,GAUDIOSO M,et al.A Branch-and-Cut Algorithm for the Quay Crane Scheduling Problem in a Container Terminal[J].Naval Research Logistics,2006,53(1):45-59.
[15]BIERWIRTH C,MEISEL F.A Fast Heuristic for Quay Crane Scheduling with Interference Constraints[J].Journal of Scheduling,2009,12(4):345-360.
[16]SONG Y T,WANG N,WU N.Optimization of Berth and Quay Crane Collaborative Scheduling Considering Both the Cost and Time Guarantee Rate[J].Operations Research and Management Science,2020,29(4):130-137.
[17]LE M L,ZHAO Y Y,LIU X L.Shore-Mounted Gantry Crane Scheduling for Single Vessel Under Time Window-Using Mathematical Programming and Rule Heuristic Algorithm[J].Computer Engineering and Applications,2014,50(9):242-248.
[1] 胡玉姣, 贾庆民, 孙庆爽, 谢人超, 黄韬.
融智算力网络及其功能架构
Functional Architecture to Intelligent Computing Power Network
计算机科学, 2022, 49(9): 249-259. https://doi.org/10.11896/jsjkx.220500222
[2] 李梦菲, 毛莺池, 屠子健, 王瑄, 徐淑芳.
基于深度确定性策略梯度的服务器可靠性任务卸载策略
Server-reliability Task Offloading Strategy Based on Deep Deterministic Policy Gradient
计算机科学, 2022, 49(7): 271-279. https://doi.org/10.11896/jsjkx.210600040
[3] 魏鹏, 马玉亮, 袁野, 吴安彪.
用户行为驱动的时序影响力最大化问题研究
Study on Temporal Influence Maximization Driven by User Behavior
计算机科学, 2022, 49(6): 119-126. https://doi.org/10.11896/jsjkx.210700145
[4] 刘丽, 李仁发.
医疗CPS协作网络控制策略优化
Control Strategy Optimization of Medical CPS Cooperative Network
计算机科学, 2022, 49(6A): 39-43. https://doi.org/10.11896/jsjkx.210300230
[5] 沈超, 何希平.
基于纹理特征增强和轻量级网络的人脸防伪算法
Face Anti-spoofing Algorithm Based on Texture Feature Enhancement and Light Neural Network
计算机科学, 2022, 49(6A): 390-396. https://doi.org/10.11896/jsjkx.210600217
[6] 刘云, 董守杰.
基于CUDA核函数的多路视频图像拼接加速算法
Acceleration Algorithm of Multi-channel Video Image Stitching Based on CUDA Kernel Function
计算机科学, 2022, 49(6A): 441-446. https://doi.org/10.11896/jsjkx.210600043
[7] 朱旭辉, 沈国娇, 夏平凡, 倪志伟.
基于螺旋进化萤火虫算法和BP神经网络的模型及其在PPP融资风险预测中的应用
Model Based on Spirally Evolution Glowworm Swarm Optimization and Back Propagation Neural Network and Its Application in PPP Financing Risk Prediction
计算机科学, 2022, 49(6A): 667-674. https://doi.org/10.11896/jsjkx.210800088
[8] 杨晓宇, 殷康宁, 候少麒, 杜文仪, 殷光强.
基于特征定位与融合的行人重识别算法
Person Re-identification Based on Feature Location and Fusion
计算机科学, 2022, 49(3): 170-178. https://doi.org/10.11896/jsjkx.210100132
[9] 陈贵强, 何军.
自然场景下遥感图像超分辨率重建算法研究
Study on Super-resolution Reconstruction Algorithm of Remote Sensing Images in Natural Scene
计算机科学, 2022, 49(2): 116-122. https://doi.org/10.11896/jsjkx.210700095
[10] 李玉, 段宏岳, 殷昱煜, 高洪皓.
基于区块链的去中心化众包技术综述
Survey of Crowdsourcing Applications in Blockchain Systems
计算机科学, 2021, 48(11): 12-27. https://doi.org/10.11896/jsjkx.210600152
[11] 廉文娟, 赵朵朵, 范修斌, 耿玉年, 范新桐.
基于认证及区块链的CFL_BLP_BC模型
CFL_BLP_BC Model Based on Authentication and Blockchain
计算机科学, 2021, 48(11): 36-45. https://doi.org/10.11896/jsjkx.201000002
[12] 杨青, 张亚文, 朱丽, 吴涛.
基于注意力机制和BiGRU融合的文本情感分析
Text Sentiment Analysis Based on Fusion of Attention Mechanism and BiGRU
计算机科学, 2021, 48(11): 307-311. https://doi.org/10.11896/jsjkx.201000075
[13] 代闯闯, 栾海晶, 杨雪莹, 过晓冰, 陆忠华, 牛北方.
区块链技术研究综述
Overview of Blockchain Technology
计算机科学, 2021, 48(11A): 500-508. https://doi.org/10.11896/jsjkx.201200163
[14] 刘彤彤, 杨环, 西永明, 郭建伟, 潘振宽, 黄宝香.
机器学习在脊柱疾病智能诊治中的应用综述
Review on Intelligent Diagnosis of Spine Disease Based on Machine Learning
计算机科学, 2021, 48(11A): 597-607. https://doi.org/10.11896/jsjkx.201100006
[15] 穆聪聪, 王一舒, 袁野, 乔百友, 马玉亮.
时序图中Top-k稠密子图查询算法研究
Top-k Densest Subgraphs Search in Temporal Graphs
计算机科学, 2021, 48(10): 152-159. https://doi.org/10.11896/jsjkx.201100005
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!