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

Abstract

The invention discloses an elevator waiting scheduling method and device of an elevator group, electronic equipment, a computer readable storage medium and an elevator system. The method comprises the steps that it is determined that multiple idle elevators exist in the elevator group; taking the plurality of idle elevators and the plurality of preset elevator waiting floors as two vertex subsets in the bipartite graph, and constructing a relation edge between the two vertex subsets; the number of the idle elevators is equal to that of the preset elevator waiting floors, and the weight of each relation edge is determined according to the running distance between the current floor of each idle elevator and the corresponding preset elevator waiting floor; calculating a weight extreme value complete matching result of the bipartite graph; and according to the weight extreme value complete matching result, all idle elevators in the elevator group are dispatched to wait for the elevator at the matched preset elevator waiting layer. According to the technical scheme, the problem that when an existing elevator system waits for the elevator in a scattered mode, the overall operation efficiency is low is solved.

Description

Technical Field

[0001] The present invention relates to the technical field of elevator control, and in particular to an elevator waiting scheduling method and device, electronic equipment, a computer-readable storage medium and an elevator system. Background Art

[0002] When a passenger has a need to call for an elevator, if an idle elevator stops at the passenger's floor or a nearby floor, it can respond to the passenger's call as quickly as possible and reduce the passenger's waiting time. Therefore, in the elevator system of the elevator group, the dispersed waiting function of the elevator group has become an essential function of the elevator system. In the related art, the elevator system often matches the nearest idle elevator to each preset waiting floor to ensure that the idle elevator has the lowest energy consumption when running to the preset waiting 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 purpose of the present invention is to provide a method and device for scheduling elevator waiting for a group of elevators, an electronic device, a computer-readable storage medium and an elevator system, aiming to solve the problem of low overall operating efficiency of the existing elevator system when the elevators are dispersed.

[0004] To achieve the above object, an embodiment of the present invention provides a method for scheduling elevator waiting time in an elevator group, comprising:

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

[0006] The plurality of idle elevators and the plurality of preset waiting floors are respectively used as two vertex subsets in a bipartite graph, and a relationship edge between the two vertex subsets is constructed; the number of the plurality of idle elevators and the number of the 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 complete matching result of the bipartite graph;

[0008] According to the weighted maximum complete matching result, each of the idle elevators in the elevator group is scheduled to wait at a matched preset waiting floor.

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

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

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

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

[0013] For each of the relationship edges, the weight of the relationship edge is determined according to the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relationship edge.

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

[0015] Using the layer difference value as the weight of the relationship edge;

[0016] Taking the opposite number or the reciprocal of the layer difference value as the weight of the relationship edge;

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

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

[0019] In the case where the weight of the relationship edge is positively correlated with the running distance, calculating the minimum weight complete matching result of the bipartite graph;

[0020] In the case where the weight of the relationship edge is negatively correlated with the running distance, a maximum weighted complete matching result of the bipartite graph is calculated.

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

[0022] determining the number of said idle elevators;

[0023] According to the number of the idle elevators, a plurality of service floors equal to the number are selected within the total service floor range of the elevator group to obtain the plurality of preset waiting floors.

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

[0025] Initializing the top mark values ​​of the two vertex subsets;

[0026] Finding a weighted maximum complete matching result of the bipartite graph, and modifying the top mark value if the weighted maximum complete matching result is not found, until finding a weighted maximum complete matching result of the bipartite graph.

[0027] Optionally, in some technical solutions provided by the embodiments of the present invention, scheduling each of the idle elevators in the elevator group to wait for the elevator at a matched preset waiting floor according to the weighted maximum complete matching result includes:

[0028] According to the weighted maximum complete matching result, determining the matching preset waiting floor for each of the idle elevators;

[0029] A virtual elevator call request is issued to each of the idle elevators respectively, so as to dispatch each of the idle elevators to the corresponding matching preset waiting floor.

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

[0031] A determination module, used for determining whether there are multiple idle elevators in the elevator group;

[0032] A construction module is used to take the plurality of idle elevators and the plurality of preset waiting floors as two vertex subsets in a bipartite graph, respectively, and construct a relationship edge between the two vertex subsets; the number of the plurality of idle elevators and the plurality 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;

[0033] A calculation module, used for calculating the weighted maximum complete matching result of the bipartite graph;

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

[0035] An embodiment of the present invention further provides an electronic device, comprising 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 waiting scheduling method for an elevator group as provided in any embodiment of the present invention.

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

[0037] An embodiment of the present invention further provides a computer program product, including a computer program, wherein the computer program is executed by a processor to implement the elevator waiting scheduling method for an elevator group 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 the multiple preset waiting floors are respectively used as two vertex subsets in the bipartite graph, and the relationship edges in the bipartite graph are constructed according to the service floor range of each idle elevator, wherein the number of the 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. Then, by calculating the weighted maximum complete matching result of the bipartite graph, a one-to-one matching result with the maximum weight can be obtained. Since the weight is related to the running distance, therefore, by finding the weighted maximum complete matching result of the bipartite graph, the optimal matching of the multiple idle elevators and the multiple preset waiting floors can be obtained, so that the total running distance of the multiple idle elevators in the dispersed waiting position is minimized, thereby improving the overall operating efficiency of the elevator system when the elevator is dispersed. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the structures shown in these drawings without paying creative work.

[0040] Figure 1 A schematic diagram of a flow chart of a method for scheduling elevators in an elevator group according to an embodiment of the present invention;

[0041] Figure 2 Schematic diagram of the principle of the elevator group waiting dispatching method provided by one embodiment of the present invention Figure 1 ;

[0042] Figure 3 Schematic diagram of the principle of the elevator group waiting dispatching method provided by one embodiment of the present invention Figure 2 ;

[0043] Figure 4 Schematic diagram of the principle of the elevator group waiting dispatching method provided by one embodiment of the present invention Figure 3 ;

[0044] Figure 5 A schematic diagram of the structure of an elevator waiting dispatching device for an elevator group provided by an embodiment of the present invention;

[0045] Figure 6 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention.

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

[0047] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0048] Those skilled in the art will readily appreciate other embodiments of the invention after considering the specification and practicing the invention disclosed herein. The 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 description and examples are to be regarded as exemplary only, and the inventive concept of the invention is indicated by the claims.

[0049] The terms used in the present invention are only for the purpose of describing specific embodiments, and are not intended to limit the present invention. The singular forms of "a", "said" and "the" used in the present invention and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used herein refers to and includes any or all possible combinations of one or more associated listed items. Depending on the context, the word "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determining".

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

[0051] In addition, in the present invention, descriptions such as "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present invention, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0052] In addition, the technical solutions between the various embodiments of the present invention can be combined with each other, but it must be based on the fact that ordinary technicians in the field can implement it. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0053] Some of the terms involved in the embodiments of the present invention are explained below.

[0054] Bipartite graph: Bipartite graph is a concept in graph theory. For an undirected graph, the vertices in the graph can be divided into two disjoint independent subsets, so that any two vertices in the same set are not 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 the two vertices associated with each edge in the graph belong to these two sets respectively.

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

[0056] The embodiment of the present invention aims to solve the problem of how to achieve global optimization of operating efficiency and energy consumption by matching waiting floors with idle elevators when the elevator system enables the decentralized waiting function, so as to meet the needs of passengers to take the elevator quickly while ensuring that each preset waiting floor has an idle elevator waiting, even if the serviceable floors of each elevator are not exactly the same. The elevator described in the embodiment of the present application can be an electric drive device for vertical or inclined transportation of passengers or goods. The types of elevators include but are not limited to vertical passenger elevators, construction elevators, freight elevators for freight transportation, car handling devices for transporting vehicles in multi-story parking lots, escalators and moving walkways, etc.

[0057] The embodiment of the present invention establishes a bipartite graph model based on the idle elevators and preset waiting floors in the elevator system, that is, the idle elevators in the elevator system and a set of equal number of preset waiting floors are recorded as two independent vertex subsets. If a certain idle elevator can reach a preset waiting floor, it is considered that there is a relationship edge between the corresponding two points, that is, for each idle elevator, it can be determined whether a relationship edge can be established with each preset waiting floor according to the serviceable floor of the idle elevator, and the weight of the relationship edge can be related to the running distance / energy consumption required for running, and can be positively correlated or negatively correlated. In this way, the problem of how to achieve the global optimal energy consumption of the matching of the preset waiting floor and the idle elevator is converted into the problem of solving the minimum weight complete matching of the weighted bipartite graph. In graph theory, an edge set in which no two edges have common points is called a matching, that is, this set includes multiple edges, and no two edges share the same vertex. In other words, in this edge set, each vertex is connected to only one edge. If all vertices of a matching in a graph are matching points, it is called a complete matching. Therefore, how to allocate each idle elevator to a different preset waiting floor is to find a match for these two vertex subsets to ensure that each preset waiting floor has an idle elevator, that is, to find a complete match of the bipartite graph.

[0058] The specific implementation of the elevator group waiting dispatching method provided by the embodiment of the present invention is described in detail below. Figure 1 The elevator waiting scheduling method of the elevator group includes the following steps:

[0059] Step 101, determining that there are multiple idle elevators in the elevator group;

[0060] Step 102, taking the plurality of idle elevators and the plurality of preset waiting floors as two vertex subsets in a bipartite graph, respectively, and constructing a relationship edge between the two vertex subsets; the number of the plurality of idle elevators and the number of the 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, calculating the weighted maximum complete matching result of the bipartite graph;

[0062] Step 104, according to the weighted maximum complete matching result, each idle elevator in the elevator group is scheduled to wait at the matched preset waiting floor.

[0063] The elevator group includes a plurality of elevators. The elevator described in the embodiment of the present application is an electric drive device for transporting passengers or goods vertically or obliquely. The types of elevators include vertically lifting passenger elevators, freight elevators for freight transportation, vehicle transport equipment in multi-story parking lots, and escalators and moving walkways. An idle elevator refers to an elevator that is not working in the elevator group. The specific determination condition of an idle elevator can be determined according to the situation. For example, the determination condition can be set to determine that the elevator is an idle elevator when the elevator has not been running for more than a preset time or has not been scheduled for more than 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, it can be specified by a number. Specifically, the numbers of the multiple elevators in the elevator group are A to H. If the elevators with the numbers A, C, F, G, and H are monitored to be idle elevators, it is determined that there are multiple idle elevators, wherein the number of the above-mentioned elevators that need to be monitored for idleness can be pre-specified.

[0064] A weighted bipartite graph is constructed based on multiple idle elevators and multiple preset waiting floors, where the multiple preset waiting floors are a group of floors with a specific number of floors set. Optionally, the preset waiting floors can be some floors selected from the union of floors that can be served by the elevator group (total service floor range), or all floors in the total service floor range. In some embodiments, the preset waiting floors can be some floors. After executing step 101, it can be determined which idle elevators they are, and then the corresponding floors are selected in the total service floor range according to the combination of idle elevators. For example, preset waiting floor combinations can be specified in advance for different idle elevator combinations, and after determining the current idle elevator combination, the corresponding preset waiting floor combination is selected. In some other embodiments, after executing step 101, a corresponding number of preset waiting floor combinations can be selected according to the number of idle elevators. In general, the method for selecting a preset waiting floor for elevators may include: 1) specifying floors for waiting elevators, directly specifying which elevators are idle, and which preset waiting floors these elevators need to be distributed in; 2) evenly distributing waiting elevators, evenly distributing them between the bottom and top floors in the total service floor range of the elevator group; 3) waiting elevators at peak floors, predicting the peak floors for elevator calls in the current period through historical data, so that idle elevators wait at the peak floors for elevator calls. It can be understood that among multiple preset waiting floors, there may be floors with the same number of floors, that is, multiple idle elevators may be dispatched to the same preset waiting floor, such as during the morning peak, multiple idle elevators may be dispatched to one floor to facilitate passengers to go up. Provide a reference example, assuming that the number set of multiple idle elevators is {A, C, F, G, H}, the number of multiple preset waiting floors is equal to the number of idle elevators, but there may be repeated floors, and the number set of multiple preset waiting floors may be {1, 1, 3, 7, 7}. The embodiment of the present invention does not specifically limit the number of idle elevators and the number of preset waiting floors, and how to select the preset waiting floors.

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

[0066] After establishing the bipartite graph, the weighted maximum complete matching result of the weighted bipartite graph can be calculated to obtain the matching (i.e., relationship edge set) of the vertices representing each idle elevator and the vertices representing each preset waiting floor, and then dispatch each idle elevator to the matching preset waiting floor.

[0067] In the above embodiment of the present invention, after determining that there are multiple idle elevators in the elevator group, the multiple idle elevators and the multiple preset waiting floors are respectively used as two vertex subsets in the bipartite graph, and the relationship edges in the bipartite graph are constructed according to the service floor range of each idle elevator, wherein the number of the 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. Then, by calculating the weighted maximum complete matching result of the bipartite graph, a one-to-one matching result with the maximum weight can be obtained. Since the weight is related to the running distance, the optimal matching of the multiple idle elevators and the multiple preset waiting floors can be obtained by obtaining the weighted maximum complete matching result of the bipartite graph, so that the total running distance of the multiple idle elevators in the dispersed waiting position is minimized, thereby improving the overall operating efficiency of the elevator system when the elevator is dispersed.

[0068] Furthermore, in some application scenarios, each elevator in the elevator group may have a different service floor range, for example, elevator A cannot reach the underground floor, elevator C cannot reach the top floor, elevator F cannot stop at one or several floors in the middle, etc. Therefore, in some technical solutions of the above embodiments of the present invention, when constructing the relationship edge between two vertex subsets in step 102, after determining the service floor range of each idle elevator, for each idle elevator, the relationship edge between the idle elevator and each preset waiting floor within the service floor range can be established. In other words, for any idle elevator, only the relationship edge between it and each serviceable floor in multiple preset waiting floors is established, which can reduce the ineffective operation and parking of the elevator and solve the matching result that conforms to the actual situation.

[0069] In executing step 102, when constructing each relationship edge, the weight of the relationship edge can be determined in the following manner: for each relationship edge, the weight of the relationship edge is determined according to the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relationship edge. That is, the weight is determined by a certain mapping relationship between the floor difference between the idle elevator and the preset waiting floor represented by two vertices connected by a relationship edge. The weight of the relationship edge can be positively correlated or negatively correlated with the floor difference value. Accordingly, when seeking the maximum complete match of the weight value, the positive correlation solves the minimum complete match, and the negative correlation solves the maximum complete match. Using the floor difference value as the basis for the weight provides an intuitive and easy-to-understand weight determination method, so that the weight can directly reflect the actual distance moved by the elevator and is directly related to the energy consumption of the elevator operation.

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

[0071] The layer difference value is used as the weight of the relationship edge;

[0072] The opposite or reciprocal of the layer difference value is used as the weight of the relationship edge;

[0073] Subtract the floor difference from the total number of service floors of the elevator group to obtain the weight of the relationship edge.

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

[0075] Optionally, in some technical solutions provided by embodiments of the present invention, step 103 calculates the weighted maximum complete matching result of the bipartite graph, including:

[0076] When the weight of the relationship 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 seeking the weighted maximum complete matching result of the bipartite graph, the minimum weight complete matching result of the bipartite graph is calculated, which can minimize the sum of the weights of all relationship edges in the matching, that is, minimize the total running distance and minimize the total running energy consumption of the elevator group.

[0077] When the weight of the relationship edge is negatively correlated with the running distance, the maximum weighted complete matching result of the bipartite graph is calculated. That is, if the running distance is larger, the weight is smaller. When seeking the weighted maximum complete matching result of the bipartite graph, the maximum weighted complete matching result of the bipartite graph is calculated so that the sum of the weights of all the relationship 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 correlations between weights and running distances, the flexibility of solving complete matching of bipartite graphs is improved, and more types of solving algorithms can be applied.

[0079] Optionally, in some technical solutions provided by the embodiments of the present invention, before executing step 102 to use multiple idle elevators and multiple preset waiting floors as two vertex subsets in the bipartite graph, the number of idle elevators can also be determined, and according to the number of idle elevators, multiple service floors equal to the number are selected within the total service floor range of the elevator group to obtain multiple preset waiting floors. This method does not require the elevator group to disperse the waiting floors when all elevators are idle, but instead starts to execute the dispersed waiting floor function after a certain number of idle elevators exist, thereby increasing the possibility of dispersed waiting floors in the elevator group and shortening the waiting time for passengers.

[0080] Optionally, in some technical solutions provided by embodiments of the present invention, step 103 calculates the weighted maximum complete matching result of the bipartite graph, which may specifically include the following steps: initializing the top mark values ​​of the two vertex subsets, finding the weighted maximum complete matching result of the bipartite graph, and modifying the top mark value if the weighted maximum complete matching result is not found, until the weighted maximum complete matching result of the bipartite graph is found. Compared with brute force search for all possible matches, this algorithm gradually approaches the optimal solution by iteratively adjusting the top mark value, thereby reducing the amount of calculation and time complexity.

[0081] In some embodiments, a set of minimum weight complete matches can be found specifically by the Kuhn-Munkras (KM) algorithm. The minimum energy consumption matching problem between idle elevators and a set of preset waiting floors in the elevator system is described by a weighted bipartite graph in a graph theory model, and can be solved by the KM algorithm. The KM algorithm is based on the idea of ​​gradual approximation, which reduces the top mark value in turn, and then continuously finds augmented paths based on the Hungarian algorithm until a complete match is found. According to the principle of the KM algorithm, as long as the weighted bipartite graph has a minimum weight complete match, a set of minimum weight complete matches can be found. According to the matching result, if there is a matching edge between the idle elevator and the preset waiting floor, the idle elevator is allowed to run to the corresponding preset waiting floor, and the total energy consumption can be minimized. Under some special building designs, some elevators are not open to some service floors, such as underground floors and VIP floors, which are only accessible by individual elevators. If the preset waiting floors also include these special floors, then the minimum weight complete match can also ensure that there are idle elevators parked at these preset waiting floors, and the total energy consumption is the lowest. In some other implementations, an algorithm for solving a complete matching of a bipartite graph, such as the HK (Hopcroft-Karp) algorithm, may also be used, and the embodiment of the present invention does not limit this.

[0082] Optionally, in some technical solutions provided by the embodiments of the present invention, the above step 104 dispatches each idle elevator in the elevator group to wait at the matched preset waiting floor according to the weighted maximum complete matching result, which may specifically include executing the following steps: determining the matched preset waiting floor of each idle elevator according to the weighted maximum complete matching result, and sending a virtual elevator call request to each idle elevator respectively, so as to dispatch each idle elevator to the corresponding matched preset waiting floor. The idle elevator is dispatched by the virtual elevator call request, and the virtual elevator call request can be used to quickly and accurately guide the idle elevator to the matched waiting floor.

[0083] The following describes a method for scheduling elevator groups provided by an embodiment of the present invention in a specific application scenario.

[0084] The preset waiting floors are specified in advance within the total service floor range of the elevator group. When all elevators are detected to be idle (it can be understood that the requirement that all elevators are idle is only an application example, not a limitation of the embodiment of the present invention), a bipartite graph model G = {V, E} is established, and a vertex set V and an edge set E are constructed. Let the idle elevators be the vertex subset V of the vertex set V. 1 , the preset ladder layer is the vertex set V of the vertex set V 2 , the relationship between the idle elevators and the preset waiting floors is the edge set E. If there is an idle elevator v i ∈V 1 , preset waiting floor v j ∈V 2 , idle elevator v j Can be v j The layer provides services, which can be docked on v j layer, then there exists an edge (v i ,v j )∈E. Next, the energy consumption of the idle elevator running to each preset waiting floor can be calculated by simply substituting the idle elevator v i The current position and the preset waiting floor v j The distance d(v i ,v j ) as the running distance. Since the KM algorithm is to solve the maximum weight problem, here we take the edge (v i ,v j ) has a weight of w(v i ,v j )=hd(v i ,v j ), where h is the total height of the building, so that the weight is non-negative, and then the top mark value l(v) is initialized by the greedy algorithm, and then the maximum weight complete match is found by the Hungarian algorithm. If there is no complete match, the top mark value is modified, and after the top mark value is modified, the maximum weight complete match is found again by the Hungarian algorithm, and it is repeated until the maximum weight complete match is found. After determining the maximum weight complete match, the idle elevator is run to the preset waiting floor according to the matching result through virtual elevator call.

[0085] Specifically, refer to Figure 2 , assuming that the number of elevators in the elevator group in the elevator system is 8 and all of them are idle, select a set of preset waiting floors with a total number of 8, and record the elevator set as V 1 = {v A ,v B ,v C ,v D ,v E ,v F ,v G ,v H}, the preset set of waiting floors is V 2 = {v1 ,v 2 ,v 3 ,v 4 ,v 5 ,v 6 ,v 7 ,v 8}, understandable, v 1 ~v 8 The same floor can exist in . Let the idle elevator v i ∈V 1 , preset waiting floor v j ∈V 2 , idle elevator v i Able to serve j Floor, that is, idle elevator v j Can run to v j layer, then establish a relationship edge (v i ,v j )∈E, and assign a weight value of w(v i ,v j )=hd(v i ,v j ), where d(v i ,v j )=Flr(v i )-v j , where Flr(v i ) is v i The current layer. Figure 2 , if the elevator v i Cannot be v j If the elevator serves the corresponding floor, there is no connecting line between the elevator and the corresponding floor. Figure 3 , the vertex v corresponding to the elevator i and the preset waiting floor v j There is no relationship edge between them.

[0086] Initialize the top value through the greedy algorithm, for V 1 Each vertex in is assigned the maximum weight of the edges connected to it. For V 2 The top label value of each vertex in is assigned to l(v j )=0, the feasible top mark satisfies: Next, find an equivalent subgraph G′ in graph G that contains all vertices and all edges satisfy l(v i )+l(v j )=w(v i ,v j ), and then look for a complete match in the equal subgraph.

[0087] Using the Hungarian algorithm, we start from an unmatched vertex and find an augmenting path. Then we invert the path, and there will be one more edge in the match until a complete match is found. Figure 4 , assuming l(v A )+l(v 4 )=w(v A ,v 4 ), at this time all vertices are unmatched points, then (v A ,v 4 ) is a matching edge, starting from the next unmatched point v B To begin with, assume that l(v B )+l(v 4 )=w(v B ,v 4 ), l(v A )+l(v 5 )=w(v A ,v 5 ), take the alternate path v B v 4 →v 4 v A →v A v 5 , v 5 is an unmatched point, then the path is an augmenting path, and the original matched edge becomes an unmatched edge, and the original unmatched edge becomes a matched edge, that is, the matching edge set {(v A ,v 4 )}(refer to Figure 4 The thick dashed line) becomes the matching edge set {(v B ,v 4 ), (v A ,v 5 )}(refer to Figure 4 The edge set is increased by one, and the augmenting path is searched and reversed until the edge set is completely matched. If the augmenting path cannot be found from the unmatched vertex, the top mark value is modified to expand the range of equal subgraphs. Figure 4 For v A ,v B , only vertex v 4 Satisfy l(v B )+l(v 4 )=w(v B ,v 4 ), l(v A )+l(v 4 )=w(v A ,v 4 ), if the augmenting path cannot be found, the top mark value is modified.

[0088] Set V 1The set of points on the alternating path is denoted by S, and the set V 1 The set of points that are not on the alternating path is denoted as S′. Similarly, the set V 2 The set of points on the alternating path is denoted by T, and the set V 2 The set of points that are not on the alternating path is denoted as T′. 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) |x∈S,y∈T′}, now a new edge is added to the equal subgraph, continue to find augmenting paths for unmatched vertices, and repeat the above steps until a complete match of the equal subgraph is found. Figure 4 , we have S = {v A ,v B}, T = {v 4}, modify the top value l(v A )=l(v A )-d,l(v B )=l(v B )-d,l(v 4 )=l(v 4 )+d, continue to search for a complete match in the equal subgraph.

[0089] Finally, according to the maximum weighted complete matching obtained by the KM algorithm, that is, the allocation method with the highest operating efficiency, each elevator is run to the preset waiting floor corresponding to the edge of the solved complete matching through virtual elevator calling. At this time, according to the definition of complete matching, 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 waiting scheduling device for an elevator group, which can be used to execute the elevator waiting scheduling method for an elevator group provided by the embodiment of the present invention. For the technical scheme or technical effect of the elevator waiting scheduling device for an elevator group provided by the embodiment of the present invention that is not described in detail, reference can be made to the relevant description in the embodiment of the elevator waiting scheduling method for the above-mentioned elevator group, and no further details will be given.

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

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

[0093] A construction module 52 is used to respectively use the plurality of idle elevators and the plurality of preset waiting floors as two vertex subsets in a bipartite graph, and to construct a relationship edge in the bipartite graph according to the service floor range of each idle elevator; the number of the plurality of idle elevators and the plurality of 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;

[0094] A calculation module 53 is used to calculate the weighted maximum complete matching result of the bipartite graph;

[0095] The scheduling module 54 is used to schedule each idle elevator in the elevator group to wait at a matched preset waiting floor according to the weighted maximum complete matching result.

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

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

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

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

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

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

[0102] The layer difference value is used as the weight of the relationship edge;

[0103] The opposite or reciprocal of the layer difference value is used as the weight of the relationship edge;

[0104] Subtract the floor difference from the total number of service floors of the elevator group to obtain the weight of the relationship edge.

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

[0106] When the weight of the relationship edge is positively correlated with the running distance, the minimum weight complete matching result of the bipartite graph is calculated;

[0107] When the weight of the relationship edge is negatively correlated with the running distance, the maximum weighted complete matching result of the bipartite graph is calculated.

[0108] Optionally, in some technical solutions provided in the embodiments of the present invention, the determination module 51 can also be used to determine the number of idle elevators before taking multiple idle elevators and multiple preset elevator waiting floors as two vertex subsets in the bipartite graph respectively; the device can also include: a selection module, which is used to select multiple service floors equal to the number of idle elevators within the total service floor range of the elevator group according to the number of idle elevators, so as to obtain multiple preset elevator 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 execute:

[0110] Initialize the top mark values ​​of the two vertex subsets;

[0111] Find the weighted maximum complete matching result of the bipartite graph, and modify the top mark value if the weighted maximum complete matching result is not found until the weighted maximum complete matching result 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] According to the weighted maximum complete matching result, the matching preset waiting floor of each idle elevator is determined;

[0114] A virtual elevator call request is issued to each idle elevator to dispatch each idle elevator to the corresponding matching preset waiting floor.

[0115] Figure 6 The block diagram of an electronic device used to implement the elevator group waiting dispatching method provided in the embodiment of the present application is shown in FIG. Figure 6 As shown, the electronic device includes: a memory 601 and a processor 602, and the memory 601 stores a computer program that can be run on the processor 602. When the processor 602 executes the computer program, the method in the above embodiment is implemented. The number of the memory 601 and the processor 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 performing data exchange transmission.

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

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

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

[0119] An embodiment of the present invention further provides a computer program product, including a computer program, wherein the computer program is executed by a processor to implement the elevator waiting scheduling method for an elevator group 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 that communicates with the electronic device, which will not be described in detail.

[0120] An embodiment of the present invention further provides an elevator system, comprising a plurality of elevators, and also comprising an electronic device provided in an embodiment of the present invention, the electronic device being used to execute the elevator waiting scheduling method of an elevator group provided in an embodiment of the present invention.

[0121] The above descriptions are only optional embodiments of the present invention, and are not intended to limit the patent scope of the present invention. All modifications, equivalent substitutions, improvements, etc. made using the contents of the present invention specification and drawings under the concept of the present invention, or directly / indirectly applied in other related technical fields, should be included in the patent protection scope of the present invention.

[0122] The above descriptions are only optional embodiments of the present invention, and are not intended to limit the patent scope of the present invention. All modifications, equivalent substitutions, improvements, etc. made using the contents of the present invention specification and drawings under the concept of the present invention, or directly / indirectly applied in other related technical fields, should be included in the patent protection scope of the present invention.

Claims

1. A method for dispatching elevators in an elevator group, characterized in that: include: Determining that there are multiple idle elevators in the elevator group; The plurality of idle elevators and the plurality of preset waiting floors are respectively used as two vertex subsets in a bipartite graph, and a relationship edge between the two vertex subsets is constructed; The number of the plurality of idle elevators is equal to the number of the plurality of preset waiting floors, 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; Calculate the weighted maximum complete matching result of the bipartite graph; According to the weighted maximum complete matching result, each of the idle elevators in the elevator group is scheduled to wait at a matched preset waiting floor.

2. The elevator group waiting dispatching method according to claim 1, characterized in that: The constructing a relationship edge between the two vertex subsets comprises: Determine the service floor range of each of the idle elevators; For each of the idle elevators, a relationship edge is established between the idle elevator and each of the preset waiting floors within the service floor range.

3. The elevator group waiting dispatching method according to claim 1, characterized in that: The constructing a relationship edge between the two vertex subsets comprises: For each of the relationship edges, the weight of the relationship edge is determined according to the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relationship edge.

4. The elevator group waiting dispatching method according to claim 3, characterized in that: The step of determining the weight of the relationship edge according to the floor difference between the current floor of the idle elevator and the preset waiting floor connected by the relationship edge comprises one of the following: Using the layer difference value as the weight of the relationship edge; Taking the opposite number or the reciprocal of the layer difference value as the weight of the relationship edge; The weight of the relationship edge is obtained by subtracting the floor difference value from the total service floors of the elevator group.

5. The elevator waiting dispatching method of an elevator group according to any one of claims 1 to 4, characterized in that: The step of calculating the weighted maximum complete matching result of the bipartite graph includes: In response to the positive correlation between the weight of the relationship edge and the running distance, a minimum weight complete matching result of the bipartite graph is calculated; The weight of the response and the relationship edge is negatively correlated with the running distance, and the maximum weight complete matching result of the bipartite graph is calculated.

6. The elevator group waiting dispatching method according to claim 1, characterized in that: Before taking the plurality of idle elevators and the plurality of preset waiting floors as two vertex subsets in a bipartite graph respectively, the method further comprises: determining the number of said idle elevators; According to the number of the idle elevators, a plurality of service floors equal to the number are selected within the total service floor range of the elevator group to obtain the plurality of preset waiting floors.

7. The elevator group waiting dispatching method according to claim 1, characterized in that: The step of calculating the weighted maximum complete matching result of the bipartite graph includes: Initializing the top mark values ​​of the two vertex subsets; Finding a weighted maximum complete matching result of the bipartite graph, and modifying the top mark value if the weighted maximum complete matching result is not found, until finding a weighted maximum complete matching result of the bipartite graph.

8. The elevator group waiting dispatching method according to claim 1, characterized in that: The step of dispatching each idle elevator in the elevator group to wait at a matched preset waiting floor according to the weighted maximum complete matching result includes: According to the weighted maximum complete matching result, determining the matching preset waiting floor for each of the idle elevators; A virtual elevator call request is issued to each of the idle elevators respectively, so as to dispatch each of the idle elevators to the corresponding matching preset waiting floor.

9. An elevator waiting dispatching device for an elevator group, characterized in that: include: A determination module, used for determining whether there are multiple idle elevators in the elevator group; A construction module, configured to use the plurality of idle elevators and the plurality of preset waiting floors as two vertex subsets in a bipartite graph, respectively, and to construct a relationship edge between the two vertex subsets; The number of the plurality of idle elevators is equal to the number of the plurality of preset waiting floors, 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; A calculation module, used for calculating the weighted maximum complete matching result of the bipartite graph; The scheduling module is used to schedule each of the idle elevators in the elevator group to wait at a matched preset waiting floor according to the weighted maximum complete matching result.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: The processor executes the program to implement the method according to any one of claims 1 to 8.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: The program is executed by a processor to implement the method according to any one of claims 1 to 8.

12. An elevator system, characterized in that: The device comprises a plurality of elevators and also comprises the electronic device according to claim 10, wherein the electronic device is used to execute the method according to any one of claims 1-8.

Images