Welcome to Journal of Graphics share: 

Journal of Graphics

Previous Articles     Next Articles

The Cutting Stock Problem of Circular Items Based on#br# Sequential Grouping Heuristic Algorithm

  

  1. 1. Department of Computer and Electronic Information, Guangxi University, Nanning Guangxi 530004, China;
    2. Department of Business Administration, South China University of Technology, Guangzhou Guangdong 510640, China
  • Online:2017-02-28 Published:2017-02-22

Abstract: Aiming at the special application background of the small batch cutting problem of circular
items, this paper introduces the thought of parallel group on the basis of sequential heuristic
procedure, and presents the sequential grouping heuristic algorithm (SGHA) based on the group
selection strategy. The SGHA combined with recursion method can generate a large number of optimal
cutting plans, and the best cutting plan of circular items can be selected with the parameter regulation.
Experimental result proves that the computational time is reasonable, the algorithm in this paper can
improve the average utilization rate of material effectively, and it has a realistic significance.

Key words: sequential grouping heuristic algorithm, cutting stock of circular items, small batch;
recursion method