A method and device for generating disassembly sequence in shield machine tunnel based on ant colony algorithm

Abstract

The present invention relates to the technical field of shield machine disassembly, and specifically discloses a method and device for generating a disassembly sequence in a shield machine hole based on an ant colony algorithm. The method comprises receiving a disassembly range input by a staff member, querying the disassembly components of the shield machine and the disassembly steps of the disassembly components within the disassembly range; querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembly components based on the disassembly time; randomly selecting K different disassembly components as the starting point, selecting the next disassembly component in turn based on the selection probability, until all the disassembly components are selected, and obtaining a disassembly path; looping execution, recursively updating the selection probability, synchronously recording the number of occurrences of each disassembly path, and determining the final path according to the number of occurrences as a disassembly sequence. The present invention queries the disassembly components within the disassembly range, takes the disassembly components as each node, and iterates the disassembly path passing through each disassembly component with the help of the ant colony algorithm as a disassembly sequence.

Description

Technical Field

[0001] The invention relates to the technical field of shield machine disassembly, and in particular to a method and a device for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm. Background Art

[0002] The dismantling sequence inside the shield machine tunnel is usually a complex and delicate project, which requires different steps and sequences to be determined according to the specific circumstances.

[0003] Most of the existing disassembly sequences in shield machines adopt a programmed disassembly sequence, that is, which components are pre-specified in what order to be disassembled. This sequence is suitable for overall disassembly or conventional partial disassembly. When faced with unconventional partial disassembly, the staff cannot predetermine the disassembly sequence and can only randomly determine the disassembly sequence based on personal experience. However, personal experience has a large degree of randomness, and it is difficult to determine a better disassembly sequence. How to quickly determine some better solutions when faced with unconventional partial disassembly requirements is a technical problem that the technical solution of the present invention is intended to solve. Summary of the invention

[0004] The object of the present invention is to provide a method and device for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm, so as to solve the problems raised in the above-mentioned background technology.

[0005] To achieve the above object, the present invention provides the following technical solutions:

[0006] A method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm, the method comprising:

[0007] Step S100: receiving a disassembly range input by a staff member, and searching for disassembly parts of the shield machine and disassembly steps of the disassembly parts within the disassembly range;

[0008] Step S200: querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembled parts based on the disassembly time;

[0009] Step S300: randomly selecting K different disassembled components as starting points, and selecting the next disassembled component in turn based on the selection probability until all disassembled components are selected, thereby obtaining a disassembly path; wherein the disassembly path is a component name with a sequence;

[0010] Step S400: cyclically execute step S300, and record the number of occurrences of each disassembly path, and determine the final path according to the number of occurrences as the disassembly sequence.

[0011] As a further solution of the present invention: the step of receiving the disassembly range input by the staff and querying the disassembly parts of the shield machine and the disassembly steps of the disassembly parts within the disassembly range includes:

[0012] Receive the dismantling range input by the staff, and traverse the component units of the shield machine within the dismantling range;

[0013] Combining the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other;

[0014] The disassembly steps of the disassembled components are queried in a preset disassembly record library; the disassembly steps include part types arranged in a disassembly order.

[0015] As a further solution of the present invention: the step of querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembled parts based on the disassembly time includes:

[0016] Read the disassembly steps of the disassembled parts, and query the part identification and disassembly time of the part type in order;

[0017] The disassembly steps are converted into an array represented by part identifiers, and the disassembly steps are clustered based on the similarity of the arrays;

[0018] Select the disassembly steps in each type of disassembly step in turn, and calculate the total time based on the disassembly time of each part;

[0019] The disassembled parts corresponding to the disassembly time are sorted according to the total time.

[0020] As a further solution of the present invention: the step of randomly selecting K different disassembled components as starting points, selecting the next disassembled component in turn based on the selection probability until all disassembled components are selected, and obtaining the disassembly path includes:

[0021] Count the names of disassembled parts and build a disassembled parts set;

[0022] Randomly select K different disassembled parts as starting points, and extract disassembled parts from the disassembled parts set based on the selection probability;

[0023] The loop is executed until the disassembled component set is empty.

[0024] As a further solution of the present invention: the selection probability is:

[0025]

[0026] In the formula, is the probability of selecting part i to part j in the selection process corresponding to the kth starting point; α and β are pre-set exponents; A k is the disassembled parts set corresponding to the kth starting point; τ ij is the information density from component i to component j, which is recursively updated according to the selection process of disassembled components; ηij is the similarity of the disassembly steps corresponding to parts i and j.

[0027] As a further solution of the present invention: the step S300 is executed cyclically, the selection probability is recursively updated, the number of occurrences of each disassembly path is synchronously recorded, and the final path is determined according to the number of occurrences, as the steps of the disassembly sequence include:

[0028] Step S300 is executed repeatedly, and each time it is executed, K disassembly paths are outputted, and the selection probability is updated synchronously;

[0029] Compare all disassembly paths in real time and classify them;

[0030] Calculate the number of paths for each type of disassembly path. When the number of paths reaches a preset threshold, use this type of disassembly path as the final path.

[0031] Output the final path as a disassembled sequence;

[0032] The updating process of the selection probability is:

[0033]

[0034] τ ij (t+1) is the pheromone concentration at the t+1th execution, τ ij (t) is the pheromone concentration at the tth execution, ρ is the preset volatilization rate, K is the K randomly selected starting points, is the pheromone left between component i and component j during the selection process corresponding to the kth starting point, T y is the total duration of the selected components during the selection process, T j is the total duration of component j.

[0035] The technical solution of the present invention also provides a shield machine in-hole disassembly sequence generation device based on ant colony algorithm, the device comprising:

[0036] A component query module is used to receive the disassembly range input by the staff, and query the disassembly components of the shield machine and the disassembly steps of the disassembly components within the disassembly range;

[0037] A step statistics sorting module is used to query and count the disassembly time of each part in all disassembly steps, and sort the disassembled parts based on the disassembly time;

[0038] A disassembly path generation module is used to randomly select K different disassembly components as starting points, and select the next disassembly component in turn based on the selection probability until all the disassembly components are selected to obtain a disassembly path; wherein the disassembly path is a component name with a sequence;

[0039] The loop execution module is used to loop execute the disassembly path generation module, recursively update the selection probability, synchronously record the number of occurrences of each disassembly path, and determine the final path according to the number of occurrences as the disassembly sequence.

[0040] As a further solution of the present invention: the component query module includes:

[0041] A traversal unit is used to receive the disassembly range input by the staff and traverse the component units of the shield machine within the disassembly range;

[0042] A merging unit, used for merging the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other;

[0043] The query unit is used to query the disassembly steps of the disassembled components in a preset disassembly record library; the disassembly steps include part types arranged in a disassembly order.

[0044] As a further solution of the present invention: the step statistical sorting module includes:

[0045] A sequential query unit, used to read the disassembly steps of the disassembled components, and sequentially query the part identification of the part type and the disassembly time;

[0046] A step clustering unit, used for converting the disassembly steps into an array represented by part identifiers, and clustering the disassembly steps based on the similarity of the arrays;

[0047] A total time calculation unit, used for selecting disassembly steps in each type of disassembly steps in sequence, and calculating the total time according to the disassembly time of each part;

[0048] The sorting unit is used to sort the disassembled parts corresponding to the disassembly time according to the total time.

[0049] As a further solution of the present invention: the disassembly path generation module includes:

[0050] A component statistics unit is used to count the component names of disassembled components and build a disassembled component set;

[0051] A component extraction unit, used for randomly selecting K different disassembled components as starting points, and extracting disassembled components from the disassembled component set based on the selection probability;

[0052] The execution unit is used for loop execution until the disassembly component set is empty.

[0053] Compared with the prior art, the beneficial effects of the present invention are as follows: the present invention queries for disassembled parts within the disassembly range, takes the disassembled parts as each node, and uses the ant colony algorithm to iterate a disassembly path passing through each disassembled part as a disassembly sequence, wherein two factors affecting the iterative process are the similarity of adjacent parts and the disassembly time of each part, and the final disassembly path is that the more similar parts are closer together, and the longer the disassembly time is, the later the parts are. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention.

[0055] Figure 1 This is a flowchart of the method for generating disassembly sequence inside a shield machine tunnel based on ant colony algorithm.

[0056] Figure 2 This is the first sub-process flowchart of the shield machine in-tunnel disassembly sequence generation method based on ant colony algorithm.

[0057] Figure 3 This is the second sub-process flowchart of the shield machine in-tunnel disassembly sequence generation method based on ant colony algorithm.

[0058] Figure 4 This is the third sub-process flowchart of the shield machine in-tunnel disassembly sequence generation method based on ant colony algorithm.

[0059] Figure 5 This is the fourth sub-process flowchart of the shield machine in-tunnel disassembly sequence generation method based on ant colony algorithm.

[0060] Figure 6 This is a structural block diagram of the shield machine in-tunnel disassembly sequence generation device based on the ant colony algorithm. DETAILED DESCRIPTION

[0061] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0062] Figure 1 The flowchart of the method for generating a disassembly sequence in a shield machine hole based on an ant colony algorithm is as follows. In an embodiment of the present invention, a method for generating a disassembly sequence in a shield machine hole based on an ant colony algorithm comprises:

[0063] Step S100: receiving a disassembly range input by a staff member, and searching for disassembly parts of the shield machine and disassembly steps of the disassembly parts within the disassembly range;

[0064] A disassembly range input by a staff member is received, where the disassembly range is an area in the shield machine that needs to be disassembled, which may be the entire shield machine or a part of the shield machine; parts in the shield machine are merged within the disassembly range, and parts with the same disassembly relationship are regarded as one component; wherein the same disassembly relationship includes a sufficient condition relationship or a necessary condition relationship, for example, when disassembling a certain part, a certain part must be disassembled, and then these two parts belong to the same disassembly relationship.

[0065] After determining the disassembly components, it is necessary to simultaneously determine the disassembly order of each part in the disassembly components, which is called the disassembly steps.

[0066] Step S200: querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembled parts based on the disassembly time;

[0067] The disassembly step is the order in which each part is disassembled. The time consumed to disassemble each part is queried based on the historical disassembly records, and then the time consumed for the entire disassembly step is calculated. Each disassembly step corresponds to each disassembled component. The disassembled components can be sorted based on the calculated time consumed for the disassembly step.

[0068] Step S300: randomly selecting K different disassembled components as starting points, and selecting the next disassembled component in turn based on the selection probability until all disassembled components are selected, thereby obtaining a disassembly path; wherein the disassembly path is a component name with a sequence;

[0069] In an example of the technical solution of the present invention, the idea of ​​ant colony algorithm is adopted, and different disassembled parts are regarded as multiple nodes. Then, K different starting points are randomly selected from the disassembled parts. Starting from the starting point, the next disassembled part is selected in turn according to the selection probability, and so on. This is repeated continuously to obtain K component groups composed of disassembled parts with order, which are called disassembly paths. It should be noted that the selection probability changes in real time and is used to adjust the selection process. The more disassembled parts are selected, the higher the probability of being selected (the idea of ​​ant colony algorithm).

[0070] Step S400: looping through step S300, recursively updating the selection probability, synchronously recording the number of occurrences of each disassembly path, and determining the final path according to the number of occurrences as the disassembly sequence;

[0071] Step S300 is executed repeatedly, and the disassembly paths starting from each disassembled component will gradually converge, and finally K paths with different starting points are obtained, which are K optimal paths. The final path is selected from these K optimal paths, indicating the order of disassembling the components, and a disassembly sequence is obtained.

[0072] Figure 2The first sub-flow chart of the method for generating a disassembly sequence in a shield machine hole based on an ant colony algorithm is as follows: the steps of receiving a disassembly range input by a worker, and querying the disassembly components of the shield machine and the disassembly steps of the disassembly components within the disassembly range include:

[0073] Step S101: receiving a disassembly range input by a staff member, and traversing component units of the shield machine within the disassembly range;

[0074] Step S102: merging the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other;

[0075] Step S103: querying the disassembly steps of the disassembled components in a preset disassembly record library; the disassembly steps include part types arranged in a disassembly order.

[0076] In an example of the technical solution of the present invention, the disassembly range is input by a staff member, and the staff member refers to a person who needs to complete the disassembly task. After receiving the disassembly range input by the staff member, the component units of the shield machine can be traversed within the disassembly range. In order to facilitate the selection of the disassembly range and the traversal process, the above steps generally occur in the virtual three-dimensional model of the shield machine.

[0077] Query the connection parameters between different components and determine the disassembly relationship based on the connection parameters. That is, when disassembling a certain part, whether there are other parts that must be disassembled. By merging the components that meet the same disassembly relationship, a whole can be obtained, which is called a disassembled component. Finally, the obtained disassembled components are independent of each other.

[0078] During the disassembly process by the staff, a disassembly record library will be built to record the disassembly process of each disassembled component. The recording method is relatively simple, and the names of the parts can be counted according to the disassembly order of the parts by the staff.

[0079] Figure 3 The second sub-flow chart of the method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm is as follows: the step of querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembly parts based on the disassembly time includes:

[0080] Step S201: reading the disassembly steps of the disassembled component, and sequentially querying the part identification of the part type and the disassembly time;

[0081] Step S202: converting the disassembly steps into an array represented by part identifiers, and clustering the disassembly steps based on the similarity of the arrays;

[0082] Step S203: Select disassembly steps in each type of disassembly steps in turn, and calculate the total disassembly time according to the disassembly time of each part;

[0083] Step S204: sorting the disassembled parts corresponding to the disassembly time according to the total time.

[0084] Read the disassembly steps of each disassembled component, and query the part identification and disassembly time of each part in order; the part identification can be a part number, which is used to convert the disassembly steps into a set of numerical values, called an array; by comparing the arrays, the disassembly steps can be clustered, that is, similar disassembly steps are grouped together. The advantage of doing so is that it makes the duration calculation process easier, because the parts involved in the same type of disassembly steps are almost similar, and the calculated values ​​are also similar; on this basis, all disassembly steps are sorted according to the calculated total duration to obtain the total duration.

[0085] The above process essentially determines two parameters of the disassembly process, one is similarity, and the other is time consumption. The time consumption parameter is relatively simple, reflecting how long it takes to disassemble each disassembled component, while similarity requires specific description, as follows:

[0086] The disassembly steps of the same type are similar, the parts that need to be disassembled are similar, and the tools involved are similar. If similar disassembly parts are disassembled in adjacent time periods, the disassembly process can omit the tool replacement process and be more efficient.

[0087] Figure 4 The third sub-flow chart of the method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm is shown in FIG. The steps of randomly selecting K different disassembly components as the starting point, selecting the next disassembly component in turn based on the selection probability, until all disassembly components are selected, and obtaining the disassembly path include:

[0088] Step S301: Count the names of disassembled components and construct a disassembled component set;

[0089] Step S302: randomly selecting K different disassembled components as starting points, and extracting disassembled components from the disassembled component set based on the selection probability;

[0090] Step S303: loop execution until the disassembled component set is empty.

[0091] Specifically, the selection probability is:

[0092]

[0093] In the formula, is the probability of selecting part i to part j in the selection process corresponding to the kth starting point; α and β are pre-set exponents; A k is the disassembled parts set corresponding to the kth starting point; τ ijis the information density from component i to component j, which is recursively updated according to the selection process of disassembled components; η ij is the similarity of the disassembly steps corresponding to parts i and j.

[0094] The above content is a single iterative process. The disassembled parts are counted to obtain a disassembled part set. All disassembled parts in the disassembled part set need to be selected and only selected once. The selection process is actually extraction, that is, after selecting a disassembled part from the disassembled part set, the corresponding disassembled part needs to be deleted from the disassembled part set. At this time, disassembled parts are continuously selected under the selection probability, and K starting points can obtain K disassembly paths.

[0095] Regarding the selection probability, The term means that the more similar the parts are, the higher the probability of being selected adjacently. Its corresponding practical meaning is that the parts with similar disassembly steps are disassembled together, which can save tool replacement time.

[0096] Figure 5 The fourth sub-flow chart of the method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm is shown in FIG. The step S300 is executed cyclically, the selection probability is recursively updated, the number of occurrences of each disassembly path is synchronously recorded, and the final path is determined according to the number of occurrences. The steps of the disassembly sequence include:

[0097] Step S401: cyclically execute step S300, output K disassembly paths each time, and synchronously update the selection probability;

[0098] Step S402: compare all disassembly paths in real time and classify the disassembly paths;

[0099] Step S403: Calculate the number of paths of each type of disassembly path, and when the number of paths reaches a preset threshold, use the disassembly path of this type as the final path;

[0100] Step S404: outputting the final path as a disassembly sequence;

[0101] Step S300 needs to be executed repeatedly, and the number of cycles is pre-set by the staff. Each cycle can output K disassembly paths. On this basis, the selection probability needs to be updated synchronously. The updated target is the above content. Item; when the selection probability keeps changing, the disassembly path will converge more and more. This is the characteristic of the ant colony algorithm, and the convergence phenomenon will be very obvious. The simplest selection method is to select the largest number of disassembly paths in the above content.

[0102] Furthermore, the updating process of the selection probability is:

[0103]

[0104] τ ij (t+1) is the pheromone concentration at the t+1th execution, τ ij (t) is the pheromone concentration at the tth execution, ρ is the preset volatilization rate, K is the K randomly selected starting points, is the pheromone left between component i and component j during the selection process corresponding to the kth starting point, T y is the total duration of the selected components during the selection process, T j is the total duration of component j.

[0105] Regarding the iterative update process of the selection probability, the rule provided in this application is that the components with smaller total time length are selected at the front end of the disassembly path. This is because in actual work, the disassembly process will be carried out by multiple staff members. After each component is disassembled, there will be more staff members to disassemble the remaining components. Therefore, placing components that are easy to disassemble at the front end (fewer staff members) and placing components that are not easy to disassemble at the back end (more staff members) can further improve the disassembly efficiency.

[0106] The key point of this function is It is actually T j / T y The reciprocal of , the greater the proportion of the duration of a component in the already selected components, the more difficult it is among the already selected components, and it should be selected later. Therefore, the reciprocal of is used to make the selection probability of the more difficult components smaller, so that they are selected later.

[0107] Figure 6 The structure diagram of the shield machine in-hole disassembly sequence generation device based on the ant colony algorithm is shown in FIG. 1 . In an embodiment of the present invention, a shield machine in-hole disassembly sequence generation device based on the ant colony algorithm is provided. The device 10 includes:

[0108] The component query module 11 is used to receive the disassembly range input by the staff, and query the disassembly components of the shield machine and the disassembly steps of the disassembly components within the disassembly range;

[0109] A step statistics sorting module 12 is used to query and count the disassembly time of each part in all disassembly steps, and sort the disassembled parts based on the disassembly time;

[0110] The disassembly path generation module 13 is used to randomly select K different disassembly components as starting points, and select the next disassembly component in turn based on the selection probability until all the disassembly components are selected to obtain a disassembly path; wherein the disassembly path is a component name with a sequence;

[0111] The loop execution module 14 is used to loop execute the disassembly path generation module, and record the number of occurrences of each disassembly path, and determine the final path according to the number of occurrences as the disassembly sequence.

[0112] Furthermore, the component query module 11 includes:

[0113] A traversal unit is used to receive the disassembly range input by the staff and traverse the component units of the shield machine within the disassembly range;

[0114] A merging unit, used for merging the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other;

[0115] The query unit is used to query the disassembly steps of the disassembled components in a preset disassembly record library; the disassembly steps include part types arranged in a disassembly order.

[0116] Specifically, the step statistical sorting module 12 includes:

[0117] A sequential query unit, used to read the disassembly steps of the disassembled components, and sequentially query the part identification of the part type and the disassembly time;

[0118] A step clustering unit, used for converting the disassembly steps into an array represented by part identifiers, and clustering the disassembly steps based on the similarity of the arrays;

[0119] A total time calculation unit, used for selecting disassembly steps in each type of disassembly steps in sequence, and calculating the total time according to the disassembly time of each part;

[0120] The sorting unit is used to sort the disassembled parts corresponding to the disassembly time according to the total time.

[0121] Furthermore, the disassembly path generation module 13 includes:

[0122] A component statistics unit is used to count the component names of disassembled components and build a disassembled component set;

[0123] A component extraction unit, used for randomly selecting K different disassembled components as starting points, and extracting disassembled components from the disassembled component set based on the selection probability;

[0124] The execution unit is used for loop execution until the disassembly component set is empty.

[0125] The functions that can be achieved by the above-mentioned method for generating disassembly sequence in the tunnel of a shield machine based on the ant colony algorithm are all completed by a computer device, and the computer device includes one or more processors and one or more memories, and at least one program code is stored in the one or more memories. The program code is loaded and executed by the one or more processors to achieve the functions of the method for generating disassembly sequence in the tunnel of a shield machine based on the ant colony algorithm.

[0126] The processor takes out instructions from the memory one by one, analyzes the instructions, and then completes the corresponding operations according to the instruction requirements, generating a series of control commands, so that the various parts of the computer can automatically, continuously and coordinately move to become an organic whole, realize the input of programs, the input of data, and the calculation and output of results. The arithmetic operations or logical operations generated in this process are all completed by the operator; the memory includes a read-only memory (ROM), which is used to store computer programs, and a protection device is provided outside the memory.

[0127] Exemplarily, the computer program may be divided into one or more modules, one or more modules are stored in a memory and executed by a processor to implement the present invention. One or more modules may be a series of computer program instruction segments capable of implementing specific functions, and the instruction segments are used to describe the execution process of the computer program in a terminal device.

[0128] Those skilled in the art will understand that the description of the above service equipment is merely an example and does not constitute a limitation on the terminal equipment. It may include more or fewer components than described above, or a combination of certain components, or different components, for example, it may include input and output devices, network access devices, buses, etc.

[0129] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the terminal device, and uses various interfaces and lines to connect various parts of the entire user terminal.

[0130] The memory can be used to store computer programs and / or modules. The processor can realize various functions of the terminal device by running or executing the computer programs and / or modules stored in the memory and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function (such as an information collection template display function, a product information release function, etc.); the data storage area can store data created according to the use of the berth status display system (such as product information collection templates corresponding to different product types, product information that different product providers need to release, etc.). In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0131] If the module / unit integrated in the terminal device 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 present invention implements all or part of the modules / units in the above-mentioned embodiment system, and can also be completed by instructing the relevant hardware through a computer program. The above-mentioned computer program can be stored in a computer-readable storage medium, and the computer program can realize the functions of the above-mentioned various system embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. Computer-readable media may include: any entity or device capable of carrying computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signal, telecommunication signal and software distribution medium, etc.

[0132] It should be noted that, in this article, the term "comprises" or any other variant thereof is intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0133] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for generating disassembly sequence in a shield machine tunnel based on ant colony algorithm, characterized in that: The method comprises: Step S100: receiving a disassembly range input by a staff member, and searching for disassembly parts of the shield machine and disassembly steps of the disassembly parts within the disassembly range; Step S200: querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembled parts based on the disassembly time; Step S300: randomly selecting K different disassembled components as starting points, and selecting the next disassembled component in turn based on the selection probability until all disassembled components are selected, thereby obtaining a disassembly path; wherein the disassembly path is a component name with a sequence; Step S400: looping through step S300, recursively updating the selection probability, synchronously recording the number of occurrences of each disassembly path, and determining the final path according to the number of occurrences as the disassembly sequence; The step of receiving the disassembly range input by the staff and querying the disassembly parts of the shield machine and the disassembly steps of the disassembly parts within the disassembly range comprises: Receive the dismantling range input by the staff, and traverse the component units of the shield machine within the dismantling range; Combining the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other; Searching for disassembly steps of a disassembled component in a pre-set disassembly record library; the disassembly steps include part types arranged in a disassembly order; The step of querying and counting the disassembly time of each part in all disassembly steps, and sorting the disassembled parts based on the disassembly time comprises: Read the disassembly steps of the disassembled parts, and query the part identification and disassembly time of the part type in order; The disassembly steps are converted into an array represented by part identifiers, and the disassembly steps are clustered based on the similarity of the arrays; Select the disassembly steps in each type of disassembly step in turn, and calculate the total time based on the disassembly time of each part; sorting the disassembled parts corresponding to the disassembly time according to the total time; The step of randomly selecting K different disassembled components as starting points, selecting the next disassembled component in turn based on the selection probability until all disassembled components are selected, and obtaining the disassembly path includes: Count the names of disassembled parts and build a disassembled parts set; Randomly select K different disassembled parts as starting points, and extract disassembled parts from the disassembled parts set based on the selection probability; The loop is executed until the disassembled component set is empty.

2. The method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm according to claim 1, characterized in that: The selection probability is: In the formula, is the probability of selecting part i to part j in the selection process corresponding to the kth starting point; α and β are pre-set exponents; A k is the disassembled parts set corresponding to the kth starting point; τ ij is the information density from component i to component j, which is recursively updated according to the selection process of disassembled components; η ij is the similarity of the disassembly steps corresponding to parts i and j.

3. The method for generating a disassembly sequence in a shield machine tunnel based on an ant colony algorithm according to claim 2, characterized in that: The step S300 is executed cyclically, the selection probability is recursively updated, the number of occurrences of each disassembly path is synchronously recorded, and the final path is determined according to the number of occurrences. The steps of the disassembly sequence include: Step S300 is executed repeatedly, and each time it is executed, K disassembly paths are outputted, and the selection probability is updated synchronously; Compare all disassembly paths in real time and classify them; Calculate the number of paths for each type of disassembly path. When the number of paths reaches a preset threshold, use this type of disassembly path as the final path. Output the final path as a disassembled sequence; The updating process of the selection probability is: τ ij (t+1) is the pheromone concentration at the t+1th execution, τ ij (t) is the pheromone concentration at the tth execution, ρ is the preset volatilization rate, K is the K randomly selected starting points, is the pheromone left between component i and component j during the selection process corresponding to the kth starting point, T y is the total duration of the selected components during the selection process, T j is the total duration of component j.

4. A shield machine in-hole disassembly sequence generation device based on ant colony algorithm, characterized in that: The device comprises: A component query module is used to receive the disassembly range input by the staff, and query the disassembly components of the shield machine and the disassembly steps of the disassembly components within the disassembly range; A step statistics sorting module is used to query and count the disassembly time of each part in all disassembly steps, and sort the disassembled parts based on the disassembly time; A disassembly path generation module is used to randomly select K different disassembly components as starting points, and select the next disassembly component in turn based on the selection probability until all the disassembly components are selected to obtain a disassembly path; wherein the disassembly path is a component name with a sequence; A loop execution module is used to loop execute the disassembly path generation module, recursively update the selection probability, synchronously record the number of occurrences of each disassembly path, and determine the final path according to the number of occurrences as the disassembly sequence; The component query module includes: A traversal unit is used to receive the disassembly range input by the staff and traverse the component units of the shield machine within the disassembly range; A merging unit, used for merging the component units according to the connection parameters of the component units to obtain disassembled components; wherein different disassembled components are independent of each other; A query unit, used to query the disassembly steps of the disassembled components in a preset disassembly record library; the disassembly steps include part types arranged in a disassembly order; The step statistical sorting module includes: A sequential query unit, used to read the disassembly steps of the disassembled components, and sequentially query the part identification of the part type and the disassembly time; A step clustering unit, used for converting the disassembly steps into an array represented by part identifiers, and clustering the disassembly steps based on the similarity of the arrays; A total time calculation unit, used for selecting disassembly steps in each type of disassembly steps in sequence, and calculating the total time according to the disassembly time of each part; A sorting unit, used for sorting the disassembled parts corresponding to the disassembly time according to the total time; The disassembly path generation module includes: A component statistics unit is used to count the component names of disassembled components and build a disassembled component set; A component extraction unit, used for randomly selecting K different disassembled components as starting points, and extracting disassembled components from the disassembled component set based on the selection probability; The execution unit is used for loop execution until the disassembly component set is empty.

Images