首页> 中文期刊> 《浙江交通职业技术学院学报》 >基于萤火虫算法的集装箱码头集卡路径多目标优化研究

基于萤火虫算法的集装箱码头集卡路径多目标优化研究

         

摘要

在两艘船同时作业情况下,建立以集卡总行驶距离最短及完成两船所有装卸任务的时段内各箱区间作业量不平衡性最小的多目标优化模型。在模型求解时,采用新颖的萤火虫算法求解,编码方式采用离散整数编码,每个整数编码表示对应的集卡作业回路运行次数。最后通过舟山甬舟集装箱码头案例分析,较好的解决了集卡路径优化问题,为码头运营者提供了一定的决策支持,也验证了模型与算法的有效性与实用性。%In order to improve the efficiency of container stevedoring ,in two boats at the same time operating condi-tions ,the establishment of a set of cards in each box within the shortest total distance traveled and the completion of the task of handling two ships of all time intervals the least amount of work unbalanced multi -objective optimization model. When solving the model ,using a novel fireflies algorithm ,encoding discrete integer encoding ,each integer corresponding to the coded representation of the working circuit card assembly operation times . Finally ,Ningbo Zhoushan Container Terminal by case analysis ,the results show that the method to solve a set of cards better path optimization problems for terminal operators to provide a certain amount of decision support ,meanwhile demonstrate the effectiveness and practical-ity of the model and algorithms.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号