TY - JOUR
T1 - MILP formulations for highway petrol station replenishment in initiative distribution mode
AU - Wei, Xintong
AU - Liao, Qi
AU - Zhang, Haoran
AU - Liang, Yongtu
AU - Wang, Bohong
AU - Xu, Ning
AU - Yuan, Meng
N1 - Publisher Copyright:
© 2021, The Author(s).
PY - 2021/6
Y1 - 2021/6
N2 - To investigate highway petrol station replenishment in initiative distribution mode, this paper develops a mixed-integer linear programming (MILP) model with minimal operational costs that includes loading costs, unloading costs, transport costs and the costs caused by unpunctual distribution. Based on discrete representation, the working day is divided into equal time intervals, and the truck distribution process is decomposed into a pair of tasks including driving, standby, rest, loading and unloading. Each truck must execute one task during a single interval, and the currently executing task is closely related to the preceding and subsequent tasks. By accounting for predictive time-varying sales at petrol stations, real-time road congestion and a series of operational constraints, the proposed model produces the optimal truck dispatch, namely, a detailed task assignment for all trucks during each time interval. The model is tested on a real-world case of a replenishment system comprising eight highway petrol stations, one depot, one garage and eight trucks to demonstrate its applicability and accuracy.
AB - To investigate highway petrol station replenishment in initiative distribution mode, this paper develops a mixed-integer linear programming (MILP) model with minimal operational costs that includes loading costs, unloading costs, transport costs and the costs caused by unpunctual distribution. Based on discrete representation, the working day is divided into equal time intervals, and the truck distribution process is decomposed into a pair of tasks including driving, standby, rest, loading and unloading. Each truck must execute one task during a single interval, and the currently executing task is closely related to the preceding and subsequent tasks. By accounting for predictive time-varying sales at petrol stations, real-time road congestion and a series of operational constraints, the proposed model produces the optimal truck dispatch, namely, a detailed task assignment for all trucks during each time interval. The model is tested on a real-world case of a replenishment system comprising eight highway petrol stations, one depot, one garage and eight trucks to demonstrate its applicability and accuracy.
KW - Discrete representation
KW - Initiative distribution
KW - MILP
KW - Petrol station
KW - Replenishment
UR - http://www.scopus.com/inward/record.url?scp=85100776213&partnerID=8YFLogxK
U2 - 10.1007/s12182-021-00551-4
DO - 10.1007/s12182-021-00551-4
M3 - Journal article
AN - SCOPUS:85100776213
SN - 1672-5107
VL - 18
SP - 994
EP - 1010
JO - Petroleum Science
JF - Petroleum Science
IS - 3
ER -