A method of calculating the throughput of a conveyor system

Abstract

The application is suitable for the field of transmission technology, and provides a method for calculating the throughput of a transmission system, which comprises the following steps: constructing a queuing model of the transmission system according to the topological relationship among a plurality of transmission devices in the transmission system, decomposing the queuing model into a plurality of queue modules, then cyclically calculating the state probability of each queue module and the output probability of the transmission system, and calculating the throughput of the transmission system according to the output probability when the output probability meets the probability convergence condition. The application can greatly reduce the calculation time of the throughput of the transmission system.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of conveying technology, and particularly relates to a calculation method of conveying system throughput. BACKGROUND

[0002] The calculation of conveying system throughput is an important link in industrial production. When a conveying system is designed, a manufacturing enterprise needs to discuss a candidate design scheme with a customer, preliminarily design a conveying system layout scale, and determine system throughput capacity, cost and the like. At present, an enterprise usually calculates the conveying system throughput by using commercial simulation software. However, due to the simulation environment setting and model establishment, a long simulation time is often required, which is not conducive to efficient communication with the customer. SUMMARY

[0003] The embodiment of the application provides a calculation method of conveying system throughput, and can solve the problem of the calculation time length of the conveying system throughput.

[0004] The embodiment of the application provides a calculation method of conveying system throughput, and can solve the problem of the calculation time length of the conveying system throughput.

[0005] According to the topological relationship between the plurality of conveying devices in the conveying system, a queuing model of the conveying system is constructed; each conveying device is a node in the queuing model;

[0006] The queuing model is decomposed into a plurality of queue modules;

[0007] According to the state probability of each queue module obtained in the j-1th time, the state probability of each queue module is obtained in the jth time; j is an integer, and j>1;

[0008] According to the state probability of the target queue module obtained in the jth time, the output probability of the conveying system is obtained in the jth time; the target queue module is a queue module containing the terminal conveying device of the conveying system in the plurality of queue modules;

[0009] It is judged whether the output probability obtained in the jth time meets a preset probability convergence condition;

[0010] If the output probability obtained in the jth time meets the probability convergence condition, the throughput of the conveying system is calculated according to the output probability obtained in the jth time;

[0011] If the output probability obtained in the jth time does not meet the probability convergence condition, the state probability of each queue module obtained in the jth time is taken as the state probability of each queue module obtained in the j-1th time, and the step of obtaining the state probability of each queue module in the jth time according to the state probability of each queue module obtained in the j-1th time is executed again.

[0012] The above-mentioned scheme of the application has the following beneficial effects:

[0013] In the embodiments of the present application, a queuing model of the transmission system is constructed according to the topological relationship among the plurality of transmission devices in the transmission system, the queuing model is decomposed into a plurality of queue modules, and then the state probability of each queue module and the output probability of the transmission system are calculated in a loop until the output probability of the transmission system meets the probability convergence condition, and the throughput of the transmission system is calculated according to the output probability when the probability convergence condition is met. In the calculation of the throughput of the transmission system, simulation is not required, but the transmission system is decomposed into a plurality of queue modules, and the throughput of the transmission system can be obtained by analyzing the state probability of the queue module, thereby greatly reducing the calculation time of the throughput of the transmission system. BRIEF DESCRIPTION OF DRAWINGS

[0014] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or prior art description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0015] Figure 1 Flow chart of the calculation method of the throughput of the transmission system provided by an embodiment of the present application;

[0016] Figure 2 Structural schematic diagram of the queuing model provided by an embodiment of the present application;

[0017] Figure 3 Decomposition schematic diagram of the queuing model provided by an embodiment of the present application;

[0018] Figure 4a Schematic diagram of the topological structure provided in an example of the present application Figure 1 ;

[0019] Figure 4b Schematic diagram of the topological structure provided in an example of the present application Figure 2 ;

[0020] Figure 4c Schematic diagram of the topological structure provided in an example of the present application Figure 3 ;

[0021] Figure 4d Schematic diagram of the topological structure provided in an example of the present application

[0022] Figure 4e Schematic diagram of the topological structure provided in an example of the present application Figure 5 ;

[0023] Figure 4f Schematic diagram of the topological structure provided in an example of the present application Figure 6;

[0024] Figure 4g Structure diagram of the topology provided in an example of the present application Figure 7 ;

[0025] Figure 5 Structure diagram of the straight structure queue module provided in an example of the present application

[0026] Figure 6 Structure diagram of the split structure queue module provided in an example of the present application

[0027] Figure 7 Structure diagram of the merge structure queue module provided in an example of the present application

[0028] Figure 8 Structure diagram of the transmission system provided in an example of the present application. DETAILED DESCRIPTION

[0029] In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. However, it will be apparent to those skilled in the art that the present application can be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known methods, devices, circuits, and

[0030] It will be understood that the terms "comprises" and / or "comprising," when used in this specification, include the presence of one or more features, integers, steps, operations, elements, and / or components but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0031] It is also to be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items, and that the term "at least one of" followed by a list of two or more items means any single one of the items in the list individually, as well as any combination of two or more of the items in the list.

[0032] As used in this specification and claims, the terms "if" and "when" can be interpreted to mean "upon" or "in response to determining," or "in response to detecting," depending on the context. Similarly, the phrase "if it is determined" or "if [a described condition or event] is detected" can be interpreted to mean "upon determining," or "in response to determining," or "upon detecting [the described condition or event]," or "in response to detecting [the described condition or event]," depending on the context.

[0033] In addition, in the description of the present application and the appended claims, the terms "first", "second", "third", etc. are used only to distinguish descriptions and cannot be understood as indicating or implying relative importance.

[0034] Reference to "one embodiment" or "some embodiments" or "one implementation" or "some implementations" etc. in the present application description means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the appearance of the phrases "in one embodiment", "in some embodiments", "in other some embodiments", "in yet some embodiments" etc. in various places in the specification is not necessarily all referring to the same embodiment, but means "one or more but not all embodiments", unless otherwise specifically noted. The terms "comprise", "include", "have" and their conjugates mean "including but not limited to", unless otherwise specifically noted.

[0035] At present, enterprises often use commercial simulation software to calculate the throughput of the conveying system, but due to the simulation environment setting and model establishment, a long simulation time is often required, which is not conducive to efficient communication with customers.

[0036] In view of the above problems, the present application embodiment provides a calculation method of the throughput of the conveying system, which constructs a queuing model of the conveying system according to the topological relationship between the plurality of conveying devices in the conveying system, and decomposes the queuing model into a plurality of queue modules, then repeatedly calculates the state probability of each queue module and the output probability of the conveying system, until the output probability of the conveying system meets the probability convergence condition, and then calculates the throughput of the conveying system according to the output probability when the probability convergence condition is met. Wherein, when calculating the throughput of the conveying system, simulation is not required, but the conveying system is decomposed into a plurality of queue modules, and the throughput of the conveying system can be obtained by analyzing the state probability of the queue module, thereby greatly reducing the calculation time of the throughput of the conveying system.

[0037] The calculation method of the throughput of the conveying system provided by the present application will be described below in conjunction with specific embodiments.

[0038] The present application embodiment provides a calculation method of the throughput of the conveying system, which can be executed by a terminal device, or by a device (such as a chip) applied in the terminal device, and the following embodiments take the method executed by the terminal device as an example. As an example, the terminal device can be a tablet, a server or a notebook computer, etc., which is not limited by the present application embodiment.

[0039] As shown in Figure 1 The calculation method of the throughput of the conveying system provided by the present application embodiment includes the following steps:

[0040] Step 101: Construct a queuing model for the transmission system based on the topological relationship between multiple transmission devices in the transmission system.

[0041] Each of the aforementioned transmission devices is a node in the queuing model. Specifically, each transmission device in the transmission system can be modeled as a node, and the entire transmission system can be modeled as a queuing model based on the positional relationships of each transmission device.

[0042] For example, when the transmission system includes transmission device A, transmission device B, transmission device C, transmission device D, transmission device E, and transmission device F, the constructed queuing model can be as follows: Figure 2 As shown in the figure. Among them, transmission device A is the entry device of the transmission system, and transmission device F is the end device of the transmission system.

[0043] Step 102: Decompose the queuing model into multiple queue modules.

[0044] In some embodiments of this application, the specific implementation of decomposing the queuing model into multiple queue modules can be as follows: taking the entrance conveying device of the conveying system as the starting point, and according to the conveying direction of the goods on the conveying system, the queuing model is decomposed into multiple queue modules.

[0045] Each queue module after decomposition includes a first preset number of nodes in the queuing model, and the number of identical nodes in two adjacent queue modules is a second preset number.

[0046] In some embodiments of this application, for ease of description, the first preset quantity is denoted as K, and the value of K can be 3, 4 or 5. To improve the calculation accuracy of throughput, the value of the second preset quantity can be K-1.

[0047] For example, when the queuing model of the transmission system is as follows Figure 2 When the structure is shown, such as Figure 3 As shown, the queuing model can be decomposed into three queue modules: queue module 301, queue module 302, and queue module 303. The value of K is 4, and there are 3 identical conveying devices in every two adjacent queue modules.

[0048] Step 103: Based on the state probability of each queue module obtained in the (j-1)th time, obtain the state probability of each queue module in the jth time.

[0049] In step 103 above, j is an integer and j≥1.

[0050] It should be noted that when j is 1, the state probability of each queue module obtained in the (j-1)th iteration can be understood as the set initial value. That is, for each queue module, the state probability of that queue module is calculated based on the initial value set for the state probability of that queue module in advance when it is obtained for the first time.

[0051] In some embodiments of this application, to improve computational efficiency, the state probability of each queue module can be calculated based on the state probability calculation formula stored in the queue module library. Specifically, for each queue module, the state probability calculation formula can be determined from the queue module library according to the topology of the queue module, and the state probability of the queue module can be obtained for the j-th calculation based on the state probability calculation formula of the queue module.

[0052] It should be noted that the queue module library mentioned above pre-stores the state probability calculation formulas for queue modules with different topologies.

[0053] For example, the topology of some queue modules in the above queue module library can be: Figures 4a to 4g The topology shown is as follows. Among them, Figures 4a to 4g In this context, h, i, k, and l represent a transmission device of the queue module.

[0054] Step 104: Based on the state probability of the target queue module obtained in the jth step, obtain the output probability of the transmission system in the jth step.

[0055] The aforementioned target queue module is a queue module containing the end-point transmission device of the transmission system among multiple queue modules.

[0056] In some embodiments of this application, the specific implementation of obtaining the output probability of the transmission system in the j-th acquisition based on the state probability of the target queue module obtained in the j-th acquisition can be: through the formula The probability of obtaining the output of the transmission system for the jth time.

[0057] in, Let π be the output probability of the transmission system obtained in the j-th iteration. j (n h ,n i ,n k ,n l ) represents the state probability of the target queue module obtained in the j-th iteration.

[0058] Step 105: Determine whether the output probability obtained in the j-th iteration satisfies the preset probability convergence condition. If the output probability obtained in the j-th iteration satisfies the probability convergence condition, proceed to step 106. If the output probability obtained in the j-th iteration does not satisfy the probability convergence condition, proceed to step 107.

[0059] Step 106, calculating the throughput of the conveying system according to the output probability obtained in the jth time.

[0060] In some embodiments of the present application, the throughput of the conveying system can be calculated by the formula wherein T is the throughput of the conveying system, μ l is the number of goods that can be conveyed by the terminal conveying device 1 of the conveying system per second.

[0061] Step 107, taking the state probability of each queue module obtained in the jth time as the state probability of each queue module obtained in the (j-1)th time, and returning to step 103.

[0062] That is, in some embodiments of the present application, when the output probability obtained in the jth time does not satisfy the probability convergence condition, the state probability of each queue module in the (j+1)th time is obtained according to the state probability of each queue module obtained in the jth time, and the calculation is repeated until the output probability obtained satisfies the preset probability convergence condition, and the throughput of the conveying system is calculated according to the output probability obtained when the probability convergence condition is satisfied.

[0063] It is worth mentioning that, since the throughput of the conveying system does not need to be simulated when calculating the throughput of the conveying system, but the conveying system is decomposed into a plurality of queue modules, and the state probability of the queue module is analyzed to obtain the throughput of the conveying system, the calculation time of the throughput of the conveying system is greatly reduced.

[0064] In addition, since the conveying system is decomposed into a plurality of queue modules in the process of calculating the throughput of the conveying system, and the throughput is calculated based on the state probability of the queue module, the above-mentioned calculation method of the throughput is applicable to the conveying system with any topological structure, and the application range of the calculation of the throughput of the conveying system is expanded.

[0065] In some embodiments of the present application, when it is judged in step 105 that the output probability obtained in the jth time does not satisfy the probability convergence condition, the above-mentioned calculation method further comprises a step of judging whether the number of times of obtaining the output probability of the conveying system reaches a preset number of times.

