Article ID: | iaor20023626 |
Country: | China |
Volume: | 47 |
Issue: | 3 |
Start Page Number: | 289 |
End Page Number: | 293 |
Publication Date: | Jun 2001 |
Journal: | Journal of Wuhan University (Natural Science Edition) |
Authors: | Li Yuanxiang, Zhang Jinbo, Xu Jingwen, Wang Lin |
One dimensional stock cutting is a typical combinatorial optimization problem, on which there have been many recent papers. In this paper, an algorithm for the problem coupling linear programming and an evolutionary algorithm is proposed, which is based on variable length coding and a novel genetic operator. Experiments show that our algorithm is easy of implementation and fast to produce satisfactory results. The usage rate of material is up to 97.5% on average and it is convenient to put into practice.