• DocumentCode
    551558
  • Title

    A hybrid algorithm for the orthogonal stock-cutting problem

  • Author

    Tan, Yongqiu ; Guo, Guanqi ; Zeng, Xiaowen

  • Author_Institution
    Sch. of Comput., Hunan Inst. of Sci. & Technol., Yueyang, China
  • Volume
    1
  • fYear
    2011
  • fDate
    20-21 Aug. 2011
  • Firstpage
    196
  • Lastpage
    199
  • Abstract
    Based on a simulated annealing algorithm and a bricklaying heuristic algorithm, a hybrid algorithm for the orthogonal stock-cutting problem is presented. The computational results on several classes of benchmark problems have shown that the presented algorithm can outperform the well-known algorithm BF+SA in terms of both solution quality and execution time.
  • Keywords
    bin packing; simulated annealing; benchmark problems; bricklaying heuristic algorithm; hybrid algorithm; orthogonal stock cutting problem; simulated annealing algorithm; Algorithm design and analysis; Computers; Europe; Genetic algorithms; Heuristic algorithms; Simulated annealing; Strips; Heuristic algorithm; Simulated annealing algorithm; Stock-cutting problem; bricklaying;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing, Control and Industrial Engineering (CCIE), 2011 IEEE 2nd International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-9599-3
  • Type

    conf

  • DOI
    10.1109/CCIENG.2011.6007991
  • Filename
    6007991
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=551558