期刊文献+

基于基因群体的一维优化下料 被引量:6

A Hybrid Grouping Genetic Algorithm for One-Dimensional Cutting Stock Problem
在线阅读 下载PDF
导出
摘要 针对一维优化下料问题,将基于群体的编码方法与遗传算法相结合,设计了一种适用于一维优化下料问题的编码方法,修改了经典遗传算子的操作方法,提出了降序最佳置换方法(BRD).引入最佳配合(BF)、优先配合降序(FFD)局部搜索算法,建立了求解一维优化下料问题的复合遗传算法.应用结果显示,本文方法的效果是令人满意的. This paper discussed the solution for a general one-dimensional cutting stock problem in which a set number of linear elements like rod are cutting from stock lengths of different sizes so that wastage is minimized. The nature of this problem is such that the traditional approaches of exact methods or approximation are not effective. This paper presents the application of a modified grouping genetic algorithm (GGA) to this grouping problem. The GGA method is enhanced with local optimization techniques such as the best replace decreasing (BRD),the best fit (BF) and the first fit decreasing (FFD). The results of studies show the effectiveness and efficiency of this approach for the problems.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2006年第6期1015-1018,1023,共5页 Journal of Shanghai Jiaotong University
关键词 一维下料 优化下料 遗传算法 one-dimension cutting stock cutting optimization genetic algorithm (GA)
  • 相关文献

参考文献5

  • 1Carvalho V.LP models for bin packing and cutting stock problem[J].European Journal of Operational Research,2002,141(2):253-273.
  • 2Gradisar M,Resinovic G,Jesenko J,et al.A sequential heuristic procedure for one-dimensional cutting[J].European Journal of Operational Research,1999,114(3):557-568.
  • 3李培勇,王全华,裘泳铭.型材优化下料的混合遗传算法[J].上海交通大学学报,2001,35(10):1557-1560. 被引量:9
  • 4贾志欣,殷国富,胡晓兵,舒斌.一维下料方案的遗传算法优化[J].西安交通大学学报,2002,36(9):967-970. 被引量:35
  • 5Falkenauer E.A hybrid grouping genetic algorithm for bin packing[J].Journal of Heuristics,1996,2(2):5-30.

二级参考文献7

共引文献41

同被引文献61

引证文献6

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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