工业工程 ›› 2020, Vol. 23 ›› Issue (2): 76-82.doi: 10.3969/j.issn.1007-7375.2020.02.010

• 专题论述 • 上一篇    下一篇

基于优先规则的船舶分段空间调度算法

朱辉, 杨立乾, 赵金楼   

  1. 哈尔滨工程大学 经济管理学院,黑龙江 哈尔滨 150001
  • 收稿日期:2019-06-12 发布日期:2020-04-22
  • 通讯作者: 杨立乾(1987-),男,河北省人,博士研究生,主要研究方向为船舶工程管理.E-mail:yangliqian@hrbeu.cn E-mail:yangliqian@hrbeu.cn
  • 作者简介:朱辉(1980-),女,北京市人,博士研究生,主要研究方向为船舶工程管理
  • 基金资助:
    中央高校基本科研业务费专项资金资助项目(HEU CFW170902)

Priority Rule-based Spatial Scheduling Algorithm for Blocks in Shipbuilding

ZHU Hui, YANG Liqian, ZHAO Jinlou   

  1. School of Economics and Management, Harbin Engineering University, Harbin 150001, China
  • Received:2019-06-12 Published:2020-04-22

摘要: 为有效解决船舶分段的空间调度问题,提出了一种基于优先规则的求解算法。首先利用优先规则和禁忌搜索算法产生可行的分段调度序列,再采用一种启发式定位策略——最下最左填满策略对产生的调度序列进行解码,以评估调度序列的优劣。算法不断迭代,最终可得到近似最优解。对船厂的实际生产数据进行了实证分析,并与现有的算法进行了对比,验证了所提出的算法在空间调度问题上的有效性和优越性。

关键词: 空间调度, 禁忌搜索算法, 优先规则, 船舶分段

Abstract: To efficiently solve the spatial scheduling problem (SSP) for blocks in shipbuilding, a priority rule-based solution algorithm is proposed. Firstly, feasible scheduling sequences of blocks are generated by combining priority rules and the Taboo search algorithm. And then, these feasible scheduling sequences are decoded and evaluated using a heuristic location strategy, which is called the bottom-left-fill (BLF) strategy. The approximate optimal solution can be obtained in the process of algorithm iteration. Based on the actual data of a shipyard, an empirical analysis is carried out. The effectiveness and superiority of the proposed algorithm are verified by comparing with existing algorithms.

Key words: spatial scheduling, taboo search algorithm, priority rule, ship block

中图分类号: