The General Yard Allocation Problem

Ping Chen¹, Zhaohui Fu¹, Andrew Lim², and Brian Rodrigues³

¹Dept of Computer Science
National University of Singapore
3 Science Drive 2
Singapore 117543
{chenp,fuzh}@comp.nus.edu.sg

²Dept of IEEM
Hong Kong University of Science and Technology
Clear Water Bay
Kowloon, Hong Kong
iealim@ust.hk

³School of Business
Singapore Management University
469 Bukit Timah Road
Singapore 259759
br@smu.edu.sg

Abstract. The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming requests for space required in the yard within time intervals. The GYAP is NP-hard for which we propose several heuristic algorithms, including Tabu Search, Simulated Annealing, Genetic Algorithms and the recently emerged "Squeaky Wheel" Optimization (SWO). Extensive experiments give solutions to the problem while comparisons among approaches developed show that the Genetic Algorithm method gives best results.

LNCS 2724, p. 1986 ff.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003