The general yard allocation problem

Authors:
Ping Chen;Zhaohui Fu;Andrew Lim;Brian Rodrigues
Affiliations:
Dept of Computer Science, National University of Singapore, Singapore;Dept of Computer Science, National University of Singapore, Singapore;Dept of IEEM, Hong Kong University of Science and Technology, Kowloon, Hong Kong;School of Business, Singapore Management University, Singapore
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 10
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
“Squeaky Wheel” optimization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Tabu Search

Tabu Search
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Using Genetic Algorithms To Solve The Yard Allocation Problem

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
The yard allocation problem

Eighteenth national conference on Artificial intelligence
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
Cyclic scheduling

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.