2015
DOI: 10.1016/j.tre.2015.06.008
|View full text |Cite
|
Sign up to set email alerts
|

Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results

Abstract: Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated berth allocation and quay crane assignment problem in seaport container terminals. We will extend the current stateof-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the eects of dierent discretization schemes and the impact of using a time-v… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
115
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 147 publications
(116 citation statements)
references
References 27 publications
0
115
0
1
Order By: Relevance
“…It is worth remarking that, since this technique is applied prior to the model optimization, such a proposal can be integrated with any approach based on enumerating the variables of the GSPP formulation and solving the resulting model with an integer linear programming algorithm. This strategy has already been adopted by Iris et al (2015), using lower bounds implied by probing the selection of a single assignment or a pair of assignments for two different tasks.…”
Section: Preprocessing Methods For Variable Reductionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is worth remarking that, since this technique is applied prior to the model optimization, such a proposal can be integrated with any approach based on enumerating the variables of the GSPP formulation and solving the resulting model with an integer linear programming algorithm. This strategy has already been adopted by Iris et al (2015), using lower bounds implied by probing the selection of a single assignment or a pair of assignments for two different tasks.…”
Section: Preprocessing Methods For Variable Reductionmentioning
confidence: 99%
“…This section extends our key idea, the matching relaxation of the GSPP structure, into algorithmic results. First, we derive in Section 4.1 a preprocessing method to probe and discard assignments that imply a suboptimal solution, as it is done in the work of Iris et al (2015) in the context of a port logistics problem. Next, we present in Section 4.2 a matheuristic algorithm to find approximate solutions to the problem in reduced computational time.…”
Section: Embedding the Relaxation In A Matheuristic Algorithmmentioning
confidence: 99%
“…However, this policy can either reduce large setup losses due to reallocation of quay cranes, or reduce computational complexity. The comparison between the two policies was addressed by Iris et al [16]. Their conclusion is that timeinvariant QC assignment policy may result in an additional cost.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (16)- (21) ensure that there is no overlap among all vessels in the 2-dimensional berth-time plane. Constraints (16) ensure that Vessel j must be moored at the berth after Vessel i departs if Vessel i is located below Vessel j in the berth-time plane. Constraints (17) ensure that the left side position of Vessel j must be greater than the right side position Vessel i if Vessel i is located in the left of Vessel j in the berth-time plane.…”
Section: T Bpsmentioning
confidence: 99%
See 1 more Smart Citation