期刊文献+

基于模糊聚类的泊位分配与岸桥调度优先级计算方法

A calculation approach about berth and quay crane assignment priority by fuzzy clustering method
在线阅读 下载PDF
导出
摘要 针对传统的一刀切式的船舶优先级调度算法在实际应用中具有的很大局限性,提出了一种基于模糊聚类思想的优先级分配方法,将具有相似特征属性的来港作业船舶进行模糊聚类,并依据设计的相应算法计算得出各艘船舶在港服务的优先级,以合理安排来港船舶的作业顺序,进而提高港区的整体经济效益。实例计算结果表明:在港区的岸桥、泊位使用更为连贯紧凑、利用率更高,港区码头的整体作业效率相对传统的基于先到先服务策略的调度方案得到大幅提升。 Berth and quay crane are scarce resources in container terminals.There,the integrated planning of berth allocation and quay crane assignment problems has attracted much attention in literature.It is vital to schedule vessels' loading and unloading since the container terminal is always in operation.A new approach based on fuzzy clustering method was proposed in this paper to solve the defects of former priority-based algorithm in practical application.Vessels were grouped into clusters with mutually similar attributes and the level of priority for different vessels was calculated.The container terminal could enhance the economic efficiency from rationally vessels scheduling.The calculation result showed that as compared with the traditional first-come-firstserve assignment method,the overall terminal efficiency and productivity was greatly improved.
出处 《中国科技论文》 北大核心 2017年第19期2219-2222,共4页 China Sciencepaper
基金 河北省自然科学基金资助项目(F2014202241)
关键词 水路运输 泊位分配 模糊聚类 港口码头 岸桥调度 waterway transportation berth allocation fuzzy clustering container terminal quay crane assignment
  • 相关文献

参考文献2

二级参考文献26

  • 1Frank Meisel, Christian Bierwirth. A survey of berth allocation and quay crane scheduling problems in container terminals[ J]. European Journal of Operational Research, 2010, (202) : 615- 627.
  • 2Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. The dynamic berth allocation problem for a container port[ J]. Transpor- tation Research Part E, 2001, (35) : 401-417.
  • 3Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation with service priority[ J]. Transportation Research Part B, 2003, (37) : 437-457.
  • 4Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos Papadimitriou. Berth allocation at indented berths for mega-container- ships[ J]. European Journal of Operational Research, 2007, (179) : 579-593.
  • 5Akio Imai, Etsuko Nishimura, Stratos Papadimitriou. Berthing ships at a multi-user container terminal with a limited quay ca- pacity[ J ]. Transportation Research Part E, 2008, (44) : 136-151.
  • 6Der-Horng Lee, Jiang Hang Chen, Jin Xin Cao. The continuous berth allocation problem: a greedy randomized adaptive search solution[ J]. Transportation Research Part E, 2010, (46) : 1017-1029.
  • 7Akio Imai, Xin Sun, Etsuko Nishimura, Stratos Papadimitriou. Berth allocation in a container port: Using a continuous loca- tion space approach[ J]. Transportation Research Part B, 2005, (39) : 199-221.
  • 8R Tavakkoli - Moghaddam, Makui, Salahi, Bazzazi. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports[ J]. Computers & Industrial Engineering, 2009, (56) : 241-248.
  • 9Frank Meisel, Christian Bierwirth. Heuristics for the integration of crane productivity in the berth allocation problem [ j]. Transportation Research Part E, 2009, (45) : 196-209.
  • 10乐美龙,刘菲.基于Memetie算法的泊位和岸桥分配问题[J].武汉理工大学,2011,11(33):66-71.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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