期刊文献+

分段堆场预测调度研究 被引量:3

Shipbuilding yards predictable scheduling approach
下载PDF
导出
摘要 针对船舶分段移动计划主要依靠人为预测及人工调度的现状,提出BP神经网络来预测一个周期内进出场分段的数量,并研究建立以分段移动度最小为目标的优化模型,模型综合考虑了分段在堆场中的停放位置及进、出场路径。通过分支定界法选择分段在堆场中停放位置的最优方案,并构建启发式规则来确定分段在堆场中的最优进、出场路径,从而实现对模型的求解。以某船厂实际数据为例,对模型在堆场调度问题中的应用进行了实例验证,结果表明,所研究方法可求解得出较优的堆场作业计划,并实现堆场资源的高效利用。 The shipbuilding yards scheduling is overly dependent on artificial prediction and scheduling and lack of effective scheduling approach in practical production. The BP neural network is proposed to predict the number of sections which are shipped in and out in one period. Then a mathematical model is defined as the assignment and paths of the inbound and out- bound objects to the shipping yard with aim of minimizing the degree of movement of blocks. Then a branch and bound algo- rithm is formulated to select the optimal parking positions of blocks. And a heuristic algorithm is also proposed to confirm the optimal moving paths of blocks in the yards. Application data are obtained from a shipyard to validate the model, and the result shows that the proposed algorithm is effective to solve the shipbuilding yards scheduling problem.
出处 《计算机工程与应用》 CSCD 2013年第23期221-227,共7页 Computer Engineering and Applications
基金 国家自然科学基金(No.70872076) 上海市博士后基金项目(No.11R21416500)
关键词 启发式规则 分段堆场 预测调度 分支定界法 heuristic regular shipbuilding yard predictable scheduling branch and bound algorithm
  • 相关文献

参考文献4

二级参考文献43

共引文献53

同被引文献18

  • 1PARK 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.
  • 2PARK C, SEO J. Mathematical modeling and solving procedure of the planar storage location assignment problem[ J ]. Computers & Industrial Engineering, 2009, 57(3) :1062-1071.
  • 3PARK 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.
  • 4TAO 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.
  • 5JIN 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.
  • 6LIND 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.
  • 7GHAREHGOZLI 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.
  • 8PARK 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.
  • 9JOO 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.
  • 10张志英,杨克开,于瑾维.面向船体分段建造的二维不规则空间调度方法[J].上海交通大学学报,2012,46(4):651-656. 被引量:6

引证文献3

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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