Bernardo Martin-Iradi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bernardo Martin-Iradi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dario Pacino
Technical University of Denmark
5 shared publications - Stefan Ropke
Technical University of Denmark
5 shared publications - Florian Fuchs2 shared publications
- Francesco Corman
Institute for Transport Planning and Systems, ETH Zürich, Zurich, Switzerland
2 shared publications Stefan Ropke
2 shared publications- Jan Lordieck
Institute for Transport Planning and Systems, Swiss Federal Institute of Technology, ETH Zrich, Zrich, Switzerland
1 shared publication
Latest Publications
- Open Access
- 29 July 2026
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 39
Handling conflicts in microscopic railway timetabling at scale: A parallelized approach
- 29 July 2026
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 39
Open AccessHandling conflicts in microscopic railway timetabling at scale: A parallelized approach
- Open Access
- 16 October 2025
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 36
Optimizing periodic stability in railway timetables: A microscopic model for networks with a macroscopic comparison
- 16 October 2025
- Published by Elsevier in Journal of Rail Transport Planning & Management
- Vol. 36
Open AccessOptimizing periodic stability in railway timetables: A microscopic model for networks with a macroscopic comparison
- 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
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.
- 1 March 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 297 (2) , 511-531
A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
- 1 March 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 297 (2) , 511-531
A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
- Open Access
The multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis
We consider a variant of the berth allocation problem-i.e., the multi-port 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 AccessThe multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis
We consider a variant of the berth allocation problem-i.e., the multi-port 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
A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing
In this study, the periodic train timetabling problem is formulated using a time-space graph formulation. Three solution methods are proposed and compared where solutions are built by what we define as a dive-and-cut-and-price procedure. An LP relaxed version of the problem with a subset of constraints is solved using column generation where each column corresponds to the train paths of a line. Violated constraints are added by separation and a heuristic process is applied to help to find integer solutions. The passenger travel time is computed based on a solution timetable and Benders' optimality cuts are generated allowing the method to integrate the routing of the passengers. We propose two large neighborhood search methods where the solution is iteratively destroyed and repaired into a new one and one random iterative method. The problem is tested on the morning rush hour period of the Regional and InterCity train network of Zealand, Denmark. The solution approaches show robust performance in a variety of scenarios, being able to find good quality solutions in terms of travel time and path length relatively fast. The inclusion of the proposed Benders' cuts provides stronger relaxations to the problem. In addition, the graph formulation covers different real-life constraints and has the potential to easily be extended to accommodate more constraints.
Open AccessA column-generation-based matheuristic for periodic train timetabling with integrated passenger routing
In this study, the periodic train timetabling problem is formulated using a time-space graph formulation. Three solution methods are proposed and compared where solutions are built by what we define as a dive-and-cut-and-price procedure. An LP relaxed version of the problem with a subset of constraints is solved using column generation where each column corresponds to the train paths of a line. Violated constraints are added by separation and a heuristic process is applied to help to find integer solutions. The passenger travel time is computed based on a solution timetable and Benders' optimality cuts are generated allowing the method to integrate the routing of the passengers. We propose two large neighborhood search methods where the solution is iteratively destroyed and repaired into a new one and one random iterative method. The problem is tested on the morning rush hour period of the Regional and InterCity train network of Zealand, Denmark. The solution approaches show robust performance in a variety of scenarios, being able to find good quality solutions in terms of travel time and path length relatively fast. The inclusion of the proposed Benders' cuts provides stronger relaxations to the problem. In addition, the graph formulation covers different real-life constraints and has the potential to easily be extended to accommodate more constraints.