The University of Southampton
×
Filter your search:
University of Southampton Institutional Repository

Exact and approximate methods for the score-constrained packing problem

Exact and approximate methods for the score-constrained packing problem
Exact and approximate methods for the score-constrained packing problem

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.

Combinatorial optimization, Evolutionary computations, Packing
0377-2217
847-859
Hawa, Asyl L.
64ce4257-6176-4a4e-bce5-5e1147377355
Lewis, Rhyd
e559e7d5-0885-4b0e-9fb3-a71c10b8e883
Thompson, Jonathan M.
aeb78954-00f6-40b9-93d5-c91a0137bf72
Hawa, Asyl L.
64ce4257-6176-4a4e-bce5-5e1147377355
Lewis, Rhyd
e559e7d5-0885-4b0e-9fb3-a71c10b8e883
Thompson, Jonathan M.
aeb78954-00f6-40b9-93d5-c91a0137bf72

Hawa, Asyl L., Lewis, Rhyd and Thompson, Jonathan M. (2022) Exact and approximate methods for the score-constrained packing problem. European Journal of Operational Research, 302 (3), 847-859. (doi:10.1016/j.ejor.2022.01.028).

Record type: Article

Abstract

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.

Text
1-s2.0-S0377221722000649-main - Proof
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 17 January 2022
e-pub ahead of print date: 11 February 2022
Published date: 1 November 2022
Additional Information: Publisher Copyright: © 2022 Elsevier B.V. Copyright: Copyright 2022 Elsevier B.V., All rights reserved.
Related URLs:
Keywords: Combinatorial optimization, Evolutionary computations, Packing

Identifiers

Local EPrints ID: 456959
URI: http://eprints.soton.ac.uk/id/eprint/456959
DOI: doi:10.1016/j.ejor.2022.01.028
ISSN: 0377-2217
PURE UUID: c70e5bc3-8b3f-4333-bd7b-95b1e6dabade

Catalogue record

Date deposited: 18 May 2022 16:50
Last modified: 16 Mar 2024 16:59

Export record

Altmetrics

Contributors

Author: Asyl L. Hawa
Author: Rhyd Lewis
Author: Jonathan M. Thompson

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information
Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×