mirror of https://github.com/ANL-CEEESA/RELOG.git
parent
86cf7f5bd9
commit
881957d6b5
@ -1,289 +0,0 @@
|
|||||||
# RELOG: Reverse Logistics Optimization
|
|
||||||
# Copyright (C) 2020, UChicago Argonne, LLC. All rights reserved.
|
|
||||||
# Released under the modified BSD license. See COPYING.md for more details.
|
|
||||||
|
|
||||||
using DataStructures
|
|
||||||
using JSON
|
|
||||||
using JSONSchema
|
|
||||||
using Printf
|
|
||||||
using Statistics
|
|
||||||
|
|
||||||
|
|
||||||
mutable struct Product
|
|
||||||
name::String
|
|
||||||
transportation_cost::Array{Float64}
|
|
||||||
transportation_energy::Array{Float64}
|
|
||||||
transportation_emissions::Dict{String, Array{Float64}}
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
mutable struct CollectionCenter
|
|
||||||
index::Int64
|
|
||||||
name::String
|
|
||||||
latitude::Float64
|
|
||||||
longitude::Float64
|
|
||||||
product::Product
|
|
||||||
amount::Array{Float64}
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
mutable struct PlantSize
|
|
||||||
capacity::Float64
|
|
||||||
variable_operating_cost::Array{Float64}
|
|
||||||
fixed_operating_cost::Array{Float64}
|
|
||||||
opening_cost::Array{Float64}
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
mutable struct Plant
|
|
||||||
index::Int64
|
|
||||||
plant_name::String
|
|
||||||
location_name::String
|
|
||||||
input::Product
|
|
||||||
output::Dict{Product, Float64}
|
|
||||||
latitude::Float64
|
|
||||||
longitude::Float64
|
|
||||||
disposal_limit::Dict{Product, Array{Float64}}
|
|
||||||
disposal_cost::Dict{Product, Array{Float64}}
|
|
||||||
sizes::Array{PlantSize}
|
|
||||||
energy::Array{Float64}
|
|
||||||
emissions::Dict{String, Array{Float64}}
|
|
||||||
storage_limit::Float64
|
|
||||||
storage_cost::Array{Float64}
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
mutable struct Instance
|
|
||||||
time::Int64
|
|
||||||
products::Array{Product, 1}
|
|
||||||
collection_centers::Array{CollectionCenter, 1}
|
|
||||||
plants::Array{Plant, 1}
|
|
||||||
building_period::Array{Int64}
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
function Base.show(io::IO, instance::Instance)
|
|
||||||
print(io, "RELOG instance with ")
|
|
||||||
print(io, "$(length(instance.products)) products, ")
|
|
||||||
print(io, "$(length(instance.collection_centers)) collection centers, ")
|
|
||||||
print(io, "$(length(instance.plants)) plants")
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
function validate(json, schema)
|
|
||||||
result = JSONSchema.validate(json, schema)
|
|
||||||
if result !== nothing
|
|
||||||
if result isa JSONSchema.SingleIssue
|
|
||||||
path = join(result.path, " → ")
|
|
||||||
if length(path) == 0
|
|
||||||
path = "root"
|
|
||||||
end
|
|
||||||
msg = "$(result.msg) in $(path)"
|
|
||||||
else
|
|
||||||
msg = convert(String, result)
|
|
||||||
end
|
|
||||||
throw(msg)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
function parsefile(path::String)::Instance
|
|
||||||
return RELOG.parse(JSON.parsefile(path))
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
function parse(json)::Instance
|
|
||||||
basedir = dirname(@__FILE__)
|
|
||||||
json_schema = JSON.parsefile("$basedir/schemas/input.json")
|
|
||||||
validate(json, Schema(json_schema))
|
|
||||||
|
|
||||||
T = json["parameters"]["time horizon (years)"]
|
|
||||||
json_schema["definitions"]["TimeSeries"]["minItems"] = T
|
|
||||||
json_schema["definitions"]["TimeSeries"]["maxItems"] = T
|
|
||||||
validate(json, Schema(json_schema))
|
|
||||||
|
|
||||||
building_period = [1]
|
|
||||||
if "building period (years)" in keys(json)
|
|
||||||
building_period = json["building period (years)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
plants = Plant[]
|
|
||||||
products = Product[]
|
|
||||||
collection_centers = CollectionCenter[]
|
|
||||||
prod_name_to_product = Dict{String, Product}()
|
|
||||||
|
|
||||||
# Create products
|
|
||||||
for (product_name, product_dict) in json["products"]
|
|
||||||
cost = product_dict["transportation cost (\$/km/tonne)"]
|
|
||||||
energy = zeros(T)
|
|
||||||
emissions = Dict()
|
|
||||||
|
|
||||||
if "transportation energy (J/km/tonne)" in keys(product_dict)
|
|
||||||
energy = product_dict["transportation energy (J/km/tonne)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
if "transportation emissions (tonne/km/tonne)" in keys(product_dict)
|
|
||||||
emissions = product_dict["transportation emissions (tonne/km/tonne)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
product = Product(product_name, cost, energy, emissions)
|
|
||||||
push!(products, product)
|
|
||||||
prod_name_to_product[product_name] = product
|
|
||||||
|
|
||||||
# Create collection centers
|
|
||||||
if "initial amounts" in keys(product_dict)
|
|
||||||
for (center_name, center_dict) in product_dict["initial amounts"]
|
|
||||||
center = CollectionCenter(length(collection_centers) + 1,
|
|
||||||
center_name,
|
|
||||||
center_dict["latitude (deg)"],
|
|
||||||
center_dict["longitude (deg)"],
|
|
||||||
product,
|
|
||||||
center_dict["amount (tonne)"])
|
|
||||||
push!(collection_centers, center)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
# Create plants
|
|
||||||
for (plant_name, plant_dict) in json["plants"]
|
|
||||||
input = prod_name_to_product[plant_dict["input"]]
|
|
||||||
output = Dict()
|
|
||||||
|
|
||||||
# Plant outputs
|
|
||||||
if "outputs (tonne/tonne)" in keys(plant_dict)
|
|
||||||
output = Dict(prod_name_to_product[key] => value
|
|
||||||
for (key, value) in plant_dict["outputs (tonne/tonne)"]
|
|
||||||
if value > 0)
|
|
||||||
end
|
|
||||||
|
|
||||||
energy = zeros(T)
|
|
||||||
emissions = Dict()
|
|
||||||
|
|
||||||
if "energy (GJ/tonne)" in keys(plant_dict)
|
|
||||||
energy = plant_dict["energy (GJ/tonne)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
if "emissions (tonne/tonne)" in keys(plant_dict)
|
|
||||||
emissions = plant_dict["emissions (tonne/tonne)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
for (location_name, location_dict) in plant_dict["locations"]
|
|
||||||
sizes = PlantSize[]
|
|
||||||
disposal_limit = Dict(p => [0.0 for t in 1:T] for p in keys(output))
|
|
||||||
disposal_cost = Dict(p => [0.0 for t in 1:T] for p in keys(output))
|
|
||||||
|
|
||||||
# Disposal
|
|
||||||
if "disposal" in keys(location_dict)
|
|
||||||
for (product_name, disposal_dict) in location_dict["disposal"]
|
|
||||||
limit = [1e8 for t in 1:T]
|
|
||||||
if "limit (tonne)" in keys(disposal_dict)
|
|
||||||
limit = disposal_dict["limit (tonne)"]
|
|
||||||
end
|
|
||||||
disposal_limit[prod_name_to_product[product_name]] = limit
|
|
||||||
disposal_cost[prod_name_to_product[product_name]] = disposal_dict["cost (\$/tonne)"]
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
# Capacities
|
|
||||||
for (capacity_name, capacity_dict) in location_dict["capacities (tonne)"]
|
|
||||||
push!(sizes, PlantSize(Base.parse(Float64, capacity_name),
|
|
||||||
capacity_dict["variable operating cost (\$/tonne)"],
|
|
||||||
capacity_dict["fixed operating cost (\$)"],
|
|
||||||
capacity_dict["opening cost (\$)"]))
|
|
||||||
end
|
|
||||||
length(sizes) > 1 || push!(sizes, sizes[1])
|
|
||||||
sort!(sizes, by = x -> x.capacity)
|
|
||||||
|
|
||||||
# Storage
|
|
||||||
storage_limit = 0
|
|
||||||
storage_cost = zeros(T)
|
|
||||||
if "storage" in keys(location_dict)
|
|
||||||
storage_dict = location_dict["storage"]
|
|
||||||
storage_limit = storage_dict["limit (tonne)"]
|
|
||||||
storage_cost = storage_dict["cost (\$/tonne)"]
|
|
||||||
end
|
|
||||||
|
|
||||||
# Validation: Capacities
|
|
||||||
if length(sizes) != 2
|
|
||||||
throw("At most two capacities are supported")
|
|
||||||
end
|
|
||||||
if sizes[1].variable_operating_cost != sizes[2].variable_operating_cost
|
|
||||||
throw("Variable operating costs must be the same for all capacities")
|
|
||||||
end
|
|
||||||
|
|
||||||
plant = Plant(length(plants) + 1,
|
|
||||||
plant_name,
|
|
||||||
location_name,
|
|
||||||
input,
|
|
||||||
output,
|
|
||||||
location_dict["latitude (deg)"],
|
|
||||||
location_dict["longitude (deg)"],
|
|
||||||
disposal_limit,
|
|
||||||
disposal_cost,
|
|
||||||
sizes,
|
|
||||||
energy,
|
|
||||||
emissions,
|
|
||||||
storage_limit,
|
|
||||||
storage_cost)
|
|
||||||
|
|
||||||
push!(plants, plant)
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
@info @sprintf("%12d collection centers", length(collection_centers))
|
|
||||||
@info @sprintf("%12d candidate plant locations", length(plants))
|
|
||||||
|
|
||||||
return Instance(T, products, collection_centers, plants, building_period)
|
|
||||||
end
|
|
||||||
|
|
||||||
|
|
||||||
"""
|
|
||||||
_compress(instance::Instance)
|
|
||||||
|
|
||||||
Create a single-period instance from a multi-period one. Specifically,
|
|
||||||
replaces every time-dependent attribute, such as initial_amounts,
|
|
||||||
by a list with a single element, which is either a sum, an average,
|
|
||||||
or something else that makes sense to that specific attribute.
|
|
||||||
"""
|
|
||||||
function _compress(instance::Instance)::Instance
|
|
||||||
T = instance.time
|
|
||||||
compressed = deepcopy(instance)
|
|
||||||
compressed.time = 1
|
|
||||||
compressed.building_period = [1]
|
|
||||||
|
|
||||||
# Compress products
|
|
||||||
for p in compressed.products
|
|
||||||
p.transportation_cost = [mean(p.transportation_cost)]
|
|
||||||
p.transportation_energy = [mean(p.transportation_energy)]
|
|
||||||
for (emission_name, emission_value) in p.transportation_emissions
|
|
||||||
p.transportation_emissions[emission_name] = [mean(emission_value)]
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
# Compress collection centers
|
|
||||||
for c in compressed.collection_centers
|
|
||||||
c.amount = [maximum(c.amount) * T]
|
|
||||||
end
|
|
||||||
|
|
||||||
# Compress plants
|
|
||||||
for plant in compressed.plants
|
|
||||||
plant.energy = [mean(plant.energy)]
|
|
||||||
for (emission_name, emission_value) in plant.emissions
|
|
||||||
plant.emissions[emission_name] = [mean(emission_value)]
|
|
||||||
end
|
|
||||||
for s in plant.sizes
|
|
||||||
s.capacity *= T
|
|
||||||
s.variable_operating_cost = [mean(s.variable_operating_cost)]
|
|
||||||
s.opening_cost = [s.opening_cost[1]]
|
|
||||||
s.fixed_operating_cost = [sum(s.fixed_operating_cost)]
|
|
||||||
end
|
|
||||||
for (prod_name, disp_limit) in plant.disposal_limit
|
|
||||||
plant.disposal_limit[prod_name] = [sum(disp_limit)]
|
|
||||||
end
|
|
||||||
for (prod_name, disp_cost) in plant.disposal_cost
|
|
||||||
plant.disposal_cost[prod_name] = [mean(disp_cost)]
|
|
||||||
end
|
|
||||||
end
|
|
||||||
|
|
||||||
return compressed
|
|
||||||
end
|
|
||||||
@ -0,0 +1,97 @@
|
|||||||
|
# RELOG: Reverse Logistics Optimization
|
||||||
|
# Copyright (C) 2020-2021, UChicago Argonne, LLC. All rights reserved.
|
||||||
|
# Released under the modified BSD license. See COPYING.md for more details.
|
||||||
|
|
||||||
|
using JuMP
|
||||||
|
|
||||||
|
function resolve(model_old, filename::AbstractString; kwargs...)::OrderedDict
|
||||||
|
@info "Reading $filename..."
|
||||||
|
instance = RELOG.parsefile(filename)
|
||||||
|
return resolve(model_old, instance; kwargs...)
|
||||||
|
end
|
||||||
|
|
||||||
|
function resolve(model_old, instance::Instance; optimizer = nothing)::OrderedDict
|
||||||
|
milp_optimizer = lp_optimizer = optimizer
|
||||||
|
if optimizer === nothing
|
||||||
|
milp_optimizer = _get_default_milp_optimizer()
|
||||||
|
lp_optimizer = _get_default_lp_optimizer()
|
||||||
|
end
|
||||||
|
|
||||||
|
@info "Building new graph..."
|
||||||
|
graph = build_graph(instance)
|
||||||
|
_print_graph_stats(instance, graph)
|
||||||
|
|
||||||
|
@info "Building new optimization model..."
|
||||||
|
model_new = RELOG.build_model(instance, graph, milp_optimizer)
|
||||||
|
|
||||||
|
@info "Fixing decision variables..."
|
||||||
|
_fix_plants!(model_old, model_new)
|
||||||
|
JuMP.set_optimizer(model_new, lp_optimizer)
|
||||||
|
|
||||||
|
@info "Optimizing MILP..."
|
||||||
|
JuMP.optimize!(model_new)
|
||||||
|
|
||||||
|
if !has_values(model_new)
|
||||||
|
@warn("No solution available")
|
||||||
|
return OrderedDict()
|
||||||
|
end
|
||||||
|
|
||||||
|
@info "Extracting solution..."
|
||||||
|
solution = get_solution(model_new, marginal_costs = true)
|
||||||
|
|
||||||
|
return solution
|
||||||
|
end
|
||||||
|
|
||||||
|
function _fix_plants!(model_old, model_new)::Nothing
|
||||||
|
T = model_new[:instance].time
|
||||||
|
|
||||||
|
# Fix open_plant variables
|
||||||
|
for ((node_old, t), var_old) in model_old[:open_plant]
|
||||||
|
value_old = JuMP.value(var_old)
|
||||||
|
node_new = model_new[:graph].name_to_process_node_map[(
|
||||||
|
node_old.location.plant_name,
|
||||||
|
node_old.location.location_name,
|
||||||
|
)]
|
||||||
|
var_new = model_new[:open_plant][node_new, t]
|
||||||
|
JuMP.unset_binary(var_new)
|
||||||
|
JuMP.fix(var_new, value_old)
|
||||||
|
end
|
||||||
|
|
||||||
|
# Fix is_open variables
|
||||||
|
for ((node_old, t), var_old) in model_old[:is_open]
|
||||||
|
value_old = JuMP.value(var_old)
|
||||||
|
node_new = model_new[:graph].name_to_process_node_map[(
|
||||||
|
node_old.location.plant_name,
|
||||||
|
node_old.location.location_name,
|
||||||
|
)]
|
||||||
|
var_new = model_new[:is_open][node_new, t]
|
||||||
|
JuMP.unset_binary(var_new)
|
||||||
|
JuMP.fix(var_new, value_old)
|
||||||
|
end
|
||||||
|
|
||||||
|
# Fix plant capacities
|
||||||
|
for ((node_old, t), var_old) in model_old[:capacity]
|
||||||
|
value_old = JuMP.value(var_old)
|
||||||
|
node_new = model_new[:graph].name_to_process_node_map[(
|
||||||
|
node_old.location.plant_name,
|
||||||
|
node_old.location.location_name,
|
||||||
|
)]
|
||||||
|
var_new = model_new[:capacity][node_new, t]
|
||||||
|
JuMP.delete_lower_bound(var_new)
|
||||||
|
JuMP.delete_upper_bound(var_new)
|
||||||
|
JuMP.fix(var_new, value_old)
|
||||||
|
end
|
||||||
|
|
||||||
|
# Fix plant expansion
|
||||||
|
for ((node_old, t), var_old) in model_old[:expansion]
|
||||||
|
value_old = JuMP.value(var_old)
|
||||||
|
node_new = model_new[:graph].name_to_process_node_map[(
|
||||||
|
node_old.location.plant_name,
|
||||||
|
node_old.location.location_name,
|
||||||
|
)]
|
||||||
|
var_new = model_new[:expansion][node_new, t]
|
||||||
|
JuMP.delete_lower_bound(var_new)
|
||||||
|
JuMP.delete_upper_bound(var_new)
|
||||||
|
JuMP.fix(var_new, value_old)
|
||||||
|
end
|
||||||
|
end
|
||||||
@ -0,0 +1,11 @@
|
|||||||
|
# Copyright (C) 2020 Argonne National Laboratory
|
||||||
|
# Written by Alinson Santos Xavier <axavier@anl.gov>
|
||||||
|
|
||||||
|
using RELOG
|
||||||
|
|
||||||
|
@testset "Resolve" begin
|
||||||
|
# Shoud not crash
|
||||||
|
filename = "$(pwd())/../instances/s1.json"
|
||||||
|
solution_old, model_old = RELOG.solve(filename, return_model = true)
|
||||||
|
solution_new = RELOG.resolve(model_old, filename)
|
||||||
|
end
|
||||||
Loading…
Reference in new issue