Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
From MaRDI portal
Publication:4995099
DOI10.1287/ijoc.2020.0976OpenAlexW3092319930MaRDI QIDQ4995099
Álinson S. Xavier, Feng Qiu, Shabbir Ahmed
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.01697
Related Items (5)
A Polyhedral Study on Fuel-Constrained Unit Commitment ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Learning optimal solutions via an LSTM-optimization framework ⋮ Learning to repeatedly solve routing problems ⋮ A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A polyhedral study of production ramping
- Empirical decision model learning
- Tight MIP formulations of the power-based unit commitment problem
- Learning heuristics for the TSP by policy gradient
- Learning a classification of mixed-integer quadratic programming problems
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Random sampling and machine learning to understand good decompositions
- Learning MILP resolution outcomes before reaching time-limit
- Min-up/min-down polytopes
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- On learning and branching: a survey
- The feasibility pump
- Julia: A Fresh Approach to Numerical Computing
- JuMP: A Modeling Language for Mathematical Optimization
- A Machine Learning-Based Approximation of Strong Branching
This page was built for publication: Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
