Elevator group waiting dispatching method and device, electronic equipment, computer readable storage medium and elevator system

Abstract

The application discloses an elevator group waiting dispatching method and device, electronic equipment, a computer readable storage medium and an elevator system. The method comprises the following steps: determining that there are multiple idle elevators in an elevator group; taking the multiple idle elevators and multiple preset waiting floors as two vertex subsets in a bipartite graph, and constructing a relationship edge between the two vertex subsets; the number of the multiple idle elevators and the multiple preset waiting floors is equal, and the weight of each relationship edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor; calculating a weight maximum complete matching result of the bipartite graph; and dispatching each idle elevator in the elevator group to wait at the matched preset waiting floor according to the weight maximum complete matching result. The technical scheme provided by the application aims to solve the problem of low overall operation efficiency of the existing elevator system when waiting is dispersed.

Description

Technical Field

[0001] This invention relates to the field of elevator control technology, specifically to a method and device for scheduling elevator groups, electronic equipment, computer-readable storage medium, and elevator system. Background Technology

[0002] When a passenger calls for an elevator, an available elevator that is stopped at the passenger's floor or a nearby floor can respond to the passenger's call as quickly as possible, reducing waiting time. Therefore, in elevator systems with multiple elevator groups, the distributed waiting function is an essential feature. In related technologies, elevator systems often match each preset waiting floor with the nearest available elevator to ensure the lowest possible energy consumption when the available elevator reaches that floor. However, for the entire elevator group, the overall operating efficiency of matching according to this rule may not be the highest. Summary of the Invention

[0003] The main objective of this invention is to provide a method and apparatus for scheduling elevator groups, an electronic device, a computer-readable storage medium, and an elevator system, aiming to solve the problem of low overall operating efficiency of existing elevator systems when waiting for elevators in a dispersed manner.

[0004] To achieve the above objectives, one embodiment of the present invention proposes a method for scheduling elevator groups, comprising:

[0005] Confirm that there are multiple idle elevators in the elevator group;

[0006] The multiple idle elevators and multiple preset waiting floors are respectively regarded as two vertex subsets in a bipartite graph, and the relationship edges between the two vertex subsets are constructed; the number of multiple idle elevators and the number of preset waiting floors are equal, and the weight of each relationship edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor;

[0007] Calculate the weighted maximum / minimum perfect matching result of the bipartite graph;

[0008] Based on the complete matching result of the weighted maximum and minimum values, each idle elevator in the elevator group is scheduled to wait on the matched preset waiting floor.

[0009] Optionally, in some technical solutions provided in embodiments of the present invention, constructing the relationship edge between the two vertex subsets includes:

[0010] Determine the service floor range of each of the aforementioned available elevators;

[0011] For each of the aforementioned idle elevators, establish a relationship edge between the idle elevator and each of the preset waiting floors within the service floor range.

[0012] Optionally, in some technical solutions provided in embodiments of the present invention, constructing the relationship edge between the two vertex subsets includes:

[0013] For each of the aforementioned relation edges, the weight of the relation edge is determined based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relation edge.

[0014] Optionally, in some technical solutions provided in the embodiments of the present invention, determining the weight of the relational edge based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relational edge includes one of the following:

[0015] The layer difference is used as the weight of the relation edge;

[0016] The opposite or reciprocal of the layer difference is used as the weight of the relation edge;

[0017] The weight of the relation edge is obtained by subtracting the floor difference value from the total number of service floors of the elevator group.

[0018] Optionally, in some technical solutions provided in embodiments of the present invention, the step of calculating the weighted maximum / minimum perfect matching result of the bipartite graph includes:

[0019] When the weights of the relation edges are positively correlated with the running distance, calculate the minimum weight complete matching result of the bipartite graph;

[0020] When the weights of the relation edges are negatively correlated with the running distance, the maximum weight complete matching result of the bipartite graph is calculated.

[0021] Optionally, in some technical solutions provided in embodiments of the present invention, before treating the plurality of idle elevators and the plurality of preset floors to be served as two vertex subsets in a bipartite graph, the method further includes:

[0022] Determine the number of available elevators;

[0023] Based on the number of available elevators, select multiple service floors equal to the total number of service floors in the elevator group to obtain the multiple preset waiting floors.

[0024] Optionally, in some technical solutions provided in embodiments of the present invention, the step of calculating the weighted maximum / minimum perfect matching result of the bipartite graph includes:

[0025] Initialize the vertex index values ​​of the two vertex subsets;

[0026] Find a perfect match for the maximum and minimum values ​​of the weights in the bipartite graph, and modify the vertex label value if no perfect match is found, until a perfect match for the maximum and minimum values ​​of the weights in the bipartite graph is found.

