The University of Southampton
University of Southampton Institutional Repository

From archaeology to 3D printing: packing problems in the three dimensions

From archaeology to 3D printing: packing problems in the three dimensions
From archaeology to 3D printing: packing problems in the three dimensions
This thesis is a study on three cutting and packing problems involving irregular items. These problems are highly relevant in areas such as transportation, additive manufacturing or the garment industry. We investigate a special type of one-dimensional bin packing problem appearing in the industry; a novel problem in two dimensions entailing irregular shapes and free rotations; and an open dimension problem in three dimensions. Our aims are to find strategies to deal with irregular shapes, particularly geometric tools, and solution methods for problems with unusual constraints.

In the first part we look at an industrial problem related to the management of helicopter fleets. We model and test with realistic data a bin packing problem where the objective is to find the minimum aircraft needed to lift a collection of items. The characteristics of this problem allow us to relax the geometrical constraints and consider it as a variant of the one-dimensional bin packing problem, but its many problem specific constraints make this a multi-objective that, to the best of our knowledge, is new in the literature.

In the second part, we deal with a novel problem in two dimensions, motivated by the deciphering of an ancient Aztec codex. The problem itself is a novel packing problem with irregular shapes, an irregular container, free rotation and with the overlap and containment constraints relaxed. We provide a constructive algorithm and a metaheuristic procedure that are able to find satisfying solutions for an open question in the deciphering of the codex.

Finally, in the last part we treat three-dimensional irregular shapes. We adopt a discretised approach that allows us to generate quick intersection tests and we develop the no-fit voxel. This is an extension of the no-t polygon, a mainstream tool for two dimensional packing problems that had not been extended to three dimensions in the literature. Using this tool, we investigate local search neighbourhoods and metaheuristic algorithms to find efficient packings and are able to provide an ILP model based on the no-fit voxel to locally improve the packing layouts.
University of Southampton
Lamas Fernandez, Carlos
ab75f8b4-a301-4e92-9e06-b8ba023af848
Lamas Fernandez, Carlos
ab75f8b4-a301-4e92-9e06-b8ba023af848
Bennell, Julia A
38d924bc-c870-4641-9448-1ac8dd663a30

Lamas Fernandez, Carlos (2018) From archaeology to 3D printing: packing problems in the three dimensions. University of Southampton, Doctoral Thesis, 172pp.

Record type: Thesis (Doctoral)

Abstract

This thesis is a study on three cutting and packing problems involving irregular items. These problems are highly relevant in areas such as transportation, additive manufacturing or the garment industry. We investigate a special type of one-dimensional bin packing problem appearing in the industry; a novel problem in two dimensions entailing irregular shapes and free rotations; and an open dimension problem in three dimensions. Our aims are to find strategies to deal with irregular shapes, particularly geometric tools, and solution methods for problems with unusual constraints.

In the first part we look at an industrial problem related to the management of helicopter fleets. We model and test with realistic data a bin packing problem where the objective is to find the minimum aircraft needed to lift a collection of items. The characteristics of this problem allow us to relax the geometrical constraints and consider it as a variant of the one-dimensional bin packing problem, but its many problem specific constraints make this a multi-objective that, to the best of our knowledge, is new in the literature.

In the second part, we deal with a novel problem in two dimensions, motivated by the deciphering of an ancient Aztec codex. The problem itself is a novel packing problem with irregular shapes, an irregular container, free rotation and with the overlap and containment constraints relaxed. We provide a constructive algorithm and a metaheuristic procedure that are able to find satisfying solutions for an open question in the deciphering of the codex.

Finally, in the last part we treat three-dimensional irregular shapes. We adopt a discretised approach that allows us to generate quick intersection tests and we develop the no-fit voxel. This is an extension of the no-t polygon, a mainstream tool for two dimensional packing problems that had not been extended to three dimensions in the literature. Using this tool, we investigate local search neighbourhoods and metaheuristic algorithms to find efficient packings and are able to provide an ILP model based on the no-fit voxel to locally improve the packing layouts.

Text
Final submission of thesis - Version of Record
Available under License University of Southampton Thesis Licence.
Download (11MB)

More information

Published date: June 2018

Identifiers

Local EPrints ID: 423469
URI: http://eprints.soton.ac.uk/id/eprint/423469
PURE UUID: 2eeaa856-0c3f-41b0-a400-752559c7790c

Catalogue record

Date deposited: 24 Sep 2018 16:30
Last modified: 17 Sep 2019 04:06

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

×