Hybrid grouping genetic algorithm for one-dimensional cutting stock problem

Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University

Volumn 40, Issue 6, 2006, Pages

  Li, Pei Yong ^a   Wang, Cheng Fang ^a   Mao, Yun Sheng ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Cutting optimization; Genetic algorithm (GA); One dimension cutting stock

Indexed keywords

ADAPTIVE SYSTEMS; FEEDSTOCKS; GENETIC ALGORITHMS; ONE DIMENSIONAL; OPTIMIZATION;

BEST FIT (BF); BEST REPLACE DECREASING (BRD); CUTTING OPTIMIZATION; FIRST FIT DECREASING (FFD); GROUPING PROBLEM; ONE-DIMENSION CUTTING STOCK;

CUTTING;

EID: 33747390061     PISSN: 10062467     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. Carvalho V. LP models for bin packing and cutting stock problem[J]. European Journal of Operational Research, 2002, 141(2): 253-273.
2. Gradisar 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. LI Pei-yong, WANG Quan-hua, QIU Yong-ming. Optimization for one dimensional cutting using hybrid genetic algorithm[J]. Journal of Shanghai Jiaotong University, 2001, 35(10): 1557-1560.
4. JIA Zhi-xin, YIN Guo-fu, HU Xiao-bing, et al. Optimization for one dimensional cutting-stock problem based on genetic[J]. Journal of Xi'an Jiaotong University, 2002, 36(9): 967-970.
5. Falkenauer E. A hybrid grouping genetic algorithm for bin packing[J]. Journal of Heuristics, 1996, 2(2): 5-30.