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

Bennell, Julia, Lee, Lai-Soon and Potts, Chris (2005) Genetic algorithm for two-dimensional bin packing problems to minimise the maximum lateness. IFORS, Hawaii. 10 - 14 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.

This record has no associated files available for download.

More information

Published date: 2005

Venue - Dates: IFORS, Hawaii, 2005-07-10 - 2005-07-14

Keywords: cutting and packing, metaheuristics

Learn more about Management research

Identifiers

Local EPrints ID: 37251

URI: http://eprints.soton.ac.uk/id/eprint/37251

PURE UUID: d9da1086-889b-42c5-a58d-dce16f440c42

Catalogue record

Date deposited: 24 May 2006

Last modified: 11 Dec 2021 15:35

Export record

Share this record

Share this on Facebook Share this on Twitter Share this on Weibo

Contributors

Author: Julia Bennell

Author: Lai-Soon Lee

Author: Chris Potts

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