An Open Access Journal
From: Optimization of a physical internet based supply chain using reinforcement learning
Parameter | Description |
---|---|
i | Set of input nodes |
j | Set of outputs |
v | Set of leading vehicles of platoons |
w | Set of vehicles |
p | Set of platoons |
Vi | The amount of trucks arriving at i starting nodes during the entire time horizon |
M | Maximum number of truck in each platoon |
P | Set of platoons |
s(i,j) | Distance traveled by the vehicle between points (i,j) |
tin | Arrival time of truck vi |
tdisp | Dispatched time of truck vi at input nodes |
thub | Waiting time of vehicle vi at the virtual hub |
cw | The cost of waiting an hour |
cp | Driver labour cost per kilometer |
cf | Unit cost of fuel |
β | Platoon follower indicator |
η | The amount of fuel cost reduction |
Variable | Description |
xv,p | Is equal to 1 if and only if truck v∈V is assigned to platoon p∈P |
xv,w,p | Is equal to 1 if and only if truck w∈V follow truck v∈V in platoon p∈P |