Name
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 a Genetic Algorithm approach. For benchmarking purposes, Tabu Search and Sim- ulated Annealing are applied to this problem as well. Extensive experiments show very favorable results for the Genetic Algorithm approach. |
Year | Venue | Keywords |
|---|---|---|
2002 | GECCO | Genetic Algorithms,Yard Allocation Problem |
Field | DocType | ISBN |
Simulated annealing,Mathematical optimization,Computer science,Operations research,Yard,Resource allocation,Genetic algorithm,Tabu search,Benchmarking | Conference | 1-55860-878-8 |
Citations | PageRank | References |
3 | 0.62 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping Chen | 1 | 109 | 19.57 |
| Zhaohui Fu | 2 | 283 | 14.28 |
| Andrew Lim | 3 | 373 | 21.86 |