Title

The General Yard Allocation Problem

Publication Type

Conference Proceeding Article

Publication Date

7-2003

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.

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Genetic and Evolutionary Computation - GECCO 2003: Genetic and Evolutionary Computation Conference Chicago, IL, USA, July 12–16, 2003 Proceedings, Part II

Volume

2724

First Page

1986

Last Page

1997

ISBN

9783540451105

Identifier

10.1007/3-540-45110-2_97

Publisher

Springer Verlag

City or Country

Berlin

Additional URL

http://dx.doi.org/10.1007/3-540-45110-2_97