摘要
【目的】研究了自动化码头双自动堆垛起重机(Automatic stacking crane,ASC)调度问题,为了提高堆场的作业效率,考虑ASC作业过程中的干扰和冲突,以极小化所有作业的总完工时间为目标,建立自动化码头双ASC调度问题的混合整数规划模型。【方法】通过CPLEX求解器对模型进行求解。为了解决中等规模问题,设计了基于任务编码的离散差分进化算法进行求解,并把求解结果与遗传算法求解结果进行对比分析。【结果】所设计的离散差分进化算法能够在要求的时间内解决自动化码头双ASC调度问题;【结论】相较于遗传算法,本文提出的算法寻优能力更强。
[Purposes]A twin ASC scheduling problem of the automatic container terminal is studied.In order to improve the efficiency of the yard operation,considering the interference and conflicts in the ASC operation process,the integer programming model is established.The optimization goal is to minimize the total completion time.[Methods]The CPLEX solver is used to solve the model.For the medium-scale problems,based on task coding,a discrete differential evolution algorithm is designed.The solution results are compared with those of the genetic algorithm solution.[Findings]The results show that the algorithm proposed can solve the twin-ASC scheduling problem of automatic container terminals within the required time.[Conclusions]The algorithm proposed dominates the genetic algorithm solution.
作者
王豪
白丹宇
曾庆成
侯年华
曾莎莎
WANG Hao;BAI Danyu;ZENG Qingcheng;HOU Nianhua;ZENG Shasha(College of Transportation Engineering,Dalian Maritime University;School of Maritime Economics,Managem ent,Dalian Maritime University,Dalian Liaoning 116026,China)
出处
《重庆师范大学学报（自然科学版）》
CAS
北大核心
2021年第1期105-113,共9页
Journal of Chongqing Normal University:Natural Science
基金
国家自然科学基金面上项目(No.61873173)。
关键词
自动化码头
双ASC
差分进化算法
混合整数规划
automated container terminal
twin ASC
differential evolution algorithm
mixed-integer programming
