|
|
|
|
LEADER |
01258 am a22001453u 4500 |
001 |
199195 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Song, Liying
|e author
|
700 |
1 |
0 |
|a Cherrett, T.J.
|e author
|
700 |
1 |
0 |
|a Guan, W.
|e author
|
245 |
0 |
0 |
|a Study on berth planning problem in a container seaport: using an integrated programming approach
|
260 |
|
|
|c 2012-02.
|
856 |
|
|
|z Get fulltext
|u https://eprints.soton.ac.uk/199195/1/song_et_al_berth_planning_problem_in_a_container_sea_port.pdf
|
520 |
|
|
|a 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.
|
655 |
7 |
|
|a Article
|