Abstract
The marginal wells in low-permeability oil fields are characterized by small storage size, scattered distribution, intermittent production, etc. The construction of large-scale gathering pipelines has large investment. So the current production mode is featured by single well tank oil storage, oil tank truck transportation and manual tank truck scheduling. At present, oil well production and crude oil transportation scheduling mainly rely on manual formulation, which has poor coordination and seriously restricts the release of oil well production capacity and the reduction of transportation cost. A mixed-integer linear programming (MILP) model representation was proposed in our previous work. The scale of the built model variables is huge, and the model solution time is long. In this paper, a genetic algorithm based on multi-layer coding is proposed. The first layer of the design code is the driving path of the oil tanker, and the second layer is the crude oil loading and unloading amount and the cumulative time. The algorithm expands the search domain by flipping, exchanging and shifting the code. In the case analysis part, the exact algorithm and the genetic algorithm designed in this paper are used to solve cases of different scales (5, 10, 30 and 200 oil wells) respectively, and the correctness and effectiveness of the algorithm are verified. The results show that, compared with the exact algorithm, the genetic algorithm designed in this paper can quickly solve a feasible scheduling scheme under different oil well scales, especially in the case of large-scale (200 wells) oil well groups. The optimal one-time result in the calculation example (200 wells) takes 1062.3 s to run, and the total driving distance of all tank trucks in the obtained feasible scheme is 11280 km. This study can guide oilfields to quickly formulate dispatching plans and minimize travel distances in non-pipeline well tanker dispatching.