Dario Pacino
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dario Pacino has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Stefan Ropke
Technical University of Denmark
6 shared publications - Bernardo Martin-Iradi
DTU Management Technical University of Denmark Akademivej Building 358 2800 Kgs Lyngby Denmark
5 shared publications Rune Møller Jensen
IT University of Copenhagen Rued Langgaards Vej 7 2300 Copenhagen Denmark
5 shared publications- Filipe Rodrigues
Technical University of Denmark, Kongens Lyngby, Denmark
4 shared publications - Daniele Gammelli
Department of Aeronautics and Astronautics, Stanford University, Stanford, CA, USA
3 shared publications - Jonas Christensen
Technical University of Denmark, Produktionstorvet 424, 2800 Kgs. Lyngby, Denmark
3 shared publications
Latest Publications
- Open Access
- 12 August 2026
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 216
Pricing and frequency decisions in RoRo-road freight competition: A multi-leader game-theoretic model
- 12 August 2026
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 216
Open AccessPricing and frequency decisions in RoRo-road freight competition: A multi-leader game-theoretic model
- Open Access
- 6 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 152-167
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
- 6 February 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (1) , 152-167
Open AccessAn adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
- Open Access
- 20 December 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 841-857
Literature survey on the container stowage planning problem
- 20 December 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 317 (3) , 841-857
Open AccessLiterature survey on the container stowage planning problem
- Open Access
Literature Survey on the Container Stowage Planning Problem
Container shipping drives the global economy and is an eco-friendly mode of transportation. A key objective is to maximize the utilization of vessels, which is challenging due to the NP-hardness of stowage planning. This article surveys the literature on the Container Stowage Planning Problem (CSPP). We introduce a classification scheme to analyze single-port and multi-port CSPPs, as well as the hierarchical decomposition of CSPPs into the master and slot planning problem. Our survey shows that the area has a relatively small number of publications and that it is hard to evaluate the industrial applicability of many of the proposed solution methods due to the oversimplification of problem formulations. To address this issue, we propose a research agenda with directions for future work, including establishing a representative problem definition and providing new benchmark instances where needed.
Open AccessLiterature Survey on the Container Stowage Planning Problem
Container shipping drives the global economy and is an eco-friendly mode of transportation. A key objective is to maximize the utilization of vessels, which is challenging due to the NP-hardness of stowage planning. This article surveys the literature on the Container Stowage Planning Problem (CSPP). We introduce a classification scheme to analyze single-port and multi-port CSPPs, as well as the hierarchical decomposition of CSPPs into the master and slot planning problem. Our survey shows that the area has a relatively small number of publications and that it is hard to evaluate the industrial applicability of many of the proposed solution methods due to the oversimplification of problem formulations. To address this issue, we propose a research agenda with directions for future work, including establishing a representative problem definition and providing new benchmark instances where needed.
- Open Access
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a set of ships simultaneously in multiple ports while also considering the sailing speed of ships between ports. Due to the highly combinatorial character of the problem, exact methods struggle to scale to large-size instances, which points to exploring heuristic methods. We present a mixed-integer problem formulation for the MCBAP and introduce an adaptive large neighborhood search (ALNS) algorithm enhanced with a local search procedure to solve it. The computational results highlight the method's suitability for larger instances by providing high-quality solutions in short computational times. Practical insights indicate that the carriers' and terminal operators' operational costs are impacted in different ways by fuel prices, external ships at port, and the modeling of a continuous quay.
Open AccessAn adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the multi-port continuous berth allocation problem (MCBAP). This problem optimizes the berth allocation of a set of ships simultaneously in multiple ports while also considering the sailing speed of ships between ports. Due to the highly combinatorial character of the problem, exact methods struggle to scale to large-size instances, which points to exploring heuristic methods. We present a mixed-integer problem formulation for the MCBAP and introduce an adaptive large neighborhood search (ALNS) algorithm enhanced with a local search procedure to solve it. The computational results highlight the method's suitability for larger instances by providing high-quality solutions in short computational times. Practical insights indicate that the carriers' and terminal operators' operational costs are impacted in different ways by fuel prices, external ships at port, and the modeling of a continuous quay.
- 14 September 2022
- Published by Springer Nature
- p. 31-43
The Multi-port Continuous Berth Allocation Problem with Speed Optimization
- 14 September 2022
- Published by Springer Nature
- p. 31-43
The Multi-port Continuous Berth Allocation Problem with Speed Optimization
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 56 (4) , 972-999
The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis
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.
- 1 July 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 56 (4) , 972-999
The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis
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.
- Open Access
Generalized Multi-Output Gaussian Process Censored Regression
When modelling censored observations, a typical approach in current regression methods is to use a censored-Gaussian (i.e. Tobit) model to describe the conditional output distribution. In this paper, as in the case of missing data, we argue that exploiting correlations between multiple outputs can enable models to better address the bias introduced by censored data. To do so, we introduce a heteroscedastic multi-output Gaussian process model which combines the non-parametric flexibility of GPs with the ability to leverage information from correlated outputs under input-dependent noise conditions. To address the resulting inference intractability, we further devise a variational bound to the marginal log-likelihood suitable for stochastic optimization. We empirically evaluate our model against other generative models for censored data on both synthetic and real world tasks and further show how it can be generalized to deal with arbitrary likelihood functions. Results show how the added flexibility allows our model to better estimate the underlying non-censored (i.e. true) process under potentially complex censoring dynamics.
Open AccessGeneralized Multi-Output Gaussian Process Censored Regression
When modelling censored observations, a typical approach in current regression methods is to use a censored-Gaussian (i.e. Tobit) model to describe the conditional output distribution. In this paper, as in the case of missing data, we argue that exploiting correlations between multiple outputs can enable models to better address the bias introduced by censored data. To do so, we introduce a heteroscedastic multi-output Gaussian process model which combines the non-parametric flexibility of GPs with the ability to leverage information from correlated outputs under input-dependent noise conditions. To address the resulting inference intractability, we further devise a variational bound to the marginal log-likelihood suitable for stochastic optimization. We empirically evaluate our model against other generative models for censored data on both synthetic and real world tasks and further show how it can be generalized to deal with arbitrary likelihood functions. Results show how the added flexibility allows our model to better estimate the underlying non-censored (i.e. true) process under potentially complex censoring dynamics.
- 26 April 2022
- Published by Elsevier in Pattern Recognition
- Vol. 129
Generalized multi-output Gaussian process censored regression
- 26 April 2022
- Published by Elsevier in Pattern Recognition
- Vol. 129
Generalized multi-output Gaussian process censored regression