Parallel tabu search for two-dimensional irregular cutting
The problem of cutting figures of various shapes out from the rectangular area is considered. The method proposed is based on the tabu search metaheuristic adapted for the problem. It includes defining the neighborhood, various types of moves and search strategies. An exact algorithm for finding placement of a polygon in polygons has been used in order to enhance additionally the quality of solutions. A parallel version of the algorithm has been proposed for a transputer environment. In the method independent tabu search processes exist, which use concurrently the transputer network. In order to use the system effectively, a load balancing mechanism has been proposed. It has been based on an auction type algorithm. The experimental results are accompanied by a discussion and comments concerning the future research.
- OSTI ID:
- 35844
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tabu search methods for multicommodity capcitated fixed charge network design problem
Deconstructing Nowicki and Smutnicki