期刊文献+

基于船舶作业优先权的靠泊计划仿真优化研究 被引量:5

Research on Simulation Optimization of Berthing Plan Based on Service Priority
在线阅读 下载PDF
导出
摘要 近年来,我国现代码头集装箱吞吐量迅猛增长的同时,客户对服务的要求越来越高,码头之间的竞争也愈加激烈。为了保障重要客户的服务效率,在考虑泊位调度的服务公平性基础上,加入了VIP客户服务优先权因素,以最小化船舶等待时间和惩罚成本为目标,建立连续泊位作业调度的多目标数学模型。设计一种求解该模型的基于邻域搜索的模拟退火算法,并通过仿真对比不同优先权下的靠泊计划。实验结果显示:上述算法具有快速收敛于最优解的特点,可以用于具有优先权的泊位分配问题的快速求解,得出重要客户优先获得服务的靠泊计划。 In recent years, the port construction in China has developed rapidly, and the demand for service quality has gradually increased, and the competition between terminals is becoming more intense. In order to protect the service of VIP customers, this paper adds the priority factor of VIP customer service to the study on the fairness of berth scheduling. This paper proposes a fairness continuous berth allocation algorithm based on the priority of customer service, which takes into account the cost of vessel punishment, the priority of ship waiting time and berthing based on multiple objectives. Compared with different parameter strategies, the results show the satisfied performance of this algorithm and ensure the VIP customers have the priority to obtain service.
作者 张雯钰 郝杨杨 ZHANG Wen-yu;HAO Yang-yang(Institute of Logistics Science And Engineering,Shanghai Maritime University,Shanghai 201306,China)
出处 《计算机仿真》 北大核心 2020年第6期130-135,共6页 Computer Simulation
关键词 泊位分配 公平性 客户服务 模拟退火 Berth allocation Fairness Service Simulated annealing(SA)
作者简介 张雯钰(1995-),女(汉族),河南省周口市人,硕士研究生,主要研究领域为物流信息工程;郝杨杨(1984-),男(汉族),山西省忻州市人,高级工程师,硕士研究生导师,主要研究领域为港航信息化与仿真优化。
  • 相关文献

参考文献2

二级参考文献16

  • 1Edmond E D, Maggs R P. How Useful are Queue Models in Port Investment Decision for Container Berths[J]. Journal of Operational Research Society, 1978,29 (8) :741-750.
  • 2Lai K K, Shih K. A Study of Container Berth Allocation[J]. Journal oI Advanced Transportation, 1992,26 (1):45-60.
  • 3Brown G G, Lawphonegpanich S, Thurman K P. Optimizing Ship Berthing[J]. Naval Research Logistics,1994,41:1-15.
  • 4Brown G G, Cormican K J, LwaPhongPanich S, et al. Optimizing Submarine Berthing with a Persistence Incentive [J]. Naval Research Logistics, 1994,44(4): 301-318.
  • 5Akio Imai. Berth Allocation in a Container Port: Using a Continuous Location Space Approach[J]. Transportation Research Part B,2005,39 : 199-221.
  • 6Daganzo C F. The Crane Scheduling Problem[J]. Transportation Research B, 1989,23(3): 159-175.
  • 7Peterkofsky R I, Daganzo C F. A Branch and Bound Solution Method for the Crane Scheduling Problem [J]. Transpotation Research B, 1990,24(3) : 159-172.
  • 8Han Xiao-le,Lu Zhi-qiang,Xi Li-feng. A Prozctive Approach for Simultaneous Berth and Quay Crane Scheduling Problem with Stochastic Arrival and Handling Time[J]. European Journal of Operational Research ,2010,207: 1327-1340.
  • 9Vis IFA,de Koster R. Transshipment of Containers at a Container Terminal:An Overview[J]. European Journal of Operation Research,2003,147(1) : 1-16.
  • 10Park K T, Kim K H. Berth Scheduling for Container Terminal by Using a Sub-gradient Optimization Technique[J]. Journal of the Operational Research Society,2002,53(9):1054-1062.

共引文献25

同被引文献12

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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