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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Sabria and C. Daganzo: Queuing systems with scheduled arrivals and established service order. Transportation Research B, vol. 23. (1989) 159–175
E.K. Bish, T.-Y. Leong, C.-L. Li, J. W.C. Ng, D. Simchi-Levi: Analysis of a new vehicle scheduling and location problem. Naval Research Logistics, vol. 48. (2001) 363–385
L. Gambardella, A. Rizzoli, M. Zaffalon: Simulation and planning of an intermodal container terminal. Simulation, vol. 71. (1998) 107–116
P. Chen, Z. Fu, A. Lim: The yard allocation problem. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), Edmonton, Alberta, Canada (2002)
P. Chen, Z. Fu, A. Lim: Using genetic algorithms to solve the yard allocation problem. In: Proceedings of the Genetic and Evolutionary Computing Conference (GECCO-2002) New York City, USA (2002)
B. Baker, E.C. Jr., R. Rivest: Orthogonal packing in two dimensions. SIAM Journal of Computing, vol. 9. (1980) 846–855
S. Jacobs: On genetic algorithms for the packing of polygons. European Journal of Operational Research, vol. 88. (1996) 165–181
E. Hopper, B. Turton: An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research, vol. 128. (2001) 34–57
P. L. Hammer: Tabu Search. J.C. Baltzer, Basel, Switzerland (1993)
F. Glover, M. Laguna: Tabu Search. Kluwer Academic Publishers (1997)
S. Sait, H. Youssef: Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems. IEEE (1999)
D. Pham, D. Karaboga: Intelligent optimisation techniques: genetic algorithms, tabu search, simulated annealing and neural networks. London and New York, Springer (2000)
D. Clements, J. Crawford, D. Joslin, G. Nemhauser, M. Puttlitz, M. Savelsbergh: Heuristic optimization: A hybrid ai/or approach. In: Workshop on Industrial Constraint-Directed Scheduling (1997)
D.E. Joslin, D. P. Clements: “squeaky wheel” optimization. Journal of Artificial Intelligence Research, vol. 10. (1999) 353–373
D.E. Joslin, D. P. Clements: Squeaky wheel optimization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, USA (1998) 340–346
D. Draper, A. Jonsson, D. Clements, D. Joslin: Cyclic scheduling. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (1999)
J.M. Crawford: An approach to resource constrained project scheduling. In: Proceedings of the 1996 Artificial Intelligence and Manufacturing Research Planning Workshop (1996)
J.C. Culberson, F. Luo: Exploring the k-colorable landscape with iterated greedy. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, David S. Johnson and Michael A. Trick (eds.). DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996) 245–284
S. Kirpatrick, C. Gelatt, Jr., M. Vecchi: Optimization by simulated annealing. Science, vol. 220. (1983) 671–680
J.H. Holland: Adaptation in natural artificial systems. Ann Arbor: University of Michigan Press (1975)
Z. Michalewicz: Genetic Algorithms + Data Structure = Evolution Programs. Springer-Verlag, Berlin Heidelberg New York (1996)
D. Goldberg, R. Lingle: Alleles, loci, and the traveling salesman problem (1985)
I. Oliver, D. Smith, J. Holland: A study of permutation crossover operators on the tsp (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, P., Fu, Z., Lim, A., Rodrigues, B. (2003). The General Yard Allocation Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_97
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_97
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive