P
Pasquale Legato
Researcher at University of Calabria
Publications - 44
Citations - 1327
Pasquale Legato is an academic researcher from University of Calabria. The author has contributed to research in topics: Container (abstract data type) & Simulation-based optimization. The author has an hindex of 15, co-authored 42 publications receiving 1231 citations. Previous affiliations of Pasquale Legato include University of Calabar.
Papers
More filters
Journal ArticleDOI
Models and Tabu Search Heuristics for the Berth-Allocation Problem
TL;DR: In the berth-allocation problem (BAP), the aim is to optimally schedule and assign ships to berthing areas along a quay to minimization of the total service time for all ships.
Journal ArticleDOI
Berth planning and resources optimisation at a container terminal via discrete event simulation
Pasquale Legato,Rina Mary Mazza +1 more
TL;DR: Steady-state simulation results illustrate the use of the queuing network model for a “what if” optimisation approach to the berth planning problem.
Journal ArticleDOI
A queuing network model for the management of berth crane operations
TL;DR: Some decisions on both straddle carrier assignment to berth cranes and hold assignment and sequencing upon the same crane could be improved by the proposed manager-friendly simulation tool.
Journal ArticleDOI
Modeling and solving rich quay crane scheduling problems
TL;DR: A rich model for quay crane scheduling that covers important issues of practical relevance like crane-individual service rates, ready times and due dates for cranes, safety requirements, and precedence relations among container groups is provided.
Journal ArticleDOI
Human resources management at a marine container terminal
Pasquale Legato,M. Flavia Monaco +1 more
TL;DR: This work proposes mathematical programming models for the manpower planning problem in the real context of a marine container terminal and derives solution algorithms by exploiting the mathematical properties of the models: a heuristic approach to a set-covering type problem for the long-term planning, and a branch-and-bound algorithm for the short- term planning.