首页> 外文会议>ICTIS 2011;International conference on transportation information and safety >The Application Research of Container Berth Allocation Based on Ant Colony Algorithms
【24h】

The Application Research of Container Berth Allocation Based on Ant Colony Algorithms

机译:蚁群算法在集装箱泊位分配中的应用研究

获取原文

摘要

At container terminal, it is critical to improve the berth to utilization efficiency, shorten the waiting time of ships at ports, and decrease the operation cost under the condition of limited shoreline resources. Based on the study and analysis of the characteristic about the port service system, related assumptions are proposed and the mathematics model of dynamic allocating the berth and quay cranes is formulated under the objective of the shortest waiting time for container ships in port. Based on the similarities of berth allocation and ant foraging path selection, parallel ant colony algorithm based on pheromone is proposed. Experimental results show that algorithm can be applied effectively to optimize berth allocation problem (BAP).
机译:在集装箱码头,在海岸线资源有限的情况下,提高泊位利用率,缩短船舶在港口的等候时间,降低运营成本至关重要。在对港口服务系统特性进行研究和分析的基础上,提出了相关假设,并以港口集装箱船等待时间最短为目标,建立了动态​​分配泊位和码头起重机的数学模型。基于泊位分配与蚁群觅食路径选择的相似性,提出了基于信息素的并行蚁群算法。实验结果表明,该算法可以有效地应用于优化泊位分配问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号