Casing pipe length matching optimization method and system suitable for mandrel type hanger and terminal

Abstract

The invention provides a sleeve length matching optimization method and system suitable for a mandrel type hanger and a terminal, and the method comprises the steps: converting a length matching problem of a mandrel type hanger sleeve into a combined optimization problem based on a simulated annealing algorithm, carrying out the random search in a solution space, and carrying out the step-by-step optimization to find an optimal length matching closest to a target, thereby achieving the optimization of the length matching of the mandrel type hanger sleeve. Through random jump and local optimization among different solutions, a local optimal solution can be effectively avoided, a global optimal solution is finally converged, the calculation process is simple, the speed is high, the error is small, the stability is good, the cost is low, and on-site popularization and application are facilitated.

Description

Technical Field

[0001] The present application relates to the field of oil and gas well engineering in petroleum engineering, and in particular to a casing length optimization method, system and terminal suitable for a mandrel-type hanger. Background Art

[0002] With the continuous development of the oil and gas industry, especially the increasing scale of high-pressure gas well development, the technical performance requirements for oil and gas well casing and its hanger are also constantly increasing. The traditional casing length matching method is mainly through on-site supervision or manual matching by technicians. This method has significant limitations, that is, the matching with the well depth is not accurate, usually with an error range of 1 to 5 meters. This inaccuracy may be acceptable in conventional oil and gas wells, but in high-pressure gas wells, it may cause a series of serious engineering problems.

[0003] At present, with the expansion of the development scale of high-pressure gas wells, mandrel hangers with better air tightness and higher pressure levels are being promoted and used on site. This type of hanger is directly sealed with the casing through metal threads, without cutting the casing, which greatly simplifies the installation process, improves installation efficiency and sealing performance, and is suitable for land or offshore jack-up drilling platforms. However, this feature of the mandrel hanger also puts higher requirements on the precise length of its matching casing.

[0004] Since the mandrel hanger and the casing are sealed with metal threads, the length cannot be adjusted by cutting the casing. Therefore, the length of the casing string must be strictly controlled within the design range. If the length of the matching casing string is too long or too short, the length of the reserved pocket will deviate from the design value, which will not only affect the cementing quality, but also may cause the casing to fail to hang, and then cause serious accidents such as blowouts and well collapse. Summary of the invention

[0005] In view of the above-mentioned shortcomings of the prior art, the purpose of the present application is to provide a casing length optimization method, system and terminal suitable for a mandrel hanger, so as to solve technical problems such as how to quickly and accurately provide an optimized casing string combination solution.

[0006] To achieve the above-mentioned purpose and other related purposes, the first aspect of the present application provides a casing length optimization method suitable for a mandrel hanger, comprising: recording the field marking and length corresponding to each casing according to the acquired specification parameters of the casing on site to form a field casing table; based on the field casing table, and according to the current well depth and the distance between the mandrel hanger and the turntable surface, calculating the required actual casing length; based on the simulated annealing algorithm, converting the casing length problem of the mandrel hanger into a combinatorial optimization problem, and determining the final optimal casing string set according to the actual casing length; outputting the final optimal casing string set to an electronic document, the data of the electronic document including the field marking of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

[0007] In some embodiments of the first aspect of the present application, based on the acquired specification parameters of the casing on the site, the site marking and length corresponding to each casing are recorded to form a site casing table, including: determining the casing buckle type, and updating the length of the corresponding casing based on the total length of each casing with the buckle type and the buckle length of each casing with the buckle type on the site that can be used for the current opening, so as to form a site casing table; wherein the length of the casing is calculated as the total length of the casing minus the buckle length of the casing.

[0008] In some embodiments of the first aspect of the present application, the method for calculating the required actual casing length based on the site casing table and according to the current well depth and the distance of the mandrel hanger from the turntable surface includes: determining the current well depth and the reserved pocket length, and calculating the required theoretical casing length according to the distance of the mandrel hanger from the turntable surface, the length of the float collar and the length of the float shoe; according to preset requirements, determining a number of single casings that must be selected in the casing string combination, traversing the site casing table and recording the site markings corresponding to each single casing to calculate the required actual casing length.

[0009] In some embodiments of the first aspect of the present application, the method of converting the casing length matching problem of the mandrel hanger into a combinatorial optimization problem based on the simulated annealing algorithm and determining the final optimal casing string set according to the actual casing length matching includes: recording the site marking number in the site casing table as the original site number; traversing the remaining available casings in the site casing table except for the several single casings that must be selected, and renumbering the remaining available casings according to the natural number sequence to obtain the new site number corresponding to the remaining available casings; setting simulated annealing parameters, initializing the current casing string set, the total length of the current casing string set, the optimal casing string set and the total length of the optimal casing string set; the simulated annealing parameters include one or more combinations of initial temperature, cooling rate, minimum temperature and the number of iterations for each temperature; gradually reducing the temperature to the minimum temperature according to the cooling rate, and performing multiple rounds of iterative updates on the current casing string set and the optimal casing string set to obtain the final optimal casing string set.

