A robust optimization approach to the integrated berth allocation and quay crane assignment problem

Shang, Xiao Ting; Cao, Jin Xin; Ren, Jie

doi:10.1016/j.tre.2016.06.011

Cited by 78 publications

(45 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance of each individual family of inequalities is also discussed. The proposed ALNS outperforms the state-of-the-art heuristics of Meisel and Bierwirth [29] and Shang et al [36] with respect to solution quality for many instances. New best upper and lower bounds are found for all instances.…”

Section: Introductionmentioning

confidence: 86%

See 1 more Smart Citation

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Iris

Pacino

Røpke

2017

Transportation Research Part E: Logistics and Transportation Re

108

View full text Add to dashboard Cite

This paper focuses on the integrated berth allocation and quay crane assignment problem in container terminals. We consider the decrease in the marginal productivity of quay cranes and the increase in handling time due to deviation from the desired position. We consider a continuous berth, discretized in small equal-sized sections. A number of enhancements over the state-of-the-art formulation and an Adaptive Large Neighborhood Search (ALNS) heuristic are presented. Computational results reveal that the enhancements improve many of the best-known bounds, and the ALNS outperforms the state-of-the-art heuristics for many instances. We also conduct further analysis on a new larger benchmark.

show abstract

Section: Introductionmentioning

confidence: 86%

“…The temporal property is dynamic because the arrival time of each vessel imposes a bound for the berthing start time. We assume that all parameters are known in advance (see Golias et al [9] and Shang et al [36] for berth planning problems under uncertainty).…”

Section: Introductionmentioning

confidence: 99%

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Iris

Pacino

Røpke

2017

Transportation Research Part E: Logistics and Transportation Re

108

View full text Add to dashboard Cite

show abstract

“…Giallombardo et al (2010) develop a heuristic based on tabu search to solve the BAQCAP, and evaluate the superiority of the proposed heuristic solution algorithm. Shang et al (2016) formulate the BAQCAP as a robust optimization model, and develop a GA and an insertion heuristic algorithm to solve the model. It is noted that all the solution algorithms reviewed above are not exact.…”

Section: The Integrated Berth Allocation and Qc Assignment Problemsmentioning

confidence: 99%

Berth Allocation and Quay Crane Assignment for the Trade-off Between Service Efficiency and Operating Cost Considering Carbon Emission Taxation

Wang

Fang

et al. 2020

Transportation Science

View full text Add to dashboard Cite

To sustain the development of maritime transportation, “green ports,” which operate with a good balance between environmental impact and economic interests, have been the focus of port operators and government agencies and are required to look into energy saving and emission reduction initiatives. One such reduction strategy proposed by the International Maritime Organization suggested imposing a carbon emission tax on ports as a long-term solution to reduce carbon emissions, but this would definitely increase the operating cost of ports. Quay cranes (QCs), as one type of handling equipment, play an important role in the service efficiency and carbon emission of ports. Therefore, this paper makes an effort to explore the study of the integrated berth allocation and QC assignment problem with the consideration of carbon emission taxation. This problem is formulated as a biobjective integer programming model, aimed at minimizing the total completion delay of all tasks and the total operating costs for all QCs. Finally, numerical experiments are performed to assess the applicability of the proposed models and evaluate the efficiency of the developed solution algorithm.

show abstract

“…Some recent studies have focused on BSP in emergency or uncertain situations. Hendriks et al [28], Xu et al [29], Golias et al [30], Zhen [31], and Shang et al [32] focus on robust berth scheduling methods to mitigate the impact of uncertain delay of vessel arrivals and fluctuation of handling time. Xu et al [33] investigate the collaborative emergency berth scheduling in the situation of unexpected shutdown of a terminal.…”

Section: Literature Reviewmentioning

confidence: 99%

“…For each p j (j = 1, 2, • • • , m), add rectangle i into p j and set initial x i and y i according to p j . Recalculate y i using expression (32) and then calculate d i using expression (33). Record the new position and height of rectangle i in p j .…”

Section: Encoding and Decoding Of Solutionsmentioning

confidence: 99%

Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel

Xue

2018

Sustainability

View full text Add to dashboard Cite

In view of the trend of upsizing ships, the physical limitations of natural waterways, huge expenses, and unsustainable environmental impact of channel widening, this paper aims to provide a cost-efficient but applicable solution to improve the operational performance of container terminals that are enduring inefficiency caused by channel traffic limitations. We propose a novel berth scheduling problem considering the traffic limitations in the navigation channel, which appears in many cases including insufficient channel width, bad weather, poor visibility, channel accidents, maintenance dredging of the navigation channel, large vessels passing through the channel, and so on. To optimally utilize the berth and improve the service quality for customers, we propose a mixed-integer linear programming model to formulate the berth scheduling problem under the one-way ship traffic rule in the navigation channel. Furthermore, we develop a more generalized model which can cope with hybrid traffic in the navigation channel including one-way traffic, two-way traffic, and temporary closure of the navigation channel. For large-scale problems, a hybrid simulated annealing algorithm, which employs a problem-specific heuristic, is presented to reduce the computational time. Computational experiments are performed to evaluate the effectiveness and practicability of the proposed method.

show abstract

A robust optimization approach to the integrated berth allocation and quay crane assignment problem

Cited by 78 publications

References 30 publications

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem

Berth Allocation and Quay Crane Assignment for the Trade-off Between Service Efficiency and Operating Cost Considering Carbon Emission Taxation

Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel

Contact Info

Product

Resources

About