Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reinforcement Learning for the Unit Commitment Problem   In this work we solve the day-ahead unit commitment (UC) problem, by
formulating it as a Markov decision process (MDP) and finding a low-cost policy
for generation scheduling. We present two reinforcement learning algorithms,
and devise a third one. We compare our results to previous work that uses
simulated annealing (SA), and show a 27% improvement in operation costs, with
running time of 2.5 minutes (compared to 2.5 hours of existing
state-of-the-art).

16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