Research student, School of Mathematics
- M1.11A, 21-23 Senghennydd Road, Cathays, Cardiff, CF24 4AG
Candidate Associate of the Operational Research Society (CandORS)
Associate Member of the Institute of Mathematics and its Applications (AMIMA)
Member of the Society for Industrial and Applied Mathematics (SIAM)
Algorithms and Heuristics
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 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  and  below. This project is specifically concerned with designing efficient (and perhaps exact) algorithms for special cases of these problems, extending on the research documented in  and .
1.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.
2.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.