The University of Southampton
University of Southampton Institutional Repository

Genetic algorithm for two-dimensional bin packing problems to minimise the maximum lateness

Genetic algorithm for two-dimensional bin packing problems to minimise the maximum lateness
Genetic algorithm for two-dimensional bin packing problems to minimise the maximum lateness
A two-dimensional bin-packing problem is considered, where bins have processing times, and rectangles have due dates. A new placement heuristic which dynamically searches for the best placement is presented. The search is controlled by a GA with alternative fitness functions for minimising the number of bins and the maximum lateness.
cutting and packing, metaheuristics
Bennell, Julia
38d924bc-c870-4641-9448-1ac8dd663a30
Lee, Lai-Soon
a43522b8-1d9b-4103-b95b-d326dea75a20
Potts, Chris
d31167a9-92fd-433c-bd49-d942cb82c543
Bennell, Julia
38d924bc-c870-4641-9448-1ac8dd663a30
Lee, Lai-Soon
a43522b8-1d9b-4103-b95b-d326dea75a20
Potts, Chris
d31167a9-92fd-433c-bd49-d942cb82c543

Bennell, Julia, Lee, Lai-Soon and Potts, Chris (2005) Genetic algorithm for two-dimensional bin packing problems to minimise the maximum lateness. IFORS. 11 - 15 Jul 2005.

Record type: Conference or Workshop Item (Paper)

Abstract

A two-dimensional bin-packing problem is considered, where bins have processing times, and rectangles have due dates. A new placement heuristic which dynamically searches for the best placement is presented. The search is controlled by a GA with alternative fitness functions for minimising the number of bins and the maximum lateness.

Full text not available from this repository.

More information

Published date: 2005
Venue - Dates: IFORS, 2005-07-11 - 2005-07-15
Keywords: cutting and packing, metaheuristics

Identifiers

Local EPrints ID: 37251
URI: https://eprints.soton.ac.uk/id/eprint/37251
PURE UUID: d9da1086-889b-42c5-a58d-dce16f440c42

Catalogue record

Date deposited: 24 May 2006
Last modified: 03 Dec 2018 17:32

Export record

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

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 https://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.

×