[0010] In some embodiments of the first aspect of the present application, the method of performing multiple rounds of iterative updates on the current casing string set and the optimal casing string set includes: gradually lowering the temperature according to the cooling rate, and when the current temperature is greater than the minimum temperature, randomly removing, adding or replacing the casing in the current casing string set to generate a domain casing string set, and calculating the total length of the domain casing string set; determining whether the total length of the domain casing string set is greater than or equal to the total length of the current casing string set; if the total length of the domain casing string set is greater than or equal to the total length of the current casing string set, and is less than or equal to the actual casing length, then updating the current casing string set. is the casing string set of the field; if the total length of the field casing string set is less than the total length of the current casing string set, the probability of accepting the field casing string set is calculated, and according to the calculated probability, it is determined whether to update the current casing string set to the casing string set of the field; it is determined whether the total length of the updated current casing string set is greater than the total length of the optimal casing string set; if the total length of the updated current casing string set is greater than the total length of the optimal casing string set, the optimal casing string set is updated to the updated current casing string set; if the total length of the updated current casing string set is less than or equal to the total length of the optimal casing string set, the optimal casing string set is not updated.

[0011] In some embodiments of the first aspect of the present application, the method of calculating the probability of receiving the field casing string set includes:

[0012]

[0013] Among them, P represents the probability of accepting the domain casing string set; T represents the current temperature; sum(B) represents the total length of the domain casing string set; sum(A) represents the total length of the current casing string set; exp represents the natural exponential function.

[0014] In some embodiments of the first aspect of the present application, the calculation method of the theoretical casing length includes:

[0015] D = H-d1-d2-d3-d4;

[0016] Wherein, D represents theoretical casing length; H represents the depth of the current well; d1 represents the length of the reserved pocket; d2 represents the distance between the mandrel hanger and the turntable surface; d3 represents the length of the float collar; and d4 represents the length of the float shoe.

[0017] In some embodiments of the first aspect of the present application, the calculation method of the actual casing length includes:

[0018]

[0019] Wherein, L represents the actual casing length; D represents the theoretical casing length; n represents the number of single casings that must be selected in the casing string combination; i m Indicates the site number corresponding to the single casing that must be selected for the mth root; Indicates that the site is marked as i m The length of a single casing.

[0020] To achieve the above-mentioned purpose and other related purposes, the second aspect of the present application provides a casing length calculation system suitable for a mandrel hanger, including: an actual casing length calculation module, which is used to record the field marking and length corresponding to each casing according to the obtained specification parameters of the casing on the site to form a field casing table; based on the field casing table, and according to the current well depth and the distance between the mandrel hanger and the turntable surface, the required actual casing length is calculated; an optimal casing string set calculation module, which is used to convert the casing length problem of the mandrel hanger into a combinatorial optimization problem based on a simulated annealing algorithm, and determine the final optimal casing string set according to the actual casing length; a data output module, which is used to output the final optimal casing string set to an electronic document, the data of the electronic document including the field marking of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

[0021] To achieve the above-mentioned purpose and other related purposes, the third aspect of the present application provides an electronic terminal, including a memory, a processor and a computer program stored in the memory, and the processor executes the computer program to implement the casing length optimization method suitable for a mandrel hanger as described above.

[0022] As described above, the casing length optimization method, system and terminal applicable to the mandrel hanger of the present application have the following beneficial effects: based on the simulated annealing algorithm, the length matching problem of the mandrel hanger casing is converted into a combinatorial optimization problem, and random jumps and local optimizations are performed between different solutions, which can effectively avoid the local optimal solution and finally converge to the global optimal solution to find the optimal length matching closest to the target, and obtain a more accurate casing length matching combination scheme, thereby improving the overall performance and stability of the mandrel hanger. The optimized casing length matching combination scheme reduces the number of casings used or reduces the total length of the casing, thereby reducing production costs and installation difficulties. The simulated annealing algorithm has strong robustness and adaptability, and can handle different types of casing length optimization problems to meet the requirements of different working conditions and needs. The casing length optimization method applicable to the mandrel hanger of the present invention has a simple calculation process, fast calculation speed, extremely small error, strong stability, low cost, and the calculation result is close to the global optimal solution, which effectively solves the casing length matching problem of the mandrel casing hanger, and is conducive to on-site promotion and application. The present invention can also be widely applied to the problem of sleeve length matching of slip-type hangers, and can effectively avoid the time loss caused by cutting the sleeve. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 Shown is a flow chart of a casing length optimization method applicable to a mandrel hanger in one embodiment of the present application.

[0024] Figure 2 Shown is a schematic diagram of a process for determining a final optimal casing string set in one embodiment of the present application.

[0025] Figure 3 Shown is a schematic diagram of a process for updating a current casing string set and an optimal casing string set in one embodiment of the present application.

[0026] Figure 4 Shown is a schematic block diagram of a casing length calculation system suitable for a mandrel hanger in one embodiment of the present application.

[0027] Figure 5 Shown is a schematic diagram of the structure of an electronic terminal in one embodiment of the present application. DETAILED DESCRIPTION

[0028] The following describes the embodiments of the present application through specific examples, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. The present application can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present application. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict.

[0029] Before further describing the present invention in detail, the nouns and terms involved in the embodiments of the present invention are explained. The nouns and terms involved in the embodiments of the present invention are applicable to the following interpretations:

[0030] <1> The depth of the current drilling: the distance from the reference plane to the drilling completion position of the current drilling.

[0031] <2> Reserved pocket length: The length of space reserved from the bottom of the casing string to the bottom of the well for the safety of casing lowering.

[0032] <3> Floating collar: A short section of casing coupling equipped with a check valve, usually installed between the lowest few casings.

[0033] <4> Float shoe: A one-way valve nipple installed at the end of the casing string and used in conjunction with a float collar.

[0034] <5> The buckle length of the casing is the length represented by the number of buckles in the casing connection, which is an important parameter of the casing connection. This length is usually determined based on the casing diameter, material, connection environment and required connection strength.

[0035] The technical solution of the embodiment of the present application can be applied to land or marine jack-up drilling platforms. In land drilling operations, due to the limitations of terrain, geological conditions and working space, there are very high requirements for the accuracy and reliability of drilling equipment. Marine jack-up drilling platform: The marine environment is complex and changeable, and higher requirements are placed on the safety and stability of drilling equipment. When operating, marine jack-up drilling platforms need to face the challenges of various natural factors such as waves, tides, and currents. Especially in deep-sea drilling operations, precise control of the length of the casing string is crucial to preventing serious accidents such as blowouts and well collapses.

[0036] To facilitate understanding of the embodiments of the present application, first Figure 1 Detailed description. Figure 1 The schematic diagram of the process flow of the casing length optimization method applicable to the mandrel hanger in the embodiment of the present invention is shown. The casing length optimization method applicable to the mandrel hanger in the embodiment of the present invention mainly includes the following steps:

[0037] S101: According to the acquired specification parameters of the casing on the site, the site marking number and length corresponding to each casing are recorded to form a site casing table.

[0038] In this embodiment, based on the acquired specification parameters of the casing on the site, the site marking and length corresponding to each casing are recorded to form a site casing table, including: determining the casing buckle type, and updating the length of the corresponding casing based on the total length of each casing with the buckle type that can be used for the current opening on the site and the buckle length of each casing with the buckle type, to form a site casing table; wherein the length of the casing is calculated as the total length of the casing minus the buckle length of the casing.

[0039] In this embodiment, the buckle type of the casing on the site is determined, and the length of all the casings on the site that can be used for the current opening model is measured according to the buckle type measurement standard, where the total number of casings that can be used for the current opening model is N, the site number of each casing is i, and the total length of each casing is l i ', the buckle length of the buckle type is measured as k, and the length of the sleeve is calculated as follows:

[0040] l i = l i '-k; Formula (I)

[0041] Among them, l i represents the length of the casing marked with i at the site; k represents the buckle length of the casing marked with i at the site; l i ' indicates the total length of the casing marked i at the site.

[0042] S102: Based on the site casing table, and according to the well depth of the current opening and the distance between the mandrel hanger and the rotary table surface, the actual required casing length is calculated.

[0043] In this embodiment, the method of calculating the required actual casing length based on the field casing table and according to the well depth of the current drilling and the distance between the mandrel hanger and the rotary table surface includes:

[0044] (1) Determine the well depth and reserved pocket length of the current well, and calculate the required theoretical casing length according to the distance between the mandrel hanger and the rotary table surface, the length of the float collar and the length of the float shoe. The calculation method of the theoretical casing length includes:

[0045] D=H-d1-d2-d3-d4; Formula (II)

[0046] Wherein, D represents theoretical casing length; H represents the depth of the current well; d1 represents the length of the reserved pocket; d2 represents the distance between the mandrel hanger and the turntable surface; d3 represents the length of the float collar; and d4 represents the length of the float shoe.

[0047] In this embodiment, the distance between the mandrel hanger and the turntable surface refers to the vertical distance from the wellhead turntable surface to the hanger installation position (usually the top of the casing).

[0048] (2) According to the preset requirements, determine the number of single casings that must be selected in the casing string combination, traverse the field casing table and record the field markings corresponding to each single casing to calculate the required actual casing length. The calculation method of the actual casing length includes:

[0049]

[0050] Wherein, L represents the actual casing length; D represents the theoretical casing length; n represents the number of single casings that must be selected in the casing string combination; i m Indicates the site number corresponding to the single casing that must be selected for the mth root; Indicates that the site is marked as i m The length of a single casing.

[0051] In this embodiment, a number of single casings that must be selected in the casing string combination are determined according to the electrical positioning requirements or other requirements, wherein the single casing that must be selected in the casing string combination refers to casings of a specific length that must be added to the casing string combination for reasons such as depth calibration and positioning. The electrical positioning requirements include but are not limited to: voltage level and insulation requirements, electromagnetic compatibility, capacitance and inductance characteristics, temperature and pressure adaptability, etc. Other requirements include but are not limited to: casing safety, ease of operation, economy, environmental adaptability, etc.

[0052] S103: Based on the simulated annealing algorithm, the casing length matching problem of the mandrel hanger is transformed into a combinatorial optimization problem, and the final optimal casing string set is determined according to the actual casing length matching.

[0053] In this embodiment, if Figure 2 As shown, a schematic diagram of the process of determining the final optimal casing string set in an embodiment of the present invention is shown. Based on the simulated annealing algorithm, the casing length matching problem of the mandrel hanger is converted into a combinatorial optimization problem, and the method of determining the final optimal casing string set according to the actual casing length matching includes:

[0054] S1031: Record the site number in the site casing table as the original site number; traverse the site casing table to remove the remaining available casings from the several single casings that must be selected, and renumber the remaining available casings according to a natural number sequence to obtain new site numbers corresponding to the remaining available casings.

[0055] In this embodiment, if the site numbering of the casing required for the current opening is 1, 2, 3.....N, and the number of single casings that must be selected is n, then the new site numbering of the remaining available casings is 1, 2, 3.....(Nn), and the remaining available casings with new site numbering of 1, 2, 3.....(Nn) are optimally matched. For example, if the site numbering of the casing required for the current opening is 1, 2, 3, 4, 5, 6, and the site numbering of the single casing that must be selected is 3, 4, then the remaining available casings except for the site numbering of 3, 4 are renumbered according to the natural number sequence, which is different from the site numbering in the site casing table (i.e., the original site numbering), that is, the casings with site numbering of 1, 2, 5, 6 (original site numbering) are renumbered, and the new site numbering is 1, 2, 3, 4. Then, based on the simulated annealing algorithm, the remaining available casings are optimally matched.

[0056] S1032: Setting simulated annealing parameters, initializing the current casing string set, the total length of the current casing string set, the optimal casing string set, and the total length of the optimal casing string set; the simulated annealing parameters include one or more combinations of initial temperature, cooling rate, minimum temperature, and the number of iterations for each temperature.

[0057] In this embodiment, the current casing string set A, the total length of the current casing string set sum(A), the optimal casing string set S and the total length of the optimal casing string set sum(S) are initialized. Exemplarily, the current casing string set A and the optimal casing string set S are initialized to null values.

[0058] S1033: gradually lowering the temperature to a minimum temperature according to the cooling rate, and performing multiple rounds of iterative updates on the current casing string set and the optimal casing string set to obtain a final optimal casing string set.

[0059] In this embodiment, if Figure 3 As shown, a schematic diagram of the process of updating the current casing string set and the optimal casing string set in an embodiment of the present invention is shown. The updating method includes the following:

[0060] S1033A: The temperature is gradually lowered according to the cooling rate. When the current temperature is greater than the minimum temperature, the casing in the current casing string set is randomly removed, added or replaced to generate a domain casing string set, and the total length of the domain casing string set is calculated.

[0061] In this embodiment, the simulated annealing parameters include one or more combinations of initial temperature, cooling rate, minimum temperature, and the number of iterations for each temperature. For example, the initial temperature is T0, the cooling rate is α, the current temperature is T, and the minimum temperature is T min. The number of iterations for each temperature refers to the number of times the algorithm executes the inner loop (i.e., tries different solutions and decides whether to accept them based on the current temperature) at each fixed temperature. The current temperature T←T×α is updated according to the cooling rate α. In this way, α is a positive number between 0 and 1 (excluding 0). Each time the temperature is updated, the current temperature is multiplied by α, so that the temperature is gradually reduced. This method is very useful in simulating the exponential decay of temperature during physical annealing. For example, if the initial temperature T0=1000 and the cooling rate α=0.95, after one iteration, the current temperature T=1000×0.95=950. After two iterations, the current temperature T=950×0.95=902.5, and so on.

[0062] In this embodiment, removing a tube from the current tube string set means randomly selecting a tube and removing it from the current tube string set A. Adding a tube from the current tube string set means randomly selecting a tube (or generating a new tube) and adding it to a random position in the current tube string set A. Replacing a tube from the current tube string set means randomly selecting a tube and replacing it with another random tube (or a new tube) in the current tube string set A, repeating the above operation, thereby generating a domain tube string set B, and calculating the total length sum(B) of the domain tube string set.

[0063] S1033B: Determine whether the total length of the domain casing string set is greater than or equal to the total length of the current casing string set.

[0064] S1033C: If the total length of the domain casing string set is greater than or equal to the total length of the current casing string set, and less than or equal to the actual casing length, then update the current casing string set to the domain casing string set.

[0065] In this embodiment, if sum(A)≤sum(B)≤L, the accepted domain casing string set is the current casing string set. Exemplarily, the current casing string set A={1, 2, 3, 4}, the domain casing string set B={2, 3, 4, 5}, if sum(A)≤sum(B)≤L, then the current casing string set A=B={2, 3, 4, 5} is updated, that is, the updated current casing string set A'={2, 3, 4, 5}. If sum(B)>L, the domain casing string set is regenerated.

[0066] S1033D: If the total length of the domain casing string set is less than the total length of the current casing string set, calculate the probability of accepting the domain casing string set, and determine whether to update the current casing string set to the domain casing string set based on the calculated probability.

[0067] In this embodiment, if sum(B) < sum(A), the neighborhood casing string set is accepted as the current casing string set with a certain probability. The method for calculating the probability of accepting the neighborhood casing string set includes:

[0068]

[0069] where P represents the probability of accepting the neighborhood casing string set; T represents the current temperature; sum(B) represents the total length of the neighborhood casing string set; sum(A) represents the total length of the current casing string set; exp represents the natural exponential function.

[0070] In this embodiment, the higher the current temperature T, the closer the value of the exponential function is to 1, which means that in the high-temperature stage, the algorithm is more inclined to accept worse solutions, thus helping to jump out of the local optimum. As the current temperature T decreases, the value of the exponential function also gradually decreases, which means that in the low-temperature stage, the algorithm is more inclined to accept better solutions, thus gradually converging to the global optimum. The neighborhood casing string set is accepted as the current casing string set with probability P. The specific method is: generate a random number r between 0 and 1. If r < P, accept the neighborhood casing string set as the current casing string set; if r > P, keep the current casing string set unchanged. Exemplarily, the current casing string set A = {1, 2, 3, 4}, and the neighborhood casing string set B = {2, 3, 4, 5}. If r < P, update the current casing string set A = B = {2, 3, 4, 5}, that is, the updated current casing string set A' = {2, 3, 4, 5}, and enter the next iteration with the current casing string set A = {2, 3, 4, 5}; if r > P, keep the current casing string set A = {1, 2, 3, 4}, that is, the updated current casing string set A' = {1, 2, 3, 4}, and enter the next iteration with the current casing string set A = {1, 2, 3, 4}.

[0071] S1033E: Determine whether the total length of the updated current casing string set is greater than the total length of the optimal casing string set.

[0072] S1033F: If the total length of the updated current casing string set is greater than the total length of the optimal casing string set, update the optimal casing string set to the updated current casing string set.

[0073] S1033G: If the total length of the updated current casing string set is less than or equal to the total length of the optimal casing string set, do not update the optimal casing string set.

[0074] In this embodiment, the total length of the current casing string set after update is sum(A)'. If sum(A)'>sum(S), the optimal casing string set S=A' is updated and the next round of iteration is entered. If sum(A)'≤sum(S), the optimal casing string set S is maintained unchanged and the next round of iteration is entered.

[0075] In this embodiment, the current temperature is updated according to the cooling rate α, and the new site number of the casing is recorded each time it is updated, so as to trace back which casing is selected later. After multiple rounds of iterations, when the current temperature drops to the minimum temperature T min After that, the simulated annealing process ends. At this point, the algorithm has found an approximately optimal final optimal casing string set, and the casings in the final optimal casing string set can be combined to form the closest actual casing length.

[0076] S104: Output the final optimal casing string set to an electronic document, the data of which includes the site marking number of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set. The following steps are included:

[0077] (1) Starting from the final optimal casing string set, reverse tracing is performed to trace back the new site number of the casing in the final optimal casing string set that can meet the actual casing length allocation.

[0078] In this embodiment, reverse tracing is performed starting from the final optimal casing string set, and new site numbers of casings in the final optimal casing string set that can meet the actual casing length allocation are recorded.

[0079] (2) The new site number of the casing in the final optimal casing string set is converted back to the corresponding original site number to obtain the site number of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set and output them.

[0080] In this embodiment, according to the correspondence between the new site number and the original site number, the site number i of the casing in the final optimal casing string set that can meet the actual casing length matching and the corresponding casing length l are found. i , this is the most optimized casing length solution.

[0081] In this embodiment, the calculated final optimal casing string set is output to a csv or excel file, and the output data includes the site marking of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

[0082] It is worth mentioning that the simulated annealing algorithm is an optimization algorithm for a serial structure that can effectively avoid falling into local minima and eventually tend to the global optimum. Theoretically, the algorithm has probabilistic global optimization performance and has been widely used in engineering.

[0083] Furthermore, the casing length optimization method applicable to the mandrel hanger of the present invention is based on the simulated annealing algorithm, which converts the length matching problem of the mandrel hanger casing into a combinatorial optimization problem, performs random jumps and local optimization between different solutions, can effectively avoid the local optimal solution, and finally converges to the global optimal solution to find the optimal length matching closest to the target, and obtain a more accurate casing length matching combination scheme, thereby improving the overall performance and stability of the mandrel hanger. The optimized casing length matching combination scheme reduces the number of casings used or reduces the total length of the casing, thereby reducing production costs and installation difficulties. The simulated annealing algorithm has strong robustness and adaptability, and can handle different types of casing length optimization problems to meet the requirements of different working conditions and needs. The casing length optimization method applicable to the mandrel hanger of the present invention has a simple calculation process, fast calculation speed, extremely small error, strong stability, low cost, and the calculation result is close to the global optimal solution, which effectively solves the casing length matching problem of the mandrel casing hanger, and is conducive to on-site promotion and application. The present invention can also be widely applied to the problem of sleeve length matching of slip-type hangers, and can effectively avoid the time loss caused by cutting the sleeve.

[0084] It is worth noting that the traditional casing length matching method is through on-site supervision or manual matching by technicians, and the matching with the well depth is not accurate, and the error is usually 1 to 5 meters. When using a general cava-type hanger, the casing can be cut to match the lowered casing with the well depth and the hanger position, but this method reduces the drilling time efficiency and causes a waste of casing length. At present, with the expansion of the scale of high-pressure gas well development, mandrel-type hangers with better air tightness and higher pressure levels are being promoted and used on site. The mandrel-type hanger and the casing are sealed with metal threads and cannot be matched by cutting the casing, which puts forward more precise requirements for the casing length matching algorithm. The casing length optimization method suitable for the mandrel-type hanger of the present invention, based on the simulated annealing algorithm, converts the length matching problem of the mandrel-type hanger casing into a combinatorial optimization problem. The optimization method has a simple calculation process, short time consumption, and the error is generally within 0.5m. The error can be completely eliminated by adjusting the pocket length, which is conducive to on-site promotion and application.

[0085] It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" represent examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0086] In the embodiments of the present application, "at least one" refers to one or more, and "plurality" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can represent: a, b, c, ab, ac, bc or abc, where a, b, c can be single or multiple.

[0087] Figure 4 Schematic diagram of a casing length calculation system for a mandrel hanger provided in an embodiment of the present application. Figure 4 As shown, the casing length calculation system 400 applicable to the mandrel hanger includes:

[0088] The actual casing length calculation module 401 is used to record the field marking number and length of each casing according to the obtained specification parameters of the casing on the site to form a field casing table; based on the field casing table, and according to the well depth of the current drilling and the distance between the mandrel hanger and the rotary table surface, the required actual casing length is calculated;

[0089] The optimal casing string set calculation module 402 is used to convert the casing length matching problem of the mandrel hanger into a combinatorial optimization problem based on a simulated annealing algorithm, and determine the final optimal casing string set according to the actual casing length matching;

[0090] The data output module 403 is used to output the final optimal casing string set to an electronic document, wherein the data of the electronic document includes the site marking number of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

[0091] It should be understood that the specific process of each module executing the above corresponding steps has been described in detail in the above method embodiment, and for the sake of brevity, it will not be repeated here.

[0092] It should also be understood that the division of modules in the embodiments of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. In addition, each functional module in each embodiment of the present application may be integrated into a processor, or may exist physically separately, or two or more modules may be integrated into one module. The above-mentioned integrated modules may be implemented in the form of hardware or in the form of software functional modules.

[0093] Figure 5is a schematic block diagram of an electronic terminal provided in an embodiment of the present application. Figure 5 As shown, the electronic terminal 500 includes: at least one processor 501, a memory 502, at least one network interface 503 and a user interface 505. The various components in the device are coupled together through a bus system 504. It can be understood that the bus system 504 is used to realize the connection and communication between these components. In addition to the data bus, the bus system 504 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, Figure 5 In the specification, various buses are labeled as bus systems.

[0094] The user interface 505 may include a display, a keyboard, a mouse, a trackball, a click gun, keys, buttons, a touch pad or a touch screen.

[0095] It is understood that the memory 502 can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM). The memory described in the embodiments of the present invention is intended to include but is not limited to these and any other suitable categories of memory.

[0096] The memory 502 in the embodiment of the present invention is used to store various categories of data to support the operation of the electronic terminal 500. Examples of these data include: any executable program used to operate on the electronic terminal 500, such as an operating system 5021 and an application 5022; the operating system 5021 includes various system programs, such as a framework layer, a core library layer, a driver layer, etc., for implementing various basic services and processing hardware-based tasks. The application 5022 can include various applications, such as a media player (Media Player), a browser (Browser), etc., for implementing various application services. The casing length optimization method for a mandrel hanger provided in the embodiment of the present invention can be included in the application 5022.

[0097] The method disclosed in the above embodiment of the present invention can be applied to the processor 501, or implemented by the processor 501. The processor 501 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 501 or the instruction in the form of software. The above processor 501 may be a general processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The processor 501 can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiment of the present invention. The general processor 501 may be a microprocessor or any conventional processor, etc. In combination with the steps of the accessory optimization method provided in the embodiment of the present invention, it can be directly embodied as a hardware decoding processor to execute, or it can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium, which is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0098] In an exemplary embodiment, the electronic terminal 500 may be implemented by one or more application specific integrated circuits (ASIC), DSP, programmable logic device (PLD), complex programmable logic device (CPLD) to execute the aforementioned method.

[0099] According to the method provided in the embodiment of the present application, the present application also provides a computer program product, which includes: a computer program code, when the computer program code is run on a computer, the computer executes Figures 1 to 3 A method according to any one of the embodiments shown.

[0100] According to the method provided in the embodiment of the present application, the present application also provides a computer-readable storage medium, which stores a program code, and when the program code is run on a computer, the computer executes Figures 1 to 3 A method according to any one of the embodiments shown.

[0101] The terms "component", "module", "system", etc. used in this specification are used to represent computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program and / or a computer. By way of illustration, both applications running on a computing device and a computing device can be components. One or more components may reside in a process and / or an execution thread, and a component may be located on a computer and / or distributed between two or more computers. In addition, these components may be executed from various computer-readable media having various data structures stored thereon. Components may, for example, communicate through local and / or remote processes according to signals having one or more data packets (e.g., data from two components interacting with another component between a local system, a distributed system and / or a network, such as the Internet interacting with other systems through signals).

[0102] Those of ordinary skill in the art will appreciate that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or in a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0103] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0104] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0105] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0106] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0107] In the above embodiments, the functions of each functional unit can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions (programs). When loading and executing computer program instructions (programs) on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more available media integrations. Available media may be magnetic media (e.g., floppy disks, hard disks, tapes), optical media (e.g., high-density digital video discs (DVDs), or semiconductor media (e.g., solid state disks (SSDs), etc.).

[0108] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program codes.

[0109] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0110] Furthermore, the following provides a specific application implementation case of the casing length optimization method applicable to the mandrel hanger. A mandrel hanger is used in a high-pressure risk exploration well in a certain sea area. The completion depth in the third opening is 3585m. The distance between the mandrel hanger and the turntable surface is 16.87m, the length of the float shoe is 0.56m, the length of the float collar is 0.48m, the depth of the reserved pocket is 5m, and the short casing 1 that must be lowered for logging and depth calibration is 5.022m long, and the short casing 2 is 3.048m long. In order to optimize the combination of the lowered casing string, the following steps are performed according to the optimization method of the present invention:

[0111] The first step is to measure the length of the field casing and mark the field number of the casing to form a field casing table, as shown in Table 1:

[0112] Table 1244.5mm field casing table (length without buckle)

[0113]

[0114]

[0115] The second step is to determine the actual casing length, i.e., the target length. The completion depth in the third opening is 3585m, the distance between the mandrel hanger and the rotary table surface is 16.87m, the length of the float shoe is 0.56m, the length of the float collar is 0.48m, the depth of the reserved pocket is 5m, the length of the short casing 1 that must be lowered for logging and depth calibration is 5.022m, and the length of the short casing 2 is 3.048m. According to step S102 of the present invention, the actual casing length is 3554.02m.

[0116] In the third step, the field casing table and the actual casing length are used as input data, and the casing length optimization method, system and terminal for mandrel hanger of the present invention are used to construct and calculate the dynamic programming optimization model, and the final optimal casing string set is output, as shown in Table 2. The final actual casing length is 3554.02m, and the error with the target casing length is 0.

[0117] Table 2 Ultimate optimal casing string set

[0118]

[0119]

[0120]

[0121]

[0122] In summary, the present application provides a casing length optimization method, system and terminal suitable for mandrel hanger. Based on the simulated annealing algorithm, the length matching problem of the mandrel hanger casing is converted into a combinatorial optimization problem. Random jumps and local optimization are performed between different solutions, which can effectively avoid the local optimal solution and finally converge to the global optimal solution to find the optimal length matching closest to the target, and obtain a more accurate casing length matching combination scheme, thereby improving the overall performance and stability of the mandrel hanger. The optimized casing length matching combination scheme reduces the number of casings used or reduces the total length of the casing, thereby reducing production costs and installation difficulties. The simulated annealing algorithm has strong robustness and adaptability, and can handle different types of casing length optimization problems to meet the requirements of different working conditions and needs. The casing length optimization method suitable for mandrel hanger of the present invention has a simple calculation process, fast calculation speed, extremely small error, strong stability, low cost, and the calculation result is close to the global optimal solution, which effectively solves the casing length matching problem of mandrel casing hanger and is conducive to on-site promotion and application. The present invention can also be applied to the problem of sleeve length matching of slip type hanger, and can effectively avoid the time loss caused by cutting the sleeve. Therefore, the present application effectively overcomes various shortcomings in the prior art and has high industrial utilization value.

[0123] The above embodiments are merely illustrative of the principles and effects of the present application and are not intended to limit the present application. Anyone familiar with the technology may modify or change the above embodiments without violating the spirit and scope of the present application. Therefore, all equivalent modifications or changes made by a person of ordinary skill in the art without departing from the spirit and technical ideas disclosed in the present application shall still be covered by the claims of the present application.

Claims

1. A casing length optimization method suitable for a mandrel hanger, characterized in that: include: According to the obtained specifications of the casing on site, record the site marking number and length of each casing to form a site casing table; Based on the field casing table, the actual casing length required is calculated according to the well depth of the current drilling and the distance between the mandrel hanger and the rotary table surface; Based on the simulated annealing algorithm, the casing length matching problem of the mandrel hanger is transformed into a combinatorial optimization problem, and the final optimal casing string set is determined according to the actual casing length matching. The final optimal casing string set is output to an electronic document, wherein the data of the electronic document includes the site marking number of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

2. The casing length optimization method for a mandrel hanger according to claim 1, characterized in that: According to the obtained specifications of the casing on the site, the site marking number and length of each casing are recorded to form a site casing table, including: Determine the buckle type of the casing, and update the length of the corresponding casing according to the total length of each casing with the buckle type that can be used for the current opening on the site and the buckle length of each casing with the buckle type to form a site casing table; wherein the length of the casing is calculated as the total length of the casing minus the buckle length of the casing.

3. The casing length optimization method for a mandrel hanger according to claim 1, characterized in that: The method of calculating the actual required casing length based on the field casing table and according to the well depth of the current opening and the distance between the mandrel hanger and the rotary table surface includes: Determine the well depth and reserved pocket length of the current drilling, and calculate the required theoretical casing length based on the distance between the mandrel hanger and the rotary table, the length of the float collar and the length of the float shoe; According to the preset requirements, determine the number of single casings that must be selected in the casing string combination, traverse the site casing table and record the site marking number corresponding to each single casing to calculate the actual required casing length.

4. The casing length optimization method for a mandrel hanger according to claim 3, characterized in that: Based on the simulated annealing algorithm, the casing length matching problem of the mandrel hanger is converted into a combinatorial optimization problem. The method of determining the final optimal casing string set according to the actual casing length matching includes: Record the site number in the site casing table as the original site number; traverse the site casing table to remove the remaining available casings from the plurality of single casings that must be selected, and renumber the remaining available casings according to a natural number sequence to obtain new site numbers corresponding to the remaining available casings; Setting simulated annealing parameters, initializing the current casing string set, the total length of the current casing string set, the optimal casing string set, and the total length of the optimal casing string set; the simulated annealing parameters include one or more combinations of initial temperature, cooling rate, minimum temperature, and the number of iterations for each temperature; The temperature is gradually reduced to the minimum temperature according to the cooling rate, and the current casing string set and the optimal casing string set are iteratively updated for multiple rounds to obtain the final optimal casing string set.

5. The casing length optimization method for a mandrel hanger according to claim 4, characterized in that: The method of performing multiple rounds of iterative updates on the current casing string set and the optimal casing string set includes: The temperature is gradually lowered according to the cooling rate. When the current temperature is greater than the minimum temperature, the casing in the current casing string set is randomly removed, added or replaced to generate a domain casing string set, and the total length of the domain casing string set is calculated; Determine whether the total length of the domain casing string set is greater than or equal to the total length of the current casing string set; If the total length of the domain casing string set is greater than or equal to the total length of the current casing string set, and less than or equal to the actual casing length, then update the current casing string set to the domain casing string set; If the total length of the domain casing string set is less than the total length of the current casing string set, the probability of accepting the domain casing string set is calculated, and according to the calculated probability, it is determined whether to update the current casing string set to the domain casing string set; Determine whether the total length of the updated current casing string set is greater than the total length of the optimal casing string set; If the total length of the updated current casing string set is greater than the total length of the optimal casing string set, then the optimal casing string set is updated to the updated current casing string set; If the total length of the updated current casing string set is less than or equal to the total length of the optimal casing string set, the optimal casing string set is not updated.

6. The casing length optimization method for a mandrel hanger according to claim 5, characterized in that: Ways to calculate the probability of receiving a set of casing strings in the field include: Among them, P represents the probability of accepting the domain casing string set; T represents the current temperature; sum(B) represents the total length of the domain casing string set; sum(A) represents the total length of the current casing string set; exp represents the natural exponential function.

7. The casing length optimization method for a mandrel hanger according to claim 3, characterized in that: The calculation method of the theoretical casing length includes: D = H-d1-d2-d3-d4; Wherein, D represents theoretical casing length; H represents the depth of the current well; d1 represents the length of the reserved pocket; d2 represents the distance between the mandrel hanger and the turntable surface; d3 represents the length of the float collar; and d4 represents the length of the float shoe.

8. The casing length optimization method applicable to a mandrel hanger according to claim 3, characterized in that: The calculation method of the actual casing length includes: Wherein, L represents the actual casing length; D represents the theoretical casing length; n represents the number of single casings that must be selected in the casing string combination; i m Indicates the site number corresponding to the single casing that must be selected for the mth root; l im Indicates that the site is marked as i m The length of a single casing.

9. A casing length calculation system suitable for a mandrel hanger, characterized in that: include: The actual casing length calculation module is used to record the field marking number and length of each casing according to the obtained specification parameters of the casing on the site to form a field casing table; Based on the field casing table, the actual casing length required is calculated according to the well depth of the current drilling and the distance between the mandrel hanger and the rotary table surface; The optimal casing string set calculation module is used to transform the casing length matching problem of the mandrel hanger into a combinatorial optimization problem based on the simulated annealing algorithm, and determine the final optimal casing string set according to the actual casing length matching; The data output module is used to output the final optimal casing string set to an electronic document, wherein the data of the electronic document includes the site marking number of the casing in the final optimal casing string set, the length of the casing and the total length of the final optimal casing string set.

10. An electronic terminal comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the casing length optimization method applicable to a mandrel hanger according to any one of claims 1 to 8.

Images