Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation

Yu, Jingjing; Tang, Guoan; Song, Xueguan

doi:10.1016/j.tre.2022.102651

Cited by 27 publications

(10 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Martin-Iradi et al (2022a) extended the branch-and-price method to the MBAP with a continuous quay, the same problem of this study, and showed that exact methods are competitive for small and medium size instances but struggle to scale for larger instances. Recently, Yu et al (2022) presented a genetic algorithm to solve a problem that integrates the BAP with speed optimization and vessel service differentiation to address both vertical and horizontal collaborations.…”

Section: Literature Reviewmentioning

confidence: 99%

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem

Martin-Iradi¹,

Pacino²,

Røpke³

2023

Preprint

View full text Add to dashboard Cite

In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a set of ships simultaneously in multiple ports while also considering the sailing speed of ships between ports. Due to the highly combinatorial character of the problem, exact methods struggle to scale to large-size instances, which points to exploring heuristic methods. We present a mixed-integer problem formulation for the MCBAP and introduce an adaptive large neighborhood search (ALNS) algorithm enhanced with a local search procedure to solve it. The computational results highlight the method's suitability for larger instances by providing high-quality solutions in short computational times. Practical insights indicate that the carriers' and terminal operators' operational costs are impacted in different ways by fuel prices, external ships at port, and the modeling of a continuous quay.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem

Martin-Iradi¹,

Pacino²,

Røpke³

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The fitness evaluation value is inverse proportion to the objective function value consequently. The reciprocal of the objective value is widely used in the literature and was selected in this study [25,[54][55][56]. The function is given below.…”

Section: Fitness Evaluationmentioning

confidence: 99%

Effect of Service Priority on the Integrated Continuous Berth Allocation and Quay Crane Assignment Problem after Port Congestion

Tang

Ji³

et al. 2022

JMSE

View full text Add to dashboard Cite

Container seaport congestion is a challenging problem in improving the service level and optimizing evacuating container vessels after congestion. There is a lack of research on container vessel evacuation strategies for continuous terminals. In this article, the weight of the objective function is regarded as the index for the service priority of vessels. The effects of the service priority on the continuous terminal are analyzed by establishing a mixed integer programming model. The model minimizes the total weighted delay departure time of vessels. Two sets of weight values are adopted, including handling volume of each ship and the squared handling volume, then the optimization results are compared with the unweighted scenario. The model is solved using a genetic algorithm. Lianyungang Port is selected as a case study. The results show that the method using the square of handled container volume is more conducive to ensuring the shipping period of large vessels after congestion. Besides, the quay crane number of large vessels affecting the scheduling strategy is discussed. The method proposed in this article provides a new idea for arranging scheduling strategies in other ports under congestion situations, which can better ensure the planned shipping period of large vessels.

show abstract

“…Thus, it is deemed to be the best meeting point for the container terminal and shipping companies to jointly practice the JIT arrival for container ships. Distinguished by the conditions of data exchange, there are two modes of the BACAP under the JIT arrival, i.e., the BACAP-VSO collaboration mode (see Figure 1) and the BACAP-VSO cooperation mode (see Figure 2), as summarized in Yu et al (2022). The BACAP-VSO collaboration mode is exhibited in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

Towards Just-In-Time Arrival for Container Ships by the Integration of Prediction Models

Yu,

Voß

2023

Proceedings of the Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

Within the context of green shipping, the concept of Just-In-Time (JIT) arrival has attracted much attention. Research achieves the JIT arrival for container ships by combining the berth allocation and quay crane assignment problem (BACAP) and the vessel speed optimization (VSO), both subject to the data exchange. Many prediction models of the research to date generally aim to reduce the uncertainty of the communicated estimated time of arrivals. There is a lack of research that simultaneously assesses the application effect of prediction models on both plans of the BACAP and the VSO. Therefore, this paper proposes a twostage model that integrates the prediction of the vessel arrival time with the optimization of the BACAP-VSO.The application in our specific case study shows that the random forest performs best in the first stage. The results are forwarded to the second stage and lead to a reduction of the service delay, fuel consumption cost, and vessel emissions.

show abstract

Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation

Cited by 27 publications

References 53 publications

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem

Effect of Service Priority on the Integrated Continuous Berth Allocation and Quay Crane Assignment Problem after Port Congestion

Towards Just-In-Time Arrival for Container Ships by the Integration of Prediction Models

Contact Info

Product

Resources

About