我试着用CPLEX来决定电动汽车充电站的位置。我已经创建了5个节点,m个车辆在两条路线上行驶,通过不同的节点停下来。根据这一信息,应确定充电站的最佳位置。基本草图:

下面是我编写的CPLEX代码的开始:
//sets
int n=...; //nodes
int a=...; //path
int m=...; //set of ES travel on path
int cost=...; //cost of locating a station at node i
float rechargerate=5; //increased riding distance per charge (km/min)
int batterycapacity=5; //full charge range
range N=1..n;
range M=1..m;
range A=1..a;
tuple edge
{int i;
int j;
}
setof(edge) edges = {<i,j> | i,j in N : i!=j};
tuple link {
key string link_id;
string org;
string dst;
}
{link} Links={<"l1","1","2">,<"l2","1","3">,<"l3","3","2">,<"l4","2","5">,<"l4","4","2">};这里的问题是,我无法在A集中定义路径,链接起始点/端点也应该在边缘中定义。如何定义它们以找到RS位置的最佳解决方案?泰。
发布于 2020-09-18 11:35:02
tuple link {
string link_id;
string org;
string dst;
}
{link} Links={<"l1","1","2">,<"l2","1","3">,<"l3","3","2">,<"l4","2","5">,<"l4","4","2">};
tuple od
{
string org;
string dst;
}
{od} ods={<i.org,i.dst> | i in Links};
sorted {string} points={l.org | l in Links} union {l.dst | l in Links};
range N=1..card(points);
tuple edge
{int i;
int j;
}
setof(edge) edges = {<i,j> | i,j in N : <item(points,i-1),item(points,j-1)> in ods};
execute
{
writeln(edges);
}可以将你的链接转换成边缘
https://stackoverflow.com/questions/63954140
复制相似问题