US 12,705,571 B2 · Material conveying method, device, system and storage medium

A material conveying method, applied to a server, the method comprises:

determining a target conveying route from a plurality of candidate conveying routes according to a route planning model;
wherein the candidate conveying routes refer to routes from a source node of supply to a user node via at least one candidate warehouse;
generating a conveying instruction according to the target conveying route and user order information;
and
sending the conveying instruction for actively controlling a conveying device to convey a material from the source node of supply to the user node via the target conveying route,
wherein the route planning model comprises an objective function and the objective function comprises a conveying cost and conveying time;
wherein the conveying cost is obtained according to a route variable set and a conveying cost parameter of a respective candidate warehouse, and the conveying time is obtained according to the route variable set and a conveying time parameter of the respective candidate warehouse;
wherein the conveying cost comprises an inventory cost for a candidate conveying route, a delivering cost for the candidate conveying route, and a transferring cost for the candidate conveying route;
and
wherein the route variable set comprises a first route variable, a second route variable, a third route variable, a fourth route variable, and a fifth route variable, wherein the first route variable represents whether a certain candidate warehouse is selected to transmit a material to another candidate warehouse, the second route variable represents whether a certain source node of supply provides a material to a certain candidate warehouse, the third route variable indicates whether a certain candidate warehouse provides a material to a user node, the fourth route variable indicates whether a certain source node of supply provides a material to a certain user node via at least one candidate warehouse, and the fifth route variable indicates whether to provide a material to the user node via a plurality of candidate warehouses,
wherein the objective function comprises:
f
=
min
⁡
(
w
1
×
C
*
C
b
+
w
2
×
T
*
T
b
)
wherein f represents the objective function, min(⋅) represents calculating a minimum value, w1 represents a cost weight, C* represents a conveying cost, Cb represents a cost benchmark value, w2 represents a time weight, T* represents conveying time, and Tb represents a time benchmark value;
wherein the conveying cost is calculated according to a first formula, and the first formula comprises:
C
*
=
C
W
+
C
D
+
C
T
wherein CW represents an inventory cost, CD represents a delivering cost, and CT represents a transferring cost;
wherein the inventory cost is calculated according to a second formula, and the second formula comprises:
C
W
=
C
W
⁢
1
+
C
W
⁢
2
+
C
W
⁢
3
CW1 represents an inbound cost, CW2 represents a first outbound cost, and CW3 represents a second outbound cost;
wherein the inbound cost is calculated according to a third formula, and the third formula comprises:
C
W
⁢
1
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d

⁢
⁠

[
⁠
ci
o
wh
⁢
x
oi
1
+
ci
i
1
wh
⁢
y
i
1
⁢
j
1
+
ci
j
1
wh
⁢
y
j
1
⁢
i
2
+
…
+
ci
i
l
wh
⁢
y
i
l
⁢
j
l
+
ci
j
l
wh
⁢
z
j
l
⁢
d
)
⁢
y
do
⁢
q
j
l
⁢
d
]
i and j both represent an identifier of a candidate warehouse, 1≤i, j≤l, l represents a total number of the candidate warehouse, d represents an identifier of a user node, 1≤d≤m, m represents a total number of the user node, o represents an identifier of a source node of supply, 1≤0≤p, p represents a total number of the source node or supply,
c
⁢
i
o
wh
represents a single-piece inbound cost for an oth source node of supply, Xoi1 is a second route variable which represents whether the oth source node of supply provides a material to an i1th candidate warehouse,
c
⁢
i
i
1
wh
represents a single-piece inbound cost for the i1th candidate warehouse,
c
⁢
i
j
1
wh
represents a single-piece inbound cost for a j1th candidate warehouse per piece, yi1j1 is a first route variable which represents whether the i1th candidate warehouse provides a material to the j1th candidate warehouse, yj1i2 represents whether the j1th candidate warehouse provides a material to an i2th candidate warehouse, zjld is a third route variable which represents whether a jlth candidate warehouse provides a material to a dth user node, ydo is a fourth route variable which represents whether the oth source node of supply provide a material to the dth user node via a candidate warehouse, qjld represents a total number of the material provided by the jlth candidate warehouse to the dth user node, i1, i2, . . . , il-1 and il represent l values of i, j1, j2, . . . , jl-1 and jl represent l values of j;
wherein the first outbound cost is calculated according to a fourth formula, and the fourth formula comprises:
C
W
⁢
2
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d


