Port space allocation with a time dimension

In the Port of Singapore, as in many other ports, space has to be allocated in yards for inbound and transit cargo. Requests for container space occur at different times during the planning period, and are made for different quantities and sizes of containers. In this paper, we study space allocation under these conditions. We reduce the problem to a two-dimensional packing problem with a time dimension. Since the problem is NP-hard, we develop heuristic algorithms, using tabu search, simulated annealing, a genetic algorithm and "squeaky wheel" optimization, as solution approaches. Extensive computational experiments compare the algorithms, which are shown to be effective for the problem.Journal of the Operational Research Society (2007) 58, 797-807. doi:10.1057/palgrave.jors.2602192 Published online 12 April 2006.