A bi-objective robust model for berth allocation scheduling under uncertainty

Xi Xiang, Changchun Liu, Lixin Miao*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

96 Citations (Scopus)

Abstract

This study examines the berth allocation problem with the consideration of uncertainty factors, including the arrival and operation times of the calling vessels. A bi-objective robust berth allocation model, which focuses on economic performance and customer satisfaction, is formulated. The model aims to optimize the robustness of the berth allocation policy, and an adaptive grey wolf optimizer algorithm is developed to solve the proposed model. The performance of the heuristic is evaluated through randomly generated instances. Experimental results show that the proposed heuristic provides good solution quality and calculation efficiency.

Original languageEnglish
Pages (from-to)294-319
Number of pages26
JournalTransportation Research Part E: Logistics and Transportation Review
Volume106
DOIs
Publication statusPublished - Oct 2017
Externally publishedYes

Keywords

  • Adaptive grey wolf optimizer algorithm
  • Berth allocation scheduling problem
  • Container terminals
  • Robust optimization
  • Uncertainty

Fingerprint

Dive into the research topics of 'A bi-objective robust model for berth allocation scheduling under uncertainty'. Together they form a unique fingerprint.

Cite this

Xiang, X., Liu, C., & Miao, L. (2017). A bi-objective robust model for berth allocation scheduling under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 106, 294-319. https://doi.org/10.1016/j.tre.2017.07.006