Solver Comparison

Same Instance · All 3 Solvers

Runs Greedy, B&B MILP, and Simulated Annealing on the same unit commitment instance. All three minimise Σ (cᵢpᵢ + SᵢUᵢ) subject to Σ pᵢ = D and Uᵢ ∈ {0,1}. Compare cost, runtime, and feasibility to understand the quality–speed tradeoff.

Canned scenarios:

Shared Generator Instance

1

pMin

pMax

varCost

startCost

a

b

c

2

pMin

pMax

varCost

startCost

a

b

c

3

pMin

pMax

varCost

startCost

a

b

c

4

pMin

pMax

varCost

startCost

a

b

c

Max cap: 200 MW

Benchmark Results

Run all solvers to compare.

Dispatch Comparison — Output per Generator

Run all solvers to see dispatch comparison.