ABSTRACT
In this paper, we documented results produced by a prototype resource allocation system that performs transfer planning for an air cargo handling facility using a constraint-based approach. The key problem is to decide, for each export and import air cargo container, which transfer deck should it be placed at before or after transfer from the aircraft, through which path within the building facility should it be transferred and at which time, and how the empty container should be transferred out to or from the storage area. This resource allocation problem is modelled as a constraint-satisfaction problem (CSP) in this research. The key objective is to optimise the use of the air cargo handling facility, to minimise any delay to aircraft departure, and to fulfil customer service commitments. Another objective is to be able to perform reactive scheduling if flight arrival or departure time has changed, and if the number and type of containers have changed. This paper describes how this problem can be modelled, the constraints that are involved, and the scheduling algorithm used.