[0027] Optionally, in some technical solutions provided in the embodiments of the present invention, the step of scheduling each idle elevator in the elevator group to wait on the matched preset waiting floor according to the weighted maximum and minimum complete matching result includes:

[0028] Based on the complete matching results of the weighted maximum and minimum values, the preset waiting floors for matching each of the idle elevators are determined;

[0029] A virtual elevator call request is sent to each of the idle elevators to dispatch each of the idle elevators to the corresponding matched preset waiting floor.

[0030] An embodiment of the present invention also provides an elevator group waiting dispatching device, comprising:

[0031] The determination module is used to determine whether there are multiple idle elevators in an elevator group;

[0032] The construction module is used to construct the relationship edges between the multiple idle elevators and the multiple preset waiting floors as two vertex subsets in a bipartite graph; the number of multiple idle elevators and the multiple preset waiting floors are equal, and the weight of each relationship edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor.

[0033] The calculation module is used to calculate the weighted maximum and minimum complete matching result of the bipartite graph;

[0034] The scheduling module is used to schedule each idle elevator in the elevator group to wait on the matched preset waiting floor according to the complete matching result of the weight maximum value.

[0035] An embodiment of the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the elevator group waiting scheduling method as provided in any embodiment of the present invention.

[0036] An embodiment of the present invention also provides a computer-readable storage medium having a computer program stored thereon, the program being executed by a processor to implement the elevator group waiting scheduling method as provided in any embodiment of the present invention.

[0037] An embodiment of the present invention also provides a computer program product, including a computer program that is executed by a processor to implement the elevator group waiting scheduling method as provided in any embodiment of the present invention.

[0038] In one or more technical solutions provided by the above embodiments of the present invention, after determining that there are multiple idle elevators in the elevator group, the multiple idle elevators and multiple preset waiting floors are respectively regarded as two vertex subsets of a bipartite graph. Relational edges in the bipartite graph are constructed according to the service floor range of each idle elevator. The number of multiple idle elevators and multiple preset waiting floors are equal. The weight of each relational edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor. Then, by calculating the perfect matching result of the weight extrema of the bipartite graph, the matching result of the weight extrema can be obtained. Since the weight is related to the running distance, the perfect matching result of the weight extrema of the bipartite graph can obtain the optimal matching between multiple idle elevators and multiple preset waiting floors, so that the total running distance of multiple idle elevators waiting in a dispersed manner is minimized, thereby improving the overall operating efficiency of the elevator system when waiting in a dispersed manner. Attached Figure Description

[0039] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the structures shown in these drawings without creative effort.

[0040] Figure 1 This is a flowchart illustrating an elevator group waiting scheduling method according to an embodiment of the present invention.

[0041] Figure 2 A schematic diagram of the principle of an elevator group waiting scheduling method provided in an embodiment of the present invention. Figure 1 ;

[0042] Figure 3 A schematic diagram of the principle of an elevator group waiting scheduling method provided in an embodiment of the present invention. Figure 2 ;

[0043] Figure 4 A schematic diagram of the principle of an elevator group waiting scheduling method provided in an embodiment of the present invention. Figure 3 ;

[0044] Figure 5 This is a schematic diagram of the structure of an elevator group waiting dispatching device provided in an embodiment of the present invention;

[0045] Figure 6 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention.

[0046] The realization of the objective, functional features and advantages of the present invention will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0047] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0048] Other embodiments of the invention will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the inventive concept is set forth in the claims.

[0049] The terminology used in this invention is for the purpose of describing particular embodiments only and is not intended to limit the invention. The singular forms “a,” “the,” and “the” used in this invention and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items. Depending on the context, the word “if” as used herein can be interpreted as “when,” “in response to a determination,” or “when…”.

[0050] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, product, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, product, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, product, or apparatus that includes said element.

[0051] Furthermore, in this invention, descriptions involving "first," "second," etc., are for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this invention, "a plurality of" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0052] Furthermore, the technical solutions of the various embodiments of the present invention can be combined with each other, but only if they are based on the ability of those skilled in the art to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be considered that such combination of technical solutions does not exist and is not within the scope of protection claimed by the present invention.

[0053] The following is an explanation of some of the terms and concepts used in the embodiments of this invention.

[0054] Bipartite Graph: A bipartite graph is a concept in graph theory. For an undirected graph, the vertices can be divided into two disjoint subsets such that no two vertices within the same subset are adjacent. In other words, each edge in the graph connects two vertices belonging to different subsets. The vertices in the graph can be divided into two independent subsets, and each edge connects two vertices belonging to one of these two subsets.

[0055] Matching: In a bipartite graph, the set of edges that have no common points between any two edges is called a matching. If all vertices of a matching in a graph are matching points, then the matching is called a complete matching (or perfect matching).

