Algorithms for one-dimensional bin packing problems with ordering implications
One-dimensional bin packing is one of the most fundamental and widely-studied problems in operational research.
In this project we will focus on various extensions to this problem where, unlike the original problem, the ordering of items within each bin is of critical importance.
Two examples of practical situations can occur can be found in the publications listed below. This project will specifically be concerned with designing efficient (and perhaps exact) algorithms for special cases of these problems, extending on the research documented below.
Suitable candidates will possess a good degree in operational research, mathematics, computer science or a related subject, and will have good programming skills. An interest in algorithm design and combinatorial optimisation is also desirable.
Interested candidates are asked to familiarise themselves with the following papers and then contact either supervisor above for further details:
Goulimis, C., 2004. Viewpoint: Minimum score separation – an open combinatorial problem associated with the cutting stock problem. Journal of the Operational Research Society 55, 1367–1368.
Lewis, R., X. Song, K. Dowsland, and J. Thompson (2011) 'An Investigation into two Bin Packing Problems with Ordering and Orientation Implications'.European Journal of Operational Research, vol. 213, pp. 52-65.
We are interested in pursuing this project and welcome applications if you are self-funded or have funding from other sources, including government sponsorships or your employer.
Please contact the supervisor when you want to pursue this project, citing the project title in your email, or find out more about our PhD programme in Mathematics.