Study on berth planning problem in a container seaport: using an integrated programming approach
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 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.
berth and crane scheduling process, mathematical programming, optimization
119-128
Song, Liying
a291ed5c-0853-4668-8a96-c0e79bc557f4
Cherrett, T.J.
e5929951-e97c-4720-96a8-3e586f2d5f95
Guan, W.
00c66631-bf6d-4c87-88d0-f5f6e7630c13
February 2012
Song, Liying
a291ed5c-0853-4668-8a96-c0e79bc557f4
Cherrett, T.J.
e5929951-e97c-4720-96a8-3e586f2d5f95
Guan, W.
00c66631-bf6d-4c87-88d0-f5f6e7630c13
Song, Liying, Cherrett, T.J. and Guan, W.
(2012)
Study on berth planning problem in a container seaport: using an integrated programming approach.
Computers & Industrial Engineering, 62 (1), .
(doi:10.1016/j.cie.2011.08.024).
Abstract
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.
Text
song_et_al_berth_planning_problem_in_a_container_sea_port.pdf
- Author's Original
Restricted to Repository staff only
Request a copy
More information
Published date: February 2012
Keywords:
berth and crane scheduling process, mathematical programming, optimization
Organisations:
Faculty of Engineering and the Environment
Identifiers
Local EPrints ID: 199195
URI: http://eprints.soton.ac.uk/id/eprint/199195
ISSN: 0360-8352
PURE UUID: b4b27d87-53fd-4cfa-a9b5-644d523d40ac
Catalogue record
Date deposited: 13 Oct 2011 08:50
Last modified: 15 Mar 2024 02:48
Export record
Altmetrics
Contributors
Author:
Liying Song
Author:
W. Guan
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
