A New Parallel Approach for Multi-dimensional Packing Problems
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.
KeywordsPacking Problem Parallel Approach Small Item Vector Computer Vector Processing
Unable to display preview. Download preview PDF.
- 2.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).Google Scholar
- 3.Dolata L.: Vector processing for cutting problem (in Polish), Master Thesis (2000), Pozna n University of Technology, Pozna n.Google Scholar
- 5.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.Google Scholar
- 7.Goodman J. E., O’Rourke J. (ed.): Handbook of Discrete and Computational Geometry, CRC Press (1997), Boca Raton.Google Scholar
- 9.Samet H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990) Reading.Google Scholar