[0056] This invention aims to address the problem of achieving optimal global operating efficiency and energy consumption when matching waiting floors with available elevators in an elevator system with its distributed waiting function. This ensures that while meeting passengers' needs for rapid elevator access, each preset waiting floor has an available elevator, even if the floors served by each elevator are not entirely the same. The elevators described in this application can be electrically driven devices for vertically or inclined transport of passengers or goods. Elevator types include, but are not limited to, vertically lifting passenger elevators, construction elevators, freight elevators, car handling devices in multi-level parking garages, escalators, and moving walkways.

[0057] This invention establishes a bipartite graph model based on idle elevators and preset waiting floors in an elevator system. Idle elevators and an equal number of preset waiting floors are represented as two independent vertex subsets. If an idle elevator can reach a preset waiting floor, a relationship edge is considered to exist between the corresponding two points. That is, for each idle elevator, the availability of service floors determines whether a relationship edge can be established with each preset waiting floor. The weight of the relationship edge can be related to the running distance / energy consumption required for operation, specifically, it can be positive or negative. Thus, the problem of how to achieve globally optimal energy consumption in matching preset waiting floors with idle elevators is transformed into solving the minimum-weight complete matching problem of a weighted bipartite graph. In graph theory, a set of edges where no two edges share a common vertex is called a matching. That is, this set includes multiple edges, and no two edges share the same vertex. In other words, in this set of edges, each vertex is connected to only one edge. If all vertices in a matching of a graph are matching vertices, then it is called a complete matching. Therefore, the solution to assign each available elevator to a different preset waiting floor is to find a matching between these two vertex subsets to ensure that each preset waiting floor has an available elevator, i.e., to find a perfect matching for the bipartite graph.

[0058] The specific implementation of the elevator group waiting dispatch method provided in this embodiment of the invention will be described in detail below. (Refer to...) Figure 1 The elevator waiting dispatch method for this elevator group includes the following steps:

[0059] Step 101: Determine if there are multiple idle elevators in the elevator group;

[0060] Step 102: Take multiple idle elevators and multiple preset waiting floors as two vertex subsets in a bipartite graph, and construct the relationship edges between the two vertex subsets; the number of multiple idle elevators and multiple preset waiting floors are equal, and the weight of each relationship edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor.

[0061] Step 103: Calculate the weighted maximum / minimum perfect matching result of the bipartite graph;

[0062] Step 104: Based on the weighted maximum and minimum complete matching results, schedule each idle elevator in the elevator group to wait on the matched preset waiting floor.

[0063] An elevator group includes multiple elevators. In this embodiment, the elevator is an electrically driven device for vertically or inclinedly transporting passengers or goods. Elevator types include vertically lifting passenger elevators, freight elevators for transporting goods, vehicle transport equipment in multi-level parking garages, escalators, and moving walkways. An idle elevator refers to an elevator in the elevator group that is not in operation. The specific criteria for determining an idle elevator can be determined according to the situation. For example, the criteria can be set to determine that an elevator is idle if it has not been running for a preset time or has not been dispatched for a preset time. The number of idle elevators can be less than or equal to the total number of elevators in the elevator group. In step 101, the number of idle elevators can be further specified, and / or, which idle elevators are specified. For example, this can be specified by labels. Specifically, let the labels of multiple elevators in the elevator group be A to H. If elevators labeled A, C, F, G, and H are detected as idle elevators, then it is determined that multiple idle elevators exist. The labels of the elevators to be monitored for idleness can be pre-specified.

[0064] A weighted bipartite graph is constructed based on multiple available elevators and multiple preset waiting floors. The preset waiting floors are a set of floors with pre-defined specific numbers of floors. Optionally, the preset waiting floors can be selected from a subset of the floors served by the elevator group (total service floor range), or all floors within the total service floor range. In some embodiments, the preset waiting floors can be a subset of floors. After performing step 101, the specific available elevators can be determined, and then the corresponding floors are selected from the total service floor range based on the combination of available elevators. For example, preset waiting floor combinations can be pre-specified for different combinations of available elevators, and after determining the current combination of available elevators, the corresponding preset waiting floor combination is selected. In yet other embodiments, after performing step 101, a corresponding number of preset waiting floor combinations can be selected based on the number of available elevators. In general, the methods for selecting preset waiting floors can include: 1) specifying floors for waiting, directly specifying which elevators are idle and which preset waiting floors they should be distributed among; 2) evenly distributing waiting floors, evenly distributing them from the bottom to the top floor within the total service floor range of the elevator group; 3) peak-hour waiting floors, predicting the peak calling floors for the current period based on historical data, so that idle elevators wait on the peak calling floors. It is understood that floors with the same number of floors can exist among multiple preset waiting floors, that is, multiple idle elevators can be dispatched to the same preset waiting floor. For example, during the morning rush hour, multiple idle elevators can be dispatched to the first floor to facilitate passenger ascent. As a reference example, let the set of labels for multiple idle elevators be {A,C,F,G,H}, and the number of preset waiting floors be equal to the number of idle elevators, but duplicate floors are possible. The set of labels for multiple preset waiting floors can be {1,1,3,7,7}. This embodiment of the invention does not impose specific limitations on the number of idle elevators, the number of preset waiting floors, or how to select preset waiting floors.

[0065] After determining multiple preset waiting floors, a bipartite graph is constructed, where multiple idle elevators and multiple preset waiting floors are two independent vertex subsets in the bipartite graph. Relationship edges between the two vertex subsets are established, that is, relationship edges between idle elevators and preset waiting floors are established, and each relationship edge is assigned a weight. The weight is determined based on the running distance between the current position of the idle elevator (current floor) and the preset waiting floor. For example, the weight can be represented by the floor difference d, that is, the weight is positively correlated with the running distance. Alternatively, it can be represented by the total floor height hd, 1 / d, -d, which is equivalent to the weight being negatively correlated with the running distance.

[0066] After establishing the bipartite graph, the weighted maximum and minimum complete matching results of the weighted bipartite graph can be calculated to obtain the matching (i.e., the relation edge set) of the vertices representing each idle elevator and the vertices representing each preset waiting floor. Then, each idle elevator can be scheduled to the matched preset waiting floor.

[0067] In the above embodiments of the present invention, after determining that there are multiple idle elevators in the elevator group, the multiple idle elevators and multiple preset waiting floors are respectively regarded as two vertex subsets of a bipartite graph. Relationship edges in the bipartite graph are constructed according to the service floor range of each idle elevator. The number of multiple idle elevators and multiple preset waiting floors are equal. The weight of each relationship edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor. Then, by calculating the weight maximum and minimum complete matching result of the bipartite graph, the matching one-to-one matching result of the weight maximum and minimum can be obtained. Since the weight is related to the running distance, the optimal matching of multiple idle elevators and multiple preset waiting floors can be obtained by finding the weight maximum and minimum complete matching result of the bipartite graph, so that the total running distance of multiple idle elevators waiting in a dispersed manner is minimized, thereby improving the overall operating efficiency of the elevator system when waiting in a dispersed manner.

[0068] Furthermore, in some application scenarios, elevators in an elevator group may have different service floor ranges. For example, elevator A cannot reach underground floors, elevator C cannot reach the top floor, and elevator F cannot stop on one or more intermediate floors, etc. Therefore, in some technical solutions of the above embodiments of the present invention, when constructing the relationship edges between two vertex subsets in step 102, after determining the service floor range of each idle elevator, a relationship edge between the idle elevator and each preset waiting floor within its service floor range can be established for each idle elevator. In other words, for any idle elevator, only the relationship edge between it and each of the multiple preset waiting floors that can be served is established. This can reduce the invalid operation and stops of elevators and solve for matching results that conform to the actual situation.

[0069] In step 102, when constructing each relation edge, the weight of the relation edge can be determined as follows: For each relation edge, the weight is determined based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relation edge. That is, the weight is determined through a certain mapping relationship using the floor difference between the idle elevator and the preset waiting floor represented by the two vertices connected by a relation edge. The weight of the relation edge can be positively or negatively correlated with the floor difference. Correspondingly, when seeking a perfect match for the maximum and minimum weights, a positive correlation solves for a perfect match for the minimum value, while a negative correlation solves for a perfect match for the maximum value. Using the floor difference as the basis for weights provides an intuitive and easy-to-understand method for determining weights, allowing the weights to directly reflect the actual distance the elevator travels and be directly related to the elevator's energy consumption.

[0070] Optionally, the step of determining the weight of the relation edge based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relation edge may include performing one of the following steps:

[0071] Use the layer difference as the weight of the relation edge;

[0072] Use the opposite or reciprocal of the layer difference as the weight of the relation edge;

[0073] The weight of the relationship edge is obtained by subtracting the floor difference from the total number of floors served by the elevator group.

[0074] By providing different weight calculation methods, the flexibility of the calculation method can be improved, which is conducive to adapting to different algorithms for solving perfect matching.

[0075] Optionally, in some technical solutions provided in the embodiments of the present invention, step 103, calculating the weighted maximum-minimum perfect matching result of the bipartite graph, includes:

[0076] When the weight of the relation edge is positively correlated with the running distance, the minimum weight complete matching result of the bipartite graph is calculated. That is, if the running distance is larger, the weight is also larger. When finding the weight maximum and minimum complete matching result of the bipartite graph, the minimum weight complete matching result of the bipartite graph is calculated so that the sum of the weights of all relation edges in the matching is minimized, that is, the total running distance is minimized and the total running energy consumption of the elevator group is minimized.

