摘要
针对集装箱港口岸桥调度过程中,岸桥具有作业效率差异的特点,将其视为同类平行机调度问题,同时结合岸桥作业不可相互穿越与安全距离等特有约束,建立了更加符合实际的岸桥作业调度混合整数规划模型,其优化目标是最小化装卸作业的最大完工时间。针对问题的NP-hard特性,设计了求解模型的遗传算法,对算法搜索空间进行了讨论,并推导了问题的下界。最后,通过实验算例验证了模型与算法的有效性。
Considering operation efficiency difference among quay cranes,the quay crane scheduling is analyzed as uniform parallel machine scheduling with the non-crossing and safety constraints.A new mixed integer programming model for quay crane scheduling problem is established,so as to minimize the makespan of a vessel.Because it is NP-hard in nature,a genetic algorithm is designed to obtain the near optimal solutions.A lower bound is given to evaluate the effectiveness of the proposed algorithm.Finally,numerical examples are given to illustrate the validity of the model and its algorithms.
出处
《工业工程与管理》
CSSCI
北大核心
2012年第2期33-38,共6页
Industrial Engineering and Management
基金
上海市自然科学基金创新行动计划项目(10190502500)
上海市科学技术委员会研究基地建设项目(09DZ2250400)
上海海事大学博士生创新基金项目(yc2011055)
关键词
岸桥作业调度
同类平行机
混合整数规划
下界
遗传算法
quay crane scheduling
uniform parallel machine
mixed integer programming
lower bound
genetic algorithm