[0066] If the number of times of obtaining the output probability reaches the preset number of times, step 106 is executed to calculate the throughput of the conveying system according to the output probability obtained in the jth time; and if the number of times of obtaining the output probability does not reach the preset number of times, step 107 is entered, that is, the state probability of each queue module is repeatedly calculated until the output probability obtained satisfies the preset probability convergence condition (or the number of times of obtaining the output probability reaches the preset number of times), and the throughput of the conveying system is calculated according to the output probability obtained at this time.

[0067] For example, the preset number of times can be set according to actual needs, such as 100 times.

[0068] In some embodiments of this application, the specific determination formula can be used. The method for determining whether the condition is met is to judge whether the output probability obtained in the j-th iteration satisfies the preset probability convergence condition.

[0069] Where, if formula If the formula holds true, then the output probability obtained in the j-th iteration satisfies the probability convergence condition; and if the formula... If this condition is not met, then the output probability obtained in the j-th iteration does not satisfy the probability convergence condition. Wherein, Let be the output probability of the transmission system obtained in the (j-1)th iteration. It should be noted that when j is 1, This can be understood as the initial value set.

[0070] The following is an exemplary description of the formula for calculating the state probability of the queue module, using specific embodiments as examples.

[0071] To facilitate understanding, the relevant concepts will be explained first.