[0077] When the weights of relation edges are negatively correlated with the running distance, the maximum weight complete matching result of the bipartite graph is calculated. That is, if the running distance is larger and the weight is smaller, then when finding the maximum weight complete matching result of the bipartite graph, the maximum weight complete matching result of the bipartite graph is calculated so that the sum of the weights of all relation edges in the matching is maximized, that is, the total running distance is minimized and the total running energy consumption of the elevator group is minimized.

[0078] By setting different relationships between weights and running distances, the flexibility of solving bipartite graph perfect matching is improved, and more types of solving algorithms can be applied.

[0079] Optionally, in some technical solutions provided in the embodiments of the present invention, before executing step 102, which treats multiple idle elevators and multiple preset waiting floors as two vertex subsets in a bipartite graph, the number of idle elevators can be determined. Based on the number of idle elevators, multiple service floors equal to the total number of service floors in the elevator group are selected to obtain multiple preset waiting floors. This method eliminates the need for the elevator group to be completely idle before distributing waiting floors; instead, it starts distributing waiting floors after a certain number of idle elevators are available, thereby increasing the possibility of distributing waiting floors in the elevator group and shortening passenger waiting time.

[0080] Optionally, in some technical solutions provided in the embodiments of the present invention, step 103, calculating the weighted maximum-minimum perfect matching result of the bipartite graph, may specifically include performing: initializing the vertex labels of two vertex subsets, searching for the weighted maximum-minimum perfect matching result of the bipartite graph, and modifying the vertex labels if no weighted maximum-minimum perfect matching result is found, until a weighted maximum-minimum perfect matching result of the bipartite graph is found. Compared to brute-force searching for all possible matches, this algorithm gradually approaches the optimal solution by iteratively adjusting the vertex labels, reducing the computational load and time complexity.

[0081] In some implementations, a set of minimum-weighted complete matchings can be found using the Hungarian (Kuhn-Munkras, KM) algorithm. The minimum energy consumption matching problem between idle elevators and a set of preset waiting floors in an elevator system is described using a weighted bipartite graph model in graph theory. This problem can be solved using the KM algorithm. The KM algorithm uses a stepwise approximation approach, successively decreasing the top index value and continuously searching for augmenting paths based on the Hungarian algorithm until a complete matching is found. According to the principle of the KM algorithm, if a minimum-weighted complete matching exists in the weighted bipartite graph, then a set of minimum-weighted complete matchings can always be found. Based on the matching results, if there is a matching edge between an idle elevator and a preset waiting floor, then the idle elevator is allowed to run to the corresponding preset waiting floor, thus minimizing total energy consumption. In some special building designs, some elevators do not provide service to certain service floors, such as basements and VIP floors, which are only accessible by a few elevators. If the preset waiting floors also include these special floors, then the minimum-weighted complete matching can also ensure that there are idle elevators stopping at these preset waiting floors, while minimizing total energy consumption. In other embodiments, algorithms such as the HK (Hopcroft-Karp) algorithm for solving bipartite graph perfect matching can also be used, and the embodiments of the present invention do not limit this.

[0082] Optionally, in some technical solutions provided in the embodiments of the present invention, step 104, which schedules each idle elevator in the elevator group to wait at a matched preset waiting floor based on the weighted maximum / minimum complete matching result, may specifically include performing the following steps: determining the matched preset waiting floor for each idle elevator based on the weighted maximum / minimum complete matching result, and issuing virtual elevator call requests to each idle elevator to schedule each idle elevator to the corresponding matched preset waiting floor. Scheduling idle elevators through virtual elevator call requests allows for quick and accurate guidance of idle elevators to the matched waiting floors.

[0083] The following describes a specific application scenario of the elevator group waiting scheduling method provided by the embodiments of the present invention.

