期刊文献+

考虑工艺顺序和组合分段的多堆场调度方法

Multi-Stockyard Scheduling Considering Technological Process and Combined Assembly Block
下载PDF
导出
摘要 为了解决船舶分段多堆场调度过程中工作效率低、运输成本高的问题,针对多堆场调度任务执行顺序、进场及阻挡分段移动等环节,综合考虑堆场的工艺属性、分段形状组合等要素,建立以最小化运输成本为目标的分段多堆场调度模型.通过对比分析2种进场分段堆位分配策略,提出阻挡分段跨堆场调度的移动策略;改进传统的任务顺序调整策略,并用禁忌搜索算法进行优化;最后,分析堆场占用率及各个调度策略组合对实验结果的影响.实验结果表明,堆位分配策略和阻挡分段的跨堆场调度策略能有效降低多堆场调度的运输成本,减少阻挡分段产生的比例,进而达到提高运输效率的目的. In order to improve the current status of low work efficiency and high transportation costs in multi-stockyard scheduling,a multi-stockyard scheduling model was established.It aimed at the execution sequence and the procedure of incoming blocks and relocating blocks.The pursued objective was to minimize the total cost which considered the process attribute of multi-stockyard and combination of blocks.This paper compared and analyzed two approaches of incoming blocks allocation,and proposed a moving strategy between multi-stockyard of obstructive blocks.Moreover,it also improved the traditional scheduling sequence by Tabu search.Finally,the effects of stockyard occupancy rate and the comparison of various scheduling strategies on the experimental results were analyzed.The results show that the block allocation and moving strategies can effectively reduce the total cost in multi-stockyard scheduling as well as the proportion of obstructive blocks.These new strategies can effectively improve the transport efficiency.
作者 孟令通 蒋祖华 陶宁蓉 刘建峰 郑虹 MENG Lingtong;JIANG Zuhua;TAO Ningrong;LIU Jianfeng;ZHENG Hong(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;College of Engineering Science and Technology,Shanghai Ocean University,Shanghai 201306,China;Shanghai Waigaoqiao Shipbuilding Co.,Ltd.,Shanghai 200137,China)
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2020年第4期331-343,共13页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金(71501125) 工业和信息化部高技术船舶项目([2017]614号-9)。
关键词 组合分段 多堆场调度 启发式调度策略 禁忌搜索算法 combined block multi-stockyard scheduling heuristic scheduling strategy Tabu search algorithm
  • 相关文献

参考文献5

二级参考文献23

  • 1魏航,李军,刘凝子.时变条件下有宵禁限制的最短路问题[J].系统工程学报,2007,22(4):359-366. 被引量:3
  • 2PARK C, SEO J, KIM J, et al. Assembly blockstorage location assignment at a shipyard: A case of Hyundai Heavy Industries[J]. Production Planning & Control, 2007, 18(3) : 180-189.
  • 3PARK C, SEO J. Mathematical modeling and solving procedure of the planar storage location assignment problem[ J ]. Computers & Industrial Engineering, 2009, 57(3) :1062-1071.
  • 4PARK C, SEO J. Comparing heuristic algorithms of the planar storage location assignment problem[J]. Transportation Research Part E Logistics and Trans- portation Review, 2010, 46 ( 1 ) : 171 - 185.
  • 5TAO N R, JIANG Z H, QU S P. Assembly block loca- tion and sequencing {or flat transporters in a planar stor- age yard o{ shipyards[J]. International Journal of Pro- duction Research, 2013, 51(14): 4289-4301.
  • 6JIN B, ZHU W, LIMA. Solving the container relo- cation problem by an improved greedy look-ahead heuristic [J]. European Journal of Operational Re- search, 2015, 240(3): 837-847.
  • 7LIND Y, LEE Y J, LEE Y. The container retrieval problem with respect to relocation[J]. Transportation Research Part C Emerging Technologies, 2015, 52: 132-143.
  • 8GHAREHGOZLI A H, YU Y, KOSTER R D, et al. A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal [J]. International Journal of Production Research, 2014, 52(9) :2592-2611.
  • 9PARK C, SEO J. A GRASP approach to transporter scheduling for ship assembly block operations man- agement[J]. European Journal of Industrial Engineer- ing, 2013, 7(3):312-332.
  • 10JOO C M, KIM B S. Block transportation scheduling under delivery restriction in shipyard using meta-heu- ristic algorithms [J]. Expert Systems with Applica- tions, 2014, 41(6):2851-2858.

共引文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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