Long-Term Carbon-Efficient Planning for Geographically Shiftable Resources: A Monte Carlo Tree Search Approach
Bibliographic record
Abstract
The global climate challenge is demanding urgent actions for decarbonization, while electric power systems take the major roles in the clean energy transition. Due to the existence of spatially and temporally dispersed renewable energy resources and the uneven distribution of carbon emission intensity throughout the grid, it is worth investigating future load planning and demand management to offset those generations with higher carbon emission rates. Such techniques include inter-region utilization of geographically shiftable resources and stochastic renewable energy. For instance, data centers are perceived as major carbon emission producers in the future due to increasing information load, while they hold untapped capability of geographical load balancing. In this paper, we focus on locating and operating geographically shiftable resources, and propose a novel planning and operation model minimizing the system-level carbon emissions. This model decides the optimal locations for shiftable resource expansion along with the power dispatch schedule. To accommodate future system operation patterns and a wide range of operating conditions, we incorporate 20-year fine-grained load and renewables scenarios for grid simulations of realistic sizes (e.g., up to 1888 buses). To tackle the computational challenges coming from the combinatorial nature of such large-scale planning problems, we develop a customized Monte Carlo Tree Search (MCTS) method, which can find reasonable solutions satisfying solution time limits. Besides, MCTS enables flexible time window settings and offline solution adjustments. Extensive simulations validate that our planning model can reduce more than 10% carbon emission across all setups. Compared to off-the-shelf optimization solvers such as Gurobi, our method achieves up to 8.1X acceleration, while the solution gaps are less than 1.5% in large-scale cases. Moreover, our method can find reasonable solutions within different time windows, unlike other benchmarked solvers that require considerable time or fail to produce feasible solutions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".