Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Developing an ace solution for two-dimensional strip packing

Dorband, John E., Mumford, Christine Lesley ORCID: and Wang, Pearl Y. 2004. Developing an ace solution for two-dimensional strip packing. Presented at: 18th International Parallel and Distributed Processing Symposium, 26-30 April 2004. Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International. IEEE, pp. 261-269. 10.1109/IPDPS.2004.1303331

Full text not available from this repository.


This paper describes the development of a fine-grained meta-heuristic for solving large strip packing problems with guillotine layouts. An architecture-adaptive environment aCe, and the aCe C parallel programming language are used to implement a massively parallel genetic simulated annealing (GSA) algorithm. The parallel GSA combines the temperature schedule of simulated annealing with the crossover and mutation operators that are applied to chromosome populations in genetic algorithms. For our problem, chromosomes are normalized postfix expressions that represent guillotine strip packings. Preliminary results for some benchmark data sets are reported and indicate that the parallel GSA method holds promise as a technique for solving the strip packing problem.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Publisher: IEEE
Related URLs:
Last Modified: 20 Oct 2022 09:25

Citation Data

Actions (repository staff only)

Edit Item Edit Item