A New Parallel Approach for Multi-dimensional Packing Problem

Authors:
Jacek Blazewicz;Rafal Walkowiak
Affiliations:
-;-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 2
Cited 2

The design and analysis of spatial data structures

The design and analysis of spatial data structures
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry

A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.