ML Anthology

The Yard Allocation Problem

Ping Chen, Zhaohui Fu, Andrew Lim
AAAI 2002 pp. 3-8
doi:10.5555/777092.777096 /aaai/2002/chen2002aaai-yard/

Abstract

The Yard Allocation Problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). We first show that YAP is NP-Hard. As the problem is NP-Hard, we propose several heuristics, including Tabu Search methods with short and long term memory, a Squeaky Wheel Optimization (SWO) method, and a new hybrid which combines SWO with TS to solve the problem. Extensive experiments show very favorable results for our new hybrid method.

PDF AAAI Semantic Scholar

Cite

Text

Chen et al. "The Yard Allocation Problem." AAAI Conference on Artificial Intelligence, 2002. doi:10.5555/777092.777096

Markdown

[Chen et al. "The Yard Allocation Problem." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/chen2002aaai-yard/) doi:10.5555/777092.777096

BibTeX

@inproceedings{chen2002aaai-yard,
  title     = {{The Yard Allocation Problem}},
  author    = {Chen, Ping and Fu, Zhaohui and Lim, Andrew},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {3-8},
  doi       = {10.5555/777092.777096},
  url       = {https://mlanthology.org/aaai/2002/chen2002aaai-yard/}
}