Optimal policies for the berth allocation problem under stochastic nature

Ursavas, Evrim; Zhu, Stuart X.

doi:10.1016/j.ejor.2016.04.029

Cited by 52 publications

(25 citation statements)

References 35 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Referring only to a few selected works, the following can be mentioned. Ursavas and Zhu (2016) [33] proposed a stochastic dynamic programing approach to model the berth allocation problem and characterized optimal polices under the stochastic arrival and handling times for vessels of various classes, such as large intercontinental deep-sea vessels or feeder ships and barges. The berth allocation problem for feeder ships and large intercontinental deep-sea vessels was also examined in Emde and Boysen (2016) [34].…”

Section: Literature Reviewmentioning

confidence: 99%

Analysis of Operations upon Entry into Intermodal Freight Terminals

Kostrzewski

2019

Applied Sciences

View full text Add to dashboard Cite

The design of intermodal freight terminals requires extensive research and a thorough analysis of the technical, financial and organizational aspects. In the paper, the operation of the reposition of large cargo containers (one of the types of intermodal transport units, ITUs) on the dedicated places is subjected to a discussion. The analysis is carried out with the use of a vehicle equipped with a telescopic arm, such as a reach stacker. The considered storage facility is reduced to a block characterized by spatial accumulation given in the paper. The description of the procedure for the execution of the handling operation from the arrival of a tractor-trailer with a container into a terminal, followed by the ITUs being set aside in a dedicated place and, in the end, the departure of the truck without load, is given in the paper. The activities are described in detail in order to present a descriptive model of particular operations upon entry to the intermodal freight terminal. Moreover, the paper contains relevant figures illustrating the various steps of realization and the analysis of duration of activities supported by actual realizations. The durations of the individual activities described in the paper are experimental, and the results have been validated on real-world intermodal freight terminals. Therefore, the authors believe that the obtained values may be used in analytical, simulation and numerical models of intermodal freight terminals.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Analysis of Operations upon Entry into Intermodal Freight Terminals

Kostrzewski

2019

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…Lalla-Ruiz et al [22] proposed a set-partitioning-based model for BAP under time-dependent limitations. Ursavas et al [23] proposed optimal policies for the BAP under a stochastic nature. Dulebenets [24] used a novel memetic algorithm with a deterministic parameter control for efficient berth scheduling at marine container terminals.…”

Section: Berth Allocation Problem (Bap)-only Studiesmentioning

confidence: 99%

A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously

et al. 2019

View full text Add to dashboard Cite

Container terminals help countries to sustain their economic development. Improving the operational efficiency in a container terminal is important. In past research, genetic algorithms (GAs) have been widely used to cope with seaside operational problems, including the berth allocation problem (BAP) and quay crane assignment problem (QCAP) individually or simultaneously. However, most GA approaches in past studies were dedicated to generate time-invariant QC assignment that does not adjust QCs assigned to a ship. This may underutilize available QC capacity. In this research, three hybrid GAs (HGAs) have been proposed to deal with the dynamic and discrete BAP (DDBAP) and the dynamic QCAP (DQCAP) simultaneously. The three HGAs supports variable QC assignment in which QCs assigned to a ship can be further adjusted. The three HGAs employ the same crossover operator but a different mutation operator and a two-stage procedure is used. In the first stage, these HGAs can generate a BAP solution and a QCAP solution that is time-invariant. The time-invariant QC assignment solution is then further transformed into a variable one in the second stage. Experiments have been conducted to investigate the effects of the three HGA and the results showed that these HGAs outperformed traditional GAs in terms of fitness value. In particular, the HGA3 with Thoros mutation operator had the best performance.

show abstract

“…Inequalities (41) have the same meaning but for the last time period. Inequalities (42) and (43) enforce γ j k to zero if either β j k = 0 or β j+1 k = 1. Constraints (44) ensure that there must exist a final operating period assigned to each vessel.…”

Section: Additional Tightening With New Variablesmentioning

confidence: 99%

“…As the integrated problem is very complex many approaches consider the two problems separately. For the BAP see, for instance, [16,18,19,27,30,42,46,47]. For the QCASP see [4,13,14,15,25,28,29,32,35,38,40].…”

mentioning

confidence: 99%

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Agra

Oliveira

2018

European Journal of Operational Research

118

View full text Add to dashboard Cite

In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered. A first mathematical model based on the relative position formulation (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables. For the new discretized model several enhancements, such as valid inequalities, are introduced. In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented. A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed. Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii) the effectiveness of the exact approach to solve to optimality a set of real instances; and (iii) the scalability of the RHH based on the enhanced mathematical model which is able to provide good feasible solutions for large size instances.

show abstract

Optimal policies for the berth allocation problem under stochastic nature

Abstract: Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Cited by 52 publications

References 35 publications

Analysis of Operations upon Entry into Intermodal Freight Terminals

Analysis of Operations upon Entry into Intermodal Freight Terminals

A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Contact Info

Product

Resources

About