期刊文献+

基于智能算法的船舶分段堆场调度计划与优化 被引量:2

Block stockyard scheduling and optimizing based on an intelligent algorithm
下载PDF
导出
摘要 分段的移动是船舶分段堆场调度中最主要的作业过程,而移动路径的优劣决定着分段堆场调度的效率和成本。论文通过综合考虑临时阻挡分段数量、平板车转向次数和移动距离对调度成本的影响,提出分段综合移动难度的评价标准,以此建立数学模型,并以分段综合移动难度为优化目标,利用遗传算法选择分段在堆场中停放位置的较优方案,运用禁忌搜索优化柔性出场时间分段的出场顺序,构建启发式规则来确定分段最优的进、出场路径。最后,利用某船厂的实际数据对模型进行实例验证和数值分析,结果表明,本文方法可以得到较优的堆场作业计划,实现堆场资源的高效利用。 Block stockyard is a major operation procedure in dispatching a ship block in a storage yard. The pros and cons of moving path determined the efficiency and the cost of the stockyard scheduling operation. This paper presented a synthetical evaluation criterion that considering obstructive blocks, fiat transporter turning times and moving distance which influenced the scheduling cost. A mathematical model was established based on this criterion with the aim of minimizing the synthetical degree of moving the block. A genetic algorithm was formulated to select the optimal storage positions for the inbound blocks. Tabu search was used to optimize the entrance order of the blocks with flexible entering times. A heuristic rule was constructed to confirm the optimum entering and leaving routes of the blocks. Finally, real data from a shipyard were used to test the numerical analysis used in the models. The results showed that the proposed algorithm was effective to solve the scheduling problem in shipbuilding yards.
出处 《哈尔滨工程大学学报》 EI CAS CSCD 北大核心 2016年第1期41-47,共7页 Journal of Harbin Engineering University
基金 国家自然科学基金资助项目(70872076) 上海市科技创新行动计划基金资助项目(11dz1121803)
关键词 分段堆场 遗传算法 禁忌搜索 启发式规则 block stockyard genetic algorithm tabu search heuristic rule
  • 相关文献

参考文献13

  • 1PARK C, SEO J. Mathematical modeling and solving procedure of the planar storage location assignment problem[J]. Computers & Industrial Engineering, 2009, 57(3):1062-1071.
  • 2PARK 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.
  • 3TAO Ningrong, JIANG Zuhua, QU Shipeng. 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.
  • 4张志英,申钢,刘祥瑞,胡小才.基于最短路算法的船舶分段堆场调度[J].计算机集成制造系统,2012,18(9):1982-1990. 被引量:12
  • 5张志英,徐建祥,计峰.基于遗传算法的船舶分段堆场调度研究[J].上海交通大学学报,2013,47(7):1036-1042. 被引量:18
  • 6ROH M I, CHA J H. A block transportation scheduling system considering a minimisation of travel distance without loading of and interference between multiple transporters[J]. International Journal of Production Research, 2011, 49(11):3231-3250.
  • 7REEVES C R. A genetic algorithm for flowshop sequencing[J]. Computers & Operations Research, 1995, 22(1):5-13.
  • 8符卓.带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究[J].系统工程理论与实践,2004,24(3):123-128. 被引量:62
  • 9JIA Shuai, HU Zhihua. Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem[J]. Computers & Operations Research, 2014, 47:11-26.
  • 10FAN Yuezhen, LU Dunmin, WANG Qingchun, et al. Notice of retraction an improved Dijkstra algorithm used on vehicle optimization route planning[C]//Proceedings of the 2nd International Conference on Computer Engineering and Technology. Chengdu:IEEE, 2010,3:V3-693-696.

二级参考文献57

共引文献109

同被引文献8

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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