上海交通大学学报

上海交通大学学报 ›› 2020, Vol. 54 ›› Issue (7): 718-727.doi: 10.16183/j.cnki.jsjtu.2018.339

• 学报（中文） • 上一篇    下一篇

考虑平板车合作运输的船舶分段堆场间调度

李柏鹤1,2,蒋祖华1,2，陶宁蓉3，孟令通1,2,郑虹1   

  1. 1. 上海交通大学 机械与动力工程学院， 上海 200240； 2. 上海交通大学 高新船舶与 深海开发装备协同创新中心， 上海 200240； 3. 上海海洋大学 工程学院， 上海 201306
  • 出版日期:2020-07-28 发布日期:2020-07-31
  • 通讯作者: 蒋祖华，男，教授，博士生导师，电话(Tel.):021-34206819；E-mail：zhjiang@sjtu.edu.cn.
  • 作者简介:李柏鹤(1993-)，男，黑龙江省齐齐哈尔市人，硕士生，研究方向为船舶分段堆场间调度.
  • 基金资助:
    国家自然科学基金(71501125)，工信部高技术船舶项目联装函［2018］35号(18GC04246)资助项目

Ship Block Transportation Scheduling Considering Cooperative Transportation of Flatcars

LI Baihe 1,2,JIANG Zuhua 1,2,TAO Ningrong 3,MENG Lingtong 1,2,ZHENG Hong 1   

  1. 1. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China; 2. Collaborative Innovation Center for Advanced Ship and Deep-Sea Exploration, Shanghai Jiao Tong University, Shanghai 200240, China; 3. College of Engineering Science and Technology, Shanghai Ocean University, Shanghai 201306, China
  • Online:2020-07-28 Published:2020-07-31

PDF (PC)

315

摘要： 针对船厂运输任务分段的平板车缺乏有效调度的现状，以多种类型平板车和任务分段的承重约束、任务时间窗约束作为约束条件，并考虑实际运输时单个大型分段质量超出现有单个平板车最大承重能力的情况，采用多个平板车合作运输的策略解决该问题.建立以平板车完成任务的空载行驶时间以及平板车的等待时间权重和作为优化目标的模型，设计禁忌搜索算法对模型进行求解.最后以某船厂实际数据为例，对模型的应用进行实例验证.研究结果表明，所提方法可以求解较优的调度方案，并解决大型分段的运输，以实现资源的高效利用.

关键词: 堆场间调度, 多类型平板车, 多车合作运输, 时间窗约束, 禁忌搜索算法

Abstract: This paper aims at solving the problem of ineffective dispatching status for flatcars in shipyard transportation tasks using the task time window and the loading constraints of various types of flatcars and blocks as constraints. Considering the fact that the weight of a single large block exceeds the maximum loading capacity of a flatcar during actual transportation, this paper proposes a method of cooperative transportation using multiple flatcars. Aimed at establishing an optimization model, the optimal objects set the no-load travel time and waiting time for the task as the weight of the flatcars. Then, a tabu search algorithm is designed to solve the model proposed. Taking the actual data of a shipyard as an example, the application of the model is verified by specific examples. The results show that the method proposed provides a better scheduling scheme which can solve the transportation problem of large blocks and better realize the efficient utilization of resources.

Key words: dispatch between storage yards, multi-type flatcars, multi-flatcar cooperative transportation, time window, tabu search algorithm

中图分类号: