A parallel algorithm for the two-dimensional cutting stock problem

Authors:
Luis García;Coromoto León;Gara Miranda;Casiano Rodríguez
Affiliations:
Dpto. Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 5
Cited 2

Best-first search methods for constrained two-dimensional cutting stock problems

Operations Research
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock

Computers and Operations Research
A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem

AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Remote service to solve the two-dimensional cutting stock problem: an application to the Canary Islands costume

International Journal of Web and Grid Services
2D cutting stock problem: a new parallel algorithm and bounds

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.02

Visualization

Abstract

Cutting Stock Problems (CSP) arise in many production industries where large stock sheets must be cut into smaller pieces. We present a parallel algorithm – based on Viswanathan and Bagchi algorithm (VB) – solving the Two-Dimensional Cutting Stock Problem (2DCSP). The algorithm guarantees the processing of best nodes first and does not introduce any redundant combinations – others than the already present in the sequential version. The improvement is orthogonal to any other sequential improvements. Computational results of an OpenMP implementation confirm the optimality of the algorithm. We also produce a new syntactic based reformulation of the 2DCSP problem which leads to a concise representation of the solutions. A highly efficient data structure to store subproblems is introduced.