Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels. (October 2022)
- Record Type:
- Journal Article
- Title:
- Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels. (October 2022)
- Main Title:
- Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels
- Authors:
- Ji, Bin
Tang, Min
Wu, Ziyun
Yu, Samson S.
Zhou, Saiqi
Fang, Xiaoping - Abstract:
- Abstract: Port operations usually suffer from uncertainties, such as vessels' arrival time and handling time and unscheduled vessels. To address this, this study presents a dynamic berth allocation and crane assignment specific problem (BACASP) when unscheduled vessels arrive at the port, which is branded the berth allocation and quay crane assignment specific problem with unscheduled vessels (UBACASP). A rolling-horizon based method is proposed to decompose the UBACASP into a multi-stage static decision BACASP, wherein a rescheduling margin-based hybrid rolling-horizon optimization method is developed by incorporating the event-driven and periodical rolling-horizon strategies as the urgency of dynamic events is evaluated. In each rolling horizon, a mixed integer linear programming model (MILP) is presented for the BACASP to minimize the total port stay time of vessels and the penalties of delays associated with the spatial and temporal constraints, such as the length of continuous berth, number of quay cranes (QCs) and non-crossing of QCs. A discretization strategy is designed to divide the continuous berth into discrete segments, and convert the BACASP to a discrete combinatorial optimization problem, which is efficiently solved by the proposed adaptive large neighborhood search algorithm (ALNS). Case studies with different problem characteristics are conducted to prove the effectiveness of the solution methods proposed in this study. Moreover, the performances of the ALNSAbstract: Port operations usually suffer from uncertainties, such as vessels' arrival time and handling time and unscheduled vessels. To address this, this study presents a dynamic berth allocation and crane assignment specific problem (BACASP) when unscheduled vessels arrive at the port, which is branded the berth allocation and quay crane assignment specific problem with unscheduled vessels (UBACASP). A rolling-horizon based method is proposed to decompose the UBACASP into a multi-stage static decision BACASP, wherein a rescheduling margin-based hybrid rolling-horizon optimization method is developed by incorporating the event-driven and periodical rolling-horizon strategies as the urgency of dynamic events is evaluated. In each rolling horizon, a mixed integer linear programming model (MILP) is presented for the BACASP to minimize the total port stay time of vessels and the penalties of delays associated with the spatial and temporal constraints, such as the length of continuous berth, number of quay cranes (QCs) and non-crossing of QCs. A discretization strategy is designed to divide the continuous berth into discrete segments, and convert the BACASP to a discrete combinatorial optimization problem, which is efficiently solved by the proposed adaptive large neighborhood search algorithm (ALNS). Case studies with different problem characteristics are conducted to prove the effectiveness of the solution methods proposed in this study. Moreover, the performances of the ALNS and the existing methods for solving the BACASP are compared, and the advantages and disadvantages of different rolling strategies under different degrees of uncertainties are deeply analyzed. … (more)
- Is Part Of:
- Advanced engineering informatics. Volume 54(2022)
- Journal:
- Advanced engineering informatics
- Issue:
- Volume 54(2022)
- Issue Display:
- Volume 54, Issue 2022 (2022)
- Year:
- 2022
- Volume:
- 54
- Issue:
- 2022
- Issue Sort Value:
- 2022-0054-2022-0000
- Page Start:
- Page End:
- Publication Date:
- 2022-10
- Subjects:
- Berth allocation and quay crane assignment -- Adaptive large neighborhood search -- Rolling-horizon optimization -- Discretization strategy -- Heuristic method
Computer-aided engineering -- Periodicals
Engineering -- Data processing -- Periodicals
620.00285 - Journal URLs:
- http://www.sciencedirect.com/science/journal/14740346 ↗
http://books.google.com/books?id=KhFVAAAAMAAJ ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.aei.2022.101733 ↗
- Languages:
- English
- ISSNs:
- 1474-0346
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 0696.851100
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 24447.xml