期刊文献+

岸桥干涉和作业量均衡的岸桥调度模型

QCs scheduling for interference problems and operation balance
原文传递
导出
摘要 为解决岸桥调度中岸桥之间的干涉问题,改善岸桥作业不均衡现象,建立以最小化岸桥的作业完成时间和作业时间标准差为目标函数的多目标混合整数规划模型,使用?-法确定权系数,将多目标问题转化为单目标问题,采用CPLEX求解.将两个单目标方案分别和多目标方案进行比较,结果表明:多目标方案的作业完成时间相较于以作业时间最平衡为目标的调度方案减少了近17.3%,岸桥作业时间标准差比以作业完成时间最小化为目标的调度方案减少了近33.33%,验证了模型在岸桥调度中的有效性. In order to solve the QCs interference problem and improve the operation balance, a multi objective mixed integer programming model was set up, aiming to minimize the QCs completion time and QCs operation time standard deviation. Then, CPLEX was used to solve this model after transferring the multi objective problem into a single object one by α - method. Finally, the comparisons of scheduling results between multi objective and two single ones showed that the QCs completion time in multi objective scheduling almost reduced by 17.3% compared with the balanced operation one, and the QCs operation time standard deviation in multi objective scheduling reduced nearly by 33.33% compared with the minimized completion time one, which confirmed that the model was effective in solving the quay crane scheduling problem.
出处 《辽宁工程技术大学学报(自然科学版)》 CAS 北大核心 2014年第11期1572-1576,共5页 Journal of Liaoning Technical University (Natural Science)
基金 国家自然基金资助项目(71071093) 上海市自然科学基金资助项目(10ZR1413300) 上海市教委创新基金资助项目(11YZ136) 上海市科委创新基金资助项目(09DZ2250400 9530708200 10190502500) 上海市重点学科基金资助项目(J50604)
关键词 水路运输 岸桥调度 作业均衡 多目标问题 α-法 干涉问题 waterway transportation QCs scheduling balanced operation multi-objective problem α- method interference problems
  • 相关文献

参考文献12

  • 1上海航运交易所.全球GDP增长减速殃及集装箱海运业[EB/OL].http://www.htship.com/html/News2013042556140453.html,2013-4-25.
  • 2金鑫,丁以中.新工艺下集装箱码头装卸资源分配模拟[J].上海海事大学学报,2010,31(1):28-32. 被引量:5
  • 3Kim K H,Park Y.A crane sehecluling method for port container terminals[J]. E~ Journal of O~onal Researeh,2004,156: 752-768.
  • 4Luigi M,Jean Francois C,Manlio C~et al.A branch-and-cut algorithm for the quay crane scheduling problem in a container Terminal[J].Naval Research Logistics,2006,53(1):45-59.
  • 5Lee D,Hui Q W, Li X M.Quay crane scheduling with non-intefferenoe constraints in port container terminals[J].Transportation Research:PartE,2008,44:124-135.
  • 6Pasquale L,Roberto T, Frank M.Modeling and solving rich quay crane scheduling problems[J].Computers & Operations Research,2012,39: 2 063-2 078.
  • 7张亚辉.基于工作量平衡的集装箱港口岸桥作业调度研究[D].上海:上海海事大学研究生院,2012.
  • 8杨春霞,王诺.改进Memetic算法求解集装箱码头泊位岸桥调度问题[J].计算机工程与应用,2011,47(22):233-235. 被引量:4
  • 9乔辰,张国立.几何加权法求解多目标规划问题[J].华北电力大学学报(自然科学版),2011,38(6):107-110. 被引量:32
  • 10赵磊,胡志华,李淑琴.基于作业均衡的集装箱堆场箱区场桥作业调度[J].武汉理工大学学报,2013,35(1):69-74. 被引量:11

二级参考文献52

  • 1韩晓龙.集装箱港口龙门吊的最优路径问题[J].上海海事大学学报,2005,26(2):39-41. 被引量:24
  • 2李学全,张泊,王军.多目标规划的一种混合遗传算法[J].数学理论与应用,2005,25(3):24-27. 被引量:5
  • 3王瑛.供应链伙伴信息共享的博弈与激励[J].中国管理科学,2005,13(5):61-66. 被引量:37
  • 4申悦,于瑞峰,吴甦,刘丽文.零售商B ertrand竞争下的供应链成本信息共享价值[J].清华大学学报(自然科学版),2005,45(11):1581-1584. 被引量:47
  • 5薛巧玲,朱建.解多目标规划的区间极大熵方法[J].南京大学学报(数学半年刊),2007,24(1):158-167. 被引量:3
  • 6CANONACO P, LEGATO P, MAZZA R M, et al. A queuing network model for the management of berth crane operations [ J]. Computers & Operations Res, 2008, 35 (8) : 2432-2446.
  • 7PETERINGA M E H, MURTYB K G. Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal [ J ]. Computers & Operations Res, 2009, 36 (5) : 1711-1725.
  • 8ZENG Qingcheng, YANG Zhongzhen. Integrating simulation and optimization to schedule loading operations in container terminals [ J]. Computers & Operations Res, 2009, 36(6) : 1935-1944.
  • 9LU Chen, NATHALIE B, PIERRE D, et al. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal [ J ]. Eur J Operational Res, 2007, 118 ( 1 ) : 48-50.
  • 10LEGATO P, GULLI D, TRUNFIO R. Simulation at a maritime container terminal: models and computational frameworks[ C J//Proc 22th Eur conf on Modelling & Simulation ( ECMS 2008). Nicosia, 2008 : 261-269.

共引文献64

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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