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 条
  • [1] A practical evolutionary algorithm of one dimensional stock cutting problem
    Zhang, JB
    Li, YX
    Yang, YW
    Li, J
    PROCEEDINGS OF THE 3RD WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-5, 2000, : 3729 - 3732
  • [2] An evolutionary algorithm for the one-dimensional cutting stock problem
    Araujo, Silvio A.
    Constantino, Ademir A.
    Poldi, Kelly C.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2011, 18 (01) : 115 - 127
  • [3] A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
    Belov, G
    Scheithauer, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 274 - 294
  • [4] An evolutionary algorithm for the rectangular cutting stock problem
    Lai, KK
    Chan, WM
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-APPLICATIONS AND PRACTICE, 1997, 4 (02): : 130 - 139
  • [5] Evolutionary algorithm for the rectangular cutting stock problem
    City Univ of Hong Kong, Hong Kong, Hong Kong
    Int J Ind Eng, 2 (130-139):
  • [6] A NEW HEURISTIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM
    Berberler, M. E.
    Nuriyev, U. G.
    APPLIED AND COMPUTATIONAL MATHEMATICS, 2010, 9 (01) : 19 - 30
  • [7] A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem
    Barragan-Vite, Irving
    Medina-Marin, Joselito
    Hernandez-Romero, Norberto
    Anaya-Fuentes, Gustavo Erick
    APPLIED SCIENCES-BASEL, 2024, 14 (18):
  • [8] New optimization algorithm for one-dimensional cutting-stock problem
    Wang, Xiao-Dong
    Li, Gang
    Ou, Zong-Ying
    Dalian Ligong Daxue Xuebao/Journal of Dalian University of Technology, 2004, 44 (03): : 407 - 411
  • [9] An Efficient Algorithm Design for the One-Dimensional Cutting-Stock Problem
    Wang, Guicong
    Li, Chuanpeng
    Lv, Jie
    Zhao, Xiuxia
    Cui, Huanyong
    PROGRESS IN MATERIALS AND PROCESSES, PTS 1-3, 2013, 602-604 : 1753 - 1756
  • [10] Hybrid grouping genetic algorithm for one-dimensional cutting stock problem
    School of Transportation, Wuhan Univ. of Technology, Wuhan 430063, China
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2006, 40 (06): : 1015 - 1018
12345