GUROBI案例实战（二）——仓库调度（网络流模型）

最新推荐文章于 2024-09-27 10:11:28 发布

吃面包的快乐小狗

最新推荐文章于 2024-09-27 10:11:28 发布

阅读量368

点赞数 9

文章标签： python 算法数学建模

本文链接：https://blog.csdn.net/qq_44533176/article/details/136875163

版权

网络流问题：交通调度、仓储运输 (aliyun.com)

改用GUROBI实现的代码如下：

import gurobipy as gp
from gurobipy import *
# parameters
Plants = ["HN"]
Depots = ["NE", "SE"]
Warehouses = ["JS", "ZJ", "JL", "LN", "HLJ"]

Edges_Costs = dict({
    ("HN", "NE"): 3.5,
    ("HN", "SE"): 2.5,
    ("NE", "LN"): 1.5,
    ("NE", "JL"): 1.7,
    ("NE", "HLJ"): 2.0,
    ("SE", "LN"): 2.6,
    ("SE", "JL"): 2.7,
    ("SE", "JS"): 1.3,
    ("SE", "ZJ"): 1.5
})

arcs, Edges_Capacity = gp.multidict({
    ("HN", "NE"): 250,
    ("HN", "SE"): 250,
    ("NE", "LN"): 100,
    ("NE", "JL"): 100,
    ("NE", "HLJ"): 100,
    ("SE", "LN"): 100,
    ("SE", "JL"): 100,
    ("SE", "JS"): 100,
    ("SE", "ZJ"): 100
})

supple = {}
supple["HN"] = 450

demand = {}
demand["JS"] = 90
demand["ZJ"] = 70
demand["JL"] = 120
demand["LN"] = 120
demand["HLJ"] = 50

# model
min_cost_model = Model()
# decision var
# list(Edges_Costs) = list(Edge_Costs.keys())
print(list(Edges_Costs))
x = min_cost_model.addVars(arcs, vtype = GRB.CONTINUOUS, name = "flow")
# objective
obj = x.prod(Edges_Costs)
min_cost_model.setObjective(obj, GRB.MINIMIZE)
# constraints
# plants constraints
min_cost_model.addConstrs((x.sum(k, "*") <= supple[k] for k in supple.keys()), name = "plant constraints")
# depots constraints
min_cost_model.addConstrs((x.sum(k, "*") == x.sum("*", k) for k in Depots), name = "flow constraints")
# warehouse constraints
min_cost_model.addConstrs((x.sum("*", k) == demand[k] for k in demand.keys()), name = "warehouse constraints")
# flow constraints
min_cost_model.addConstrs((x[edge] <= Edges_Capacity[edge] for edge in Edges_Capacity.keys()), name="capacity_constraints")
# optimize
min_cost_model.write("model.lp")
min_cost_model.optimize()