Stefan Ropke
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
Stefan Ropke has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- David Pisinger
Department of Management Engineering Technical University of Denmark Akademivej Building 358 2800 Kgs Lyngby Denmark
9 shared publications - Dario Pacino
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 - Allan Larsen
Department of Management Engineering, Technical University of Denmark, Lyngby, Denmark
4 shared publications - Richard Martin Lusby
Department of Management Engineering, Technical University of Denmark, Kgs. Lyngby, Denmark
4 shared publications - Alberto Santini
Department of Economics and Business, Universitat Pompeu Fabra, 08005 Barcelona, Spain; and UPF Barcelona School of Management, 08005 Barcelona, Spain
3 shared publications
Latest Publications
- 13 October 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 223
Dynamic mobile production vehicle routing problem
- 13 October 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 223
Dynamic mobile production vehicle routing problem
- Open Access
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
One-by-one or all-at-once: gradient-based co-optimization of wind turbine layout, PV design, and cable network in renewable hybrid power plants
Utility-scale wind–PV hybrid power plants couple two technologies that have historically been designed in isolation. Whether their physical design benefits from being optimized jointly, or whether a sequential per-technology problem-solving is enough, has not been tested. This paper introduces a stochastic gradient-based framework that simultaneously determines wind turbine positions, the spatial distribution of PV arrays, the south/east–west split for PV mounting, and the route of the medium-voltage cable network. Discrete PV placement is relaxed via a RAMP topology penalty, and the technical constraints are incorporated into an Augmented Lagrangian reformulation. The framework is applied to a 325 MW wind, 400.2 MW PV, 300 MW grid-connected reference plant from IEA Wind Task 50. Joint optimization reduces wind turbine shading losses by around 40% and shortens the MV cable network by over 1 km. At the nominal start, it lowers total costs by 5.5% compared to the sequential solving. In the presented formulation, whether this translates into higher NPV across different initializations depends on whether the converged solution also produces a compact enough PV layout. Sequential optimization is over 70% faster and yields more regular wind turbine layouts. Thus, the choice between strategies is a trade-off rather than a clear winner. Sensitivity analyses confirm that cable-cost weighting and mini-batch size govern layout compactness and placement quality. The overall gains from co-optimization are thus conditional on both solver settings and initialization.
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOne-by-one or all-at-once: gradient-based co-optimization of wind turbine layout, PV design, and cable network in renewable hybrid power plants
Utility-scale wind–PV hybrid power plants couple two technologies that have historically been designed in isolation. Whether their physical design benefits from being optimized jointly, or whether a sequential per-technology problem-solving is enough, has not been tested. This paper introduces a stochastic gradient-based framework that simultaneously determines wind turbine positions, the spatial distribution of PV arrays, the south/east–west split for PV mounting, and the route of the medium-voltage cable network. Discrete PV placement is relaxed via a RAMP topology penalty, and the technical constraints are incorporated into an Augmented Lagrangian reformulation. The framework is applied to a 325 MW wind, 400.2 MW PV, 300 MW grid-connected reference plant from IEA Wind Task 50. Joint optimization reduces wind turbine shading losses by around 40% and shortens the MV cable network by over 1 km. At the nominal start, it lowers total costs by 5.5% compared to the sequential solving. In the presented formulation, whether this translates into higher NPV across different initializations depends on whether the converged solution also produces a compact enough PV layout. Sequential optimization is over 70% faster and yields more regular wind turbine layouts. Thus, the choice between strategies is a trade-off rather than a clear winner. Sensitivity analyses confirm that cable-cost weighting and mini-batch size govern layout compactness and placement quality. The overall gains from co-optimization are thus conditional on both solver settings and initialization.
- Open Access
- 14 March 2026
- Published by Elsevier in SSRN Electronic Journal
Layout optimization of solar PV systems in hybridized wind farms
Adding solar PV to existing wind farms is one of the more practical ways to get more out of the grid without building new transmission infrastructure — the resources complement each other, and much of the civil and electrical infrastructure is already in place. Yet how to actually lay out the PV within an operating wind farm has received little systematic attention, particularly when infrastructure reuse and the physical interactions between technologies are taken into account.This study proposes a three-step framework for placing utility-scale PV within existing onshore wind farms. First, PV tilt and orientation are optimized for revenue rather than raw energy yield. Second, cost coefficients are assigned spatially across the available area, capturing proximity to existing infrastructure and local shadowing conditions. Third, a mixed-integer quadratic programming (MIQP) model determines the cost-optimal allocation of PV arrays. Compactness is enforced throughout via a minimum average connectivity degree constraint embedded in the formulation, ensuring the resulting layouts are practically achievable.Wind turbine shadow effects are modeled explicitly: tower shadow enters as a revenue penalty, while blade shadow is captured through elevated long-term investment costs. The model simultaneously rewards use of existing cables and roads, so the optimization naturally balances infrastructure-sharing benefits against shadow-related losses. Globally optimal solutions are obtained within practical computation times.The framework is demonstrated on a Danish wind farm, where the effects of clustering requirements and infrastructure parameters on layout outcomes are examined. The results show that cost-aware, spatially realistic hybrid plant design is achievable within a single integrated optimization.
- 14 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLayout optimization of solar PV systems in hybridized wind farms
Adding solar PV to existing wind farms is one of the more practical ways to get more out of the grid without building new transmission infrastructure — the resources complement each other, and much of the civil and electrical infrastructure is already in place. Yet how to actually lay out the PV within an operating wind farm has received little systematic attention, particularly when infrastructure reuse and the physical interactions between technologies are taken into account.This study proposes a three-step framework for placing utility-scale PV within existing onshore wind farms. First, PV tilt and orientation are optimized for revenue rather than raw energy yield. Second, cost coefficients are assigned spatially across the available area, capturing proximity to existing infrastructure and local shadowing conditions. Third, a mixed-integer quadratic programming (MIQP) model determines the cost-optimal allocation of PV arrays. Compactness is enforced throughout via a minimum average connectivity degree constraint embedded in the formulation, ensuring the resulting layouts are practically achievable.Wind turbine shadow effects are modeled explicitly: tower shadow enters as a revenue penalty, while blade shadow is captured through elevated long-term investment costs. The model simultaneously rewards use of existing cables and roads, so the optimization naturally balances infrastructure-sharing benefits against shadow-related losses. Globally optimal solutions are obtained within practical computation times.The framework is demonstrated on a Danish wind farm, where the effects of clustering requirements and infrastructure parameters on layout outcomes are examined. The results show that cost-aware, spatially realistic hybrid plant design is achievable within a single integrated optimization.
- 2 January 2026
- Published by Springer Nature
- p. 81-96
Taxi Re-positioning Considering Driver Compliance
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (2) , 391-412
Designing the Liner Shipping Network of Tomorrow Powered by Alternative Fuels
The liner shipping industry is undergoing an extensive decarbonization process to reduce its 275 million tons of CO2 emissions as of 2018. In this process, the long-term solution is the introduction of new alternative maritime fuels. The introduction of alternative fuels presents a great set of unknowns. Among these are the strategic concerns regarding sourcing of alternative fuels and, operationally, how the new fuels might affect the network of shipping routes. We propose a problem formulation that integrates fuel supply/demand into the liner shipping network design problem. Here, we present a model to determine the production sites and distribution of new alternative fuels—we consider methanol and ammonia. For the network design problem, we apply an adaptive large neighborhood search combined with a delayed column generation process. In addition, we wish to test the effect of designing a robust network under uncertain demand conditions because of the problem’s strategic nature and importance. Therefore, our proposed solution method will have a deterministic and stochastic setup when we apply it to the second-largest multihub instance, WorldSmall, known from LINER-LIB. In the deterministic setting, our proposed solution method finds a new best solution to three instances from LINER-LIB. For the main considered WorldSmall instance, we even noticed a new best solution in all our tested fuel settings. In addition, we note a profit drop of 7.2% between a bunker-powered and pure alternative fuel–powered network. The selected alternative fuel production sites favor a proximity to European ports and have a heavy reliance on wind turbines. The stochastic results clearly showed that the found networks were much more resilient to the demand changes. Neglecting the perspective of uncertain demand leads to highly fluctuating profits. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0143 .
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 59 (2) , 391-412
Designing the Liner Shipping Network of Tomorrow Powered by Alternative Fuels
The liner shipping industry is undergoing an extensive decarbonization process to reduce its 275 million tons of CO2 emissions as of 2018. In this process, the long-term solution is the introduction of new alternative maritime fuels. The introduction of alternative fuels presents a great set of unknowns. Among these are the strategic concerns regarding sourcing of alternative fuels and, operationally, how the new fuels might affect the network of shipping routes. We propose a problem formulation that integrates fuel supply/demand into the liner shipping network design problem. Here, we present a model to determine the production sites and distribution of new alternative fuels—we consider methanol and ammonia. For the network design problem, we apply an adaptive large neighborhood search combined with a delayed column generation process. In addition, we wish to test the effect of designing a robust network under uncertain demand conditions because of the problem’s strategic nature and importance. Therefore, our proposed solution method will have a deterministic and stochastic setup when we apply it to the second-largest multihub instance, WorldSmall, known from LINER-LIB. In the deterministic setting, our proposed solution method finds a new best solution to three instances from LINER-LIB. For the main considered WorldSmall instance, we even noticed a new best solution in all our tested fuel settings. In addition, we note a profit drop of 7.2% between a bunker-powered and pure alternative fuel–powered network. The selected alternative fuel production sites favor a proximity to European ports and have a heavy reliance on wind turbines. The stochastic results clearly showed that the found networks were much more resilient to the demand changes. Neglecting the perspective of uncertain demand leads to highly fluctuating profits. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0143 .
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (6) , 1696-1714
A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams
We present a new flow-based formulation for identical parallel machine scheduling with a regular objective function and without idle time. The formulation is constructed with the help of a decision diagram that represents all job sequences that respect specific ordering rules. These rules rely on a partition of the planning horizon into, generally nonuniform, periods and do not exclude all optimal solutions, but they constrain solutions to adhere to a canonical form. The new formulation has numerous variables and constraints, and hence we apply a Dantzig-Wolfe decomposition to compute the linear programming relaxation in reasonable time; the resulting lower bound is stronger than the bound from the classical time-indexed formulation. We develop a branch-and-price framework that solves three instances from the literature for the first time. We compare the new formulation with the time-indexed and arc time–indexed formulation by means of a series of computational experiments. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was partially funded by the European Union’s Horizon 2020 research and innovation program under [Marie Skłodowska-Curie Grant 754462]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0301 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0301 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (6) , 1696-1714
A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams
We present a new flow-based formulation for identical parallel machine scheduling with a regular objective function and without idle time. The formulation is constructed with the help of a decision diagram that represents all job sequences that respect specific ordering rules. These rules rely on a partition of the planning horizon into, generally nonuniform, periods and do not exclude all optimal solutions, but they constrain solutions to adhere to a canonical form. The new formulation has numerous variables and constraints, and hence we apply a Dantzig-Wolfe decomposition to compute the linear programming relaxation in reasonable time; the resulting lower bound is stronger than the bound from the classical time-indexed formulation. We develop a branch-and-price framework that solves three instances from the literature for the first time. We compare the new formulation with the time-indexed and arc time–indexed formulation by means of a series of computational experiments. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was partially funded by the European Union’s Horizon 2020 research and innovation program under [Marie Skłodowska-Curie Grant 754462]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0301 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0301 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (5) , 919-924
Erratum: “Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows”
The aim of this erratum is to correct an error in the computer implementation of the algorithm proposed by Dabia, Ropke, and van Woensel [Dabia S, Ropke S, van Woensel T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):295–454]. Section 6, “Computational Results,” from the original paper is rewritten to reflect the corrected implementation, the new computational setup, and the updated results.
- 1 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (5) , 919-924
Erratum: “Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows”
The aim of this erratum is to correct an error in the computer implementation of the algorithm proposed by Dabia, Ropke, and van Woensel [Dabia S, Ropke S, van Woensel T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):295–454]. Section 6, “Computational Results,” from the original paper is rewritten to reflect the corrected implementation, the new computational setup, and the updated results.
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (4) , 741-760
Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem
This paper describes an exact branch-and-cut (B&C) algorithm for the split delivery vehicle routing problem. The underlying model is based on a previously proposed two-index vehicle flow formulation that models a relaxation of the problem. We dynamically separate two well-known classes of valid inequalities, namely capacity and connectivity cuts, and use an in-out algorithm to improve the convergence of the cutting phase. We generate no-good cuts from feasible integer solutions to the relaxation using a recently proposed single-commodity flow formulation in the literature. The exact methodology is complemented by a very effective adaptive large neighborhood search (ALNS) heuristic that provides high-quality upper bounds to initiate the B&C algorithm. Key ingredients in the design of the heuristic include the use of a tailored construction algorithm, which can exploit the situation in which the ratio of the number of customers to the minimum number of vehicles needed is low, and the use of a route-based formulation to improve the solutions found before, during, and after the ALNS procedure. An earlier version of this work was submitted to the DIMACS (Center for Discrete Mathematics and Theoretical Computer Science) implementation challenge, where it placed third. On sets of well-known benchmark instances for limited and unlimited fleet variants of the problem, we demonstrate that the heuristic provides very competitive solutions, with respective average gaps of 0.19% and 0.18% from best-known values. Furthermore, the exact B&C framework is also highly competitive with state-of-the-art methods, providing solutions with an average optimality gap of 1.82%. History: This paper has been accepted for the Transportation Science Special Section on DIMACS Implementation Challenge: Vehicle Routing Problems. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.0353 .
- 1 July 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 58 (4) , 741-760
Exact and Heuristic Methods for the Split Delivery Vehicle Routing Problem
This paper describes an exact branch-and-cut (B&C) algorithm for the split delivery vehicle routing problem. The underlying model is based on a previously proposed two-index vehicle flow formulation that models a relaxation of the problem. We dynamically separate two well-known classes of valid inequalities, namely capacity and connectivity cuts, and use an in-out algorithm to improve the convergence of the cutting phase. We generate no-good cuts from feasible integer solutions to the relaxation using a recently proposed single-commodity flow formulation in the literature. The exact methodology is complemented by a very effective adaptive large neighborhood search (ALNS) heuristic that provides high-quality upper bounds to initiate the B&C algorithm. Key ingredients in the design of the heuristic include the use of a tailored construction algorithm, which can exploit the situation in which the ratio of the number of customers to the minimum number of vehicles needed is low, and the use of a route-based formulation to improve the solutions found before, during, and after the ALNS procedure. An earlier version of this work was submitted to the DIMACS (Center for Discrete Mathematics and Theoretical Computer Science) implementation challenge, where it placed third. On sets of well-known benchmark instances for limited and unlimited fleet variants of the problem, we demonstrate that the heuristic provides very competitive solutions, with respective average gaps of 0.19% and 0.18% from best-known values. Furthermore, the exact B&C framework is also highly competitive with state-of-the-art methods, providing solutions with an average optimality gap of 1.82%. History: This paper has been accepted for the Transportation Science Special Section on DIMACS Implementation Challenge: Vehicle Routing Problems. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.0353 .
- Open Access
- 22 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
- 22 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Open AccessSolving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences