Unit Commitment & Economic Dispatch
Which generators run, when, and at what output.
QG-SCHEDQG-ALLOC
Energy & Utilities
Dispatch and grid decisions, made at combinatorial scale.
Which generators run, how the grid is configured, and how storage charges and discharges are all decisions across a huge combinatorial space, under hard reliability constraints. We prove the difference on your own dispatch data before anything changes.
The problem
Unit commitment, topology and storage — all combinatorial.
Deciding which generators run and when is a scheduling and allocation problem with steep combinatorics; grid topology is a network design problem; storage scheduling under fluctuating renewable supply is a dynamic assignment problem. Each gets harder as the grid gets more distributed and more variable.
What we optimize
Three solutions, three archetypes.
Grid Topology & Transmission-Loss Minimization
Network configuration for lower losses and higher reliability.
QG-GRAPH
Renewable Integration & Storage Scheduling
Optimal charge/discharge and dispatch under fluctuating supply.
QG-SCHED
The engines behind it
Built on the same core engines.
Proof
No published number yet for this industry — and we're saying so.
QG-SCHED has a real, published result in telecom scheduling; QG-ALLOC and QG-GRAPH are earlier-stage. None has an independently benchmarked figure for energy dispatch yet. The honest version: mature scheduling techniques, real research behind the newer engines, and when we run them against your dispatch data, that benchmark is the number that counts.
Have a dispatch or grid problem to optimize?
Share historical dispatch, topology or storage data; we'll benchmark against your current approach and give you a clear read.
Request a pilot →