Research at the University of Auckland.
Project Summary:
Many organisations have complex scheduling problems that they model as
generalised set partitioning models and then solve using integer
programming optimisation techniques. These problems arise, for instance,
in the airline operations, rostering of medical personnel, forestry
management, or collection and processing of goods (such as milk) and
many other contexts.
These problems have mathematical formulations with a special structure
(generalised set partitioning models). Due to their prohibitively large
size, the problems are commonly solved using decomposition algorithms.
Decomposition approaches initially solve a simplified optimisation
problem, and then repeatedly augment this problem with new schedules
(e.g. sequences of work tasks) that improve the solution. Our recent
observations hint at the impact of the augmentation approach itself,
where, by carefully shaping the formulation, we can create favourable
model properties that speed up the solution process. This allows us to
obtain high quality solutions faster. We will systematically propose and
analyse problem shaping approaches to develop a theoretical
understanding of this new approach
For more information, please see here:
https://orsnz.org.nz/blog/2023/12/08/funded-phd-at-uoa-problem-shaping-for-mathematical-models-of-scheduling-problems/
If you are interested or have any questions, please get in touch as soon
as possible with Andrea Raith a.raith@auckland.ac.nz or Andrew Mason
a.mason@auckland.ac.nz
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
