Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ejor.2005.01.064 | European Journal of Operational Research |
Keywords | DocType | Volume |
Metaheuristics,Logistics,Packing,Scheduling | Conference | 174 |
Issue | ISSN | Citations |
2 | 0377-2217 | 14 |
PageRank | References | Authors |
0.79 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Lim | 1 | 937 | 89.78 |
| Zhou Xu | 2 | 208 | 14.97 |