[0072] n i M represents the quantity of goods in conveying device i. i The capacity of conveying device i is denoted by λ; the arrival rate λ is the number of goods arriving at the conveying system from outside per second; the effective arrival rate a is denoted by λ. i To account for congestion, the number of goods arriving at conveyor i per second; a h (n h For the transmission device h, there are n. h Under the condition of one shipment, the effective arrival rate of the conveying equipment h; service rate μ i Let μ be the number of goods that transmission device i can transmit per second. h (n h ,n i For the transmission device h, there are n. h A cargo and a conveying device i in n i Under the condition of one type of cargo, the service rate of the conveying equipment h; the effective service rate u i Taking congestion into account, the number of goods that conveyor i can transport per second; u l (n l ) is a transmission device l with n l Given a quantity of goods, the service availability rate of conveying device l; the state probability π of the queue module is the probability of the quantity of goods in each conveying device of the queue module; π j (n h ,n i ,n k ,n lWhen the loop count is j, the number of transmission devices h in the queue module is n. h There are n goods and conveying equipment. i There are k goods and n conveying devices. k There are n goods and conveying equipment. l The probability of the state of each item; π j {n g |n h ,n i ,n k When} is the number of cycles j, the transmission device g has n g Under the condition of one cargo, the conveying equipment h has n h There are n goods and conveying equipment. i There are k goods and n conveying devices. k The conditional probability of each item.

[0073] The term "blocking type" describes the phenomenon where goods are delayed at a forward conveyor due to insufficient storage space at the downstream conveyor. Different delay behaviors result in different processing methods and varying delay times. This application's method employs a pre-processing blocking (BBS) type, where the forward conveyor stops transmitting when the downstream conveyor lacks sufficient storage space. The forward conveyor resumes transmission once the downstream conveyor has available storage space.

[0074] The merging criterion is the criterion for determining goods with limited access rights when goods from different conveying devices merge into the same device. The method in this application adopts the first-come, first-served (FCFS) criterion, that is, the goods that arrive at the merging conveying device first have priority to enter the merging conveying device.

[0075] The diversion criterion is the criterion for selecting the path of goods when they can enter different subsequent conveying devices from the diversion conveying device. The method of this application adopts the random criterion, that is, the goods are randomly selected to enter one of the subsequent conveying devices from the diversion conveying device.

[0076] In some embodiments of this application, when the queue module includes transmission device h, transmission device i, transmission device k, and transmission device l, and the topology of the queue module is as follows: Figure 5 When the structure shown is linear, the formula for calculating the state probability of the queue module is:

[0077] (a h (n h )+μ h (n h ,n i )+μ i (n i ,n k )+μ k(n k ,n l )+u l (n l )*π j (n h ,n i ,n k ,n l )=a h (n h -1)π j (n h -1,n i ,n k ,n l )+μ h (n h +1,n i -1)π j (n h +1,n i -1,n k ,n l )+μ i (n i +1,n k -1)π j )(n h ,n i +1,n k -1,n l )+μ k (n k +1,n l -1)π j (n h ,n i ,n k +1,n l -1)+u l (n l +1)π j (n h ,n i ,n k ,n l +1)

[0078] where a h (n h ) is the effective arrival rate of the transfer device h with n h goods.

[0079]

[0080] λ h (n h ) is the arrival rate of goods from outside the transfer system into the transfer system, n g is the number of goods in the transfer device g, and M gμ(n, n, n, n) is the service rate of conveyor g with n g (n g ) is the service rate of conveyor g with n g goods in the queue module, π j (n g | n h , n i , n k ) is the conditional probability that conveyor h has n g goods, conveyor i has n h goods, and conveyor k has n i goods given that conveyor g has n k goods at the time the state probabilities of the queue module are calculated for the jth time.

[0081]

[0082] π j-1 (n g , n h , n i , n k ) is the state probability that conveyor g has n g goods, conveyor h has n h goods, conveyor i has n i goods, and conveyor k has n k goods at the time the state probabilities of the queue module are calculated for the j-1th time. j-1 (n h , n i , n k ) is the state probability that conveyor h has n h goods, conveyor i has n i goods, and conveyor k has n k goods at the time the state probabilities of the queue module are calculated for the j-1th time.

[0083]

[0084] π j (n g , n f | n h , n i ) is the conditional probability that conveyor h has n g goods, conveyor i has n f goods, and conveyor k has n h goods given that conveyor g has n i goods at the time the state probabilities of the queue module are calculated for the jth time.

[0085]

[0086] π j-1 (n g ,n h ,n f ,n i ) is the state probability of conveyor g having n g goods, conveyor h having n h goods, conveyor f having n f goods, and conveyor i having n i goods, as calculated for the (j-1)th iteration of the state probabilities of the queue module, π j-1 (n h ,n i ) is the state probability of conveyor h having n h goods, and conveyor i having n i goods, as calculated for the (j-1)th iteration of the state probabilities of the queue module.

[0087]

[0088] n f is the number of goods in conveyor f, M f is the capacity of conveyor f, μ h (n h ,n i ) is the service rate of conveyor h given that conveyor h has n h goods and conveyor i has n i goods, μ i (n i ,n k ) is the service rate of conveyor i given that conveyor i has n i goods and conveyor k has n k goods, μ k (n k ,n l ) is the service rate of conveyor k given that conveyor k has n k goods and conveyor l has n l goods, u l (n l ) is the effective service rate of conveyor l given that conveyor l has n l goods.

[0089]

[0090] n p is the number of goods in conveyor p, M p is the capacity of conveyor p, μ l (n l ) is the effective service rate of conveyor l given that conveyor l has nl Under the condition of one cargo, the service rate of the conveying equipment l, π j {n p |n i ,n k ,n l When calculating the state probability of the queue module for the j-th time, the transmission device p has n p Under the condition of one cargo, the conveying equipment i has n i There are k goods and n conveying devices. k There are n goods and conveying equipment. l The conditional probability of each item.

[0091]

[0092] π j-1 (n i ,n k ,n l ,n p When calculating the state probability of the queue module for the (j-1)th time, the transmission device i has n i There are k goods and n conveying devices. k There are n goods and conveying equipment. l There are n goods and conveying devices p. p The state probability of each item, π j-1 (n i ,n k ,n l When calculating the state probability of the queue module for the (j-1)th time, the transmission device i has n i There are k goods and n conveying devices. k There are n goods and conveying equipment. l The probability of the state of each item.

[0093]

[0094] π j {n q ,n p |n k ,n l When calculating the state probability of the queue module for the j-th time, the transmission device q has n... q There are n goods and conveying devices p. p Under the condition of one cargo, the conveying equipment k has n k There are n goods and conveying equipment. l The conditional probability of each item.

[0095]

[0096] π j-1 (n k,n l ,n q ,n p When calculating the state probability of the queue module for the (j-1)th time, the transmission device k has n k There are n goods and conveying equipment. l There are n goods and conveying devices q. q There are n goods and conveying devices p. p The state probability of each item, π j-1 (n k ,n l When calculating the state probability of the queue module for the (j-1)th time, the transmission device k has n k There are n goods and conveying equipment. l The probability of the state of each item.

[0097]

[0098] n q M represents the quantity of goods in the conveying device q. q For the capacity of the transmission device q, π j (n h ,n i ,n k ,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h There are n goods and conveying equipment. i There are k goods and n conveying devices. k There are n goods and conveying equipment. l The probability of the state of each item.

[0099]

[0100] n h M represents the quantity of goods in the conveying device h. h For the capacity of transmission device h, n i M represents the quantity of goods in conveying device i. i For the capacity of transmission device i, n k M represents the quantity of goods in conveyor k. k For the capacity of transmission device k, n l M represents the quantity of goods in conveyor l. l For the capacity of transmission device l, a h (n h -1) For the transmission device h, n h Under the condition of -1 cargo, the effective arrival rate of the conveying equipment h, π j (n h -1,n i ,n k ,nl When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h -1 item, conveyor equipment i has n i There are k goods and n conveying devices. k There are n goods and conveying equipment. l The state probability of each item, μ h (n h +1,n i -1) For the transmission device h, n h +1 cargo and the conveying device i has n i Under the condition of -1 cargo, the service rate of the conveying equipment h, π j (n h +1,n i -1,n k ,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h +1 cargo, conveyor equipment i has n i -1 cargo, conveying equipment k has n k There are n goods and conveying equipment. l The state probability of each item, μ i (n i +1,n k -1) For transmission device i, n i +1 cargo and the conveying device k has n k Under the condition of -1 cargo, the service rate of transport device i, π j (n h ,n i +1,n k -1,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h There are n goods and conveying equipment. i +1 cargo, conveying equipment k has n k -1 item, conveyor equipment has n l The state probability of each item, μ k (n k +1,n l -1) For transmission device k, n k +1 cargo and the conveying device l has n l Under the condition of -1 cargo, the service rate of the conveying equipment k, π j (n h ,n i ,n k +1,n l -1) When calculating the state probability of the queue module for the j-th time, the transmission device h has n hNumber of goods, conveying device i has n i Number of goods, conveying device k has n k Number of goods, conveying device l has n l State probability of -1 number of goods, u l (n l Effective service rate of conveying device l under the condition of n l +1 number of goods, π j (n h ,n i ,n k ,n l When the state probability of the queue module is calculated for the jth time, conveying device h has n h Number of goods, conveying device i has n i Number of goods, conveying device k has n k Number of goods, conveying device l has n l State probability of n+1 number of goods.

[0101] It should be noted that when the state probability of the queue module is calculated for the jth time, the value of the state probability of the queue module for the j-1th time is a preset initial value. In addition, since for the queue module composed of conveying device h, conveying device i, conveying device k and conveying device l, conveying device f, conveying device g, conveying device p and conveying device q do not necessarily exist in the conveying system where the queue module actually exists, in Figure 5 , conveying device f, conveying device g, conveying device p and conveying device q are represented by dashed boxes, conveying device g is an upstream conveying device of conveying device h and conveying device f, and conveying device p is a downstream conveying device of conveying device q and conveying device l. In the above formula, the conveying device as a straight line conveying device means that the conveying device has only one upstream conveying device and one downstream conveying device, and the conveying device as a split conveying device means that the conveying device has one upstream conveying device and multiple downstream conveying devices.

[0102] In some embodiments of the present application, when the queue module includes conveying device h, conveying device i, conveying device k and conveying device l, and the topology of the queue module is a split structure as shown in Figure 6 , the state probability calculation formula of the queue module is:

[0103] (a h (n h )+μ h (n h ,n i )+0.5μ i (n i ,n k )+0.5μ i (n in l )+u k (n k )+u l (n l ))*π j (n h ,n i ,n k ,n l )=a h (n h -1)π j (n h -1,n i ,n k ,n l )+μ h (n h +1,n i -1)π j (n h +1,n i -1,n k ,n l )+0.5μ i (n i +1,n k -1)π j (n h ,n i +1,n k -1,n l )+0.5μ i (n i +1,n l -1)π j (n h ,n i +1,n k ,n l -1)+u k (n k +1)π j (n h ,n i ,n k +1,n l )+u l (n l +1)π j (n h ,n i ,n k ,n l +1)

[0104] where a h (n h ) is the effective arrival rate of the transfer device h with n h goods.

[0105]

[0106] λ h (n h ) is the arrival rate of items into the conveying system from outside the conveying system, n g is the number of items in conveying device g, M g is the capacity of conveying device g, μ g (n g ) is the service rate of conveying device g given that it has n g items, π j {n g | n h , n i , n k} is the conditional probability that conveying device h has n g items, conveying device i has n h items, and conveying device k has n i items given that conveying device g has n k items at the jth calculation of the state probabilities of the queue module, π j {n g , n f | n h , n i} is the conditional probability that conveying device h has n g items, conveying device i has n f items given that conveying device g has n h items and conveying device f has n i items at the jth calculation of the state probabilities of the queue module, μ h (n h , n i ) is the service rate of conveying device h given that it has n h items and conveying device i has n i items, μ i (n i , n k ) is the service rate of conveying device i given that it has n i items and conveying device k has n k items, μ i (n i , n l ) is the service rate of conveying device i given that it has n i items and conveying device l has n l items, u l (n l ) is the effective service rate of conveying device l given that it has n l items.

[0107]

[0108] n p M represents the quantity of goods in the conveying device p. p For the capacity of the transmission device p, μ l (n l ) is a transmission device l with n l Under the condition of one cargo, the service rate of the conveying equipment l, π j {n p |n h ,n i ,n l When calculating the state probability of the queue module for the h-th time, the transmission device p has n p Under the condition of one cargo, the conveying equipment h has n h There are n goods and conveying equipment. i There are n goods and conveying equipment. l The conditional probability of each item, π j {n q ,n p |n i ,n l When calculating the state probability of the queue module for the j-th time, the transmission device q has n... q There are n goods and conveying devices p. p Under the condition of one cargo, the conveying equipment i has n i There are n goods and conveying equipment. l The conditional probability of a single item, u k (n k For transmission device k, there are n k Under the condition of a certain number of goods, the effective service rate of the conveying equipment k.

[0109]

[0110] n s M represents the quantity of goods in the conveying device s. s For the capacity of the transmission device s, μ k (n k For transmission device k, there are n k Under the condition of one cargo, the service rate of the transmission equipment k, π j {n s |n h ,n i ,n k When calculating the state probability of the queue module for the j-th time, the transmission device s has n s Under the condition of one cargo, the conveying equipment h has n h There are n goods and conveying equipment. inumber of items in the queue at the transfer device k, n k conditional probability of n j {n r ,n s |n i ,n k} is the conditional probability of n r number of items in the queue at the transfer device s, n s number of items in the queue at the transfer device i, n i number of items in the queue at the transfer device k, n k conditional probability of n k (n k ) is the service rate of the transfer device k given n k number of items in the queue at the transfer device k, n j (n h ,n i ,n k ,n l} is the conditional probability of n h number of items in the queue at the transfer device i, n i number of items in the queue at the transfer device k, n k number of items in the queue at the transfer device I, n l state probability of n h (n h -1) is the effective arrival rate of the transfer device h given n h -1 number of items in the queue at the transfer device h, n j (n h -1,n i ,n k ,n l} is the conditional probability of n h -1 number of items in the queue at the transfer device i, n i number of items in the queue at the transfer device k, n k number of items in the queue at the transfer device I, n l state probability of n h (n h +1,n i -1) is the service rate of the transfer device h given n h +1 number of items in the queue at the transfer device h and n i -1 number of items in the queue at the transfer device i, n j (n h +1,n i -1,n k ,n l} is the conditional probability of n h+1 cargo, conveyor equipment i has n i -1 cargo, conveying equipment k has n k There are n goods and conveying equipment. l The state probability of each item, μ i (n i +1,n k -1) For transmission device i, n i +1 cargo and the conveying device k has n k Under the condition of -1 cargo, the service rate of transport device i, π j (n h ,n i +1,n k -1,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h There are n goods and conveying equipment. i +1 cargo, conveying equipment k has n k -1 item, conveyor equipment has n l The state probability of each item, μ i (n i +1,n l -1) For transmission device i, n i +1 cargo and the conveying device l has n l Under the condition of -1 cargo, the service rate of transport device i, π j (n h ,n i +1,n k ,n l -1) When calculating the state probability of the queue module for the j-th time, the transmission device h has n h There are n goods and conveying equipment. i +1 cargo, conveying equipment k has n k There are n goods and conveying equipment. l -1 probability of the state of a commodity, u k (n k +1) For transmission device k, n k With +1 cargo, the effective service rate of conveyor equipment l, π j (n h ,n i ,n k +1,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h There are n goods and conveying equipment. i There are k goods and n conveying devices. k +1 cargo, conveyor equipment has n l The state probability of each item, ul (n l +1) For the transmission device l, there are n l With +1 cargo, the effective service rate of conveyor equipment l, π j (n h ,n i ,n k ,n l +1) When calculating the state probability of the queue module for the j-th time, the transmission device h has n h There are n goods and conveying equipment. i There are k goods and n conveying devices. k There are n goods and conveying equipment. l +1 item state probability.

[0111] It should be noted that when calculating the state probability of the queue module for j=1 times, the value of the queue module state probability for j-1 times is a pre-set initial value. Furthermore, since for a queue module composed of transmission devices h, i, k, and l, transmission devices f, g, p, q, r, and s may not actually exist in its transmission system, therefore... Figure 6 In the above formula, transmission devices f, g, p, q, r, and s are represented by dashed boxes. Transmission device g is the upstream transmission device of transmission devices h and f, transmission device p is the downstream transmission device of transmission devices q and l, and transmission device s is the downstream transmission device of transmission devices k and r. In the above formula, a transmission device is a linear transmission device if it has only one upstream and one downstream transmission device; a transmission device is a split transmission device if it has one upstream and multiple downstream transmission devices; and a transmission device is a merging transmission device if it has multiple upstream and one downstream transmission device.

[0112] In some embodiments of this application, when the queue module includes transmission device h, transmission device i, transmission device k, and transmission device l, and the topology of the queue module is as follows: Figure 7 When the merging structure is shown, the formula for calculating the state probability of the queue module is:

[0113] (a h (n h )+a k (n k )+μ h (n h ,n i )+μ k (n k ,n i )+μi (n i ,n l )+u l (n l )*π j (n h ,n k ,n i ,n l )=a h (n h -1)π j (n h -1,n k ,n i ,n l )+a k (n k -1)π j (n h ,n k -1,n i ,n l )+μ h (n h +1,n i -1)π j (n h +1,n k =0,n i -1,n l )+μ k (n k +1,n i -1)π j (n h =0,n k +1,n i -1,n l )+P1*μ h (n h +1,n i -1)π j (n h +1,n k >0,n i -1,n l )+P2*μ k (n k +1,n i -1)π j (n h >0,n k +1,n i -1,n l )+μ i (n i +1,n l -1)π j (n h ,n k ,ni +1,n l -1)+u l (n l +1)π j (n h ,n k ,n i ,n l +1)

[0114] Among them, a h (n h For the transmission device h, there are n. h The effective arrival rate of the conveying equipment h under the condition of one cargo.

[0115]

[0116] λ h (n h ) represents the arrival rate of goods entering the conveyor system from outside the system, n. g M represents the quantity of goods in conveying device g. g For the capacity of the transmission device g, μ g (n g For the transmission device g, there are n. g Under the condition of one cargo, the service rate of the conveying equipment g, π j {n g |n h ,n i ,n k When calculating the state probability of the queue module for the j-th time, the transmission device g has n g Under the condition of one cargo, the conveying equipment h has n h There are n goods and conveying equipment. i There are k goods and n conveying devices. k The conditional probability of each item, π j {n g ,n f |n h ,n i When calculating the state probability of the queue module for the j-th time, the transmission device g has n g There are n goods and conveying devices. f Under the condition of one cargo, the conveying equipment h has n h There are n goods and conveying equipment. i The conditional probability of a single item, μ h (n h ,n i For the transmission device h, there are n. h There are n goods and the conveying equipment i has n i Under the condition of one cargo, the service rate of the conveying equipment h, μ k (nk ,n i ) is the service rate of conveyor k given that there are n k items in conveyor i and n i items in conveyor k. i (n i ,n l ) is the service rate of conveyor i given that there are n i items in conveyor i and n l items in conveyor l. l (n l ) is the effective service rate of conveyor l given that there are n l items in conveyor l.

[0117]

[0118] n p is the number of items in conveyor p, M p is the capacity of conveyor p, μ l (n l ) is the service rate of conveyor l given that there are n l items in conveyor l, π j {n p | n h ,n i ,n l} is the conditional probability that there are n p items in conveyor h, n h items in conveyor i, n i items in conveyor l given that there are n l items in conveyor p when the state probabilities of the queue module are computed for the hth time, π j {n q ,n p | n i ,n l} is the conditional probability that there are n q items in conveyor q, n p items in conveyor p given that there are n i items in conveyor i, n l items in conveyor l when the state probabilities of the queue module are computed for the jth time, a k (n k ) is the effective arrival rate of conveyor k given that there are n k items in conveyor k.

[0119]

[0120] λ k (nk ) is the arrival rate of goods into the conveying system from outside the conveying system, n s is the number of goods in the conveying device s, M s is the capacity of the conveying device s, μ s (n s ) is the service rate of the conveying device s with n s goods, π j {n s | n k , n i , n l} is the conditional probability of conveying device k having n s goods, conveying device i having n k goods, and conveying device 1 having n i goods, given that conveying device s has n l goods, π j (n s , n r | n k , n i} is the conditional probability of conveying device k having n s goods, conveying device i having n r goods, given that conveying device s has n k goods and conveying device r has n i goods, π j (n h , n k , n i , n l ) is the state probability of conveying device h having n h goods, conveying device k having n k goods, conveying device i having n i goods, and conveying device 1 having n l goods, a h (n h - 1) is the effective arrival rate of conveying device h with n h - 1 goods, π j (n h - 1, n k , n i , n l ) is the conditional probability of conveying device h having n h - 1 goods, conveying device k having n k goods, conveying device i having n i goods, and conveying device 1 having nl The state probability of each item, a k (n k -1) For transmission device k, n k Under the condition of -1 goods, the effective arrival rate of conveying equipment k, π j (n h ,n k -1,n i ,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h There are k goods and n conveying devices. k -1 item, conveying equipment i has n i There are n goods and conveying equipment. i The state probability of each item, μ h (n h +1,n i -1) For the transmission device h, n h +1 cargo and the conveying device i has n i Under the condition of -1 cargo, the service rate of the conveying equipment h, π j (n h +1,n i -1,n k ,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h +1 cargo, conveyor equipment i has n i -1 cargo, conveying equipment k has n k There are n goods and conveying equipment. l The state probability of each item, μ i (n i +1,n k -1) For transmission device i, n i +1 cargo and the conveying device k has n k Under the condition of -1 cargo, the service rate of transport device i, π j (n h +1,n k =0,n i -1,n l When calculating the state probability of the queue module for the j-th time, the transmission device h has n... h +1 cargo, transport device k has 0 cargo, transport device i has n i -1 item, conveyor equipment has n l The state probability of each item, μ k (n k +1,n i -1) For transmission device k, n k +1 cargo and the conveying device i has ni -1, the service rate of conveyor i, π j (n h =0, n k +1, the service rate of conveyor k, π i (n l -1, the service rate of conveyor i, π k (n i +1, the service rate of conveyor k, π l (n h -1, the service rate of conveyor i, π h (n i +1, the service rate of conveyor k, π h (n i -1, the service rate of conveyor i, π j (n h +1, the service rate of conveyor k, π k (n i -1, the service rate of conveyor i, π l (n h +1, the service rate of conveyor k, π k (n k -1, the service rate of conveyor i, π i (n l +1, the service rate of conveyor k, π k (n k -1, the service rate of conveyor i, π i (n k +1, the service rate of conveyor k, π i (n j -1, the service rate of conveyor i, π h (n k +1, the service rate of conveyor k, π i (n l -1, the service rate of conveyor i, π h (n h +1, the service rate of conveyor k, π k (n i -1, the service rate of conveyor i, π l (n i +1, the service rate of conveyor k, π i (n l -1, the service rate of conveyor i, π i (n l +1, the service rate of conveyor k, πj (n h ,n k ,n i +1,n l -1) is the state probability of the queue module at the jth calculation, with n h goods in conveyor h, n k goods in conveyor k, n i +1 goods in conveyor i, and n l -1 goods in conveyor 1, u l (n l +1) is the effective service rate of conveyor 1 given that there are n l +1 goods in conveyor 1, π j (n h ,n i ,n k ,n l +1) is the state probability of the queue module at the jth calculation, with n h goods in conveyor h, n i goods in conveyor i, n k goods in conveyor k, and n l +1 goods in conveyor 1;

[0121]

[0122]

[0123] π j (n h +1,n k =0,n i -1,n l ) is the state probability of the queue module at the jth calculation, with n h +1 goods in conveyor h, 0 goods in conveyor k, n i -1 goods in conveyor i, and n l goods in conveyor 1, π j (n h =0,n k +1,n i -1,n l ) is the state probability of the queue module at the jth calculation, with 0 goods in conveyor h, n k +1 goods in conveyor k, n i -1 goods in conveyor i, and n l goods in conveyor 1.

[0124] It should be noted that when the state probability of the j = 1 order queue module is calculated, the value of the state probability of the j - 1 order queue module is a preset initial value. In addition, since for the queue module composed of the transfer device h, the transfer device i, the transfer device k and the transfer device I, the transfer device f, the transfer device g, the transfer device p, the transfer device q, the transfer device r and the transfer device s do not necessarily exist in the transfer system in which the queue module actually exists, in the above formula, the transfer device f, the transfer device g, the transfer device p, the transfer device q, the transfer device r and the transfer device s are represented by a dashed box, the transfer device g is an upstream transfer device of the transfer device h and the transfer device f, the transfer device p is a downstream transfer device of the transfer device q and the transfer device I, and the transfer device s is an upstream transfer device of the transfer device k and the transfer device r. In the above formula, the transfer device being a straight line transfer device means that the transfer device has only one upstream transfer device and one downstream transfer device, the transfer device being a split transfer device means that the transfer device has one upstream transfer device and multiple downstream transfer devices, and the transfer device being a merge transfer device means that the transfer device has multiple upstream transfer devices and one downstream transfer device. Figure 7

[0125] The calculation speed of the calculation method of the throughput of the transfer system of the present application will be described below with reference to specific experimental data.

[0126] In this experiment, the topology of the transfer system is as shown in Figure 8 The transfer system includes a transfer device A, a transfer device B, a transfer device C, a transfer device D, a transfer device E, a transfer device F, a transfer device G, a transfer device H, a transfer device I, a transfer device J, a transfer device K, a transfer device L, a transfer device M, a transfer device N, a transfer device O, the service rate of each transfer device is μ, and the arrival rate of the transfer system is λ. At the same time, in this experiment, the basic parameter settings are as shown in Table 1, and the experimental data of the throughput of the transfer system calculated by the calculation method of the present application and the existing commercial simulation software are as shown in Table 2.

[0127] Item Setting value Arrival rate λ 1 [jobs / s] Service rate μ for each transfer device 0.8, 1, 1.2 [jobs / s] Blocking type BBS Merge criterion FCFS Split criterion Random Total number of transfer devices 15

[0128] Table 1

[0129]

[0130] Table 2

[0131] ​From the above experimental data, it can be seen that the throughput calculation time of the present application is much shorter than that of the commercial simulation software, and the throughput calculated by the present application is very close to that calculated by the commercial simulation software. From the results, it can be seen that the error of the calculated value of the present application relative to the simulation value of the commercial software is within 5%, and the error value is within the acceptable range. However, the calculation time of the present application is only one thousandth of the comprehensive simulation time of the commercial simulation software, which shows that the present application significantly improves the calculation efficiency of the throughput of the conveying system.

[0132] In order to facilitate the understanding of the calculation method of the throughput of the conveying system, the calculation method of the throughput of the conveying system is exemplarily illustrated by a specific example.

[0133] In this example, the conveying system includes conveying device A, conveying device B, conveying device C, conveying device D, conveying device E and conveying device F, the external cargo arrival rate λ and the device i service rate μi are known, and the initial state probability π 0 (n A ,n B ,n C ,n D ), π 0 (n B ,n C ,n D ,n E ) and π 0 (n C ,n D ,n E ,n F ) of the three queue modules are given.

[0134] The calculation process of the throughput of the conveying system is as follows:

[0135] First, according to the topological structure of the conveying system, a queuing model as shown in Figure 2 is constructed;

[0136] Second, as shown in Figure 3 , the queuing model is decomposed into three queue modules;

[0137] Third, π j (n B ,n C ,n D ,n E ) is substituted into and to obtain π j {n E |n B ,n C ,n D};

[0138] Fourth step, considering that device A is the entry device of the transmission system, substitute λ into

[0139]

[0140]

[0141] Substitute π j {n E |n B ,n C ,n D} into

[0142]

[0143]

[0144] Fifth step, substitute the above μ A ,μ B ,μ C into

[0145]

[0146] (a h (n h )+μ h (n h ,n i )+μ i (n i ,n k )+μ k (n k ,n l )+u l (n l ))*π j (n h ,n i ,n k ,n l )=a h (n h -1)π j (n h -1,n i ,n k ,n l )+μ h (n h +1,n i -1)π j (n h +1,n i -1,n k ,n l )+μ i (n i +1,n​​k -1)π j (n h ,n i +1,n k -1,n l )+μ k (n k +1,n l -1)π j (n h ,n i ,n k +1,n l -1)+u l (n l +1)π j (n h ,n i ,n k ,n l +1)

[0147] get π j+1 (n A ,n B ,n C ,n D );

[0148] sixth step, substitute the above π j (n A ,n B ,n C ,n D ) into and substitute π j (n C ,n D ,n E ,n F ) into and get π j {n A |n B ,n C ,n D} and π j {n F |n C ,n D ,n E};

[0149] seventh step, substitute the above π j {n A |n B ,n C ,n D} and π j {n F |n C ,n D,n E Substitute

[0150]

[0151]

[0152] to obtain and

[0153] Step 8: Substitute the above μ B , μ C , μ D Substitute into

[0154]

[0155] (a h (n h ) + μ h (n h , n i ) + μ i (n i , n k ) + μ k (n k , n l ) + u l (n l )) * π j (n h , n i , n k , n l ) = a h (n h - 1)π j (n h - 1, n i , n k , n l ) + μ h (n h + 1, n i - 1)π j (n h + 1, n i - 1, n k , n l ) + μ i (n i + 1, n k )π j (n h , n i + 1, n k - 1, n l ) + μ k (n k + 1, n l-1)π j (n h ,n i ,n k +1,n l -1)+u l (n l +1)π j (n h ,n i ,n k ,n l +1)

[0156] get π j+1 (n B ,n C ,n D ,n E );

[0157] Step 9, substitute the above π j (n B ,n C ,n D ,n E ) into and get π j {n B |n C ,n D ,n E};

[0158] Step 10, substitute π j {n B |n C ,n D ,n E} into

[0159]

[0160] get

[0161] Consider that the transmitting device F is the end transmitting device, substitute μ F according to

[0162]

[0163] get

[0164] Step 11, substitute the above μ C , μ D , μ E into

[0165]

[0166] (ah (n h )+μ h (n h ,n i )+μ i (n i ,n k )+μ k (n k ,n l )+u l (n l ))*π j (n h ,n i ,n k ,n l )=a h (n h -1)π j (n h -1,n i ,n k ,n l )+μ h (n h +1,n i -1)π j (n h +1,n i -1,n k ,n l )+μ i (n i +1,n k -1)π j (n h ,n i +1,n k -1,n l )+μ k (n k +1,n l -1)π j (n h ,n i ,n k +1,n l -1)+u l (n l +1)π j (n h ,n i ,n k ,n l +1)

[0167] get π j+1 (n C ,n D ,n E ,n F );

[0168] Twelfth step, j = j + 1;

[0169] Thirteenth step, the formula is satisfied, then the fourteenth step is executed, otherwise, go to the third step;

[0170] Fourteenth step, the formula is used to calculate the transmission system throughput.

[0171] The above-described embodiments are only used to illustrate the technical solutions of the present application, rather than limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in the protection scope of the present application.

Claims

1. A method for calculating the throughput of a transmission system, characterized in that, include: Based on the topological relationship between multiple transmission devices in the transmission system, a queuing model of the transmission system is constructed; each transmission device is a node in the queuing model. The queuing model is decomposed into multiple queue modules; According to the The state probability of each queue module obtained in the -1st iteration, the th The state probability of each queue module is obtained once; It is an integer, and ; According to the The probability of the state of the target queue module obtained in the first acquisition, the th The output probability of the transmission system is obtained next; the target queue module is a queue module containing the end-point transmission device of the transmission system among multiple queue modules; Judge the first Does the obtained output probability satisfy the preset probability convergence condition? If the first If the output probability obtained in the th iteration satisfies the probability convergence condition, then according to the th... The throughput of the transmission system is calculated based on the output probability obtained each time. If the first If the output probability obtained in the second iteration does not satisfy the probability convergence condition, then the first iteration will be... The state probability of each queue module obtained in the first iteration is used as the first... -1 times the state probability of each queue module is obtained, and the execution is returned according to the first time. The state probability of each queue module obtained in the -1st iteration, the th The next step is to obtain the state probability of each queue module; The step of decomposing the queuing model into multiple queue modules includes: Starting from the entrance conveying device of the conveying system, the queuing model is decomposed into multiple queue modules according to the conveying direction of the goods on the conveying system. Each queue module includes a first preset number of nodes in the queuing model, and the number of identical nodes in two adjacent queue modules is a second preset number; According to the first The state probability of each queue module obtained in the -1st iteration, the th The state probability of each queue module is obtained, including: For each queue module, based on its topology, the state probability calculation formula for that queue module is determined from the queue module library. Then, based on the state probability calculation formula, the [missing information] is calculated. The state probability of the queue module is obtained through calculation; the queue module library pre-stores the state probability calculation formulas of queue modules with different topologies. The queue module includes a transmission device. Conveying equipment Conveying equipment and transmission equipment The step of determining the state probability calculation formula of the queue module from the queue module library based on the topology of the queue module includes: When the topology of the queue module is a merging structure, the formula for calculating the state probability of the queue module is: in, For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate; The arrival rate of goods entering the conveyor system from outside the system. For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment k have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have One item, and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate; The arrival rate of goods entering the conveyor system from outside the system. For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One item and have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have One item and Conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One item and have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have One item and Conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One item and have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item; For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item.

2. The calculation method according to claim 1, characterized in that, The queue module includes a transmission device. Conveying equipment Conveying equipment and transmission equipment The step of determining the state probability calculation formula of the queue module from the queue module library based on the topology of the queue module includes: When the topology of the queue module is a linear structure, the formula for calculating the state probability of the queue module is: in, For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate; The arrival rate of goods entering the conveyor system from outside the system. for Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item; = For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item; For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item; = For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have The probability of the state of each item; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have One cargo and conveying equipment k have Under the condition of individual goods, conveying equipment service rate For transmission equipment k have One item, and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item; = For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item; , For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item; = , For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have The probability of the state of each item; For transmission equipment Quantity of goods in China For transmission equipment capacity, For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item.

3. The calculation method according to claim 1, characterized in that, The queue module includes a transmission device. Conveying equipment Conveying equipment and transmission equipment The step of determining the state probability calculation formula of the queue module from the queue module library based on the topology of the queue module includes: When the topology of the queue module is a split-flow structure, the state probability calculation formula of the queue module is: in, For transmission equipment have Under the condition of individual goods, conveying equipment Effective arrival rate The arrival rate of goods entering the conveyor system from outside the system. For transmission equipment Quantity of goods in China For transmission equipment capacity, for have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have One cargo and conveying equipment k have Under the condition of individual goods, conveying equipment service rate For transmission equipment have One item, and conveying equipment have Under the condition of individual goods, conveying equipment service rate For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate; For transmission equipment Quantity of goods in China For transmission equipment capacity, For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Under the condition of individual goods, conveying equipment have Goods, conveying equipment have The conditional probability of a single item. For transmission equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item for have Under the condition of individual goods, conveying equipment Effective arrival rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have One cargo and conveying equipment have Under the condition of individual goods, conveying equipment service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The state probability of each item For transmission equipment have Under the condition of individual goods, conveying equipment Effective service rate For the first When calculating the state probability of the queue module, the transmission device have Goods, conveying equipment have Goods, conveying equipment have Goods, conveying equipment have The probability of the state of each item.

4. The calculation method according to claim 1, characterized in that, According to the first The probability of the state of the target queue module obtained in the first acquisition, the th The next step of obtaining the output probability of the transmission system includes: Through formula No. The output probability of the transmission system is obtained once; in, For the first The output probability of the transmission system obtained this time. For the first The probability of the state of the target queue module obtained this time.

5. The calculation method according to claim 4, characterized in that, The judgment of the first Whether the output probability obtained this time satisfies the preset probability convergence condition, including: Judgment Formula Is it valid? If the formula If true, then the first... The output probability obtained this time satisfies the probability convergence condition; If the formula If not true, then determine the first... The output probability obtained this time does not satisfy the probability convergence condition; in, For the first -1 times the output probability of the transmission system.

6. The calculation method according to claim 4, characterized in that, According to the first The throughput of the transmission system is calculated based on the obtained output probabilities, including: Through formula Calculate the throughput of the transmission system; in, T The throughput of the transmission system, The end-point conveying device of the conveying system The number of goods that can be transported per second.

7. The calculation method according to claim 1, characterized in that, If the first If the obtained output probability does not satisfy the probability convergence condition, the calculation method further includes: Determine whether the number of times the output probability of the transmission system has been acquired has reached a preset number; If the preset number of times is reached, then according to the first... The throughput of the transmission system is calculated based on the output probability obtained each time. If the preset number of times is not reached, then proceed to the step of... The state probability of each queue module obtained in the first iteration is used as the first... -1 steps to obtain the state probability of each queue module.

Images