Advertisement

A New Parallel Approach for Multi-dimensional Packing Problems

  • Jacek Błazewicz
  • Rafał Walkowiak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)

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.

Keywords

Packing Problem Parallel Approach Small Item Vector Computer Vector Processing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Błażzewicz J., Walkowiak R.: A local search approach for two-dimensional cutting. OR Spectrum 17 (1995) 93–98.CrossRefGoogle Scholar
  2. 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. 3.
    Dolata L.: Vector processing for cutting problem (in Polish), Master Thesis (2000), Pozna n University of Technology, Pozna n.Google Scholar
  4. 4.
    Dowsland K.A., Dowsland W.B.: Solution approaches to irregular nesting problems. EJOR 84 (1995) 506–521.zbMATHCrossRefGoogle Scholar
  5. 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
  6. 6.
    Dyckhoff H.: A typology of cutting and packing problems. EJOR 44 (1990) 145–159.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Goodman J. E., O’Rourke J. (ed.): Handbook of Discrete and Computational Geometry, CRC Press (1997), Boca Raton.Google Scholar
  8. 8.
    Oliveira J. F., Gomes M. A., Ferreira S. J.: Topos-A new constructive algorithm for nesting problems. OR Spectrum 22 (2000) 263–284.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Samet H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990) Reading.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Jacek Błazewicz
    • 1
    • 2
  • Rafał Walkowiak
    • 1
  1. 1.Institute of Computing SciencePoznań University of TechnologyPoznańPoland
  2. 2.Institute of Bioorganic ChemistryPolish Academy of SciencesPoznańPoland

Personalised recommendations