A Fully Fuzzy Linear Programming Model to the Berth Allocation Problem

Segura, Flabio Gutiérrez; Lujan, Edwar; Vergara-Moreno, Edmundo; Uceda, Rafael Asmat

doi:10.15439/2017f339

Cited by 9 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was presumed that the berthing layout was continuous and that ship's arrival and processing times were known with certainty. Segura et al 7 developed a fuzzy linear programming model for the continuous and dynamic BAP, aimed at minimizing the total waiting time for all ships at Port Valencia (Spain) berths. It was assumed that each ship had a draft that was smaller or equal to the quay draft, and no consideration was given to the safety distance between ships.…”

Section: Literature Reviewmentioning

confidence: 99%

“…4,5 In terminal ports operations planning, the berth allocation problem (BAP) is a main terminal port operation which aims at determining the berthing time and location of a fleet of vessels expected to arrive at a terminal within a specified planning horizon while meeting several spatial and temporal constraints. 6,7 To solve the BAP, the set of arriving vessels with their lengths and drafts, expected arrival times, estimated handling times, and berth should be identified in advance. Then, berthing time, departure time, and position of the vessel can be determined.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal berth allocation under regular and emergent vessel arrivals

Al–Refaie

Abedalqader

2020

Proceedings of the Institution of Mechanical Engineers, Part M:

View full text Add to dashboard Cite

This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.

show abstract

Section: Literature Reviewmentioning

confidence: 99%