具有服务优先级别的动态离散泊位调度优化.pdfVIP

上海交通大学学报 Vo l. 43 No.6 第 43 卷第6 期 Jun. 2009 2009 年 6 月 JOURNAL OF SHANGHAI JIAOTONG UNIVERSITY 文章编号:1006-2467(2009)06-0902-04 具有服务优先级别的动态离散泊位调度优化 韩笑乐， 陆志强， 矣立峰 (上海交通大学工业工程与管理系，上海 200240) 摘 要:研究具有不同服务优先级别的船舶动态到达情形下的离散泊位调度问题.以泊位分派和 船舶作业开始时间为决策变量，为优化码头作业效率和船公司客户满意度，以最小化船舶总在港时 间与加权延迟时间之和为目标建立数学模型.采用基于修改后的先到先服务等规则的启发式算法 生成初始解，以此为基础设计结合禁忌深度搜索和模拟退火算法框架的混合算法对问题进行优化 求解.不同问题规模下的数据仿真试验表明，该算法可以快速、有效地解决此类问题. 关键词:泊位调度;模拟退火;禁忌搜索;集装箱码头作业 中图分类号: TP 29; U 691 文献标识码:A Optimization of Discrete Berth Scheduling Problem for Dynamic Arriving Vessels with Service Priority HAN Xiao-le , LU Zhi-qiang , XI Li-feng (Department of lndustrial Engineering and Management , Shanghai ]iaotong University , Shanghai 200240 , China) Abstract: This paper studied a discrete berth scheduling problem in which ships arrive dynamically with different service priorities. A mathematical model was established using berth assignment and vessel pro- cessing starting time as decision variables. Total staying time plus weighted sum of tardiness are chosen as objective function , aiming to optimize both terminal operation efficiency and vessel customer satisfaction. A hybrid algorithm combining tabu local search and simulated annealing algorithm frame was constructed with initial solution generated by heuristics based on modified rules such as first come first serve , etc. The computational experiments under various problem scales show the satisfied performance of this algorithm. Key words: berth scheduling; simulated annealing; tabu search; conta