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

Zachary Tindale

Zachary Tindale

Comparing Efficient Portfolios of Australian Shares Using Different Risk Measures
Soprom Meng

Soprom Meng

Geometry of 1-parameter subgroups of Lie groups
Gaurangi Gupta

Gaurangi Gupta

When Does Machine Learning Work in Time-Series Forecasting?
Matthew Hanna

Matthew Hanna

Optimisation and Theoretical Implications of Probability Inequalities
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.