cplex求解3-----求解CVRP问题

CVRP指载重量有限的车辆运输问题，从起点出发，到n个点获取物资，然后运回起点，要求运输路径总和最短。
导入需要的包

import cplex
import docplex
from docplex.mp.model import Model
import numpy as np
rnd = np.random
rnd.seed(0)
import matplotlib.pyplot as plt

问题规模

n = 10     # 10个装载点
Q = 15     # 15个运输点的各自编号
N = [i for i in range(1, n+1)]   #10个运输点的各自编号
V = [0] + N         #所有顶点编号，以0为出发顶点
q = {i: rnd.randint(1, 10) for i in N}   #每个装载点拥有的货物量

#为每一个顶点在平面坐标系上随机一个位置，之后点间距将以这个为基础计算
loc_x = rnd.rand(len(V)) * 200
loc_y = rnd.rand(len(V)) * 100
plt.scatter(loc_x[1:],loc_y[1:], c="b")
plt.show()

for i in N:
    plt.annotate("$q_%d=%d$"%(i, q[i]), (loc_x[i] + 2, loc_y[i]))

plt.scatter(loc_x[0], loc_y[0], c='r', marker="s")
plt.show()

A = []
c = {}
for i in V:
    for j in V:
        if(i != j):
            A.append((i, j))

#定义每个点对之间的距离为坐标系平面距离
for i, j in A:
    c[i,j] = np.hypot(loc_x[i] - loc_x[j], loc_y[i] - loc_y[j])

model = Model(name="CVRP")
x = model.binary_var_dict(A, name="x")
u = model.continuous_var_dict(N, ub=Q, name='u')


model.minimize(model.sum(c[i, j] * x[i,j] for i, j in A))


for i in N:
    model.add_constraint(model.sum(x[i, j] for j in V  if j != i) == 1)
for j in N:
    model.add_constraint(model.sum(x[i, j] for i in V  if j != i) == 1)

# for i, j in A:
#     if i != 0 and j != 0:
#         model.add_indicator_constraints(model.indicator_constraint(x[i, j], u[i] + q[j] == u[j]))
model.add_indicator_constraints(model.indicator_constraint(x[i, j], u[i] + q[j] == u[j]) for i, j in A if i != 0 and j != 0)
model.add_constraints(u[i] >= q[i] for i in N)
solution = model.solve(log_output=True)
print(solution)


used_edge = [(i,j) for i, j in A if x[(i, j)].solution_value > 0.9] #得到选用的各个边


plt.scatter(loc_x[1:],loc_y[1:], c='b')
for i in N:
    plt.annotate("$q_%d=%d$"%(i, q[i]),(loc_x[i] + 2, loc_y[i]))
for i,j in used_edge:
    plt.plot([loc_x[i], loc_x[j]],[loc_y[i], loc_y[j]],c='k')
plt.scatter(loc_x[0],loc_y[0],c='r', marker='s')#显示随机出来的各个点，其中红色的定义为起点
plt.show()