[
⁠
(
co
o
wh
⁢
x
oi
1
+
co
i
1
wh
⁢
y
i
1
⁢
j
1
+
co
j
1
wh
⁢
y
j
1
⁢
i
2
+
…
+
co
i
l
wh
⁢
y
i
l
⁢
j
l
+
co
j
l
wh
⁢
z
j
l
⁢
d
)
⁢
y
di
l
-
1
⁢
v
i
l
-
1
⁢
d
]
wherein
c
⁢
o
o
wh
represents an outbound cost by volume for the oth source node of supply,
c
⁢
o
i
1
wh
represents an outbound cost by volume for the j1th candidate warehouse,
c
⁢
o
j
1
wh
represents an outbound cost by volume for the j1th candidate warehouse, zjld is the third route variable which represents whether the jlth candidate warehouse provides a material to the dth user node, ydil-1 is a fifth route variable which represents whether an il-1th candidate warehouse provides a material to the dth user node via other candidate warehouses, Vil-1d represents total volume of the material provided by the il-1th candidate warehouse to the dth user node;
wherein the second outbound cost is calculated according to a fifth formula, and the fifth formula comprises:
C
W
⁢
3
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
cf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
q
j
l
⁢
d
-
n
j
l
⁢
d
)
⁢
(
1
-
ρ
d
)
+
ρ
d
(
co
j
l
⁢
d
v
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
v
j
l
⁢
d
+
co
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
q
j
l
⁢
d
)
/
2
]
wherein
c
⁢
f
j
l
⁢
d
n
represents an outbound cost for a first order when the jlth candidate warehouse provides the material to the dth user node, ydjl-1 is the fifth route variable which represents whether a jl-1th candidate warehouse provide a material to the dth user node via other candidate warehouses, zjld is the third route variable which represents whether a jlth candidate warehouse provides a material to the dth user node, njld represents an order quantity of the material provided by the jlth candidate warehouse to the dth user node,
c
⁢
c
j
l
⁢
d
q
represents an outbound cost for a subsequent piece when the jlth candidate warehouse provides the material to the dth user node, qjld represents a total number of the material provided by the jlth candidate represents an warehouse to the dth user node, ρd represents an adjustment coefficient,
c
⁢
o
j
l
⁢
d
v
represents an outbound cost by volume when the jlth candidate warehouse provides the material to the dth user node, and
c
⁢
o
j
l
⁢
d
q
represents a single-piece outbound cost when the jlth candidate warehouse provides the material to the dth user node;
wherein the delivering cost is calculated according to a sixth formula, and the sixth formula comprises:
C
D
=
∑
d
∑
j
l
[
cdf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cdc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
m
j
l
⁢
d
-
n
j
l
⁢
d
)
]
wherein
c
⁢
d
⁢
f
j
l
⁢
d
n
represents a delivering cost for a first order when the jlth candidate warehouse provides the material to the dth user node,
c
⁢
d
⁢
c
j
l
⁢
d
q
represents a delivering cost for extra weight when the jlth candidate warehouse provides the material to the dth user node, mjld represents total weight of the material provided by the jlth candidate warehouse to the dth user node;
wherein the delivering time is calculated according to a seventh formula, and the seventh formula comprises:
T
*
=
∑
j
l
∑
d
T
j
l
⁢
d
Z
⁢
j
l
⁢
d
Tjld represents a conveying time parameter when the jlth candidate warehouse provides the material to the dth user node.

601 more elements

A server, comprising a memory and a processor,

