An evolutionary algorithm of one dimensional stock cutting problem based on variable length coding

被引：0
|
作者：
Li, Y.-X. [1 ]
Zhang, J.-B. [1 ]
Xu, J.-W. [1 ]
Wang, L. [1 ]
机构：
[1] State Key Lab. of Software Eng., Wuhan University, Wuhan 430072, Hubei, China
来源：
Wuhan Daxue Xuebao/Journal of Wuhan University | 2001年 / 47卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
One dimensional stock cutting problem is a typical combinatorial optimization problem, on which many recent research work are concerning. In this paper, an algorithm for the problem coupling the linear programming and the evolutionary algorithm is proposed, which is based on variable length coding and a designed 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.
引用
收藏
页码：289 / 293
相关论文
共 50 条
  • [31] Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
    Poldi, Kelly Cristina
    Arenales, Marcos Nereu
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 2074 - 2081
  • [32] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 86 - 91
  • [33] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    Terno, J
    Müller, A
    Belov, G
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (12) : 1390 - 1401
  • [34] A heuristic for the one-dimensional cutting stock problem with usable leftover
    Cui, Yaodong
    Yang, Yuli
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 245 - 250
  • [35] A simulated annealing heuristic for the one-dimensional cutting stock problem
    Chen, CLS
    Hart, SM
    Tham, WM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 522 - 535
  • [36] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Gonçalo R. L. Cerqueira
    Sérgio S. Aguiar
    Marlos Marques
    Journal of Combinatorial Optimization, 2021, 42 : 657 - 674
  • [37] A heuristic for the one-dimensional cutting stock problem with pattern reduction
    Cui, Y.
    Zhao, X.
    Yang, Y.
    Yu, P.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2008, 222 (06) : 677 - 685
  • [38] THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM USING 2 OBJECTIVES
    SINUANYSTERN, Z
    WEINER, I
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (02) : 231 - 236
  • [39] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Cerqueira, Goncalo R. L.
    Aguiar, Sergio S.
    Marques, Marlos
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 657 - 674
  • [40] On the one-dimensional stock cutting problem in the paper tube industry
    Kazuki Matsumoto
    Shunji Umetani
    Hiroshi Nagamochi
    Journal of Scheduling, 2011, 14 : 281 - 290
12345