Advanced Optimisation Techniques to the Variable‐Sized 2‐dimensional Bin Packing Problem

This project deals with the two-dimensional bin packing problem that consists in packing without overlap small rectangular items into large non-identical rectangular bins, with the items obtained via guillotine edge-to-edge cuts. This NP-hard combinatorial optimisation problem asks to minimize the waste of the used bins. Even though the general bin packing
problem has been a subject for intensive study over the past decades, research on its variable-sized two-dimensional variant is still limited because of the intrinsic computational
complexity that makes it challenging to solve to optimality. The aim of this project is to develop time-efficient approximate approaches to the problem and explore effective
decomposition techniques to solve instances of moderate size.

Xiaojuan He

Deakin University

Xiaojuan is an undergraduate student in her third year at Deakin University. Even though her degree is in computer science, she is diligently pursuing further maths studies. Statistics and combinatorial optimization interest her. She intends to earn a master’s degree in mathematics or statistics.

You may be interested in

Thomas Hanyang Zheng

Thomas Hanyang Zheng

Hidden Markov Models for Analyzing Stress Levels in Working Dogs: A Comparative Study of Data Collection Devices and Frequencies
Jeremy Sterjovski

Jeremy Sterjovski

How Is American Option Optimal Price Affected by Transaction Costs?
Daniel Claassen

Daniel Claassen

Extreme Events and Critical Fluctuations in Generated Time Series Data
Rajan Shankar

Rajan Shankar

Towards a Uniform Sampling Procedure for Abstract Triangulations of Surfaces
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.