Abstract
Taking the distribution route optimization of refined oil as background, this paper studies the inventory
routing problem of refined oil distribution based on working time equilibrium. In consideration
of the constraints of vehicle capacity, time window for unloading oil, service time and demand
of each gas station, we take the working time equilibrium of each vehicle as goal and establish
an integer programming model for the vehicle routing problem of refined oil distribution, the
objective function of the model is to minimize the maximum working time of vehicles. To solve
this model, a Lingo program was written and a heuristic algorithm was designed. We further use
the random generation method to produce an example with 10 gas stations. The local optimal solution
and approximate optimal solution are obtained by using Lingo software and heuristic algorithm
respectively. By comparing the approximate optimal solution obtained by heuristic algorithm
with the local optimal solution obtained by Lingo software, the feasibility of the model and
the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical
basis for the scheduling department to formulate the oil distribution plan