Title: Instance Space Analysis for Cutting and Packing Mathematical Models

Speaker: Kelvin Liu
The University of Melbourne/KU Leuven

Summary:
Cutting and packing problems are combinatorial optimisation problems with wide-ranging applications in manufacturing, transportation, and logistics. In this seminar, we evaluate and advance mathematical models for two important packing problems: the two-dimensional bin packing problem and the three-dimensional container loading problem (CLP).

For bin packing, we apply instance space analysis to several mixed-integer programming models, using a combination of published, generated, and evolved instances to assess each model’s strengths and weaknesses. For container loading, we introduce two new constraint programming models, including a novel block-building approach adapted from heuristics. Extensive computational experiments demonstrate that these models significantly outperform exisiting exact methods on classical benchmark instances.

Bio:
Kelvin is undertaking a joint PhD at the University of Melbourne and KU Leuven. His research focuses on applying instance space analysis to mathematical model formulations of multi-dimensional cutting and packing problems. He is supervised by OPTIMA CIs Prof. Kate Smith-Miles and A/Prof. Alysson M. Costa from the University of Melbourne, and Prof. Tony Wauters from KU Leuven.

—

SEMINAR – MON 06 OCTOBER 2025 17:00-18:00 (AEDT, Melbourne Time) *NOTE DIFFERENT DAY AND TIME TO REGULAR SEMINARS

This event will be held in a Hybrid format, no need to register

ATTEND IN PERSON – Level 8, Room 8108, Melbourne Connect, 700 Swanston Street, Carlton 3053

ZOOM – MEETING ID: 873 1557 5255; PASSWORD – 778635