Tito Homem-De-Mello
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
Tito Homem-De-Mello has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Frédéric Babonneau
KEDGE Business School, Bordeaux, France
5 shared publications - Alexandre Street
Department of Industrial Engineering PUC-Rio
3 shared publications - Francisca Jalil-Vega
Department of Chemical Engineering, Imperial College London, C509 Roderic Hill Building, South Kensington Campus, London, SW7 2AZ, United Kingdom
3 shared publications Alexander Shapiro
2 shared publications- Alexander Shapiro
Georgia Institute of Technology 30332 Atlanta Georgia USA
2 shared publications Bernardo K. Pagnoncelli
2 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
A Data-Driven Multistage Stochastic Programming Approach to Energy Storage Management in Residential Microgrids
The integration of Distributed Energy Resources (DERs) into the grid introduces significant stochasticity, requiring robust real-time management strategies at the grid edge. This paper presents GEMA, an integrated framework for the optimal dispatch of residential storage that bridges data-driven forecasting with computationally efficient multistage stochastic optimization. We utilize Long Short-Term Memory (LSTM) neural networks with Monte Carlo dropout to generate probabilistic scenarios for demand and solar generation, capturing the time-varying uncertainty inherent to renewable prosumers. Unlike standard approaches that rely on simplified heuristics or computationally expensive mixed-integer programming, our model employs Stochastic Dual Dynamic Programming (SDDP). This enables rigorous handling of stochastic scenarios at 30-minute resolution while maintaining the computational speed required for rolling-horizon deployment. Uniquely, GEMA is not limited to simulation; it is experimentally validated on a fully operational, grid-connected microgrid in central-southern Chile. Results demonstrate that GEMA outperforms price-based control in every month of the simulated year, and that on the deployed microgrid it delivers a consistent daily profit advantage while closely tracking a perfect-information benchmark, thereby unlocking the economic flexibility of residential storage. The proposed framework provides a scalable, hardware-validated pipeline to transform passive residential connections into active, optimized grid nodes.
- 8 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Data-Driven Multistage Stochastic Programming Approach to Energy Storage Management in Residential Microgrids
The integration of Distributed Energy Resources (DERs) into the grid introduces significant stochasticity, requiring robust real-time management strategies at the grid edge. This paper presents GEMA, an integrated framework for the optimal dispatch of residential storage that bridges data-driven forecasting with computationally efficient multistage stochastic optimization. We utilize Long Short-Term Memory (LSTM) neural networks with Monte Carlo dropout to generate probabilistic scenarios for demand and solar generation, capturing the time-varying uncertainty inherent to renewable prosumers. Unlike standard approaches that rely on simplified heuristics or computationally expensive mixed-integer programming, our model employs Stochastic Dual Dynamic Programming (SDDP). This enables rigorous handling of stochastic scenarios at 30-minute resolution while maintaining the computational speed required for rolling-horizon deployment. Uniquely, GEMA is not limited to simulation; it is experimentally validated on a fully operational, grid-connected microgrid in central-southern Chile. Results demonstrate that GEMA outperforms price-based control in every month of the simulated year, and that on the deployed microgrid it delivers a consistent daily profit advantage while closely tracking a perfect-information benchmark, thereby unlocking the economic flexibility of residential storage. The proposed framework provides a scalable, hardware-validated pipeline to transform passive residential connections into active, optimized grid nodes.
- Open Access
- 4 July 2026
- Published by Elsevier in SSRN Electronic Journal
A Cost-Optimization Framework for Assessing Green Ammonia Regional Maritime Demand and Bunkering
We develop a methodology to endogenously estimate green ammonia demand based on a spatial optimization model and demonstrate its application by assessing Chile’s potential role as a green ammonia supplier for maritime transport. The model simultaneously determines the optimal location and capacity of bunkering facilities, vessel retrofitting decisions, and fuel supply flows while minimizing the total annualized system cost. Results indicate that carbon prices below 230USD/tCO2 are insufficient to trigger investment in green ammonia infrastructure under baseline cost assumptions, highlighting the importance of market-based measures for maritime decarbonization. Sensitivity analyses show that fuel production costs strongly influence both the carbon-price threshold required for market uptake and Chile’s competitiveness. Relatively small production cost advantages substantially increase its market share and can eventually enable Chile to become the dominant supplier. The proposed framework provides a quantitative tool to evaluate carbon-pricing policies, infrastructure deployment, and the competitiveness of emerging green fuel exporters
- 4 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Cost-Optimization Framework for Assessing Green Ammonia Regional Maritime Demand and Bunkering
We develop a methodology to endogenously estimate green ammonia demand based on a spatial optimization model and demonstrate its application by assessing Chile’s potential role as a green ammonia supplier for maritime transport. The model simultaneously determines the optimal location and capacity of bunkering facilities, vessel retrofitting decisions, and fuel supply flows while minimizing the total annualized system cost. Results indicate that carbon prices below 230USD/tCO2 are insufficient to trigger investment in green ammonia infrastructure under baseline cost assumptions, highlighting the importance of market-based measures for maritime decarbonization. Sensitivity analyses show that fuel production costs strongly influence both the carbon-price threshold required for market uptake and Chile’s competitiveness. Relatively small production cost advantages substantially increase its market share and can eventually enable Chile to become the dominant supplier. The proposed framework provides a quantitative tool to evaluate carbon-pricing policies, infrastructure deployment, and the competitiveness of emerging green fuel exporters
- Open Access
- 22 August 2025
- Published by Elsevier in Journal of Cleaner Production
- Vol. 523
Integrated long-term energy planning with vehicle-to-grid for decarbonization of the Chilean energy system
- 22 August 2025
- Published by Elsevier in Journal of Cleaner Production
- Vol. 523
Open AccessIntegrated long-term energy planning with vehicle-to-grid for decarbonization of the Chilean energy system
- 1 January 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (1) , 22-39
Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting
Application-Driven Learning: Closing the Loop Between the Application and the Estimation of Forecast Models This paper introduces a closed-loop framework called application-driven learning, where the best forecast model is tailored to the application cost structure. Our methodology employs two-stage optimization schemes to derive multivariate point forecasts. The estimation problem is conceived as a bilevel model, and we propose two solution methodologies: an exact one using KKT conditions and a scalable decomposition heuristic. This approach offers a scientifically grounded alternative to ad hoc demand biasing approaches and reserve requirement rules currently adopted by power system operators worldwide. Testing with real data and large-scale systems demonstrates that our methodology consistently outperforms traditional open-loop methods, providing significant potential benefits for energy system operations.
- 1 January 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (1) , 22-39
Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting
Application-Driven Learning: Closing the Loop Between the Application and the Estimation of Forecast Models This paper introduces a closed-loop framework called application-driven learning, where the best forecast model is tailored to the application cost structure. Our methodology employs two-stage optimization schemes to derive multivariate point forecasts. The estimation problem is conceived as a bilevel model, and we propose two solution methodologies: an exact one using KKT conditions and a scalable decomposition heuristic. This approach offers a scientifically grounded alternative to ad hoc demand biasing approaches and reserve requirement rules currently adopted by power system operators worldwide. Testing with real data and large-scale systems demonstrates that our methodology consistently outperforms traditional open-loop methods, providing significant potential benefits for energy system operations.
- Open Access
Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting
Forecasting and decision-making are generally modeled as two sequential steps with no feedback, following an open-loop approach. In this paper, we present application-driven learning, a new closed-loop framework in which the processes of forecasting and decision-making are merged and co-optimized through a bilevel optimization problem. We present our methodology in a general format and prove that the solution converges to the best estimator in terms of the expected cost of the selected application. Then, we propose two solution methods: an exact method based on the KKT conditions of the second-level problem and a scalable heuristic approach suitable for decomposition methods. The proposed methodology is applied to the relevant problem of defining dynamic reserve requirements and conditional load forecasts, offering an alternative approach to current ad hoc procedures implemented in industry practices. We benchmark our methodology with the standard sequential least-squares forecast and dispatch planning process. We apply the proposed methodology to an illustrative system and to a wide range of instances, from dozens of buses to large-scale realistic systems with thousands of buses. Our results show that the proposed methodology is scalable and yields consistently better performance than the standard open-loop approach.
Open AccessApplication-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting
Forecasting and decision-making are generally modeled as two sequential steps with no feedback, following an open-loop approach. In this paper, we present application-driven learning, a new closed-loop framework in which the processes of forecasting and decision-making are merged and co-optimized through a bilevel optimization problem. We present our methodology in a general format and prove that the solution converges to the best estimator in terms of the expected cost of the selected application. Then, we propose two solution methods: an exact method based on the KKT conditions of the second-level problem and a scalable heuristic approach suitable for decomposition methods. The proposed methodology is applied to the relevant problem of defining dynamic reserve requirements and conditional load forecasts, offering an alternative approach to current ad hoc procedures implemented in industry practices. We benchmark our methodology with the standard sequential least-squares forecast and dispatch planning process. We apply the proposed methodology to an illustrative system and to a wide range of instances, from dozens of buses to large-scale realistic systems with thousands of buses. Our results show that the proposed methodology is scalable and yields consistently better performance than the standard open-loop approach.
- 27 March 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 191
Uncertainty dynamics in energy planning models: An autoregressive and Markov chain modeling approach
- 27 March 2024
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 191
Uncertainty dynamics in energy planning models: An autoregressive and Markov chain modeling approach
- 27 October 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 428
Measuring the impact of regional climate change on heating and cooling demand for the Chilean energy transition
- 27 October 2023
- Published by Elsevier in Journal of Cleaner Production
- Vol. 428
Measuring the impact of regional climate change on heating and cooling demand for the Chilean energy transition
- Open Access
- 28 March 2023
- Published by Elsevier in Energy Policy
- Vol. 177
The role of hydrogen for deep decarbonization of energy systems: A Chilean case study
- 28 March 2023
- Published by Elsevier in Energy Policy
- Vol. 177
Open AccessThe role of hydrogen for deep decarbonization of energy systems: A Chilean case study
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (5) , 2845-2865
A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties
The appointment scheduling problem (ASP) studies how to manage patient arrivals to a healthcare system to improve system performance. An important challenge occurs when some patients may not show up for an appointment. Although the ASP is well studied in the literature, the vast majority of the existing work does not consider the well-observed phenomenon that patient no-show is influenced by the appointment time, the usual decision variable in the ASP. This paper studies the ASP with random service time (exogenous uncertainty) with known distribution and patient decision-dependent no-show behavior (endogenous uncertainty). This problem belongs to the class of stochastic optimization with decision-dependent uncertainties. Such problems are notoriously difficult as they are typically nonconvex. We propose a stochastic projected gradient path (SPGP) method to solve the problem, which requires the development of a gradient estimator of the objective function—a nontrivial task, as the literature on gradient-based optimization algorithms for problems with decision-dependent uncertainty is very scarce and unsuitable for our model. Our method can solve the ASP problem under arbitrarily smooth show-up probability functions. We present solutions under different patterns of no-show behavior and demonstrate that breaking the assumption of constant show-up probability substantially changes the scheduling solutions. We conduct numerical experiments in a variety of settings to compare our results with those obtained with a distributionally robust optimization method developed in the literature. The cost reduction obtained with our method, which we call the value of distribution information, can be interpreted as how much the system performance can be improved by knowing the distribution of the service times, compared to not knowing it. We observe that the value of distribution information is up to 31% of the baseline cost, and that such value is higher when the system is crowded or/and the waiting time cost is relatively high. Summary of Contribution: This paper studies an appointment scheduling problem under time-dependent patient no-show behavior, a situation commonly observed in practice. The problem belongs to the class of stochastic optimization problems with decision-dependent uncertainties in the operations research literature. Such problems are notoriously difficult to solve as a result of the lack of convexity, and the present case requires different techniques because of the presence of continuous distributions for the service times. A stochastic projected gradient path method, which includes the development of specialized techniques to estimate the gradient of the objective function, is proposed to solve the problem. For problems with a similar structure, the algorithm can be applied once the gradient estimator of the objective function is obtained. Extensive numerical studies are presented to demonstrate the quality of the solutions, the importance of modeling time-dependent no-shows in appointment scheduling, and the value of using distribution information about the service times.
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (5) , 2845-2865
A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties
The appointment scheduling problem (ASP) studies how to manage patient arrivals to a healthcare system to improve system performance. An important challenge occurs when some patients may not show up for an appointment. Although the ASP is well studied in the literature, the vast majority of the existing work does not consider the well-observed phenomenon that patient no-show is influenced by the appointment time, the usual decision variable in the ASP. This paper studies the ASP with random service time (exogenous uncertainty) with known distribution and patient decision-dependent no-show behavior (endogenous uncertainty). This problem belongs to the class of stochastic optimization with decision-dependent uncertainties. Such problems are notoriously difficult as they are typically nonconvex. We propose a stochastic projected gradient path (SPGP) method to solve the problem, which requires the development of a gradient estimator of the objective function—a nontrivial task, as the literature on gradient-based optimization algorithms for problems with decision-dependent uncertainty is very scarce and unsuitable for our model. Our method can solve the ASP problem under arbitrarily smooth show-up probability functions. We present solutions under different patterns of no-show behavior and demonstrate that breaking the assumption of constant show-up probability substantially changes the scheduling solutions. We conduct numerical experiments in a variety of settings to compare our results with those obtained with a distributionally robust optimization method developed in the literature. The cost reduction obtained with our method, which we call the value of distribution information, can be interpreted as how much the system performance can be improved by knowing the distribution of the service times, compared to not knowing it. We observe that the value of distribution information is up to 31% of the baseline cost, and that such value is higher when the system is crowded or/and the waiting time cost is relatively high. Summary of Contribution: This paper studies an appointment scheduling problem under time-dependent patient no-show behavior, a situation commonly observed in practice. The problem belongs to the class of stochastic optimization problems with decision-dependent uncertainties in the operations research literature. Such problems are notoriously difficult to solve as a result of the lack of convexity, and the present case requires different techniques because of the presence of continuous distributions for the service times. A stochastic projected gradient path method, which includes the development of specialized techniques to estimate the gradient of the objective function, is proposed to solve the problem. For problems with a similar structure, the algorithm can be applied once the gradient estimator of the objective function is obtained. Extensive numerical studies are presented to demonstrate the quality of the solutions, the importance of modeling time-dependent no-shows in appointment scheduling, and the value of using distribution information about the service times.