Abstract
Significant reduction of computation time of algorithms based on data organized as vectors and matrices is possible when pipeline processing is applied for packing and cutting problems. Data representation by spatial occupancy enumeration can be used to describe geometrical entities. The computer data representation provides the data that can be efficiently computed in vector computers. Solving of packing problems on a vector computer consists in designing procedures for manipulation on matrices defining the allocation space and geometrical entities to be assigned to it. It results in ability to create and rearrange a layout in a short time. Using this parallel computational geometry technique a family of methods based on controlled reorganization of the solution can be created. In this paper, the general idea of the approach and arising problems are presented. Computational results for a simplified version of the method complete the paper.
Partially supported by KBN grant 8T11A01618
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Błażzewicz J., Walkowiak R.: A local search approach for two-dimensional cutting. OR Spectrum 17 (1995) 93–98.
B7lażzewicz J., Moret-Salvador A., Walkowiak R.: Tabu search for two-dimensional irregular cutting. ed.: Ribeiro C.C., Hansen P., Essays and Surveys in Metaheuris-tics, Kluwer (2001) (to appear).
Dolata L.: Vector processing for cutting problem (in Polish), Master Thesis (2000), Pozna n University of Technology, Pozna n.
Dowsland K.A., Dowsland W.B.: Solution approaches to irregular nesting problems. EJOR 84 (1995) 506–521.
Dowwsland K.A., Dowsland W.B, Bennel J.A.: Jostling for position: local improvement for irregular cutting patterns. J. of ORS 49 (1998) 647–658.
Dyckhoff H.: A typology of cutting and packing problems. EJOR 44 (1990) 145–159.
Goodman J. E., O’Rourke J. (ed.): Handbook of Discrete and Computational Geometry, CRC Press (1997), Boca Raton.
Oliveira J. F., Gomes M. A., Ferreira S. J.: Topos-A new constructive algorithm for nesting problems. OR Spectrum 22 (2000) 263–284.
Samet H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990) Reading.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Błazewicz, J., Walkowiak, R. (2002). A New Parallel Approach for Multi-dimensional Packing Problems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_21
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive