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.

为了研究主动分配模式下的高速公路加油站补给，本文开发了一种混合整数线性规划（MILP）模型，该模型具有最小的运营成本，包括装载成本，卸载成本，运输成本以及不按时分配所引起的成本。基于离散表示，将工作日划分为相等的时间间隔，并将卡车的分配过程分解为一对任务，包括驾驶，待机，休息，装载和卸载。每辆卡车必须在一个间隔内执行一个任务，并且当前正在执行的任务与之前和之后的任务密切相关。通过考虑加油站的预测时变销售，实时道路拥堵和一系列操作限制，所提出的模型产生了最佳的卡车调度，即 每个时间间隔内所有卡车的详细任务分配。该模型在一个补给系统的实际案例中进行了测试，补给系统包括八个高速公路加油站，一个仓库，一个车库和八辆卡车，以证明其适用性和准确性。