Title
The general yard allocation problem
Abstract
The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming requests for space required in the yard within time intervals. The GYAP is NP-hard for which we propose several heuristic algorithms, including Tabu Search, Simulated Annealing, Genetic Algorithms and the recently emerged "Squeaky Wheel" Optimization (SWO). Extensive experiments give solutions to the problem while comparisons among approaches developed show that the Genetic Algorithm method gives best results.
Year
DOI
Venue
2003
10.1007/3-540-45110-2_97
GECCO
Keywords
Field
DocType
genetic algorithms,space allocation,general yard allocation problem,resource allocation problem,singapore authority,squeaky wheel,genetic algorithm method,best result,simulated annealing,tabu search,resource allocation,heuristic algorithm,genetic algorithm
Simulated annealing,Mathematical optimization,Heuristic,Computer science,Yard,Resource allocation,Space allocation,Priority queue,Tabu search,Genetic algorithm
Conference
Volume
ISSN
ISBN
2724
0302-9743
3-540-40603-4
Citations 
PageRank 
References 
5
0.59
7
Authors
4
Name
Order
Citations
PageRank
Ping Chen1171.93
Zhaohui Fu228314.28
Andrew Lim337321.86
Brian Rodrigues431122.31