Dario Pacino

Dario Pacino


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2015 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
ÇIÇağatay Iris
Çağatay Iris
Dario PacinoDario Pacino
Dario Pacino
SRStefan Ropke
Stefan Ropke
ALAllan Larsen
Allan Larsen

1 May 2017 in Transportation Research Part D: Transport and Environment
Verified
Journal Article
Open access
MWM. Wen
M. Wen
Dario PacinoDario Pacino
Dario Pacino
Christos KontovasChristos Kontovas
Christos Kontovas
HPHarilaos N. Psaraftis
Harilaos N. Psaraftis

1 May 2018 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
ÇIÇağatay Iris
Çağatay Iris
JCJonas Christensen
Jonas Christensen
Dario PacinoDario Pacino
Dario Pacino
SRStefan Ropke
Stefan Ropke

6 July 2016 in Flexible Services and Manufacturing Journal
Verified
Journal Article
Closed access
PDF file
KTKevin Tierney
Kevin Tierney
Dario PacinoDario Pacino
Dario Pacino
SVStefan Voß
Stefan Voß

1 October 2016 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
FPFrancisco Parreno
Francisco Parreno
Dario PacinoDario Pacino
Dario Pacino
RARamon Alvarez-Valdes
Ramon Alvarez-Valdes

1 July 2022 in Transportation Science
Verified
Journal Article
Closed access
BMBernardo Martin-Iradi
Bernardo Martin-Iradi
Dario PacinoDario Pacino
Dario Pacino
SRStefan Ropke
Stefan Ropke
We consider a variant of the berth allocation problem—that is, the multiport berth allocation problem—aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds between multiple ports, thereby exploiting the potentials of a collaboration between carriers (shipping lines) and terminal operators. Using a graph representation of the problem, we reformulate an existing mixed-integer problem into a generalized set partitioning problem, in which each variable refers to a sequence of feasible berths in the ports that the vessel visits. By integrating column generation and cut separation in a branch-and-cut-and-price procedure, our proposed method is able to outperform commercial solvers in a set of benchmark instances and adapt better to larger instances. In addition, we apply cooperative game theory methods to efficiently distribute the savings resulting from a potential collaboration and show that both carriers and terminal operators would benefit from collaborating.