Research on Optimisation focuses on solving optimisation problems, which is about finding values for unknowns such that constraints are satisfied and a cost is (near-)minimal or a gain is (near-)maximal. Sometimes the goal is to satisfy the constraints without a specific function to be minimised or maximised.
Our research is on methods and tools for mathematical programming, constraint programming, and local search. Applications of optimisation arise in many real-world domains, such as communication networks, transportation and logistics for resource allocation, personnel rostering under work regulations and employee preferences, scheduling under precedence and resource allocation constraints, vehicle routing under time windows for deliveries or pick-ups, routing and scheduling of data flows in information networks, planning and performance engineering of mobile communications systems, etc.
We coordinate the research arena of Applied Optimisation at the Department of Information Technology. The research arena is a networking effort at the department level, aiming at bringing together researchers for which optimisation is relevant for a wide range of application domains.
- Andreina Francisco Rodriguez serves as the Workshop Chair and also serves together with Pierre Flener and Justin Pearson on the programme committee of CP 2020, the 26th International Conference on the Principles and Practice of Constraint Programming, held in Louvain-la-Neuve (Belgium) in September 2020.
- We had a project on sawmill optimisation with Sveaskog and others, under a Test your Hypothesis grant by BioInnovation, in 2020.
- Di Yuan received a mobility grant from the Swedish Foundation for Strategic Research for working with Netonomics AB in 2020.