new formatting

src/transform/initcond.jl

@@ -11,7 +11,10 @@ Generates feasible initial conditions for the given instance, by constructing
 and solving a single-period mixed-integer optimization problem, using the given
 optimizer. The instance is modified in-place.
 """
-function generate_initial_conditions!(instance::UnitCommitmentInstance, optimizer)::Nothing
+function generate_initial_conditions!(
+    instance::UnitCommitmentInstance,
+    optimizer,
+)::Nothing
     G = instance.units
     B = instance.buses
     t = 1
@@ -28,7 +31,11 @@ function generate_initial_conditions!(instance::UnitCommitmentInstance, optimize
     @constraint(mip, max_power[g in G], p[g] <= g.max_power[t] * x[g])
 
     # Constraint: Production equals demand
-    @constraint(mip, power_balance, sum(b.load[t] for b in B) == sum(p[g] for g in G))
+    @constraint(
+        mip,
+        power_balance,
+        sum(b.load[t] for b in B) == sum(p[g] for g in G)
+    )
 
     # Constraint: Must run
     for g in G

src/transform/randomize/XavQiuAhm2021.jl

@@ -117,7 +117,10 @@ Base.@kwdef struct Randomization
     randomize_load_share::Bool = true
 end
 
-function _randomize_costs(instance::UnitCommitmentInstance, distribution)::Nothing
+function _randomize_costs(
+    instance::UnitCommitmentInstance,
+    distribution,
+)::Nothing
     for unit in instance.units
         α = rand(distribution)
         unit.min_power_cost *= α
@@ -131,11 +134,17 @@ function _randomize_costs(instance::UnitCommitmentInstance, distribution)::Nothi
     return
 end
 
-function _randomize_load_share(instance::UnitCommitmentInstance, distribution)::Nothing
+function _randomize_load_share(
+    instance::UnitCommitmentInstance,
+    distribution,
+)::Nothing
     α = rand(distribution, length(instance.buses))
-    for t = 1:instance.time
+    for t in 1:instance.time
         total = sum(bus.load[t] for bus in instance.buses)
-        den = sum(bus.load[t] / total * α[i] for (i, bus) in enumerate(instance.buses))
+        den = sum(
+            bus.load[t] / total * α[i] for
+            (i, bus) in enumerate(instance.buses)
+        )
         for (i, bus) in enumerate(instance.buses)
             bus.load[t] *= α[i] / den
         end
@@ -149,9 +158,11 @@ function _randomize_load_profile(
 )::Nothing
     # Generate new system load
     system_load = [1.0]
-    for t = 2:instance.time
+    for t in 2:instance.time
         idx = (t - 1) % length(params.load_profile_mu) + 1
-        gamma = rand(Normal(params.load_profile_mu[idx], params.load_profile_sigma[idx]))
+        gamma = rand(
+            Normal(params.load_profile_mu[idx], params.load_profile_sigma[idx]),
+        )
         push!(system_load, system_load[t-1] * gamma)
     end
     capacity = sum(maximum(u.max_power) for u in instance.units)
@@ -161,7 +172,7 @@ function _randomize_load_profile(
     # Scale bus loads to match the new system load
     prev_system_load = sum(b.load for b in instance.buses)
     for b in instance.buses
-        for t = 1:instance.time
+        for t in 1:instance.time
             b.load[t] *= system_load[t] / prev_system_load[t]
         end
     end