Improved ACO for Dimensional Cutting-stock Problem

被引：0
|
作者：
Li, Yancang [1 ]
Suo, Juanjuan [1 ]
Zhou, Shujing [1 ]
机构：
[1] Hebei Univ Engn, Handan 056038, Peoples R China
来源：
ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2 | 2010年 / 26-28卷
关键词：
dimensional cutting-stock; ant colony algorithm; NP hard problems; optimization; ANT COLONY OPTIMIZATION; ALGORITHM;
D O I：
10.4028/www.scientific.net/AMM.26-28.277
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In order to find an effective method for solving the NP problem-dimensional cutting stock problem, the improved ACO based on entropy was introduced. After introducing the basic knowledge of the improved ACO, the dimensional cutting-stock problem's mathematical model was set up. And the improved ACO was employed to optimize the problem. Computed results indicate that the ant colony algorithm can approach the theoretical optimal solution, and its astringency is good. This study provides a new approach for the optimization of the NP hard problems.
引用
收藏
页码：277 / 280
页数：4
相关论文
共 50 条
  • [41] Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm
    Liao, Xiaoping
    Ma, Junyan
    Ou, Chengyi
    Long, Fengying
    Liu, Xiangsha
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2016, 8 (06)
  • [42] Sequential quadratic programming method with a global search strategy on the cutting-stock problem with rotatable polygons
    M. T. Yu
    T. Y. Lin
    C. Hung
    [J]. Journal of Intelligent Manufacturing, 2012, 23 : 787 - 795
  • [43] IMPROVED HEURISTIC PROCEDURE FOR A NONLINEAR CUTTING STOCK PROBLEM
    COVERDALE, I
    WHARTON, F
    [J]. MANAGEMENT SCIENCE, 1976, 23 (01) : 78 - 86
  • [44] Triangle Rectangle Method for 20 Irregular Cutting-Stock Problems
    Zheng, Wu
    Li, Bing
    Yang, Kuo-ran
    Li, Hang
    [J]. MECHANICAL AND ELECTRONICS ENGINEERING III, PTS 1-5, 2012, 130-134 : 2090 - 2093
  • [45] Two-dimensional cutting stock problem with multiple stock sizes
    Ayasandır, Umutcan
    Azizoğlu, Meral
    [J]. International Journal of Manufacturing Technology and Management, 2024, 38 (02) : 95 - 125
  • [46] An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill
    Díaz, Diego
    Valledor, Pablo
    Areces, Paula
    Rodil, Jorge
    Suárez, Montserrat
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8667 : 13 - 24
  • [47] An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill
    Diaz, Diego
    Valledor, Pablo
    Areces, Paula
    Rodil, Jorge
    Suarez, Montserrat
    [J]. SWARM INTELLIGENCE, ANTS 2014, 2014, 8667 : 13 - 24
  • [48] A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
    Belov, G
    Scheithauer, G
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 274 - 294
  • [49] The two-dimensional cutting stock problem revisited
    Seiden, SS
    Woeginger, GJ
    [J]. MATHEMATICAL PROGRAMMING, 2005, 102 (03) : 519 - 530
  • [50] The two-dimensional cutting stock problem revisited
    Steven S. Seiden
    Gerhard J. Woeginger
    [J]. Mathematical Programming, 2005, 102 : 519 - 530
12345