ECAI 2004 Conference Paper

A Critical-Shaking Neighborhood Search for the Yard Allocation Problem

Andrew Lim, Zhou Xu

The Yard Allocation Problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). To overcome its NP-hardness practically, we propose an effective heuristic procedure, named critical-shaking neighborhood search, to solve the problem. Extensive experiments show that the new method can produce solutions with higher qualities in a much shorter time, as compared with other heuristics proposed in the literature. Further to this, it also improves or at least achieves the best solutions to all the benchmark instances of the problem.

Keywords: port logistics, planning, scheduling, packing, heuristics, automation

Citation: Andrew Lim, Zhou Xu: A Critical-Shaking Neighborhood Search for the Yard Allocation Problem. In R.López de Mántaras and L.Saitta (eds.): ECAI2004, Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2004, pp.1049-1050.

ECAI-2004 is organised by the European Coordinating Committee for Artificial Intelligence (ECCAI) and hosted by the Universitat Politècnica de València on behalf of Asociación Española de Inteligencia Artificial (AEPIA) and Associació Catalana d'Intel-ligència Artificial (ACIA).