Integer Programming Models for the Class Constrained Multi-Level Bin Packing Problem

The Multi-Level Bin Packing problem is a generalisation of the widely-known NP-hard Bin Packing problem. This work aims to investigate approaching this problem, as well as a version including Class Constraints, through integer programming. By modelling the problems in two ways: standard, and with a network flow approach. The studying of the...

Comparing approximate and optimal solution algorithms for the Multi-Level Bin Packing problem

Multi-Level variants of classic optimisation problems are becoming more noteworthy as the complexity of real life applications increases. In this research we investigate the Multi-Level Bin Packing optimisation problem, which models, for example, global logistics and part manufacturing. We will look at the performance of solving Integer Linear...

Executing convex polytope queries on nD point clouds

Efficient spatial queries are frequently needed to extract useful information from massive nD point clouds. Most previous studies focus on developing solutions for orthogonal window queries, while rarely considering the polytope query. The latter query, which includes the widely adopted polygonal query in 2D, also plays a critical role in...

An Integrated Planning Approach: Maintenance Task Scheduling Optimization

Aircraft base maintenance consists of hundreds of tasks including preventive, corrective and modification tasks which have to be scheduled to a few check moments per year. The allocation of tasks to checks represents a complex scheduling problem due to the constraints involved. A mixed integer linear programming model was developed to optimize...