期刊文献+

基于微粒群优化算法的人造板生产批量时域滚动计划

Rolling horizon lot-sizing planning of wood-based panel based on an improved particle swarm optimization
下载PDF
导出
摘要 【目的】生产批量计划是企业制定主令生产计划和物料需求计划的依据,生产批量计划的优化也是企业节约成本和原料的关键所在。目前人造板企业都采用批量生产模式,并且依据事先设定的生产计划确定各个阶段的生产任务,但随着市场竞争的日益激励和个性化需求的提高,每个阶段的实际生产任务通常需要根据市场需求及时调整。为此,针对人造板生产批量计划问题,提出基于微粒群优化算法(PSO)的时域滚动计划。【方法】首先,根据人造板批量生产特点,制定决策变量和约束条件,建立生产批量计划的混合整数决策模型。然后依据决策模型的约束条件,采用降维搜索的方式,提出改进的微粒群求解算法。最后,采用时域滚动计划进行模拟仿真。【结果】仿真结果表明:对于年产10万m3的刨花板生产线而言,以3个月作为一个滚动计划单元,在12个月的生产批量计划中,采用改进PSO算法获得的生产批量计划可以节约1.8%的成本,有生产能力约束时可以节约近0.9%的成本。【结论】对于人造板批量生产模式,时域滚动计划能够使得生产计划动态满足市场需求,同时时域滚动计划模型是一类非确定性(NP)困难问题,智能群集优化算法为此类问题的求解提供了较好的解决途径。未来的研究可以关注生产批量计划问题数学模型的完善以及智能优化算法设计方面。 [Objective]In general,lot-sizing planning(LSP) is the basis of master production schedule and material requirements planning.Obviously,optimization of LSP is the key to save cost and materials.At present,bulk-production mode is widely adopted in wood-based panel industries.For arranging the productive task,the detail planning needs to be made in advance.However,the scheduled planning usually needs to be re-planned to cope with the change of market requirement dynamically.For this reason,an improved particle swarm optimization(PSO) and a kind of rolling horizon planning(RHP)method are proposed to solve the LSP problem of wood-based panels in this paper.[Method]Firstly,according to the characters of production process,a series of decision variables and constrains were determined,and then,a mathematical mixed integer decision method was built for LSP problem.Secondly,an improved PSO algorithm was designed by reducing the dimension of the solution space.At last,with RHP method,the improved PSO algorithm was used to solve a series of sub-LSP problems repeatedly.A simulation example was designed to verify the performance of the LSP model and improve PSO algorithm.[Result]According to the simulation results,to a wood-based panel production line with an annual output of 100 000 m^3,when the planning horizon and total planning period were set to 3 months and 12 months respectively,1.8% production cost could be saved through RHP method and the improved PSO approach.In addition,to the same model with production capacity constrains,the production cost could be reduced by 0.9%.[Conclusion]RHP is an efficient way to make lot-sizing planning of woodbased panel.The important advantage of RHP is that the production schedule could be adjusted with the changing market requirement dynamically.Due to the NP-hard of RHP,the intelligent swarm optimizations could solve these problems with an acceptable period of time.In addition,future research will focus on the model of LSP with actual constrains and the algorithms of intelligent swarm optimization.
作者 方赛银 李明 邱荣祖 Fang Sai-yin;Li Ming;Qiu Rong-zu(Fujian Agriculture and Forestry University, Fuzhou 350002, Fujian, China;Southwest Forestry University, Kunming 650224, Yunnan, China)
出处 《北京林业大学学报》 CAS CSCD 北大核心 2018年第2期106-113,共8页 Journal of Beijing Forestry University
基金 国家自然科学基金项目(31760182 31100424)
关键词 生产批量计划 微粒群算法 时域滚动计划 人造板 lot-sizing planning particle swarm optimization rolling horizon planning wood-based panel
  • 相关文献

参考文献2

二级参考文献32

  • 1王欣,阳春华,秦斌.棒线材轧制批量调度多目标混合优化[J].控制与决策,2006,21(9):996-1000. 被引量:8
  • 2李铁克,郭冬芬.基于约束满足的热轧批量计划模型与算法[J].控制与决策,2007,22(4):389-393. 被引量:18
  • 3Zhu X, Wilhelm W. Scheduling and lot sizing with sequence-dependent setup: A literature review[J]. IIE Trans, 2006, 38(11): 987-1007.
  • 4Jans R, Degraeve Z. Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches[J]. European J of Operational Research, 2007, 177(3): 1855- 1875.
  • 5Xie J, Dong J. Heuristic genetic algorithms for general capacitated Lot-sizing problems[J]. Computers & Mathematics with Applications, 2002, 44(1): 263-276.
  • 6Xiao Y, Kaku I, Zhao Q, et al. A variable neighborhood search based approach for uncapacitated multilevel lot- sizing problems[J]. Computers& Industrial Engineering, 2011, 60(2): 218-227.
  • 7Han Y, Tang J, Kaku I, et al. Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight[J]. Computers & Mathematics with Applications, 2009, 57(11/12): 1748- 1755.
  • 8Dye C Y, Ouyang L Y. A particle swarm optimization for solving joint pricing and lot-sizing problem with fluctuating demand and trade credit financing[J]. Computers &IndustriaI Engineering, 2011, 60(1): 127- 137.
  • 9Arumugam M S, Rao M V C. On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square(RMS) variants for computing optimal control of a class of hybrid systems[J]. Applied Soft Computing, 2008, 8(1): 324-336.
  • 10Coelho L S. A quantum particle swarm optimizer with chaotic mutation operator[J]. Chaos, Solitons & Fractals, 2008, 37(5): 1409-1418.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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