the memory is configured to store an instruction executable by the processor;
wherein the processor is configured to:
determine a target conveying route from a plurality of candidate conveying routes according to a route planning model;
wherein the candidate conveying routes refer to routes from a source node of supply to a user node via at least one candidate warehouse;
generate a conveying instruction according to the target conveying route and user order information;
and
send the conveying instruction for actively controlling a conveying device to convey a material from the source node of supply to the user node via the target conveying route,
wherein the route planning model comprises an objective function and the objective function comprises a conveying cost and conveying time;
wherein the conveying cost is obtained according to a route variable set and a conveying cost parameter of a respective candidate warehouse, and the conveying time is obtained according to the route variable set and a conveying time parameter of the respective candidate warehouse;
wherein the conveying cost comprises an inventory cost for a candidate conveying route, a delivering cost for the candidate conveying route, and a transferring cost for the candidate conveying route;
and
wherein the route variable set comprises a first route variable, a second route variable, a third route variable, a fourth route variable, and a fifth route variable, wherein the first route variable represents whether a certain candidate warehouse is selected to transmit a material to another candidate warehouse, the second route variable represents whether a certain source node of supply provides a material to a certain candidate warehouse, the third route variable indicates whether a certain candidate warehouse provides a material to a user node, the fourth route variable indicates whether a certain source node of supply provides a material to a certain user node via at least one candidate warehouse, and the fifth route variable indicates whether to provide a material to the user node via a plurality of candidate warehouses,
wherein the objective function comprises:
f
=
min
⁡
(
w
1
×
C
*
C
b
+
w
2
×
T
*
T
b
)
wherein f represents the objective function, min(⋅) represents calculating a minimum value, w1 represents a cost weight, C* represents a conveying cost, Cb represents a cost benchmark value, w2 represents a time weight, T* represents conveying time, and Tb represents a time benchmark value;
wherein the conveying cost is calculated according to a first formula, and the first formula comprises:
C
*
=
C
W
+
C
D
+
C
T
wherein CW represents an inventory cost, CD represents a delivering cost, and CT represents a transferring cost;
wherein the inventory cost is calculated according to a second formula, and the second formula comprises:
C
W
=
C
W
⁢
1
+
C
W
⁢
2
+
C
W
⁢
3
CW1 represents an inbound cost, CW2 represents a first outbound cost, and CW3 represents a second outbound cost;
wherein the inbound cost is calculated according to a third formula, and the third formula comprises:
C
W
⁢
1
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
c
⁢
i
o
w
⁢
h
⁢
x
o
⁢
i
1
+
ci
i
1
w
⁢
h
⁢
y
i
1
⁢
j
1
+
c
⁢
i
j
1
w
⁢
h
⁢
y
j
1
⁢
i
2
+
…
+
ci
i
l
w
⁢
h
⁢
y
i
l
⁢
j
l
+
c
⁢
i
j
l
w
⁢
h
⁢
z
j
l
⁢
d
)
⁢
y
do
⁢
q
j
l
⁢
d
]
i and j both represent an identifier of a candidate warehouse, 1≤i, j≤l, l represents a total number of the candidate warehouse, d represents an identifier of a user node, 1≤d≤m, m represents a total number of the user node, o represents an identifier of a source node of supply, 1≤0≤p, p represents a total number of the source node of supply,
c
⁢
i
o
w
⁢
h
represents a single-piece inbound cost for an oth source node of supply, xoi1 is a second route variable which represents whether the oth source node of supply provides a material to an i1th candidate warehouse,
c
⁢
i
i
1
w
⁢
h
represents a single-piece inbound cost for the i1th candidate warehouse,
c
⁢
i
j
1
w
⁢
h
represents a single-piece inbound cost for a j1th candidate warehouse per piece, yi1j1 is a first route variable which represents whether the i1th candidate warehouse provides a material to the j1th candidate warehouse, yj1i2 represents whether the j1th candidate warehouse provides a material to an i2th candidate warehouse, zjld is a third route variable which represents whether a jlth candidate warehouse provides a material to a dth user node, ydo is a fourth route variable which represents whether the oth source node of supply provide a material to the dth user node via a candidate warehouse, qjld represents a total number of the material provided by the jlth candidate warehouse to the dth user node, i1, i2, . . . , il-1 and il represent l values of i, j1, j2, . . . , jl-1 and jl represent l values of j;
wherein the first outbound cost is calculated according to a fourth formula, and the fourth formula comprises:
C
W
⁢
2
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
(
c
⁢
o
o
w
⁢
h
⁢
x
o
⁢
i
1
+
co
i
1
w
⁢
h
⁢
y
i
1
⁢
j
1
+
c
⁢
o
j
1
w
⁢
h
⁢
y
j
1
⁢
i
2
+
…
+
co
i
l
w
⁢
h
⁢
y
i
l
⁢
j
l
+
c
⁢
o
j
l
w
⁢
h
⁢
z
j
l
⁢
d
)
⁢
y
di
l
-
1
⁢
v
i
l
-
1
⁢
d
]
wherein
c
⁢
o
o
w
⁢
h
represents an outbound cost by volume for the oth source node of supply,
c
⁢
o
i
1
w
⁢
h
represents an outbound cost by volume for the i1th candidate warehouse,
c
⁢
o
j
1
w
⁢
h
represents an outbound cost by volume for the j1th candidate warehouse, zjld is the third route variable which represents whether the jlth candidate warehouse provides a material to the dth user node, ydil-1 is a fifth route variable which represents whether an il-1th candidate warehouse provides a material to the dth user node via other candidate warehouses, vil-1d represents total volume of the material provided by the il-1th candidate warehouse to the dth user node;
wherein the second outbound cost is calculated according to a fifth formula, and the fifth formula comprises:
C
W
⁢
3
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
cf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
q
j
l
⁢
d
-
n
j
l
⁢
d
)
⁢
(
1
-
ρ
d
)
+
ρ
d
(
c
⁢
o
j
l
⁢
d
v
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
v
j
l
⁢
d
+
c
⁢
o
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
q
j
l
⁢
d
)
/
2
]
wherein
c
⁢
f
j
l
⁢
d
n
represents an outbound cost for a first order when the jlth candidate warehouse provides the material to the dth user node, ydjl-1 is the fifth route variable which represents whether a jl-1th candidate warehouse provide a material to the dth user node via other candidate warehouses, zjld is the third route variable which represents whether a jlth candidate warehouse provides a material to the dth user node, njld represents an order quantity of the material provided by the jlth candidate warehouse to the dth user node,
c
⁢
c
j
l
⁢
d
q
represents an outbound cost for a subsequent piece when the jlth candidate warehouse provides the material to the dth user node, qjld represents a total number of the material provided by the jlth candidate warehouse to the dth user node, ρd represents an adjustment coefficient,
c
⁢
o
j
l
⁢
d
v
represents an outbound cost by volume when the jlth candidate warehouse provides the material to the dth user node, and
c
⁢
o
j
l
⁢
d
q
represents a single-piece outbound cost when the jlth candidate warehouse provides the material to the din user node;
wherein the delivering cost is calculated according to a sixth formula, and the sixth formula comprises:
C
D
=
∑
d
∑
j
l
[
cdf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cdc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
m
j
l
⁢
d
-
n
j
l
⁢
d
)
]
wherein
c
⁢
d
⁢
f
j
l
⁢
d
n
represents a delivering cost for a first order when the jlth candidate warehouse provides the material to the dth user node,
cdc
j
l
⁢
d
q
represents a delivering cost for extra weight when the jlth candidate warehouse provides the material to the dth user node, mjld represents total weight of the material provided by the jlth candidate warehouse to the dth user node;
wherein the delivering time is calculated according to a seventh formula, and the seventh formula comprises:
T
*
=
∑
j
l
∑
d
T
j
l
⁢
d
Z
⁢
j
l
⁢
d
Tjld represents a conveying time parameter when the jlth candidate warehouse provides the material to the dth user node.

