학술
기타
Optimization models and algorithms for the Unit Commitment problem
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
The unit commitment problem determines the optimal strategy to meet the electricity demand at minimum cost by committing power generation units at each point of time.
Solving the unit commitment problem gives rise to a challenging optimization problem due to its combinatorial complexity and potentially long solution time requirements.
Our proposed solution approach utilizes a decomposition method in conjunction with alternative models from the EGRET library.
Results of this decomposition approach tested against four benchmarking systems show that significant computational speed ups are achieved.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
FineServe: A Fine-Grained Dataset and Characterization of Global LLM Serving Workloads
arXiv CS.AI
Hybrid LSTM-Graph Neural Framework for Robust Financial Fraud Detection and Adversarial Resilience
arXiv CS.AI
OpenEvoShield: Dual Non-Stationary Continual Defense for Open-World Multi-Agent System Attacks
arXiv CS.AI