Fully-funded PhD position: Optimisation algorithms for 3D irregular cutting & packing problems

Posted by: Tony Wauters
Contact:[email protected]

In logistics and manufacturing, it is often the case that items or objects must be optimally positioned within a 3D volume (container). This is a challenging optimization task, which becomes even more challenging when the items or objects in question have irregular shapes and can be rotated in multiple ways. This problem of positioning 3D objects within a 3D volume can be seen as an optimization problem. More specifically, it belongs to the class of 3D Cutting & Packing optimization problems. These problems are unique in the fact that they combine geometric computations with (combinatorial) optimization. Some of the most challenging cutting & packing problems are those featuring 3D irregular objects.
In this research project, we would like to advance the state-of-the-art in solving 3D irregular cutting & packing problems. We will develop highly parallel optimization algorithms and run them on modern computing hardware such as multicore CPUs and GPUs. Furthermore, we will develop efficient optimization algorithms that can run locally on hardware with limited resources.
  • Master's degree relevant to computational computer science, algorithms and datastructures, combinatorial optimization. 
  • Experience with parallel computing and GPU programming is a plus,
  • The candidate should have provable experience in the implementation of efficient algorithms in a modern programming language.
  • Work precisely and are able to report accurately,
  • Have very good communication skills,
  • Have a good command of English, both written and spoken.
  • A fully-funded four-year PhD grant at KU Leuven, a university which is ranked consistently among the top universities in Europe.
  • A great work environment surrounded by skilled people with expert knowledge on combinatorial optimisation.
  • Networking opportunities through participation in conferences, workshops and collaborations with local and international research groups.
  • The opportunity to develop teaching and management skills.
  • Opportunities for collaborating with industrial partners.
The CODeS research group is part of the Department of Computer Science at KU Leuven. The overall research theme of CODeS includes the design, analysis and application of algorithms for combinatorial optimisation problems. The group investigates the construction of models, the behaviour and the application of algorithms for combinatorial optimisation and builds upon more than a decade of intense activity in this field. The group, located in Ghent, is part of the Faculty of Engineering Technology, which has a prolific industrial collaboration history. In the past few years, Reuters has consistently ranked KU Leuven as Europe's most innovative university.


For more information please contact Prof. dr. Tony Wauters by mail: [email protected].
You can apply for this job no later than August 07, 2023 via the  online application tool 
KU Leuven seeks to foster an environment where all talents can flourish, regardless of gender, age, cultural background, nationality or impairments. If you have any questions relating to accessibility or support, please contact us at [email protected].