多停泊基地约束下港口拖轮作业的一体化调度优化

发布时间：2018-04-25 05:21

本文选题：拖轮调度 + 多处理器任务调度　；参考：《上海交通大学学报》2014年01期

【摘要】：在分析拖轮调度问题基本性质的基础上,结合多处理器任务调度理论,构建了以拖轮总作业时间最小化为目标函数、考虑多停泊基地条件下的一体化调度优化模型;针对问题特点设计了混合模拟退火算法并对其进行求解;以二维实整数的方式作为解的表现形式,在初始解的生成过程中加入首艘可用拖轮的启发式规则,并运用三点交叉的方式产生新解.数值实例结果表明,所提出的算法收敛性较好,求解结果比现行调度规则所得结果的优化率提高了20%.对系统参数的分析表明:移泊作业所占比例和到港船舶类型对目标函数的影响较大;在拖轮配备中,总作业时间对拖轮配备情况具有极弱的敏感性,而在不同装卸作业时间下总作业时间的变化无规律性.
[Abstract]:Based on the analysis of the basic properties of the tugboat scheduling problem and the multiprocessor task scheduling theory, an integrated scheduling optimization model with the objective function of minimizing the total working time of the tug is constructed, and the integrated scheduling optimization model is considered under the condition of multiple berthing bases. According to the characteristics of the problem, the hybrid simulated annealing algorithm is designed and solved, and the heuristic rule of the first available tug is added in the process of generating the initial solution by taking the two-dimensional real integer as the representation of the solution. And the use of three-point crossover way to produce a new solution. Numerical results show that the proposed algorithm has better convergence, and the optimization rate of the proposed algorithm is increased by 20% compared with the results obtained from the current scheduling rules. The analysis of system parameters shows that the proportion of mooring operation and the type of ship coming to port have a great influence on the objective function, and the total working time has a very weak sensitivity to the condition of tugboat configuration. However, there is no regular change of total operation time under different loading and unloading time.
【作者单位】：大连海事大学交通运输管理学院;
【基金】：国家自然科学基金项目(71172108,71302044) 教育部高等学校博士学科点专项科研基金项目(20122125110009) 中央高校基本科研业务费专项资金项目(3132013076,3132013320,3132041217)资助
【分类号】：U691

【参考文献】