带作业范围约束的岸桥调度模型及其算法设计

发布时间：2018-03-09 09:04

本文选题：岸桥作业调度　切入点：最大完工时间　出处：《计算机工程与应用》2015年17期 　论文类型：期刊论文

【摘要】：受电缆线坑位置与缆线长度的限制,岸桥作业只能在一定的横向移动范围之内。考虑到这一现实要求,结合岸桥作业禁止跨越与安全距离等特有约束,以最小化装卸作业的makespan为目标,构建了新的岸桥作业调度混合整数规划模型。针对问题的NP-hard特性,设计了一种混合模拟退火算法,运用启发式算法生成质量较高的初始解,结合遗传算法的变异运算生成邻域新解,增强了解的多样性,引入禁忌搜索算法的禁忌表操作,避免了循环搜索,提高了求解效率。大规模实验结果表明所建立的模型是有效的,算法的求解质量与效率明显优于标准模拟退火算法与禁忌搜索算法。当实验规模逐渐增大时,与LINGO软件相比,算法在求解效率方面的优势越来越明显。
[Abstract]:Restricted by the position of cable cable pit and cable length, the operation of shore bridge can only be within a certain range of lateral movement. Considering this practical requirement, combining with the unique constraints such as forbidden crossing and safe distance of shore bridge operation, Aiming at minimizing the makespan of loading and unloading operations, a new mixed integer programming model of shoreline operation scheduling is constructed. According to the NP-hard characteristics of the problem, a hybrid simulated annealing algorithm is designed, and a heuristic algorithm is used to generate a high quality initial solution. Combining the mutation operation of genetic algorithm to generate neighborhood new solution, enhance the diversity of understanding, introduce Tabu list operation of Tabu search algorithm, avoid circular search. The results of large-scale experiments show that the proposed model is effective, and the quality and efficiency of the algorithm are obviously superior to those of the standard simulated annealing algorithm and Tabu search algorithm. The advantages of the algorithm in solving efficiency are becoming more and more obvious.
【作者单位】：河南理工大学经济管理学院;上海海事大学物流研究中心;
【基金】：国家自然科学基金(No.71101088,No.71171129) 河南省教育厅人文社科研究项目(No.2014-QN-115) 河南理工大学博士基金项目(No.B2015-45) 河南省教育厅科学技术研究重点项目(No.15A630066)
【分类号】：U691.3

【参考文献】