This paper puts forward an integrated optimisation model that combines two distinct problems arising in container terminals, namely the Quay Crane Assignment Problem, and the Quay Crane Scheduling Problem. The model is of the mixed-integer programming type with the objective being to minimise the tardiness of vessels. Although exact solutions can be found to the problem using Branch-and-Cut, for instance, they are costly in time when instances are of realistic sizes. To overcome the computationaludburden of large scale instances, an adapted Genetic Algorithm, is used. Small to medium size instances of the combined model have been solved with both the Genetic Algorithm and the CPLEX implementationudof Branch-and-Cut. Larger size instances, however, could only be solved approximately in acceptable times with the Genetic Algorithm. Computational results are included and discussed.
展开▼
