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.
Heuristics, Logistics, Packing, Port management, Singapore
Operations and Supply Chain Management
Journal of the Operational Research Society
FU, Zhaohui; LIM, Andrew; LI, Yanzhi; and RODRIGUES, Brian.
Port Space Allocation with a Time Dimension. (2007). Journal of the Operational Research Society. 58, (6), 797-807. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/610