The yard allocation problem

Authors:
Ping Chen;Zhaohui Fu;Andrew Lim
Affiliations:
Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore;Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 8
Cited 2

“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
Cyclic Scheduling

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Effective Ship Berthing Algorithm

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
The berth planning problem11This research is part of a project the author has with the Port of Singapore Authority. The author was a senior technical consultant in that project. This research was supported in part by the NUS Research Front RP3972679.

Operations Research Letters

An effective algorithm for project scheduling with arbitrary temporal constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The general yard allocation problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Quantified Score

Hi-index	0.00

Visualization

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.