[0084] A preset waiting floor is specified in advance within the total service floor range of the elevator group. When all elevators are detected to be idle (this requirement of all elevators being idle is merely an application example and not a limitation of the embodiment of this invention), a bipartite graph model G = {V, E} is established, constructing a vertex set V and an edge set E. Let the idle elevators be the vertex subset V1 of vertex set V, and the preset waiting floor be the vertex set V2 of vertex set V. The relationship between the idle elevators and the preset waiting floor is the edge set E. If there is an idle elevator v... i ∈V1, preset ladder level v j ∈V2, Idle elevator v j It can be v j The layer provides services, meaning it can dock at v j If there is a layer, then there exists an edge (v) i ,v j Next, calculate the energy consumption of the idle elevator traveling to each preset waiting floor. This can be easily achieved by converting the idle elevator v... i The current position and the preset waiting floor v j Distance d(v) i ,v j As the running distance, since the KM algorithm solves the maximum weight problem, we take the edge (v) as the running distance. i ,v j The weight of ) is w(v i ,v j ) = hd(v i ,v j Let h be the total building height, and h be the weights. The top-level label value l(v) is initialized using a greedy algorithm. Then, a Hungarian algorithm is used to find the maximum weighted perfect match. If no perfect match is found, the top-level label value is modified. After modification, the Hungarian algorithm is used again to find the maximum weighted perfect match, and this process is repeated until a maximum weighted perfect match is found. After determining the maximum weighted perfect match, a virtual elevator call is used to make the idle elevator run to the preset waiting floor according to the matching result.

[0085] Specifically, refer to Figure 2 Assume the elevator system has 8 elevators in the elevator group, all of which are idle. Select a set of 8 pre-defined waiting floors, denoted as V1 = {v A ,v B ,v C ,v D ,v E ,v F ,v G ,v H Let the set of floors to be served by elevator be V2 = {v1, v2, v3, v4, v5, v6, v7, v8}. It can be understood that floors v1 through v8 can contain the same floor. Let v be the number of available elevators. i ∈V1, preset ladder level vj ∈V2, Idle elevator v i Able to serve v j Floor, i.e., available elevator v j It can run up to v j If a layer is established, then a relation edge (v) is created. i ,v j If )∈E, assign a weight value w(v) to the relation edge. i ,v j ) = hd(v i ,v j ), where d(v i ,v j )=Flr(v i )-v j , where Flr(v i ) for v i Current layer. (See reference) Figure 2 If elevator v i Cannot be v j For floor services, there is no connecting line between the elevator and the corresponding floor. Accordingly, refer to... Figure 3 The vertex v corresponding to the elevator i With the preset waiting layer v j There are no relational edges between them.

[0086] The vertex labels are initialized using a greedy algorithm, assigning each vertex in V1 the maximum weight of the edges connected to that vertex. For each vertex in V2, assign the vertex index value l(v j If ) = 0, the feasible vertex index satisfies: Next, find an equal subgraph G′ in graph G that contains all vertices and whose edges satisfy l(v i )+l(v j )=w(v i ,v j Then, find a perfect match in the equality subgraph.

[0087] The Hungarian algorithm is used to find an augmenting path starting from an unmatched vertex. Inverting this path adds an edge to the matching, and this process continues until a perfect match is found. (Reference) Figure 4 Assume l(v) A )+l(v4)=w(v A If v4), then all vertices are unmatched, then (v A v4) is a matched edge, starting from the next unmatched vertex v B Initially, assume l(v) B )+l(v4)=w(v B ,v4),l(v A )+l(v5)=w(vA (v5), take the alternating path v B v4→v4v A →v A If v5 is an unmatched vertex, then the path is an augmenting path. Inverting this path changes the original matched edges to unmatched edges and vice versa. Therefore, the set of matched edges is {(v...} A ,v4)}(Reference Figure 4 The thick dashed line becomes the matching edge set {(v B ,v4), (v A v5)}(Reference Figure 4 (Medium-thick solid line), add one edge to the set, and continue searching for augmenting paths by reversing them until the edge set is a complete match. If no augmenting path can be found starting from an unmatched vertex, then modify the vertex label value to expand the range of the equal subgraph. Assume that in... Figure 4 For v A ,v B Only vertex v4 satisfies l(v B )+l(v4)=w(v B ,v4),l(v A )+l(v4)=w(v A If no augmenting path can be found at v4, then modify the top label value.

[0088] Let S denote the set of points in set V1 that are on the alternating path, and S′ denote the set of points in set V1 that are not on the alternating path. Similarly, let T denote the set of points in set V2 that are on the alternating path, and T′ denote the set of points in set V2 that are not on the alternating path. l(v i )=l(v i )-d, l(v j )=l(v j )+d, where d=min{l(v x )+l(v y )-W e(x→y) If |x∈S,y∈T′}, then a new edge is added to the equal subgraph. Continue searching for augmenting paths for unmatched vertices, repeating the above steps until a perfect match is found in the equal subgraph. (Reference) Figure 4 , we have S = {v A ,v B}, T = {v4}, modify the top-level value l(v A )=l(v A )-d,l(v B )=l(v B )-d,l(v4)=l(v4)+d, continue searching for a perfect match in the equality subgraph.

[0089] Finally, based on the maximum weighted perfect matching obtained by the KM algorithm, which is the allocation method with the highest running efficiency, each elevator is run to the preset waiting floor corresponding to the edge of the solved perfect matching through virtual elevator calling. At this time, according to the definition of perfect matching, it can be seen that each preset waiting floor has a corresponding elevator service, and the overall running distance is the shortest.

[0090] The present invention also provides an embodiment of an elevator group waiting dispatching device, which can be used to execute the elevator group waiting dispatching method provided in the embodiment of the present invention. For the parts of the technical solution or technical effect of the elevator group waiting dispatching device provided in the embodiment of the present invention that are not described in detail, please refer to the relevant description in the embodiment of the elevator group waiting dispatching method, which will not be repeated here.

[0091] refer to Figure 5 The elevator group waiting dispatch device 50 may include a determination module 51, a construction module 52, a calculation module 53 and a dispatch module 54.

[0092] Module 51 is used to determine whether there are multiple idle elevators in the elevator group;

[0093] The construction module 52 is used to take multiple idle elevators and multiple preset waiting floors as two vertex subsets in a bipartite graph, and construct the relation edges in the bipartite graph according to the service floor range of each idle elevator; the number of multiple idle elevators and multiple preset waiting floors are equal, and the weight of each relation edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor.

[0094] Calculation module 53 is used to calculate the weighted maximum and minimum perfect matching results of the bipartite graph;

[0095] The scheduling module 54 is used to schedule each idle elevator in the elevator group to wait on the pre-matched waiting floor based on the complete matching result of the weight maximum and minimum values.

[0096] Optionally, in some technical solutions provided in the embodiments of the present invention, the construction module 52 may be specifically used to perform:

[0097] Determine the service floor range of each of the aforementioned available elevators;

[0098] For each available elevator, establish the relationship edge between the available elevator and each preset waiting floor within the service floor range;

[0099] Optionally, in some technical solutions provided in the embodiments of the present invention, the construction module 52 may be specifically used to perform:

[0100] For each relation edge, the weight of the relation edge is determined based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relation edge.

[0101] Optionally, in some technical solutions provided in the embodiments of the present invention, the construction module 52 may be specifically used to perform one of the following:

[0102] Use the layer difference as the weight of the relation edge;

[0103] Use the opposite or reciprocal of the layer difference as the weight of the relation edge;

[0104] The weight of the relationship edge is obtained by subtracting the floor difference from the total number of floors served by the elevator group.

[0105] Optionally, in some technical solutions provided in the embodiments of the present invention, the calculation module 53 may be specifically used to perform:

[0106] Calculate the minimum weight complete matching result of the bipartite graph when the weight of the relation edge is positively correlated with the running distance;

[0107] Calculate the maximum weight complete matching result of the bipartite graph when the weight of the relation edge is negatively correlated with the running distance.

[0108] Optionally, in some technical solutions provided in the embodiments of the present invention, the determining module 51 can also be used to determine the number of idle elevators before taking the multiple idle elevators and the multiple preset waiting floors as two vertex subsets in the bipartite graph; the device can also include: a selection module, used to select multiple service floors equal to the number of idle elevators within the total service floor range of the elevator group, to obtain multiple preset waiting floors.

[0109] Optionally, in some technical solutions provided in the embodiments of the present invention, the calculation module 53 may be specifically used to perform:

[0110] Initialize the vertex indices of two subsets of vertices;

[0111] Find a perfect match for the weighted extrema of the bipartite graph, and modify the vertex label value if no perfect match is found, until a perfect match for the weighted extrema of the bipartite graph is found.

[0112] Optionally, in some technical solutions provided in the embodiments of the present invention, the scheduling module 54 may be specifically used to execute:

[0113] Based on the weighted maximum and minimum complete matching results, determine the preset waiting floors for matching each idle elevator;

[0114] Virtual elevator call requests are sent to each available elevator to dispatch each available elevator to the corresponding preset waiting floor.

[0115] Figure 6 This is a block diagram of an electronic device used to implement the elevator group waiting scheduling method provided in the embodiments of this application. Figure 6As shown, the electronic device includes a memory 601 and a processor 602. The memory 601 stores a computer program that can run on the processor 602. When the processor 602 executes the computer program, it implements the method described in the above embodiments. The number of memories 601 and processors 602 can be one or more. In a specific implementation, the electronic device may also include a communication interface 603 for communicating with external devices and exchanging data.

[0116] In practical implementation, if the memory 601, processor 602, and communication interface 603 are implemented independently, they can be interconnected via a bus to communicate with each other. This bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. This bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0117] Optionally, in a specific implementation, if the memory 601, processor 602 and communication interface 603 are integrated on a single chip, the memory 601, processor 602 and communication interface 603 can communicate with each other through an internal interface.

[0118] An embodiment of the present invention also provides a computer-readable storage medium having a computer program stored thereon, the program being executed by a processor to implement the elevator group waiting scheduling method as provided in any embodiment of the present invention.

[0119] One embodiment of the present invention also provides a computer program product, including a computer program executed by a processor to implement the elevator group waiting scheduling method as provided in any embodiment of the present invention. Similar to a computer-readable storage medium, the computer program can also be executed by an electronic device or an electronic device communicating with an electronic device, as will not be elaborated further.

[0120] An embodiment of the present invention also provides an elevator system, including multiple elevators, and an electronic device provided in the embodiment of the present invention, which is used to execute the elevator group waiting scheduling method provided in the embodiment of the present invention.

[0121] The above description is merely an optional embodiment of the present invention and does not limit the patent scope of the present invention. Any modifications, equivalent substitutions, improvements, etc., made under the concept of the present invention and using the contents of the present invention specification and drawings, or directly / indirectly applied to other related technical fields, should be included within the patent protection scope of the present invention.

[0122] The above description is merely an optional embodiment of the present invention and does not limit the patent scope of the present invention. Any modifications, equivalent substitutions, improvements, etc., made under the concept of the present invention and using the contents of the present invention specification and drawings, or directly / indirectly applied to other related technical fields, should be included within the patent protection scope of the present invention.

Claims

1. A method of destination dispatching for an elevator group, characterized in that, include: Confirm that there are multiple idle elevators in the elevator group; The multiple idle elevators and multiple preset waiting floors are respectively regarded as two vertex subsets in a bipartite graph, and the relationship edges between the two vertex subsets are constructed. The number of the multiple idle elevators and the multiple preset waiting floors are equal, and the weight of each relation edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor; Calculate the weighted maximum / minimum perfect matching result of the bipartite graph; Based on the complete matching result of the weighted maximum and minimum values, each idle elevator in the elevator group is scheduled to wait on the matched preset waiting floor; Constructing the relationship edge between the two vertex subsets includes: Determine the service floor range of each of the aforementioned available elevators; For each of the aforementioned idle elevators, establish a relationship edge between the idle elevator and each of the preset waiting floors within the service floor range.

2. The elevator bank hall call dispatching method according to claim 1, wherein Constructing the relationship edge between the two vertex subsets includes: For each of the aforementioned relation edges, the weight of the relation edge is determined based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relation edge.

3. The elevator bank hall call dispatching method according to claim 2, wherein The step of determining the weight of the relational edge based on the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relational edge includes one of the following: The layer difference is used as the weight of the relation edge; The opposite or reciprocal of the layer difference is used as the weight of the relation edge; The weight of the relation edge is obtained by subtracting the floor difference value from the total number of service floors of the elevator group.

4. The elevator bank destination dispatching method of any one of claims 1-3, wherein, The calculation of the weighted maximum-minimum perfect matching result of the bipartite graph includes: The response and the weight of the relation edge are positively correlated with the running distance; calculate the minimum weight complete matching result of the bipartite graph. The response and the weight of the relation edge are negatively correlated with the running distance, and the maximum weight complete matching result of the bipartite graph is calculated.

5. The elevator bank hall call dispatching method of claim 1, wherein, Before treating the multiple idle elevators and the multiple preset waiting floors as two vertex subsets in a bipartite graph, the method further includes: Determine the number of available elevators; Based on the number of available elevators, select multiple service floors equal to the total number of service floors in the elevator group to obtain the multiple preset waiting floors.

6. The elevator bank hall call dispatching method of claim 1, wherein, The calculation of the weighted maximum-minimum perfect matching result of the bipartite graph includes: Initialize the vertex index values ​​of the two vertex subsets; Find a perfect match for the maximum and minimum weights of the bipartite graph, and modify the vertex label value if no perfect match is found, until a perfect match for the maximum and minimum weights of the bipartite graph is found.

7. The elevator bank hall call dispatching method of claim 1, wherein, The step of scheduling each idle elevator in the elevator group to wait at a pre-matched waiting floor based on the weighted maximum / minimum complete matching result includes: Based on the complete matching results of the weighted maximum and minimum values, the preset waiting floors for matching each of the idle elevators are determined; A virtual elevator call request is sent to each of the idle elevators to dispatch each of the idle elevators to the corresponding matched preset waiting floor.

8. An elevator group waiting time scheduling device characterized by comprising: include: The determination module is used to determine whether there are multiple idle elevators in an elevator group; The construction module is used to construct the relationship edge between the multiple idle elevators and the multiple preset floors to be escalated as two vertex subsets in a bipartite graph. The number of the multiple idle elevators and the multiple preset waiting floors are equal, and the weight of each relation edge is determined according to the running distance between the current floor of the idle elevator and the preset waiting floor; The calculation module is used to calculate the weighted maximum and minimum complete matching result of the bipartite graph; The scheduling module is used to schedule each idle elevator in the elevator group to wait on the matched preset waiting floor according to the complete matching result of the weight maximum value; The construction module is also used to: determine the service floor range of each of the idle elevators; and for each of the idle elevators, establish a relationship edge between the idle elevator and each of the preset waiting floors within the service floor range.

9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, The processor executes the program to implement the method as described in any one of claims 1-7.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The program is executed by a processor to implement the method as described in any one of claims 1-7.

11. An elevator system characterized in that It includes multiple elevators and the electronic device as described in claim 9.

Images