Implement generating alternatives using metaheuristics (#13)

* Implement normal flow metaheuristic alternative generation * Test and polish mga using metaheuristics * Specify Metaheuristics version * Change Metaheuristics version * Change Metaheuristics version again * Resolve change from MGA to NearOptimalAlternatives * Update Julia version to 1.7 * Fix a typo Co-authored-by: Ni Wang <[email protected]> * Fix a typo Co-authored-by: Ni Wang <[email protected]> * Fix a description Co-authored-by: Ni Wang <[email protected]> * Set gx to [0.0] when no inequality constraints present * fix lint --------- Co-authored-by: Greg Neustroev <[email protected]> Co-authored-by: Ni Wang <[email protected]>
TulipaEnergy · Jun 17, 2024 · 0c6eee8 · 0c6eee8
1 parent 115c473
commit 0c6eee8
Show file tree

Hide file tree

Showing 11 changed files with 981 additions and 22 deletions.
diff --git a/.github/workflows/Test.yml b/.github/workflows/Test.yml
@@ -32,7 +32,7 @@ jobs:
       fail-fast: false
       matrix:
         version:
-          - "1.6"
+          - "1.7"
           - "1"
         os:
           - ubuntu-latest

diff --git a/Project.toml b/Project.toml
@@ -4,12 +4,15 @@ authors = ["Matthijs Arnoldus <[email protected]> and contributors"]
 version = "0.1.0"
 
 [deps]
+DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
 Distances = "b4f34e82-e78d-54a5-968a-f98e89d6e8f7"
 JuMP = "4076af6c-e467-56ae-b986-b466b2749572"
 MathOptInterface = "b8f27783-ece8-5eb3-8dc8-9495eed66fee"
+Metaheuristics = "bcdb8e00-2c21-11e9-3065-2b553b22f898"
 
 [compat]
 JuMP = "1"
 MathOptInterface = "1"
 Distances = "0.10"
-julia = "1.6"
+julia = "1.7"
+Metaheuristics = "3.3"
diff --git a/src/NearOptimalAlternatives.jl b/src/NearOptimalAlternatives.jl
@@ -5,9 +5,12 @@ module NearOptimalAlternatives
 using JuMP
 using Distances
 using MathOptInterface
+using Metaheuristics
+using DataStructures
 
 include("results.jl")
 include("alternative-optimisation.jl")
 include("generate-alternatives.jl")
+include("alternative-metaheuristics.jl")
 
 end
diff --git a/src/alternative-metaheuristics.jl b/src/alternative-metaheuristics.jl
@@ -0,0 +1,330 @@
+"""
+    Structure representing a problem that can be solved by Metaheuristics.jl and the algorithm to solve it.
+"""
+mutable struct MetaheuristicProblem
+  objective::Function
+  bounds::Matrix{Float64}
+  algorithm::Metaheuristics.Algorithm
+end
+
+"""
+    constraint = extract_constraint(
+        constraint::MOI.ConstraintFunction,
+        x::Vector{Float64},
+        index_map::Dict{Int64, Int64},
+        fixed_variables::Dict{MOI.VariableIndex, Float64}
+    )
+
+Convert a constraint from a MathOptInterface function into a julia function of x. Supports only ScalarAffineFunction and VariableIndex constraints.
+
+# Arguments
+- `constraint::MOI.ConstraintFunction`: constraint transform into a julia function.
+- `x::Vector{Float64}`: a vector representing an individual in the metaheuristic population.
+- `index_map::Dict{Int64, Int64}`: a dictionary mapping indices in the MathOptInterface model to indices of `x`.
+- `fixed_variables::Dict{MOI.VariableIndex, Float64}: a dictionary containing the values of the fixed variables.`
+"""
+function extract_constraint(
+  constraint::MOI.ScalarAffineFunction,
+  x::Vector{Float64},
+  index_map::Dict{Int64, Int64},
+  fixed_variables::Dict{MOI.VariableIndex, Float64},
+)
+  result = 0
+  for t in constraint.terms
+    if haskey(index_map, t.variable.value)
+      result += t.coefficient * x[index_map[t.variable.value]]
+    else
+      result += t.coefficient * fixed_variables[t.variable]
+    end
+  end
+  return result
+end
+
+"""
+    objective = extract_objective(
+        objective::JuMP.AffExpr,
+        x::Vector{Float64},
+        index_map::Dict{Int64, Int64},
+        fixed_variables::Dict{MOI.VariableIndex, Float64}
+    )
+
+Convert the objective from a MathOptInterface function into a julia function of x. Supports only linear single-objective functions.
+
+# Arguments
+- `objective::JuMP.AffExpr`: the objective function to transform into a julia function.
+- `x::Vector{Float64}`: a vector representing an individual in the metaheuristic population.
+- `index_map::Dict{Int64, Int64}`: a dictionary mapping indices in the MathOptInterface model to indices of `x`.
+- `fixed_variables::Dict{MOI.VariableIndex, Float64}: a dictionary containing the values of the fixed variables.`
+"""
+function extract_objective(
+  objective::JuMP.AffExpr,
+  x::Vector{Float64},
+  index_map::Dict{Int64, Int64},
+  fixed_variables::Dict{MOI.VariableIndex, Float64},
+)
+  result = 0
+  # Add the constant in the objective function.
+  result += objective.constant
+  # Add all terms in the objective function with variables iteratively.
+  for (var, coef) in objective.terms
+    # If variable in `index_map`, add corresponding value to the result. Else, the variable is fixed and add the original resulting variable.
+    if haskey(index_map, var.index.value)
+      result += coef * x[index_map[var.index.value]]
+    else
+      result += coef * fixed_variables[var.index]
+    end
+  end
+  return result
+end
+
+"""
+    objective = create_objective(
+        model::JuMP.Model,
+        solution::OrderedDict{JuMP.VariableRef, Float64},
+        optimality_gap::Float64,
+        metric::Distances.SemiMetric,
+        index_map::Dict{Int64, Int64},
+        fixed_variables::Dict{VariableRef, Float64}
+    )
+
+Create an objective function supported by Metaheuristics.jl for the alternative generating problem.
+
+# Arguments
+- `model::JuMP.Model`: solved JuMP model of the original lp problem.
+- `solution::OrderedDict{JuMP.VariableRef, Float64}`: solution value of the original lp problem excluding fixed variables.
+- `optimality_gap::Float64`: maximum difference between objective value of optimal solution and alternative solutions.
+- `metric::Distances.SemiMetric`: distance metric used to measure distance between solutions.
+- `index_map::Dict{Int64, Int64}`: dictionary mapping indices in the JuMP/MathOptInterface model to indices of `x`.
+- `fixed_variables::Dict{VariableRef, Float64}`: dictionary containing the values of the fixed variables.
+"""
+function create_objective(
+  model::JuMP.Model,
+  solution::OrderedDict{JuMP.VariableRef, Float64},
+  optimality_gap::Float64,
+  metric::Distances.SemiMetric,
+  index_map::Dict{Int64, Int64},
+  fixed_variables::Dict{MOI.VariableIndex, Float64},
+)
+  original_objective = JuMP.objective_function(model)
+  solution_values = collect(Float64, values(solution))
+  # Compute objective value of original LP.
+  original_objective_value =
+    extract_objective(original_objective, solution_values, index_map, fixed_variables)
+  # Obtain all constraints from model (including variable bounds).
+  constraints = JuMP.all_constraints(model, include_variable_in_set_constraints = true)
+  constraint_functions = map(c -> MOI.get(model, MOI.ConstraintFunction(), c), constraints)
+  constraint_sets = map(c -> MOI.get(model, MOI.ConstraintSet(), c), constraints)
+
+  function f(x)
+    # Objective function for metaheuristic (= distance between individual x and solution values of original LP). Solution_values does not contain fixed_variables, these are not required in objective as the distance for these variables is zero.
+    fx = [-Distances.evaluate(metric, x, solution_values)]
+    # Initialise set of inequality constraints.
+    gx = Vector{Float64}(undef, 0)
+    # Add objective gap constraint depending on whether original LP is maximised or minimised.
+    if JuMP.objective_sense(model) == JuMP.MAX_SENSE
+      push!(
+        gx,
+        original_objective_value * (1 - optimality_gap * sign(original_objective_value)) -
+        extract_objective(original_objective, x, index_map, fixed_variables),
+      )
+    else
+      push!(
+        gx,
+        extract_objective(original_objective, x, index_map, fixed_variables) -
+        original_objective_value * (1 + optimality_gap * sign(original_objective_value)),
+      )
+    end
+    # Initialise set of equality constraints.
+    hx = Vector{Float64}(undef, 0)
+
+    for i in eachindex(constraint_functions)
+      c_fun = constraint_functions[i]
+      c_set = constraint_sets[i]
+
+      # Check if constraint involves multiple variables or if it is a bound.
+      if isa(c_fun, MathOptInterface.ScalarAffineFunction)
+        # Add constraint to gx or hx, depending on equality or inequality.
+        if isa(c_set, MOI.LessThan)
+          resulting_constraint =
+            extract_constraint(c_fun, x, index_map, fixed_variables) - MOI.constant(c_set)
+          push!(gx, resulting_constraint)
+        elseif isa(c_set, MOI.GreaterThan)
+          resulting_constraint =
+            MOI.constant(c_set) - extract_constraint(c_fun, x, index_map, fixed_variables)
+          push!(gx, resulting_constraint)
+        elseif isa(c_set, MOI.EqualTo)
+          resulting_constraint =
+            extract_constraint(c_fun, x, index_map, fixed_variables) - MOI.constant(c_set)
+          push!(hx, resulting_constraint)
+        elseif isa(c_set, MOI.Interval)
+          constraint = extract_constraint(c_fun, x, index_map, fixed_variables)
+          push!(gx, constraint - c_set.upper)
+          push!(gx, c_set.lower - constraint)
+        end
+      elseif isa(c_fun, MathOptInterface.VariableIndex)
+        # Skip variable if it is fixed.
+        if !haskey(index_map, c_fun.value)
+          continue
+        end
+        # Add bounds to gx or hx, depending on equality or inequality.
+        if isa(c_set, MOI.LessThan)
+          push!(gx, x[index_map[c_fun.value]] - MOI.constant(c_set))
+        elseif isa(c_set, MOI.GreaterThan)
+          push!(gx, MOI.constant(c_set) - x[index_map[c_fun.value]])
+        elseif isa(c_set, MOI.EqualTo)
+          push!(hx, x[index_map[c_fun.value]] - MOI.constant(c_set))
+        elseif isa(c_set, MOI.Interval)
+          push!(gx, x[index_map[c_fun.value]] - c_set.upper)
+          push!(gx, c_set.lower - x[index_map[c_fun.value]])
+        end
+      else
+        throw(ArgumentError("Only linear non-vector constraints are supported."))
+      end
+    end
+
+    # gx and hx should contain 0.0 if no inequality constraints or equality constraints are in the original problem.
+    if isempty(gx)
+      push!(gx, 0.0)
+    end
+
+    if isempty(hx)
+      push!(hx, 0.0)
+    end
+
+    return fx, gx, hx
+  end
+
+  return f
+end
+
+"""
+    bounds = extract_bounds(
+        model::JuMP.Model,
+        index_map::Dict{Int64, Int64}
+    )
+
+Transform the bounds from a JuMP Model into a matrix of bounds readable by Metaheuristics.jl.
+
+# Arguments
+- `model::JuMP.Model`: solved JuMP model of the original lp problem.
+- `index_map::Dict{Int64, Int64}`: dictionary mapping indices in the JuMP/MathOptInterface model to indices of `x`.
+"""
+function extract_bounds(model::JuMP.Model, index_map::Dict{Int64, Int64})
+  # Initialise bound matrix with all variables between -Inf and Inf.
+  n_variables = length(index_map)
+  bounds = zeros(Float64, (2, n_variables))
+  for i = 1:n_variables
+    bounds[1, i] = -Inf
+    bounds[2, i] = Inf
+  end
+
+  # Obtain all constraints from the model.
+  constraints = all_constraints(model, include_variable_in_set_constraints = true)
+
+  for c in constraints
+    c_fun = MOI.get(model, MOI.ConstraintFunction(), c)
+    # Check if constraint is a bound. In that case add upper and lower bounds depending on type of constraint.
+    if isa(c_fun, MOI.VariableIndex) && haskey(index_map, c_fun.value)
+      c_set = MOI.get(model, MOI.ConstraintSet(), c)
+      if isa(c_set, MOI.LessThan)
+        bounds[2, index_map[c_fun.value]] = MOI.constant(c_set)
+      elseif isa(c_set, MOI.GreaterThan)
+        bounds[1, index_map[c_fun.value]] = MOI.constant(c_set)
+      elseif isa(c_set, MOI.EqualTo)
+        bounds[1, index_map[c_fun.value]] = MOI.constant(c_set)
+        bounds[2, index_map[c_fun.value]] = MOI.constant(c_set)
+
+      elseif isa(c_set, MOI.Interval)
+        bounds[1, index_map[c_fun.value]] = c_set.lower
+        bounds[2, index_map[c_fun.value]] = c_set.upper
+      end
+    end
+  end
+
+  return bounds
+end
+
+"""
+    problem = create_alternative_generating_problem(
+        model::JuMP.Model,
+        algorithm::Metaheuristics.Algorithm,
+        initial_solution::OrderedDict{VariableRef, Float64},
+        optimality_gap::Float64,
+        metric::Distances.SemiMetric,
+        fixed_variables::Dict{VariableRef, Float64}
+    )
+
+Create the Metaheuristic problem representing the alternative generating problem for the original LP.
+
+# Arguments:
+- `model::JuMP.Model`: JuMP model representing the original LP.
+- `algorithm::Metaheuristics.Algorithm`: Metaheuristic algorithm to solve the alternative generating problem.
+- `initial_solution::OrderedDict{VariableRef, Float64}`: (near-)optimal solution to `model`, for which alternatives are sought.
+- `optimality_gap::Float64`: maximum gap in objective value between `initial_solution` and alternative solutions.
+- `metric::Distances.SemiMetric`: distance metric used to compute distance between alternative solutions and `initial_solution`.
+- `fixed_variables::Dict{MOI.VariableIndex, Float64}`: solution values for fixed variables of the original problem.
+"""
+function create_alternative_generating_problem(
+  model::JuMP.Model,
+  algorithm::Metaheuristics.Algorithm,
+  initial_solution::OrderedDict{VariableRef, Float64},
+  optimality_gap::Float64,
+  metric::Distances.SemiMetric,
+  fixed_variables::Dict{MOI.VariableIndex, Float64},
+)
+  # Create map between variable indices in JuMP model and indices in individuals of Metaheuristic problem.
+  index_map = Dict{Int64, Int64}()
+  k = collect(keys(initial_solution))
+  for i in eachindex(k)
+    index_map[k[i].index.value] = i
+  end
+
+  objective =
+    create_objective(model, initial_solution, optimality_gap, metric, index_map, fixed_variables)
+  bounds = extract_bounds(model, index_map)
+  # Possible TODO: Initialise initial_population
+
+  return MetaheuristicProblem(objective, bounds, algorithm)
+end
+
+"""
+    add_solution!(
+        problem::MetaheuristicProblem,
+        result::Metaheuristics.State,
+        metric::Distances.SemiMetric
+    )
+
+Modify a Metaheuristic problem representing the alternative generating problem for the original LP using a newly found alternative solution. This function can be used when one wants to iteratively run a metaheuristic to find alternative solutions one by one.
+
+# Arguments:
+- `problem::MetaheuristicProblem`: problem to be modified by adding a solution.
+- `result::Metaheuristics.State`: result containing the optimal solution to add to the objective function.
+- `metric::Distances.SemiMetric`: metric used to evaluate distance between alternatives.
+"""
+function add_solution!(
+  problem::MetaheuristicProblem,
+  result::Metaheuristics.State,
+  metric::Distances.SemiMetric,
+)
+  # Create new objective function using old objective function.
+  objective = problem.objective
+  solution = minimizer(result)
+  function f(x)
+    f_old, gx, hx = objective(x)
+    fx = [f_old[1] - Distances.evaluate(metric, solution, x)]
+    return fx, gx, hx
+  end
+  problem.objective = f
+end
+
+"""
+    result = run_alternative_generating_problem!(
+        problem::MetaheuristicProblem
+    )
+
+Optimise the `problem` using the specified metaheuristic algorithm and return the result.
+"""
+function run_alternative_generating_problem!(problem::MetaheuristicProblem)
+  result = Metaheuristics.optimize(problem.objective, problem.bounds, problem.algorithm)
+  return result
+end
-Original file line number
+Diff line change
@@ Expand Up / @@ -32,7 +32,7 @@ jobs: @@
           fail-fast: false
           matrix:
             version:
-              - "1.6"
+              - "1.7"
               - "1"
             os:
               - ubuntu-latest
@@ Expand Down @@