Chapter
Sep 12, 2019
15th Triennial International Conference

Time-Window Based Berth and Yard Allocation Planning of Container Vessels

Publication: Ports 2019: Port Planning and Development

ABSTRACT

Mathematical programming could help improve the operability of container-vessel oriented ports in terms of coupling the management of vessel berth allocation and container yard allocation under various realistic constraints. In this paper, a time-window based MINLP (mixed-integer nonlinear programming) model has been developed for the simultaneous planning of berth and yard allocation problems at container-vessel oriented ports. It can simultaneously optimize the spatial berthing schedule of each vessel as well as container transshipment schedule at the port yard, so as to minimize the overall port operating cost subject to various port resource limits and operating constraints. A detailed case study has also been utilized to demonstrate the efficacy of the developed model.

Get full access to this article

View all available purchase options and get full access to this chapter.

ACKNOWLEDGMENTS

This work was partially supported by the Center for Advances in Port Management at Lamar University and the Graduate Student Scholarship from Lamar University.

REFERENCES

Bierwirth, C. and F. Meisel (2010). “A survey of berth allocation and quay crane scheduling problems in container terminals.” European Journal of Operational Research 202(3): 615-627.
Bierwirth, C. and F. Meisel (2015). “A follow-up survey of berth allocation and quay crane scheduling problems in container terminals.” European Journal of Operational Research 244(3): 675-689.
Brooke, A., D. Kendrick and A. Meeraus (1992). GAMS: release 2.25 : a user's guide, Scientific Press.
CPLEX Optimization, I. (1995). Using the CPLEX Callable Library: Including Using the CPLEX Base System with CPLEX Barrier and Mixed Integer Solver Options, CPLEX Optimization, Incorporated.
Giallombardo, G., L. Moccia, M. Salani and I. Vacca (2010). “Modeling and solving the Tactical Berth Allocation Problem.” Transportation Research Part B: Methodological 44(2): 232-245.
Hendriks, M., M. Laumanns, E. Lefeber and J. T. Udding (2010). “Robust cyclic berth planning of container vessels.” OR Spectrum 32(3): 501-517.
Hendriks, M. P. M., E. Lefeber and J. T. Udding (2013). “Simultaneous berth allocation and yard planning at tactical level.” OR Spectrum 35(2): 441-456.
Iris, Ç., D. Pacino, S. Ropke and A. Larsen (2015). “Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results.” Transportation Research Part E: Logistics and Transportation Review 81: 75-97.
Jean-Fran, O. Cordeau, G. Laporte, P. Legato and L. Moccia (2005). “Models and Tabu Search Heuristics for the Berth-Allocation Problem.” Transportation Science 39(4): 526-538.
Monaco, M. F. and M. Sammarra (2007). “The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach.” Transportation Science 41(2): 265-280.
Moorthy, R. and C.-P. Teo (2006). “Berth management in container terminal: the template design problem.” OR Spectrum 28(4): 495-518.
Nishimura, E., A. Imai and S. Papadimitriou (2001). “Berth allocation planning in the public berth system by genetic algorithms.” European Journal of Operational Research 131(2): 282-292.
Steenken, D., S. Voß and R. Stahlbock (2004). “Container terminal operation and operations research - a classification and literature review.” OR Spectrum 26(1): 3-49.
Tao, Y. and C.-Y. Lee (2015). “Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy.” Transportation Research Part E: Logistics and Transportation Review 83: 34-50.
Xu, J., H. Qu, S. Wang and Q. Xu (2017). “A New Proactive Scheduling Methodology for Front-End Crude Oil and Refinery Operations under Uncertainty of Shipping Delay.” Industrial & Engineering Chemistry Research 56(28): 8041-8053.
Xu, J., S. Zhang, J. Zhang, S. Wang and Q. Xu (2017). “Simultaneous scheduling of front- end crude transfer and refinery processing.” Computers & Chemical Engineering 96: 212-236.
Zhen, L., E. P. Chew and L. H. Lee (2011). “An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs.” Transportation Science 45(4): 483-504.

Information & Authors

Information

Published In

Go to Ports 2019
Ports 2019: Port Planning and Development
Pages: 633 - 643
Editors: Pooja Jain, Moffatt & Nichol and William S. Stahlman III, America's Central Port
ISBN (Online): 978-0-7844-8262-9

History

Published online: Sep 12, 2019
Published in print: Sep 12, 2019

Permissions

Request permissions for this article.

Authors

Affiliations

Dan F. Smith Dept. of Chemical Engineering, Lamar Univ., Beaumont, TX 77710, USA. E-mail: [email protected]
Sujing Wang [email protected]
Dept. of Computer Science, Lamar Univ., Beaumont, TX 77710, USA. E-mail: [email protected]
Dan F. Smith Dept. of Chemical Engineering, Lamar Univ., Beaumont, TX 77710, USA. E-mail: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$126.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$126.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share