Sciweavers

Share
EOR
2006

A critical-shaking neighborhood search for the yard allocation problem

8 years 10 months ago
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.
Andrew Lim, Zhou Xu
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where EOR
Authors Andrew Lim, Zhou Xu
Comments (0)
books