Maria Vlasiou
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
Maria Vlasiou has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Bert Zwart
CWI, National Research Institute of Mathematics and Computer Science, Amsterdam, The Netherlands
23 shared publications - Zbigniew Palmowski
Faculty of Pure and Applied Mathematics, Wrocław University of Science and Technology, Wrocław, Poland
9 shared publications - Eleni Vatamidou
Eurandom and Department of Mathematics & Computer Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands
8 shared publications - Angelos Aveklouris
Eindhoven University of Technology
7 shared publications - Onno Boxma
Eindhoven University of Technology
6 shared publications Bert Zwart
Eindhoven University of Technology, Eindhoven, Kingdom of the Netherlands
5 shared publications
Latest Publications
- Open Access
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Optimal Siting and Sizing of Virtual Power Lines in Medium-Voltage Grids for Congestion Management
Energy Storage Systems (ESSs) are a promising solution for managing electrical grid congestion. However, in the European Union, regulations aimed at preventing electricity market interference restrict grid operators from the conventional use of ESSs. To overcome this restriction, Virtual Power Lines (VPLs) have been proposed in earlier research. VPLs are groups of ESSs operated such that their aggregated power is net zero at all time steps, thereby avoiding market interference. We formulate a MILP for the optimal siting and sizing of VPLs.We first show that optimal siting matters more for VPLs than for ESSs: randomized siting captures only 42.1% of the congestion reduction achievable with optimally sited VPLs, but captures 67.6% of that achievable with optimally sited ESSs. Next, we compare VPLs against conventional ESSs and show that VPLs have an effectiveness between 57.6% and 92.6% compared to ESSs of the same size. We also observe that the optimal siting of VPLs places an ESS at the slack node in 94.1% of cases, and validate their importance.These results give grid operators insight into how to use a practical, regulation compliant tool for relieving congestion, while also exposing the price of the policy that makes such workarounds necessary.
- 17 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOptimal Siting and Sizing of Virtual Power Lines in Medium-Voltage Grids for Congestion Management
Energy Storage Systems (ESSs) are a promising solution for managing electrical grid congestion. However, in the European Union, regulations aimed at preventing electricity market interference restrict grid operators from the conventional use of ESSs. To overcome this restriction, Virtual Power Lines (VPLs) have been proposed in earlier research. VPLs are groups of ESSs operated such that their aggregated power is net zero at all time steps, thereby avoiding market interference. We formulate a MILP for the optimal siting and sizing of VPLs.We first show that optimal siting matters more for VPLs than for ESSs: randomized siting captures only 42.1% of the congestion reduction achievable with optimally sited VPLs, but captures 67.6% of that achievable with optimally sited ESSs. Next, we compare VPLs against conventional ESSs and show that VPLs have an effectiveness between 57.6% and 92.6% compared to ESSs of the same size. We also observe that the optimal siting of VPLs places an ESS at the slack node in 94.1% of cases, and validate their importance.These results give grid operators insight into how to use a practical, regulation compliant tool for relieving congestion, while also exposing the price of the policy that makes such workarounds necessary.
- 8 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Scale-Free Cascading Failures: Generalized Approach for All Simple, Connected Graphs
Cascading failures, wherein the failure of one component triggers subsequent failures in complex interconnected systems, pose a significant risk of disruptions and emerge across various domains. Understanding and mitigating the risk of such failures is crucial to minimize their impact and ensure the resilience of these systems. In multiple applications, the failure processes exhibit scale-free behavior in terms of their total failure sizes. Various models have been developed to explain the origin of this scale-free behavior. A recent study proposed a novel hypothesis, suggesting that scale-free failure sizes might be inherited from scale-free input characteristics in power networks. However, the scope of this study excluded certain network topologies. Here, motivated by power networks, we strengthen this hypothesis by generalizing to a broader range of graph topologies where this behavior is manifested. Our approach yields a universal theorem applicable to all simple, connected graphs, revealing that when a cascade leads to network disconnections, the total cascade size exhibits a scale-free tail inherited from the input characteristics. We do so by characterizing cascade sequences of failures in the asymptotic regime. Funding: This work was funded by the Dutch Research Council (NWO) through Gravitation NETWORKS [Grant 024.002.003]
- 8 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Scale-Free Cascading Failures: Generalized Approach for All Simple, Connected Graphs
Cascading failures, wherein the failure of one component triggers subsequent failures in complex interconnected systems, pose a significant risk of disruptions and emerge across various domains. Understanding and mitigating the risk of such failures is crucial to minimize their impact and ensure the resilience of these systems. In multiple applications, the failure processes exhibit scale-free behavior in terms of their total failure sizes. Various models have been developed to explain the origin of this scale-free behavior. A recent study proposed a novel hypothesis, suggesting that scale-free failure sizes might be inherited from scale-free input characteristics in power networks. However, the scope of this study excluded certain network topologies. Here, motivated by power networks, we strengthen this hypothesis by generalizing to a broader range of graph topologies where this behavior is manifested. Our approach yields a universal theorem applicable to all simple, connected graphs, revealing that when a cascade leads to network disconnections, the total cascade size exhibits a scale-free tail inherited from the input characteristics. We do so by characterizing cascade sequences of failures in the asymptotic regime. Funding: This work was funded by the Dutch Research Council (NWO) through Gravitation NETWORKS [Grant 024.002.003]
- Open Access
- 29 April 2026
- Published by Elsevier in Mathematical Biosciences
- Vol. 397, 109708
A potential surrogate model for efficient inference of stochastic GLUT4 translocation
- 29 April 2026
- Published by Elsevier in Mathematical Biosciences
- Vol. 397, 109708
Open AccessA potential surrogate model for efficient inference of stochastic GLUT4 translocation
- Open Access
- 4 November 2025
- Published by Elsevier in Performance Evaluation
- Vol. 170
Comparing approximations in the ASIP tandem queue
- 4 November 2025
- Published by Elsevier in Performance Evaluation
- Vol. 170
Open AccessComparing approximations in the ASIP tandem queue
- Open Access
- 2 September 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 87 (10) , 1-28
Does GLUT4 Queue? A Mechanistic Mathematical Model for Insulin Response in Adipocytes
Mammalian cells regulate their glucose levels by redistributing glucose transporter proteins within the cell. Glucose Transporter 4 (GLUT4) is the main insulin-regulated glucose transporter in mammalian cells. Insulin signals the redistribution of GLUT4 from intracellular compartments to the cell surface. The mechanisms of the release of GLUT4 and subsequent transport to the plasma membrane remain an open question. Here, a biologically plausible model of GLUT4 translocation is presented. Using a stochastic queuing model, we find that changing only the number of fusion sites available for GLUT4-containing vesicles as a function of insulin is sufficient to explain experimental observations. Thus, the activity of the fusion sites could be the primary determinant of the dynamics of GLUT4.
- 2 September 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 87 (10) , 1-28
Open AccessDoes GLUT4 Queue? A Mechanistic Mathematical Model for Insulin Response in Adipocytes
Mammalian cells regulate their glucose levels by redistributing glucose transporter proteins within the cell. Glucose Transporter 4 (GLUT4) is the main insulin-regulated glucose transporter in mammalian cells. Insulin signals the redistribution of GLUT4 from intracellular compartments to the cell surface. The mechanisms of the release of GLUT4 and subsequent transport to the plasma membrane remain an open question. Here, a biologically plausible model of GLUT4 translocation is presented. Using a stochastic queuing model, we find that changing only the number of fusion sites available for GLUT4-containing vesicles as a function of insulin is sufficient to explain experimental observations. Thus, the activity of the fusion sites could be the primary determinant of the dynamics of GLUT4.
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 55 (2) , 85-100
Learning by Doing: The Industrial and Applied Mathematics Program at Eindhoven University of Technology
The Industrial and Applied Mathematics (IAM) master’s program at Eindhoven University of Technology received the INFORMS UPS George D. Smith Prize in 2022. This paper highlights the department’s history, the innovative aspects of the program, and its role in educating operations research practitioners. Eindhoven University of Technology emphasizes industry collaboration, societal involvement, and scientific excellence, principles that are integral to the IAM program.
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 55 (2) , 85-100
Learning by Doing: The Industrial and Applied Mathematics Program at Eindhoven University of Technology
The Industrial and Applied Mathematics (IAM) master’s program at Eindhoven University of Technology received the INFORMS UPS George D. Smith Prize in 2022. This paper highlights the department’s history, the innovative aspects of the program, and its role in educating operations research practitioners. Eindhoven University of Technology emphasizes industry collaboration, societal involvement, and scientific excellence, principles that are integral to the IAM program.
- Open Access
- 22 February 2025
- Published by Springer Nature in Queueing Systems
- Vol. 109 (1) , 1-26
Extreme values for the waiting time in large fork-join queues
We prove that the scaled maximum steady-state waiting time and the scaled maximum steady-state queue length among N GI/GI/1-queues in the N-server fork-join queue converge to a normally distributed random variable as $$N\rightarrow \infty $$ . The maximum steady-state waiting time in this queueing system scales around $$\frac{1}{\gamma }\log N$$ , where $$\gamma $$ is determined by the cumulant generating function $$\Lambda $$ of the service times distribution and solves the Cramér–Lundberg equation with stochastic service times and deterministic interarrival times. This value $$\frac{1}{\gamma }\log N$$ is reached at a certain hitting time. The number of arrivals until that hitting time satisfies the central limit theorem, with standard deviation $$\frac{\sigma _A}{\sqrt{\Lambda '(\gamma )\gamma }}$$ . By using the distributional form of Little’s law, we can extend this result to the maximum queue length. Finally, we extend these results to a fork-join queue with different classes of servers.- 22 February 2025
- Published by Springer Nature in Queueing Systems
- Vol. 109 (1) , 1-26
Open AccessExtreme values for the waiting time in large fork-join queues
We prove that the scaled maximum steady-state waiting time and the scaled maximum steady-state queue length among N GI/GI/1-queues in the N-server fork-join queue converge to a normally distributed random variable as $$N\rightarrow \infty $$ . The maximum steady-state waiting time in this queueing system scales around $$\frac{1}{\gamma }\log N$$ , where $$\gamma $$ is determined by the cumulant generating function $$\Lambda $$ of the service times distribution and solves the Cramér–Lundberg equation with stochastic service times and deterministic interarrival times. This value $$\frac{1}{\gamma }\log N$$ is reached at a certain hitting time. The number of arrivals until that hitting time satisfies the central limit theorem, with standard deviation $$\frac{\sigma _A}{\sqrt{\Lambda '(\gamma )\gamma }}$$ . By using the distributional form of Little’s law, we can extend this result to the maximum queue length. Finally, we extend these results to a fork-join queue with different classes of servers. - 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1587-1599
Polyhedral Restrictions of Feasibility Regions in Optimal Power Flow for Distribution Networks
The optimal power flow (OPF) problem is one of the most fundamental problems in power system operations. The non-linear alternating current (AC) power flow equations that model different physical laws (together with operational constraints) lay the foundation for the feasibility region of the OPF problem. While significant research has focused on convex relaxations, which are approaches to solve an OPF problem by enlarging the true feasibility region, the opposite approach of convex restrictions offers valuable insights as well. Convex restrictions, including polyhedral restrictions, reduce the true feasible region to a convex region, ensuring that it contains only feasible points. In this work, we develop a sequential optimization method that offers a scalable way to obtain (bounds on) solutions to OPF problems for distribution networks. To do so, we first develop sufficient conditions for the existence of feasible power flow solutions in the neighborhood of a specific (feasible) operating point in distribution networks, and second, based on these conditions, we construct a polyhedral restriction of the feasibility region. Our numerical results demonstrate the efficacy of the sequential optimization method as an alternative to existing approaches to obtain (bounds on) solutions to OPF problems for distribution networks. By construction, the optimization problems within the defined restrictions can be solved in polynomial time and are guaranteed to have feasible solutions.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1587-1599
Polyhedral Restrictions of Feasibility Regions in Optimal Power Flow for Distribution Networks
The optimal power flow (OPF) problem is one of the most fundamental problems in power system operations. The non-linear alternating current (AC) power flow equations that model different physical laws (together with operational constraints) lay the foundation for the feasibility region of the OPF problem. While significant research has focused on convex relaxations, which are approaches to solve an OPF problem by enlarging the true feasibility region, the opposite approach of convex restrictions offers valuable insights as well. Convex restrictions, including polyhedral restrictions, reduce the true feasible region to a convex region, ensuring that it contains only feasible points. In this work, we develop a sequential optimization method that offers a scalable way to obtain (bounds on) solutions to OPF problems for distribution networks. To do so, we first develop sufficient conditions for the existence of feasible power flow solutions in the neighborhood of a specific (feasible) operating point in distribution networks, and second, based on these conditions, we construct a polyhedral restriction of the feasibility region. Our numerical results demonstrate the efficacy of the sequential optimization method as an alternative to existing approaches to obtain (bounds on) solutions to OPF problems for distribution networks. By construction, the optimization problems within the defined restrictions can be solved in polynomial time and are guaranteed to have feasible solutions.
- Open Access
- 26 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (9) , 1-41
The Distance Between: An Algorithmic Approach to Comparing Stochastic Models to Time-Series Data
While mean-field models of cellular operations have identified dominant processes at the macroscopic scale, stochastic models may provide further insight into mechanisms at the molecular scale. In order to identify plausible stochastic models, quantitative comparisons between the models and the experimental data are required. The data for these systems have small sample sizes and time-evolving distributions. The aim of this study is to identify appropriate distance metrics for the quantitative comparison of stochastic model outputs and time-evolving stochastic measurements of a system. We identify distance metrics with features suitable for driving parameter inference, model comparison, and model validation, constrained by data from multiple experimental protocols. In this study, stochastic model outputs are compared to synthetic data across three scales: that of the data at the points the system is sampled during the time course of each type of experiment; a combined distance across the time course of each experiment; and a combined distance across all the experiments. Two broad categories of comparators at each point were considered, based on the empirical cumulative distribution function (ECDF) of the data and of the model outputs: discrete based measures such as the Kolmogorov–Smirnov distance, and integrated measures such as the Wasserstein-1 distance between the ECDFs. It was found that the discrete based measures were highly sensitive to parameter changes near the synthetic data parameters, but were largely insensitive otherwise, whereas the integrated distances had smoother transitions as the parameters approached the true values. The integrated measures were also found to be robust to noise added to the synthetic data, replicating experimental error. The characteristics of the identified distances provides the basis for the design of an algorithm suitable for fitting stochastic models to real world stochastic data.
- 26 July 2024
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 86 (9) , 1-41
Open AccessThe Distance Between: An Algorithmic Approach to Comparing Stochastic Models to Time-Series Data
While mean-field models of cellular operations have identified dominant processes at the macroscopic scale, stochastic models may provide further insight into mechanisms at the molecular scale. In order to identify plausible stochastic models, quantitative comparisons between the models and the experimental data are required. The data for these systems have small sample sizes and time-evolving distributions. The aim of this study is to identify appropriate distance metrics for the quantitative comparison of stochastic model outputs and time-evolving stochastic measurements of a system. We identify distance metrics with features suitable for driving parameter inference, model comparison, and model validation, constrained by data from multiple experimental protocols. In this study, stochastic model outputs are compared to synthetic data across three scales: that of the data at the points the system is sampled during the time course of each type of experiment; a combined distance across the time course of each experiment; and a combined distance across all the experiments. Two broad categories of comparators at each point were considered, based on the empirical cumulative distribution function (ECDF) of the data and of the model outputs: discrete based measures such as the Kolmogorov–Smirnov distance, and integrated measures such as the Wasserstein-1 distance between the ECDFs. It was found that the discrete based measures were highly sensitive to parameter changes near the synthetic data parameters, but were largely insensitive otherwise, whereas the integrated distances had smoother transitions as the parameters approached the true values. The integrated measures were also found to be robust to noise added to the synthetic data, replicating experimental error. The characteristics of the identified distances provides the basis for the design of an algorithm suitable for fitting stochastic models to real world stochastic data.
- 26 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Stochastic Systems
Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory
High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].
- 26 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Stochastic Systems
Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory
High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].