643 more elements

A material conveying system, comprising a conveying device and a server, wherein the server comprises a memory and a processor, the memory is configured to store an instruction executable by the processor, and the processor is configured to:

determine a target conveying route from a plurality of candidate conveying routes according to a route planning model;
wherein the candidate conveying routes refer to routes from a source node of supply to a user node via at least one candidate warehouse;
generate a conveying instruction according to the target conveying route and user order information;
and
send the conveying instruction for actively controlling a conveying device to convey a material from the source node of supply to the user node via the target conveying route,
wherein the route planning model comprises an objective function and the objective function comprises a conveying cost and conveying time;
wherein the conveying cost is obtained according to a route variable set and a conveying cost parameter of a respective candidate warehouse, and the conveying time is obtained according to the route variable set and a conveying time parameter of the respective candidate warehouse;
wherein the conveying cost comprises an inventory cost for a candidate conveying route, a delivering cost for the candidate conveying route, and a transferring cost for the candidate conveying route;
and
wherein the route variable set comprises a first route variable, a second route variable, a third route variable, a fourth route variable, and a fifth route variable, wherein the first route variable represents whether a certain candidate warehouse is selected to transmit a material to another candidate warehouse, the second route variable represents whether a certain source node of supply provides a material to a certain candidate warehouse, the third route variable indicates whether a certain candidate warehouse provides a material to a user node, the fourth route variable indicates whether a certain source node of supply provides a material to a certain user node via at least one candidate warehouse, and the fifth route variable indicates whether to provide a material to the user node via a plurality of candidate warehouses,
wherein the objective function comprises:
f
=
min
⁡
(
w
1
×
C
*
C
b
+
w
2
×
T
*
T
b
)
wherein f represents the objective function, min(⋅) represents calculating a minimum value, w1 represents a cost weight, C* represents a conveying cost, Cb represents a cost benchmark value, w2 represents a time weight, T* represents conveying time, and Tb represents a time benchmark value;
wherein the conveying cost is calculated according to a first formula, and the first formula comprises:
C
*
=
C
W
+
C
D
+
C
T
wherein CW represents an inventory cost, CD represents a delivering cost, and CT represents a transferring cost;
wherein the inventory cost is calculated according to a second formula, and the second formula comprises:
C
W
=
C
W
⁢
1
+
C
W
⁢
2
+
C
W
⁢
3
CW1 represents an inbound cost, CW2 represents a first outbound cost, and CW3 represents a second outbound cost;
wherein the inbound cost is calculated according to a third formula, and the third formula comprises:
C
W
⁢
1
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
c
⁢
i
o
w
⁢
h
⁢
x
o
⁢
i
1
+
ci
i
1
w
⁢
h
⁢
y
i
1
⁢
j
1
+
c
⁢
i
j
1
w
⁢
h
⁢
y
j
1
⁢
i
2
+
…
+
ci
i
l
w
⁢
h
⁢
y
i
l
⁢
j
l
+
c
⁢
i
j
l
w
⁢
h
⁢
z
j
l
⁢
d
)
⁢
y
do
⁢
q
j
l
⁢
d
]
i and j both represent an identifier of a candidate warehouse, 1≤i, j≤l, l represents a total number of the candidate warehouse, d represents an identifier of a user node, 1≤d≤m, m represents a total number of the user node, o represents an identifier of a source node of supply, 1≤o≤p, p represents a total number of the source node or supply,
ci
o
wh
represents a single-piece inbound cost for an oth source node of supply, xoi1 is a second route variable which represents whether the oth source node of supply provides a material to an i1th candidate warehouse,
ci
i
1
wh
represents a single-piece inbound cost for the i1th candidate warehouse,
ci
j
1
wh
represents a single-piece inbound cost for a j1th candidate warehouse per piece, yj1j1 is a first route variable which represents whether the j1th candidate warehouse provides a material to the j1th candidate warehouse, yj1i2 represents whether the j1th candidate warehouse provides a material to an i2th candidate warehouse, zjld is a third route variable which represents whether a jlth candidate warehouse provides a material to a dth user node, ydo is a fourth route variable which represents whether the oth source node of supply provide a material to the dth user node via a candidate warehouse, qjld represents a total number of the material provided by the jlth candidate warehouse to the dth user node, i1, i2, . . . , il-1 and il represent l values of i, j1, j2, . . . , jl-1 and jl represent l values of j;
wherein the first outbound cost is calculated according to a fourth formula, and the fourth formula comprises:
C
W
⁢
2
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
(
c
⁢
o
o
w
⁢
h
⁢
x
o
⁢
i
1
+
co
i
1
w
⁢
h
⁢
y
i
1
⁢
j
1
+
c
⁢
o
j
1
w
⁢
h
⁢
y
j
1
⁢
i
2
+
…
+
co
i
l
w
⁢
h
⁢
y
i
l
⁢
j
l
+
c
⁢
o
j
l
w
⁢
h
⁢
z
j
l
⁢
d
)
⁢
y
di
l
-
1
⁢
v
i
l
-
1
⁢
d
]
wherein
c
⁢
o
o
w
⁢
h
represents an outbound cost by volume for the oth source node of supply,
c
⁢
o
i
1
w
⁢
h
represents an outbound cost by volume for the i1th candidate warehouse,
c
⁢
o
j
1
w
⁢
h
represents an outbound cost by volume for the j1th candidate warehouse, zjld is the third route variable which represents whether the jlth candidate warehouse provides a material to the dth user node, ydil-1 is a fifth route variable which represents whether an il-1th candidate warehouse provides a material to the dth user node via other candidate warehouses, vil-1d represents total volume of the material provided by the il-1th candidate warehouse to the dth user node;
wherein the second outbound cost is calculated according to a fifth formula, and the fifth formula comprises:
C
W
⁢
3
=
∑
o
∑
j
1
⁢
…
⁢
j
l
∑
i
1
⁢
…
⁢
i
l
∑
d
[
cf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
q
j
l
⁢
d
-
n
j
l
⁢
d
)
⁢
(
1
-
ρ
d
)
+
ρ
d
(
c
⁢
o
j
l
⁢
d
v
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
v
j
l
⁢
d
+
c
⁢
o
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
q
j
l
⁢
d
)
/
2
]
wherein
c
⁢
f
j
l
⁢
d
n
represents an outbound cost for a first order when the jlth candidate warehouse provides the material to the dth user node, ydjl-1 is the fifth route variable which represents whether a jl-1th candidate warehouse provide a material to the dth user node via other candidate warehouses, zjld is the third route variable which represents whether a jlth candidate warehouse provides a material to the dth user node, njld represents an order quantity of the material provided by the jlth candidate warehouse to the dth user node,
c
⁢
c
j
l
⁢
d
q
represents an outbound cost for a subsequent piece when the jlth candidate warehouse provides the material to the dth user node, qjld represents a total number of the material provided by the jlth candidate warehouse to the dth user node, ρd represents an adjustment coefficient,
c
⁢
o
j
l
⁢
d
v
represents an outbound cost by volume when the jlth candidate warehouse provides the material to the dth user node, and
c
⁢
o
j
l
⁢
d
q
represents a single-piece outbound cost when the jlth candidate warehouse provides the material to the dth user node;
wherein the delivering cost is calculated according to a sixth formula, and the sixth formula comprises:
C
D
=
∑
d
∑
j
l
[
cdf
j
l
⁢
d
n
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
⁢
n
j
l
⁢
d
+
cdc
j
l
⁢
d
q
⁢
y
dj
l
-
1
⁢
z
j
l
⁢
d
(
m
j
l
⁢
d
-
n
j
l
⁢
d
)
]
wherein
c
⁢
d
⁢
f
j
l
⁢
d
n
represents a delivering cost for a first order when the jlth candidate warehouse provides the material to the dth user node,
c
⁢
d
⁢
c
j
l
⁢
d
q
represents a delivering cost for extra weight when the jlth candidate warehouse provides the material to the dth user node, mjld represents total weight of the material provided by the jlth candidate warehouse to the dth user node;
wherein the delivering time is calculated according to a seventh formula, and the seventh formula comprises:
T
*
=
∑
j
l
∑
d
T
j
l
⁢
d
Z
⁢
j
l
⁢
d
Tjld represents a conveying time parameter when the jlth candidate warehouse provides the material to the dth user node.

633 more elements

Material conveying method, device, system and storage medium

Life of this patent

Material conveying method, device, system and storage medium

Life of this patent

Abstract

Claims20