Optimal Survival Trees: A Dynamic Programming Approach

Survival analysis studies and predicts the time of death, or other singular unrepeated events, based on historical data, while the true time of death for some instances is unknown. Survival trees enable the discovery of complex nonlinear relations in a compact human comprehensible model, by recursively splitting the population and predicting...

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming

Global optimization of decision trees has shown to be promising in terms of accuracy, size, and consequently human comprehensibility. However, many of the methods used rely on general-purpose solvers for which scalability remains an issue. Dynamic programming methods have been shown to scale much better because they exploit the tree structure by...

Fair and Optimal Decision Trees: A Dynamic Programming Approach

Interpretable and fair machine learning models are required for many applications, such as credit assessment and in criminal justice. Decision trees offer this interpretability, especially when they are small. Optimal decision trees are of particular interest because they offer the best performance possible for a given size. However, state-of...

Stochastic bidding of volume and price in constrained energy and reserve markets

The power system is undergoing a significant change as it adapts to the intermittency and uncertainty from renewable generation. Flexibility from loads such as electric vehicles (EVs) can serve as reserves to sustain the supply-demand balance in the grid. Some reserve markets have rules for participation that are computationally challenging...

TORS: A train unit shunting and servicing simulator

When trains are finished with their transportation tasks during the day, they are moved to a shunting yard where they are routed, parked, cleaned, subject to regular maintenance checks and repaired during the night. The resulting Train Unit Shunting and Servicing problem motivates advanced research in planning and scheduling in general since...

Benchmarking Flexible Electric Loads Scheduling Algorithms

Due to increasing numbers of intermittent and distributed generators in power systems, there is an increasing need for demand responses to maintain the balance between electricity generation and use at all times. For example, the electrification of transportation significantly adds to the amount of flexible electricity demand. Several methods...

Complexity of Scheduling Charging in the Smart Grid

The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. We show that for about 20 variants...

Optimal non-zero Price Bids for EVs in Energy and Reserves Markets using Stochastic Optimization

In power systems, demand and supply always have to be balanced. This is becoming more challenging due to the sustained penetration of renewable energy sources. Because of the increasing amount of electrical vehicles (EVs), and the high capacity and flexibility of their charging process, EVs are a good candidate for providing balancing services...

Complexity of Scheduling Charging in the Smart Grid: Extended Abstract

The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. For about 20 variants the problem is...

Fabrieksschema: Acetonbereiding

Document(en) uit de collectie Chemische Procestechnologie