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

Exact and approximate methods for the score-constrained packing problem

Hawa, Asyl, Lewis, Rhydian and Thompson, Jonathan 2022. Exact and approximate methods for the score-constrained packing problem. European Journal of Operational Research 10.1016/j.ejor.2022.01.028
Item availability restricted.

[thumbnail of ALHManuscriptSource.pdf] PDF - Accepted Post-Print Version
Restricted to Repository staff only until 11 February 2024 due to copyright restrictions.

Download (507kB)


This paper investigates a packing problem related to the one-dimensional bin packing problem in which the order and orientation of items influences the feasibility of a solution. We give an exact polynomial-time algorithm for the Constrained Ordering Problem, explaining how it can be used to find a feasible packing of items in a single bin. We then introduce an evolutionary algorithm for the multi-bin version of the problem, which incorporates the exact algorithm along with a local search procedure and three recombination operators. The mechanisms and results produced by each of the recombination operators are compared, and we discuss the circumstances in which each approach proves most advantageous.

Item Type: Article
Date Type: Published Online
Status: In Press
Schools: Mathematics
Publisher: Elsevier
ISSN: 0377-2217
Date of First Compliant Deposit: 17 January 2022
Date of Acceptance: 17 January 2022
Last Modified: 17 May 2022 04:27

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics