The University of Southampton
University of Southampton Institutional Repository

A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting

A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting
A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting
In this paper, a heuristic dynamic-programming recursion is proposed for solving unconstrained 2D knapsack problem efficiently. The algorithm we propose is an incompletely enumerative method, in which some intricate cutting patterns may not be enumerated. Compared with the traditional dynamic-programming, the algorithm gives a high percentage of optimal solutions (93%) with a much lowered computational complexity. Some theoretical analyses for the algorithm are performed. Computational results are given for small and medium-sized problems.
Song, Xiang
28fc03d0-9077-49f5-bc94-a4f92fa76565
Chu, Chengbin
bc06adcc-0c98-4ce1-a39e-d2c63e7d7cbb
Nie, Yiyong
1d23f805-af0c-4525-b15b-f9e1f097a9ac
Song, Xiang
28fc03d0-9077-49f5-bc94-a4f92fa76565
Chu, Chengbin
bc06adcc-0c98-4ce1-a39e-d2c63e7d7cbb
Nie, Yiyong
1d23f805-af0c-4525-b15b-f9e1f097a9ac

Song, Xiang, Chu, Chengbin and Nie, Yiyong (2004) A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting. Proceedings of the IADIS International Conference on Applied Computing, Lisbon, Portugal, 23-26 March 2004.

Record type: Conference or Workshop Item (Paper)

Abstract

In this paper, a heuristic dynamic-programming recursion is proposed for solving unconstrained 2D knapsack problem efficiently. The algorithm we propose is an incompletely enumerative method, in which some intricate cutting patterns may not be enumerated. Compared with the traditional dynamic-programming, the algorithm gives a high percentage of optimal solutions (93%) with a much lowered computational complexity. Some theoretical analyses for the algorithm are performed. Computational results are given for small and medium-sized problems.

This record has no associated files available for download.

More information

Published date: 2004
Venue - Dates: Proceedings of the IADIS International Conference on Applied Computing, Lisbon, Portugal, 23-26 March 2004, 2004-01-01

Identifiers

Local EPrints ID: 36727
URI: http://eprints.soton.ac.uk/id/eprint/36727
PURE UUID: 00c9234b-231e-4752-ba34-e8e49010e08c

Catalogue record

Date deposited: 07 Jun 2006
Last modified: 11 Dec 2021 15:33

Export record

Contributors

Author: Xiang Song
Author: Chengbin Chu
Author: Yiyong Nie

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 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.

×