A critical-shaking neighborhood search for the yard allocation problem

The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective meta-heuristic procedure, named critical-shaking neighborhood search. Extensive experiments have shown that the new method can produce higher quality solutions in a much shorter time, as compared with other meta-heuristics in the literature. Further to this, it has also improved or at least achieved the current best solutions to all the benchmark instances of the problem.

• Type: Journal
• Year: 2006
• Where: EOR
• Authors: Andrew Lim, Zhou Xu
• Keywords: Allocation Problem, EOR 2006, Resource Allocation Problem, Yard Allocation Problem