×

zbMATH — the first resource for mathematics

The general yard allocation problem. (English) Zbl 1038.68659
Cantú-Paz, Erick (ed.) et al., Genetic and evolutionary computation – GECCO 2003. Genetic and evolutionary computation conference, Chicago, IL, USA, July 12–16, 2003. Proceedings, Part II. Berlin: Springer (ISBN 3-540-40603-4/pbk). Lect. Notes Comput. Sci. 2724, 1986-1997 (2003).
Summary: 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.
For the entire collection see [Zbl 1025.68695].

MSC:
68U99 Computing methodologies and applications
68T05 Learning and adaptive systems in artificial intelligence
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90B06 Transportation, logistics and supply chain management
PDF BibTeX XML Cite
Full Text: Link