Please use this identifier to cite or link to this item:
|Title:||The yard allocation problem||Authors:||Chen, P.
|Issue Date:||2002||Citation:||Chen, P.,Fu, Z.,Lim, A. (2002). The yard allocation problem. Proceedings of the National Conference on Artificial Intelligence : 3-8. ScholarBank@NUS Repository.||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.||Source Title:||Proceedings of the National Conference on Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/40379|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.