This paper studies the optimization problem of refined oil distribution with multiple trips and multiple due time. Oil depots use multi-cabin vehicles with transportation time windows to distribute multiple orders from each gas station. Each gas station has its own priority, and each order of one gas station has a due time. Comprehensively considering factors including customer priority, order due time, and vehicle transportation time window, with the goal of maximizing distribution revenue, a distribution optimization model of refined oil with multiple trips and multiple due time is established. The improved variable neighborhood search algorithm with the due time removal operator is used to solve the problem. An initial solution based on pushing forward insertion heuristic is constructed. The neighborhood perturbation operator is designed according to the order due time, and a greedy strategy based on the maximum return per unit time is designed to enhance the local optimization ability of the algorithm. A later optimization strategy based on reverse order access is proposed to speed up the convergence speed while ensuring the quality of the solution. The effectiveness of the algorithm is verified by simulation experiments under different scales. The experimental results show that the proposed model and algorithm can not only maximize the distribution revenue, but also effectively improve timeliness of delivery.