Port Space Allocation with a Time Dimension

Publication Type

Journal Article

Publication Date

6-2007

Abstract

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.

Keywords

Heuristics, Logistics, Packing, Port management, Singapore

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Journal of the Operational Research Society

Volume

58

Issue

6

First Page

797

Last Page

807

ISSN

0160-5682

Identifier

10.1057/palgrave.jors.2602192

Publisher

Palgrave

Additional URL

https://doi.org/10.1057/palgrave.jors.2602192

Link to Full Text

Share

COinS