计算机工程与应用2024，Vol.60Issue(17)：302-311,10.DOI:10.3778/j.issn.1002-8331.2305-0477
自动化码头同时考虑握手区容量和位置的双ASC调度
Twin ASC Scheduling Considering Capacity and Location of Handshake Area in Automated Terminal
摘要
Abstract
In order to improve the scheduling efficiency of automatic stacking crane(ASC)in the synchronous mode of container storage and retrieval at automated container terminal(ACT),the scheduling of uncrossable twin ASC in the same block is investigated,with the objective of minimizing the maximum ASC completion time,a twin ASC scheduling mixed integer programming(MIP)model is established,which considers both the constraints of the capacity and location of the handshake area,and the mixed stacking of storage and retrieval tasks on the seaside and landside of the yard.The chaotic discrete particle swarm optimization(CDPSO)algorithm with permutation coding is designed with the sequence of operational tasks as the coding,and the convergence speed of the algorithm is improved by the designed sequence of chaotic factors.Three sets of experiments are designed by changing different handshake area location and capacity,and the experimental results show that the optimal handshake area location and capacity help to reduce the maximum comple-tion time and conflict time of twin ASC,and meanwhile,the comparison experiments of different algorithms show that the designed algorithm can effectively solve the twin ASC scheduling MIP model,and the optimal solution obtained has better no-load time and maximum completion time of twin ASC compared with other algorithms.关键词
自动化集装箱码头(ACT)/自动堆垛起重机(ASC)/混沌离散粒子群优化算法(CDPSO)/双ASC调度Key words
automated container terminal(ACT)/automated stacking crane(ASC)/chaotic discrete particle swarm opti-mization(CDPSO)/twin ASC scheduling分类
交通工程引用本文复制引用
马飞扬,朱瑾..自动化码头同时考虑握手区容量和位置的双ASC调度[J].计算机工程与应用,2024,60(17):302-311,10.基金项目
国家自然科学基金(62073212) （62073212）
上海市科学技术委员会项目(23ZR1426600). （23ZR1426600）
