A MILP approach for filling station replenishment problem with time windows in initiative distribution

In this paper, we present a case study on vehicle routing and scheduling problem of filling stations replenishment with time windows in initiative distribution. A mixed-integer linear programming approach is proposed based on discrete-time presentation. By setting the minimal total cost in loading and unloading operations as well as all vehicles' transportation as objective function, and considering the practical issues such as fluctuation in filling station's sales and road congestion, the model is established under the constraints of loading, unloading, rest and standby, vehicle's state, time, filling station, depot and cost. Finally, the method is applied to a real case which has eight filling stations, one depot, one garage and eight vehicles and there are three types of products to be transported in the system. The final results proved better applicability and accuracy of this method.