期刊文献+

离散泊位分配装卸量加权延迟最小化策略 被引量:1

Weighted Delay Minimization Strategy of Handling Capacity for Discrete Berth Allocation
下载PDF
导出
摘要 主要研究船舶优先权的离散泊位优化调度问题,对不同装卸量的船舶赋以不同的权重值,建立以最小化船舶总的加权作业时间为目标的混合整数规划模型。通过算例比较了是否考虑船舶权重两种泊位分配策略下船舶总的作业完成时间以及加权作业完成时间,并分析了不同的船舶权重系数对泊位分配的影响。研究结果表明:权重系数的选取会影响到整个港口的作业效率,决策者在做决策的过程中要对其综合考虑。 The discrete berth scheduling problem was studied with considering vessel priority. According to the workload,this paper established the mathematical programming model of minimizing the total weighted work time based on different vessel weights design. Through an example,the completed work time and the weighted completed work time under two kinds of berth allocation strategies of without the weights and with the weights were compared,and the effect of different vessel weights on the berth allocation was analyzed. The results show that the selection of weight coefficient affects the efficiency of the whole port,and the decision makers should consider all the factors.
作者 杨斌 岳宇菲
出处 《河南科技大学学报(自然科学版)》 CAS 北大核心 2014年第4期100-104,10,共5页 Journal of Henan University of Science And Technology:Natural Science
基金 国家自然科学基金项目(71171129) 上海市科委科研计划基金项目(111510501900 12dz1124802) 上海市教委科研基金项目(11YZ137)
关键词 离散 泊位分配 装卸量 加权延迟 混合整数规划 discrete berth allocation handling capacity weighted delay mixed integer programming
  • 相关文献

参考文献14

  • 1Ima A,Nagaiwa K,Chan W.Efficient Planning of Berthing Allocation for Container Terminals in Asia [ J ].Journal of Advanced Transportation,1997,31:75-94.
  • 2Imai A,NJshimura E,Papadimitriou S.The Dynamic Berth Allocation Problem for a Container Port [ J ].Transportation Research Part B,2001,35(4):401-417.
  • 3Dorigo M,Maniezzo V,Colorni A.Ant System:Optimization by a Colony of Cooperating Agents IEEE Trans [ J ].Systems Man Cybernet,1996,26(1):29-41.
  • 4Lira A.The Berth Planning Problem [ J ].Operations Research Letters,1998,25(2/3):105-110.
  • 5Kim K H,Moon K C.Berth Scheduling by Simulated Annealing[ J ].Transportation Research Part B,2003,37(6:541-560.
  • 6Park K T,Kim K H.Berth Scheduling for Container Terminals by Using a Sub-gradient Optimization Technique[ J ]Journal of the Operational Research Society,2002,53(9):1054-1062.
  • 7Nishimura E,hnai A,Papadimitriou S.Berth Allocation Planning in the Public Berth System by Genetic Algorithms[ J].European Journal of Operational Research,2001,131(2):282-292.
  • 8Hansen P,Oguz C,Mladenovic N.Variable Neighborhood Search Forminimum Cost Berth Allocation[J].European Journal of Operational Research,2008,191(3):636-649.
  • 9Buhrkal K,Zuglian S,Ropke S,et al.Models for the Discrete Berth Allocation Problem:A Computational Comparison[J].Transportation Research Part E,2011,47(4):461-473.
  • 10童珊.基于船舶优先权的集装箱港口泊位分配问题[J].交通运输工程与信息学报,2012,10(1):105-110. 被引量:13

二级参考文献41

  • 1李平,孙俊清,韩梅.泊位调度问题的GATS混合优化策略[J].天津理工大学学报,2006,22(4):58-61. 被引量:11
  • 2Vis I F A, de Koster R. Transshipment of containers at a container terminal.. An overview [J]. European Journal of Operational Research, 2003, 147(1): 1-16.
  • 3Imai A, Nagaiwa K, Tat C W. Efficient planning of berth allocation for container terminals in Asia [J]. Journal of Advanced Transportation, 1997, 31 ( 1 ) :75- 94.
  • 4Park K T, Kim K H. Berth scheduling for container terminals by using a sub-gradient optimization technique [J]. Journal of the Operational Research Society, 2002, 53(9): 1054-1062.
  • 5Imai A, Nishimura E, Papadimitriou S. The dynamic berth allocation problem for a container port [J]. Transportation Research Part B, 2001, 35(4): 401- 417.
  • 6Lai K K, Shih K. A study of container berth allocation [J]. Journal of Advanced Transportation, 1992, 26: 45-60.
  • 7Nishimura E, Imai A, Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms [J]. European Journal of Operational Research, 2001, 131(2): 282-292.
  • 8Lim A. The berth planning problem [J]. Operations Research Letters, 1998, 22(2-3): 105-110.
  • 9ImaiA., Sun X., Nishimura E., Papadimitriou S.. Berth allocation in a container port: using a continuous location space approach [J]. Transportation ResearchPartB, 2005, 39: 199- 221.
  • 10Imai A., Nishimura E., Papadimitriou S.. The dynamic berth allocation problem for a container port[J]. Transportation Research Part B, 2001, 35(4): 401-417.

共引文献71

同被引文献14

  • 1Ji Ming Jun, Zhu Hui Ling, Wang Qing Bin, Zhao Rui, Yang Yong Zhi.Integrated Strategy for Berth Allocation and Crane Assignment on a Continuous Berth Using Monte Carlo Simu-lation[J].Simulation, 2015 (1).
  • 2Bierwirth C, Meisel F. A Follow-up Survey of Berth Alloca-tion and Quay Crane Scheduling Problems in Container Ter-minals[J].European Journal of Operational Research, 2015 (3).
  • 3Yan Shang Yao, Lu Chung Cheng, Hsieh Junh Siao, Lin Han-Chun. A Network Flow Model for the Dynamic and Flexible Berth Allocation Problem[J].Computers and Industrial Engi-neering,2015(81).
  • 4Rodriguez M M, Salido M A, Barber F. Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem [C]. Mathematical Problems in Engineering,2014.
  • 5Pang King Wah, Liu Ji Yin. An Integrated Model for Ship Routing with Transshipment and Berth Allocation[J].IIE Transactions, 2014 (12).
  • 6Robenek T, Umang N, Bierlaire M, Ropke S. A Branch-and-price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports[J].European Journal of Operational Research, 2014(2).
  • 7Hu Qing Mi, Hu Zhi Hua, Du Yu Quan. Berth and Quay-crane Allocation Problem Considering Fuel Consumption and Emissions From Vessels[J].Computers and Industrial Engi-neering, 2014 (1).
  • 8Lin Shi Wei, Ting Ching Jun. Solving the Dynamic Berth Allocation Problem by Simulated Annealing [J]. Engineering Optimization, 2014 (3).
  • 9Gao Zhi Jun, Cao Jin Xin, Zhao Qing Yu. Optimization Re-search of Berth Allocation and Quay Crane Assignment at Container Terminal Based on the Genetic Algorithm[J].Ap-plied Mechanics and Materials, 2014 (5).
  • 10孙少文,杨斌,胡志华.潮汐影响下的港口离散泊位分配问题研究[J].合肥工业大学学报(自然科学版),2014,37(4):486-492. 被引量:7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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