Advanced Optimisation Techniques to the Variable-Sized Two-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. It has a huge solution space with many alternative solutions whose packing configurations are symmetric. These aspects make the problem a hot topic that is increasingly exciting the interest of operations research community, especially its Special Interest Group on Cutting and Packing

Betty Yuliani

Deakin University

Betty Yuliani is currently a student at Deakin University undertaking a Bachelor of Computer Science. She is particularly interested in algorithmic analysis and aspires to combine her technical IT knowledge with the world of medical science. Outside the classroom, she is socially active by being engaged in cultural clubs and part-time work as a retailer.

You may be interested in

Pu Ti Dai

Pu Ti Dai

Financial Applications of Correlated Brownian Motion
Luke Robinson

Luke Robinson

Interface Stability and Interplay of Surface Tension and Inertial Stabilisation Mechanisms
Jack Mulqueeney

Jack Mulqueeney

Stochastic Modelling of Deterministic Time Series
Jonah Klowss

Jonah Klowss

Finite Transition Times for Diffusion-Decay Problems
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.