A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem

@article{Lim2004ACN,
  title={A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem},
  author={Andrew Lim and Zhou Xu},
  journal={European Journal of Operational Research},
  year={2004},
  volume={174},
  pages={1247-1259}
}
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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
0 Extracted Citations
13 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 13 references

Port yard optimization problem

  • P. Chen, Z. Fu, A. Lim
  • IEEE Transactions on Robotics and Automation 1 (1…
  • 2004
1 Excerpt

Analysis of a new vehicle scheduling and location problem

  • E. K. Bish, T. Y. Leong, C. L. Li, J.W.C. Ng, D. Simchi- Levi
  • Naval Research Logistics 48
  • 2001
1 Excerpt

On the ship berthing problem

  • A. Lim
  • Operations Research Letters 22
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…