Study on berth planning problem in a container seaport: using an integrated programming approach
This paper provides an integrated solution for two common processes in a container seaport: namely, the Berth Allocation Process (BAP) and the Quay Crane Scheduling Process (QCSP). These are formulated through a Bi-Level Programming (BLP) approach, which is used to characterize the highly interrelat...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2012-02.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Summary: | This paper provides an integrated solution for two common processes in a container seaport: namely, the Berth Allocation Process (BAP) and the Quay Crane Scheduling Process (QCSP). These are formulated through a Bi-Level Programming (BLP) approach, which is used to characterize the highly interrelated relationships between the two processes and simultaneously, identify an integrated solution for both. The upper-level problem (BAP) is termed 'NP-hard' as its computational complexity increases exponentially with the number of incoming ships for mooring, while the lower-level problem (QCSP) is a mixed-integer linear program. A revised Genetic Algorithm and a Branch-and-Bound method (B&B) are then applied for the solutions of upper and lower level problems, respectively. |
|---|