期刊文献+

基于混合算法的多目标连续泊位-岸桥集成调度研究 被引量:2

Study of Multi-objective Consecutive Berth Integrated Scheduling of Quay Based on Hybrid Algorithm
在线阅读 下载PDF
导出
摘要 为了多角度考虑,合理地提高码头作业效率和客户满意度.针对集装箱码头连续泊位,考虑船舶动态到达且船舶有优先级条件下的泊位-岸桥集成调度优化问题.首先,建立了基于船舶总在港时间最少、总等待时间最少,泊位偏离惩罚最小、超出计划离港时间惩罚最小的多目标泊位-岸桥集成调度一阶段模型和最小化岸桥移动成本的岸桥具体分配二阶段模型.然后,提出了一种将细菌觅食、粒子群、克隆免疫、变领域搜索相结合的混合算法.最后,用提出的算法和Cplex软件对模型算例进行求解,针对不同目标,得出具体调度方案.实验表明:混合算法比细菌觅食算法、粒子群算法和克隆免疫算法有更好的精度并且具有较快求解速度;同时具体调度方案会随着目标函数的不同而发生相应的变化,各个目标之间存在约束关系,验证了混合算法和模型的有效性. In order to improve the efficiency of terminal operations and customer satisfaction from multiangle, for the continuous berth container terminal, berth and quay crane integrated scheduling problems under the condition of ships dynamic arriving and the ship has priority is considered in the paper. First, first stage model of the multi-objective integrated scheduling berth and quay crane model based on the total vessel time in port at least, the total waiting time at least, minimal punishment of berth deviations, minimal penalty of beyond the planned departure time, and two-stage model of minimize moving costs quay specific allocation are established. Then, a hybrid search algorithm is proposed combined with bacteria foraging optimization (BFO), particle swarm optimization (PSO), immune clonal algorithm (ICA) and variable neighborhood search algorithm(VNS). Finally, the algorithm and Cplex software are used to solve the examples of berth and quay crane allocation model, which can draw concrete allocation scheme for different target. Comparative analysis of simulation results illustrated that: the algorithm has better accuracy and faster solving speed compared with the BFO, PSO and ICA; scheduling program will vary with the specific objective function and the various objective functions exists constraint relationship.
作者 谭盛强 朱瑾
出处 《宁夏大学学报(自然科学版)》 CAS 2015年第2期131-139,共9页 Journal of Ningxia University(Natural Science Edition)
基金 上海市自然科学基金资助项目(13ZR1419200)
关键词 集装箱码头 泊位-岸桥集成调度 多目标 细菌觅食算法 粒子群算法 克隆免疫算法 container terminal berth-crane allocation multi-objective bacteria foraging optimization particle swarm optimization immune clonal algorithm
  • 相关文献

参考文献15

  • 1IMAI A, CHENH C, NISHIMURA E, et al. The simultaneous berth and quay crane allocation problem [J]. Transportation Research Part E, 2008, 44 (5) . 900-920.
  • 2HANSEN P, OGUZ C, MLADENOVIC N. Variable neighborhood search for minimum cost berth allocation [J]. European Journal of Operational Researeh,2008, 191(3) .636-649.
  • 3LIANG C, HUANG Y, YANG Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning[J]. Computers and Industrial, Engineering,2008,56(3) :1021-1028.
  • 4GIANOMBARDO G, MOCCIA L, SALANI M, et al.The tactical berth allocation problem with quay craneassignment and transshipment-related quadratic yard costs [ C ]//Proceedings of the European Transport Conference(ETC), 2008 : 1-27.
  • 5GOLIAS MIHALIS M, BOILE MARIA, THEOFANIS SOTIRIOS. Berth scheduling by customer service differentiation: A multi-objective approach [ J ]. Transportation Research Part E, 2009,45 . 878-892.
  • 6ZHANG Canrong, LI Zheng, ZHANG Zhihai, et al. The allocation of berths and quay cranes by using a sub-gradient optimization technique[J]. Computers and Industrial, 2010,58 (1) : 40-50.
  • 7周鹏飞,康海贵.面向随机环境的集装箱码头泊位-岸桥分配方法[J].系统工程理论与实践,2008,28(1):161-169. 被引量:56
  • 8杨春霞,王诺.基于多目标遗传算法的集装箱码头泊位—岸桥分配问题研究[J].计算机应用研究,2010,27(5):1720-1722. 被引量:24
  • 9TAVAKKOLI-MOGHADDAM R, MAKUI A, SALAHI S, et al. An efficient algorithm for solving a New mathematical model for a quay crane scheduling Problem in container Port[J]. Computers Industrial Engineering, 2009,56 (1) . 241-248.
  • 10杨春霞,王诺.改进Memetic算法求解集装箱码头泊位岸桥调度问题[J].计算机工程与应用,2011,47(22):233-235. 被引量:4

二级参考文献98

共引文献126

同被引文献12

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部