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

How to pack trapezoids: exact and evolutionary algorithms

Lewis, Rhyd ORCID: and Holborn, Penny 2017. How to pack trapezoids: exact and evolutionary algorithms. IEEE Transactions on Evolutionary Computation 21 (3) , pp. 463-476. 10.1109/TEVC.2016.2609000

[thumbnail of Rh. Lew.pdf]
PDF - Accepted Post-Print Version
Download (2MB) | Preview


The purposes of this paper are twofold. In the first, we describe an exact polynomial-time algorithm for the pair sequencing problem and show how this method can be used to pack fixed-height trapezoids into a single bin such that interitem wastage is minimised. We then go on to examine how this algorithm can be combined with bespoke evolutionary and local search methods for tackling the multiple-bin version of this problem—one that is closely related to one-dimensional bin packing. In the course of doing this, a number of ideas surrounding recombination, diversity, and genetic repair are also introduced and analysed.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Publisher: IEEE
ISSN: 1089-778X
Date of First Compliant Deposit: 12 September 2016
Date of Acceptance: 25 June 2016
Last Modified: 12 Apr 2024 16:08

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics