03:30 PM - 03:55 PM
A tight-and-cheap conic relaxation with accuracy metrics for the ACOPF problem
Computational speed and global optimality are a key need for pratical algorithms of the OPF problem. Recently, we proposed a tight-and-cheap conic relaxation for the ACOPF problem that offers a favourable trade-off between the standard second-order cone and the standard semidefinite relaxations for large-scale meshed networks in terms of optimality gap and computation time. In this paper, we show theoretically and numerically that this relaxation can be exact and can provide a global optimal solution for the ACOPF problem.
03:55 PM - 04:20 PM
Optimal planning of long-term preventive maintenance operations on power transmission systems
The interruption of service of any electrical power system equipment due to maintenance should not affect network reliability, security and continuous power supply. The selection of the optimal period to remove a transmission line from the grid temporarily and which resources (workers, vehicles, others) should be assigned to each maintenance action, constitutes the transmission maintenance scheduling problem (TMS).
We present a mixed-integer linear program formulation of the TMS problem for a regulated electricity market, throughout a long-term period of one year and considering a yearly budget limitation. The grid is modeled as a direct current power flow network, to guarantee it meets consumers’ demand, and N-1 criteria constraints were designed to keep a reliable and safe operation.
04:20 PM - 04:45 PM
Heuristic unsupervised learning algorithm for feature engineering
Clustering and segmentation are of great importance in many real-world tasks. In this research, we propose a heuristic algorithm in order to automatically cluster the data. The clustered labels will be added as a new feature to an industrial dataset in order to evaluate the algorithm’s performance in a forecasting task.
Keyword: Feature engineering, heuristic, clustering