• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Service Systems and Service Management >Optimization research of joint quay crane scheduling and block selection in container terminals
【24h】

Optimization research of joint quay crane scheduling and block selection in container terminals

机译：集装箱码头联合码头起重机调度与选区优化研究

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper addresses the joint quay crane and yard selection problem at a container terminal. We consider the work capacity of the quay cranes and the storage capacity of yard blocks. For the bidirectional flow problem with both inbound and outbound containers, a mixed-integer linear programming model under determination is formulated to minimize the make-span and the traveling time of truck by using discretization policy. An improved Particle Swarm Optimization (PSO) algorithm is suggested to solve this problem, in which a neighborhood taboo search and a heuristic pre-processing are incorporated to improve the solution quality and runtime. Numerical experiments are performed to validate the effectiveness of the proposed models and the efficiency of the proposed solution algorithm.
机译：本文解决了集装箱码头的联合码头起重机和堆场选择问题。我们考虑码头起重机的工作能力和堆场的存储能力。对于入库和出库的双向流动问题，采用离散化策略，制定了确定中的混合整数线性规划模型，以最小化卡车的制造跨度和行驶时间。提出了一种改进的粒子群算法（PSO）来解决该问题，该算法结合了邻域禁忌搜索和启发式预处理，以提高解决方案的质量和运行时间。进行了数值实验，以验证所提出的模型的有效性和所提出的求解算法的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号