摘要
针对穿越式双起重机作业过程中的干涉问题,分析并界定干涉的存在形式,以最小化任务完成时间为目标,建立穿越式双起重机同步调度下的混合整数规划模型,确定装卸任务的分配与每台起重机的作业序列.用状态转移函数描述起重机的作业过程,提出基于任务优先级的随机键遗传算法,求解所提出的优化问题.根据现实自动化集装箱码头的特征参数,设计不同规模的算例并进行计算实验.实验结果表明,模型满足同步调度的约束条件,所得的解均为无冲突调度,验证了模型的有效性.算法求解结果显示,所得结果能够规避干涉实现同步调度,验证了算法的合理性与有效性.此外,所提算法具有良好的求解性能,能够提升穿越式双起重机同步调度问题的求解速度.
Aiming at the interference problem in the operation of dual automated stacking crane, the existing forms of interference are analyzed and defined. A mixed integer programming model for synchronous scheduling of dual automated stacking crane is established to determine the distribution of handling jobs and the sequence of each crane under the minimization of the makespan. The handling process of each crane is depicted by state transition function. A priority-key genetic algorithm based on task priority is proposed to solve the proposed optimization problem. Several numerical examples with various scales are designed according to the feature parameters at real-world automated container terminals for numerical experiment. The experimental results indicate that the proposed model satisfies the constraints of synchronous scheduling. All the solutions are conflict-free scheduling, which verifies the validity of the model. The results show that the solution of solving by proposed algorithm can avoid interference and achieve synchronous scheduling. The reasonability and validity of the algorithm are verified. In addition, this algorithm can effectively improve the solving rate of optimization of scheduling for dual automated stacking crane with synchronous constraints.
作者
王耀宗
胡志华
WANG Yaozong;HU Zhihua(Logistics Research Center,Shanghai Maritime University,Shanghai 201306,China)
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
2020年第1期83-93,共11页
Journal of Dalian University of Technology
基金
国家自然科学基金资助项目(71871136)
上海市科学技术委员会重点项目(17DZ2280200)
关键词
自动化集装箱码头
双起重机调度
干涉
优先权
遗传算法
automated container terminal
scheduling of dual cranes
interference
priority
genetic algorithm
