A genetic algorithm solution for one-dimensional bundled stock cutting

被引：25
|
作者：
Wagner, BJ [1 ]
机构：
[1] Univ Delaware, Coll Business & Econ, Dept Business Adm, Newark, DE 19716 USA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 117卷 / 02期
关键词：
cutting; genetic algorithms; linear programming; integer programming; heuristics;
D O I：
10.1016/S0377-2217(98)00244-6
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper discusses a one-dimensional cutting stock problem in which lumber is cut in bundles. The nature of this problem is such that the traditional approaches of linear programming with an integer round-up procedure or sequential heuristics are not effective. A good solution to this problem must consider trim loss, stock usage and ending inventory levels. A genetic search algorithm is proposed and results compared to optimal solutions for an integer programming formulation of the problem. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：368 / 381
页数：14
相关论文
共 50 条
  • [1] Genetic algorithm solution for one-dimensional bundled stock cutting
    Dept. of Business Administration, College of Business and Economics, University of Delaware, Newark, DE 19716-2710, United States
    Eur J Oper Res, 2 (368-381):
  • [2] 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
  • [3] Annealing genetic algorithm and its application in one-dimensional cutting stock problem
    Wang Jie
    Zhang Binyan
    Li Dawei
    Wang Li
    Proceedings of the 24th Chinese Control Conference, Vols 1 and 2, 2005, : 1341 - 1344
  • [4] ONE-DIMENSIONAL CUTTING STOCK PROBLEMS AND SOLUTION PROCEDURES
    HAESSLER, RW
    MATHEMATICAL AND COMPUTER MODELLING, 1992, 16 (01) : 1 - 8
  • [5] 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
  • [6] Solution of a one-dimensional cutting stock problem using a genetic algorithm in the framework for changing production ordering cycle
    Takeda, Ken
    Kuroda, Mitsuru
    Xin, Haihong
    Journal of Engineering Valuation and Cost Analysis, 2000, 3 (4-5): : 313 - 322
  • [7] 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
  • [8] 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
  • [9] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 86 - 91
  • [10] 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
12345