2019
DOI: 10.1016/j.ejor.2018.07.019
|View full text |Cite
|
Sign up to set email alerts
|

The berth allocation problem in terminals with irregular layouts

Abstract: As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and depa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(8 citation statements)
references
References 35 publications
0
8
0
Order By: Relevance
“…In Correcher et al [2019], they presented a PABD variant, a Mixed Integer Linear Programming (MILP) formulation, a heuristic based on Iteruntild Local Search (ILS) and a Ruin & Recreuntil framework, which were able to obtain optimal solutions or almost optimal for this new variant of the problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In Correcher et al [2019], they presented a PABD variant, a Mixed Integer Linear Programming (MILP) formulation, a heuristic based on Iteruntild Local Search (ILS) and a Ruin & Recreuntil framework, which were able to obtain optimal solutions or almost optimal for this new variant of the problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Thus, the BLH may perform badly in the presence of desirable berthing positions because it does not take them into account. Hence, the BLH is usually replaced by a more general MCIH that consists of inserting the vessels in the time‐space diagram, one by one, in the available position false(sk,bkfalse)$(s_k,b_k)$ with the minimum allocation cost (see, for instance, Correcher, 2017). The minimum allocation cost for each vessel k is usually given by the value of the objective function for such a vessel, that is, Costk=w1(skak)+w2|bkpk|$Cost_k = w_1(s_k-a_k)+w_2|b_k-p_k|$.…”
Section: Extension Of the Proposed Insertion Strategies To Other Bapsmentioning
confidence: 99%
“…Buhrkal et al [8] reviews and describes three main models for the discrete BAP and enhances the performance of one. A mixed integer linear programming formulation and a heuristic are presented for the BAP in [12]. Tavakkoli-Moghaddam et al [43] models the quay crane scheduling and assignment problem as mixed-integer programming and proposes a genetic algorithm to cope with some real-sized instances.…”
Section: Related Workmentioning
confidence: 99%
“…Equation (11) states that the departure time of each vessel is equal to the latest finish time of all quay cranes which work on it. Constraint (12) calculates the departure delay according to a desirable process time which is based on the assignment of the maximum possible number of cranes to the vessel (Qmax i ). Constraint ( 13) is for respecting the vessel's length at the berth and assures that no more than one vessel can moor in each point at the same time.…”
Section: Objectivesmentioning
confidence: 99%