为了解决船舶分段多堆场调度过程中工作效率低、运输成本高的问题，针对多堆场调度任务执行顺序、进场及阻挡分段移动等环节，综合考虑堆场的工艺属性、分段形状组合等要素，建立以最小化运输成本为目标的分段多堆场调度模型.通过对比分析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.
［1］PARK C, SEO J, KIM J, et al. Assembly block storage location assignment at a shipyard: A case of Hyundai Heavy Industries［J］. Production Planning and Control, 2007, 18(3): 180-189.
［2］PARK C, SEO J. Mathematical modeling and solving procedure of the planar storage location assignment problem［J］. Computers and Industrial Engineering, 2009, 57(3): 1062-1071.
［3］PARK C, SEO J. Comparing heuristic algorithms of the planar storage location assignment problem［J］. Transportation Research Part E: Logistics and Transportation Review, 2010, 46(1): 171-185.
［4］TAO N R, JIANG Z H, QU S P. Assembly block location and sequencing for flat transporters in a planar storage yard of shipyards［J］. International Journal of Production Research, 2013, 51(14): 4289-4301.
［5］张志英, 徐建祥, 计峰. 基于遗传算法的船舶分段堆场调度研究［J］. 上海交通大学学报, 2013, 47(7): 1036-1042.
ZHANG Zhiying, XU Jianxiang, JI Feng. Shipbuilding yard scheduling approach based on genetic algorithm［J］. Journal of Shanghai Jiao Tong University, 2013, 47(7): 1036-1042.
［6］曾建智, 张志英, 邢艳, 等. 基于双层遗传算法的单时间窗分段堆场调度计划与优化［J］. 计算机集成制造系统, 2016, 22(9): 2165-2174.
ZENG Jianzhi, ZHANG Zhiying, XING Yan, et al. Block stockyard scheduling and optimization with single time window based on dual-layer genetic algorithm［J］. Computer Integrated Manufacturing Systems, 2016, 22(9): 2165-2174.
［7］陈凯, 蒋祖华, 刘建峰, 等.带有进场时间窗的船舶分段堆场调度［J］. 上海交通大学学报, 2016, 50(9): 1390-1398.
CHEN Kai, JIANG Zuhua, LIU Jianfeng, et al. Shipbuilding yard scheduling with block inbound time window［J］. Journal of Shanghai Jiao Tong University, 2016, 50(9): 1390-1398.
［8］陶宁蓉, 蒋祖华, 刘建峰, 等. 考虑工艺流程的船体分段多堆场调度问题研究［J］. 河北工业科技, 2017, 34(1): 12-17.
TAO Ningrong, JIANG Zuhua, LIU Jianfeng, et al. Multi-stockyard scheduling problem considering technological process of hull blocks［J］. Hebei Journal of Industrial Science & Technology, 2017, 34(1): 12-17.
［9］孟令通, 蒋祖华, 陶宁蓉, 等. 船舶组合分段堆场调度方法［J］. 上海交通大学学报, 2019, 53(7): 780-788.
MENG Lingtong, JIANG Zuhua, TAO Ningrong, et al. Combined assembly block scheduling in storage yard of shipbuilding［J］. Journal of Shanghai Jiao Tong University, 2019, 53(7): 780-788.
［10］ZHENG J L, JIANG Z B, CHEN Q. Block spatial scheduling modelling and application in shipbuilding［J］. International Journal of Production Research, 2012, 50(10): 2744-2756.
［11］KWON B, LEE G M. Spatial scheduling for large assembly blocks in shipbuilding［J］. Computers & Industrial Engineering, 2015, 89: 203-212.
［12］DAI L, HU H, CHEN F. A GA-based heuristic approach for offshore structure construction spatial scheduling under uncertainty［J］. Ships and Offshore Structures, 2015, 10(6): 660-668.
［13］赵明华. 面向船体曲面分段建造的空间调度及调整算法研究［D］. 上海: 上海交通大学, 2010.
ZHAO Minghua. Study on spatial scheduling and adjustment algorithm oriented to curved block in shipbuilding［D］. Shanghai: Shanghai Jiao Tong University, 2010.
