全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

柔性宽度浇次计划编制的一种混合改进算法

DOI: 10.13195/j.kzyjc.2013.1714, PP. 348-352

Keywords: 浇次计划,柔性制造,广义车辆路径问题,局部-全局方法

Full-Text   Cite this paper   Add to My Lib

Abstract:

根据连铸工艺特点,炉次的宽度是柔性值,充分利用炉次宽度的柔性可以有效提高中间包的利用率,但同时会增加浇次计划的编制难度.根据柔性宽度浇次计划问题特征,建立其广义车辆路径问题模型,并构建一种混合改进算法进行求解.该算法基于局部-全局方法,将柔性宽度浇次计划问题分解为确定炉次顺序和选取炉次宽度两个子问题,并利用改进的交叉熵法和可达算法分别进行求解.最后通过实例表明了所提出模型和算法的有效性.

References

[1]  Xue Y C, Zheng D L, Yang Q W. Optimum steel making cast plan with unknown cast number based on the modified discrete particle swarm optimization[J]. Control Theory & Applications, 2010, 27(2): 273-277.
[2]  Tang L X, Luo J X. A new ILS algorithm for cast planning problem in steel industry[J]. ISIJ Int, 2007, 47(3): 443-452.?
[3]  Balakrishnan A, Geunes J. Production planning with flexible product specifications: an application to specialty steel manufacturing[J]. Operations Research, 2003, 51(1): 94-112.
[4]  Dong H Y, Huang M, Ip W H, et al. Improved variable neighbourhood search for integrated tundish planning in primary steelmaking processes[J]. Int J of Production Research, 2012, 50(20): 5747-5761.
[5]  汪恭书. 基于列生成的铁钢区批量计划与物流调度[D]. 沈阳: 东北大学信息科学与工程学院, 2007.
[6]  (Wang G S. Column generation methods for batching decision and logistics scheduling problems in iron-making and steel-making area[D]. Shenyang: College of Information Science and Engineering, Northeastern University, 2007.)
[7]  Ghiani G, Improta G. An efficient transformation of the generalized vehicle routing problem[J]. European J of Operational Research, 2000, 122(1): 11-17.
[8]  Baldacci R, Bartolini E, Laporte G. Some applications of the generalized vehicle routing problem[J]. J of the Operational Research Society, 2010, 61(7): 1072-1077.
[9]  Pop P C, Matei O, Sitar C P. An improved hybrid algorithm for solving the generalized vehicle routing problem[J]. Neurocomputing, 2013, 109(3): 76-83.
[10]  Boer P T, Kroese D P, Mannor S, et al. A tutorial on the cross-entropy method[J]. Annals of Operation Research, 2005, 134(1): 19-67.
[11]  Rubinstein R. The cross-entropy method for combinatorial and continuous optimization[J]. Methodology and Computing in Applied Probability, 1999, 1(2): 127-190.
[12]  娄山佐, 史忠科. 基于交叉熵法解决随机用户和车辆路径问题[J]. 控制与决策, 2007, 22(1): 7-10.
[13]  (Lou S Z, Shi Z K. Vehicle routing problem with sto-chastic customers and demands based on the cross-entropy method[J]. Control and Decision, 2007, 22(1): 7-10.)
[14]  Moccia L, Cordeau J F, Laporte G. An incremental tabu search heuristic for the generalized vehicle routing problem with time windows[J]. J of the Operational Research Society, 2012, 63(2): 232-244.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133