On Optimizing PSA Berth Planning System
Competition among container ports continues to increase as the differentiation of hub ports and feeder ports progresses. Managers in many container terminals are trying to attract carriers by automating handling equipment, providing and speeding up various services, and furnishing the most current i...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3720 |
_version_ | 1826195028135903232 |
---|---|
author | Teo, Chung Piaw Dai, Jim Moorthy, Rajeeva Lochana |
author_facet | Teo, Chung Piaw Dai, Jim Moorthy, Rajeeva Lochana |
author_sort | Teo, Chung Piaw |
collection | MIT |
description | Competition among container ports continues to increase as the differentiation of hub ports and feeder ports progresses. Managers in many container terminals are trying to attract carriers by automating handling equipment, providing and speeding up various services, and furnishing the most current information on the flow of containers. At the same time, however, they are trying to reduce costs by utilizing resources efficiently, including human resources, berths, container yards, quay cranes, and various yard equipment. When planning berth usage, the berthing time and the exact position of each vessel at the wharf, as well as various quay side resources are usually determined in the process. Several variables must be considered, including the length overall (LOA) and arrival time of each vessel, the number of containers for discharging and loading, and the storage location of outbound/inbound containers to be loaded onto/discharged from the corresponding vessel. Furthermore, we aim to propose berthing plan that will be "robust", since the actual arrival time of each vessel can vary substantially from forecast. This is particular important for vessels from priority customers (called priority vessels hereon), who have been promised berth-on-arrival (i.e. within two hours of arriving) service guarantee in their contract with PSA. A robust plan will also helps to minimize the frequent updates (changes) to berthing plan that have repercussion in resource and sta deployment within the terminal. Thus, the problem reduces to one of finding a berthing plan, so that priority vessels can be berthed-on-arrival with high probability, and the vessels can be berthed as close to their preferred locations as possible, to reduce the cost of transporting the containers within the terminal. In this paper, we described an approach to address this problem. |
first_indexed | 2024-09-23T10:05:36Z |
format | Article |
id | mit-1721.1/3720 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T10:05:36Z |
publishDate | 2003 |
record_format | dspace |
spelling | mit-1721.1/37202019-04-10T16:45:26Z On Optimizing PSA Berth Planning System Teo, Chung Piaw Dai, Jim Moorthy, Rajeeva Lochana berthing plan port management Competition among container ports continues to increase as the differentiation of hub ports and feeder ports progresses. Managers in many container terminals are trying to attract carriers by automating handling equipment, providing and speeding up various services, and furnishing the most current information on the flow of containers. At the same time, however, they are trying to reduce costs by utilizing resources efficiently, including human resources, berths, container yards, quay cranes, and various yard equipment. When planning berth usage, the berthing time and the exact position of each vessel at the wharf, as well as various quay side resources are usually determined in the process. Several variables must be considered, including the length overall (LOA) and arrival time of each vessel, the number of containers for discharging and loading, and the storage location of outbound/inbound containers to be loaded onto/discharged from the corresponding vessel. Furthermore, we aim to propose berthing plan that will be "robust", since the actual arrival time of each vessel can vary substantially from forecast. This is particular important for vessels from priority customers (called priority vessels hereon), who have been promised berth-on-arrival (i.e. within two hours of arriving) service guarantee in their contract with PSA. A robust plan will also helps to minimize the frequent updates (changes) to berthing plan that have repercussion in resource and sta deployment within the terminal. Thus, the problem reduces to one of finding a berthing plan, so that priority vessels can be berthed-on-arrival with high probability, and the vessels can be berthed as close to their preferred locations as possible, to reduce the cost of transporting the containers within the terminal. In this paper, we described an approach to address this problem. Singapore-MIT Alliance (SMA) 2003-11-24T20:39:55Z 2003-11-24T20:39:55Z 2003-01 Article http://hdl.handle.net/1721.1/3720 en_US High Performance Computation for Engineered Systems (HPCES); 12708 bytes application/pdf application/pdf |
spellingShingle | berthing plan port management Teo, Chung Piaw Dai, Jim Moorthy, Rajeeva Lochana On Optimizing PSA Berth Planning System |
title | On Optimizing PSA Berth Planning System |
title_full | On Optimizing PSA Berth Planning System |
title_fullStr | On Optimizing PSA Berth Planning System |
title_full_unstemmed | On Optimizing PSA Berth Planning System |
title_short | On Optimizing PSA Berth Planning System |
title_sort | on optimizing psa berth planning system |
topic | berthing plan port management |
url | http://hdl.handle.net/1721.1/3720 |
work_keys_str_mv | AT teochungpiaw onoptimizingpsaberthplanningsystem AT daijim onoptimizingpsaberthplanningsystem AT moorthyrajeevalochana onoptimizingpsaberthplanningsystem |