By Topic

MHA: A mixed heuristic algorithm for the cutting stock problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yingyu Huo ; School of Science, Foshan University, Foshan 528000, China ; Kejing He ; Rengui Zhang ; Yong Zhong

Cutting stock problem (CSP), the studies of which mainly focus on building up specific mathematical models and finding efficient solution methods, has been widely applied in engineering and industrial production. This paper builds a single objective linear programming model for the one-dimensional (1D) and two-dimensional (2D) cutting stock problems with time restriction, and presents an effective multistage mixed heuristic algorithm (MHA) for model solving. MHA integrates heuristic strategy, lemma of dropping inferior patterns, greedy theory and the time dimension handling method to optimize the combination of patterns and reduce the computational complexity. The final cutting solution gotten by the MHA achieves a utilization ratio of more than 95%. The MHA can be implemented easily and is very fast. It is widely applicable and especially suitable for 1D and 2D cutting stock problems. For the demonstration problems, the number of raw materials, the number of cutting patterns, the total wastes, and the utilization ratio are 800, 46, 6430 mm and 98.96% respectively for the 1D case, are 462, 65, 4340880 mm2 and 96.87% respectively for the 2D case.

Published in:

Information and Automation, 2009. ICIA '09. International Conference on

Date of Conference:

22-24 June 2009