Evaluation of algorithms for one-dimensional cutting

被引：18
|
作者：
Gradisar, M
Resinovic, G
Kljajic, M
机构：
[1] Univ Ljubljana, Fac Econ, Ljubljana 1000, Slovenia
[2] Univ Maribor, Fac Org Sci, Kranj 4000, Slovenia
来源：
COMPUTERS & OPERATIONS RESEARCH | 2002年 / 29卷 / 09期
关键词：
cutting; heuristics; optimisation; evaluation;
D O I：
10.1016/S0305-0548(01)00025-9
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The paper deals with the problem of evaluating and comparing different one-dimensional stock, Cutting algorithms regarding trim loss. Different types of problems are identified. An evaluation method is developed which enables a comparison of Solutions of all types of problems. A practical example of this methods implementation is presented.
引用
收藏
页码：1207 / 1220
页数：14
相关论文
共 50 条
  • [21] The one-dimensional cutting stock problem with due dates
    Reinertsen, Harald
    Vossen, Thomas W. M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (03) : 701 - 711
  • [22] Large gaps in one-dimensional cutting stock problems
    Rietz, J.
    Dempe, S.
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1929 - 1935
  • [23] 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
  • [24] A heuristic for the problem of one-dimensional steel coil cutting
    Pimenta-Zanon, M. H.
    Sakuray, F.
    Hoto, R. S., V
    COMPUTATIONAL & APPLIED MATHEMATICS, 2021, 40 (02):
  • [25] An online layout algorithm for the one-dimensional cutting problems
    Zhao, Zhi-Yan
    Zhan, Yuan-Rui
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 2560 - +
  • [26] Random search in the one-dimensional cutting stock problem
    Vahrenkamp, R
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (01) : 191 - 200
  • [27] Pattern reduction in one-dimensional cutting stock problems
    Foerster, H
    Wäscher, G
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (07) : 1657 - 1676
  • [28] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 86 - 91
  • [29] 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
  • [30] Quadratically Convergent Algorithms and One-Dimensional Search Schemes
    Huang, H. Y.
    Chambliss, J. P.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1973, 11 (02) : 175 - 188
12345