Elevator deployment method

Abstract

This invention discloses an elevator dispatching method, comprising: step S1, acquiring the current operating information and elevator request signals of each elevator in an elevator group, wherein the current operating information includes at least the operating direction, current position, and floor to be stopped for each elevator, and the elevator request signal includes at least the passenger's destination floor information, and the elevator request signal takes a given high-traffic floor as the departure floor; step S2, determining a target elevator that meets the target elevator conditions based on the current operating information and the elevator request signal, wherein the target elevator conditions include at least: condition one, the corresponding floor to be stopped includes the given high-traffic floor; condition two, arriving at the given high-traffic floor earliest; step S3, selecting an elevator request signal as a selected elevator request signal, the selection range of which is all unassigned elevator request signals; and step S4, assigning the selected elevator request signal to the target elevator.

Description

Technical Field

[0001] This invention relates to the field of elevators, and more particularly to an elevator dispatching method. Background Technology

[0002] Currently, elevators typically employ group management systems to improve operational efficiency and reduce passenger waiting times by rationally allocating multiple elevators. Existing elevator group management systems usually respond to passenger request signals by selecting the optimal elevator from among multiple elevators based on elevator operating information; that is, assigning the optimal elevator to the request signal. For example, CN200980152488.7 calculates evaluation indicators for newly generated waiting area call signals, selects the most suitable elevator car based on these indicators, and assigns it to the newly generated waiting area call signal; CN200910166025.8 discloses an elevator group management system that manages the operation of multiple elevators, and when an elevator hall call occurs, selects the elevator car from among the elevators to respond to the hall call. The elevator car is assigned to the elevator lobby call. It has: an elevator lobby call registration device and a group management control device with a calculation unit and an allocation evaluation value calculation unit. The calculation unit calculates the predicted arrival time of each elevator car to the floor where the elevator lobby call originated. The allocation evaluation value calculation unit calculates the allocation evaluation value of the elevator car based on the location of the elevator car and the registered elevator car call information, and determines the elevator car to be assigned. The allocation evaluation value is determined by comparing the predicted arrival time and the walking time required for passengers to reach the elevator lobby. Thus, even when receiving elevator usage requests from places far from the elevator lobby, the average waiting time of all passengers can be shortened.

[0003] Clearly, existing elevator management systems respond to a given call signal by calculating evaluation indicators to select the appropriate elevator from among multiple elevators. This management approach focuses on the call signal (actually, the passenger's perspective), aiming to shorten passenger waiting time (or simultaneously considering elevator operating efficiency and energy consumption), using alternative elevators as options, and allocating elevators through appropriate selection. While this method has its inherent advantages, in certain situations, the allocation results may not be optimal. For example, in the lobby of an office building during the morning rush hour, passengers swipe their cards at the turnstiles to enter the waiting area. The passenger's card data is transmitted to the elevator management system, thus generating an elevator call request signal (containing destination floor information). Due to the concentrated passenger flow during the morning rush hour, excessive waiting passengers often accumulate in the lobby, causing congestion. In response to this situation, existing group management systems typically improve elevator efficiency by dividing elevator service floors into high and low zones and assigning passengers with the same destination floor to the same elevator to reduce elevator stops. This aims to quickly transport waiting passengers to their destination floors and alleviate congestion in the first-floor waiting area. However, because these technologies still operate from the passenger's (elevator call request signal) perspective, attempting to quickly remove passengers from the first-floor waiting area by appropriately selecting elevators, their effectiveness in alleviating congestion in the first-floor waiting area is not ideal.

[0004] Therefore, how to allocate elevators more rationally to more effectively alleviate congestion in elevator lobbies during peak passenger flow has become a problem that needs to be solved. Summary of the Invention

[0005] To solve the aforementioned technical problems, the present invention provides an elevator dispatching method, comprising:

[0006] Step S1: Obtain the current operating information and elevator request signal of each elevator in the elevator group. The current operating information includes at least the operating direction, current position and waiting floor of each elevator. The elevator request signal includes at least the passenger's destination floor information. The elevator request signal takes a given high passenger flow floor as the departure floor.

[0007] Step S2: Determine the target elevator that meets the target elevator conditions based on the current operating information and the elevator request signal. The target elevator conditions include at least: Condition 1, the corresponding waiting floor includes the given high passenger flow floor; Condition 2, the earliest arrival at the given high passenger flow floor.

[0008] Step S3: Select an elevator request signal as the selected elevator request signal. The selection range of elevator request signals is all unassigned elevator request signals.

[0009] Step S4: Assign the selected elevator request signal to the target elevator.

[0010] Preferably, the given high-traffic floor is a non-terminal floor, and the target elevator conditions further include: condition three, moving towards the given high-traffic floor along the high-traffic direction; condition four, when starting to leave the given high-traffic floor, taking the high-traffic direction as the running direction.

[0011] Preferably, the target elevator condition further includes: condition five, the distance between the elevator car and the given high-traffic floor is less than a distance threshold.

[0012] Preferably, step S3 further includes: step S3-1, determining the selection principle to be followed when selecting a selected elevator request signal from the elevator request signals; step S3-2, selecting an elevator request signal as the selected elevator request signal according to the selection principle.

[0013] Preferably, in step S3, the selection range is the elevator request signal with the desired elevator direction as the running direction when the target elevator starts and leaves from a given high-traffic floor.

[0014] Preferably, step S2 determines the target elevator according to the following sub-steps: Sub-step S2-11, estimating the arrival time of each elevator to the given high-traffic floor based on the current operating information of each elevator; Sub-step S2-12, determining the elevator that arrives at the given high-traffic floor first based on the arrival time; Sub-step S2-13, monitoring the distance between the elevator car that arrives at the given high-traffic floor first and the given high-traffic floor, and when the distance is less than a distance threshold, determining the elevator that arrives at the given high-traffic floor first as the target elevator.

[0015] Preferably, step S2 determines the target elevator according to the following sub-steps: Sub-step S2-21: Monitor the current operating information of each elevator, monitoring the current position of each elevator car and the distance and direction of travel between it and the given high-traffic floor; Sub-step S2-22: Select the elevator that is heading towards the given high-traffic floor from among the elevators based on the monitoring results of sub-step S2-21; Sub-step S2-23: Select the elevator with the smallest distance to the given high-traffic floor from among the elevators heading towards the given high-traffic floor, and when the distance is less than a distance threshold, determine the elevator as the target elevator.

[0016] Preferably, the distance threshold is the floor spacing between the given high-passenger-flow floor and the adjacent floor whose operating direction is opposite to that of the target elevator heading towards the given high-passenger-flow floor.

[0017] Preferably, the selection principle is to prioritize transporting passengers who depart from a given high-traffic floor and whose destination floor has the largest number of passengers.

[0018] Preferably, the selection principle is to maximize the passenger disembarkation speed.

[0019] Preferably, the selection principle is to prioritize transporting passengers whose destination floor is the floor where the passenger with the longest waiting time for the elevator is located.

[0020] Preferably, the selection principle is to minimize the total waiting time of all passengers in the elevator lobby in a single elevator trip.

[0021] Preferably, the selection principle is to minimize the total waiting time of all passengers in the waiting hall per unit time.

[0022] Preferably, the selection principle is to maximize the total travel distance of passengers leaving the high-traffic floor by elevator per unit time.

[0023] Preferably, the selection principle is to minimize the number of passengers on their destination floor while ensuring that the difference between the number of second passengers and the number of passengers allocated to the target elevator is less than a threshold.

[0024] Preferably, step S3-2 further includes: step S3-2-11, determining all destination floors according to the elevator request signal; step S3-2-12, counting the number of passengers on each destination floor according to the elevator request signal; step S3-2-13, comparing the number of passengers on each destination floor with the first number of passengers, and selecting the elevator request signal as the selected elevator request signal according to the passenger comparison result.

[0025] Preferably, step S3-2 further includes: step S3-2-21, enumerating all possible elevator request signals that have never been selected and selecting a selection scheme for the selected elevator request signal; step S3-2-22, calculating the number of passengers transported by the target elevator from the given high-traffic floor in each selection scheme; step S3-2-23, estimating the time interval between the start of the target elevator from the given high-traffic floor and the return time of the target elevator transporting passengers to the destination floor and returning to the given high-traffic floor; step S3-2-24, calculating the quotient of the number of passengers transported by the target elevator from the given high-traffic floor obtained in step S3-2-22 and the time interval obtained in step S3-2-23; step S3-2-25, taking the elevator request signal selected corresponding to the selection scheme with the largest quotient as the selected elevator request signal.

[0026] Preferably, step S3-2 further includes: step S3-2-31, determining the longest waiting time among the waiting times of each passenger; step S3-2-32, determining the destination floor corresponding to the longest waiting time;

[0027] Step S3-2-33: Count the number of passengers on the destination floor corresponding to the longest waiting time; Step S3-2-34: Compare the number of passengers on the destination floor corresponding to the longest waiting time with the number of first passengers, and select the elevator request signal as the selected elevator request signal based on the passenger comparison result.

[0028] Preferably, step S3-2 further includes: step S3-2-41, determining the waiting time of each passenger in the elevator lobby; step S3-2-42, sorting the elevator request signals according to the length of the waiting time; step S3-2-43, selecting the elevator request signal with the longest waiting time from the sorted elevator request signals as the selected elevator request signal.

[0029] Preferably, step S3-2 further includes: step S3-2-51, determining the waiting time of each passenger in the elevator lobby; step S3-2-52, enumerating all possible elevator request signals that have never been selected and selecting a selection scheme for the selected elevator request signal; step S3-2-53, calculating the sum of the waiting times of each selected elevator request signal in each selection scheme; step S3-2-54, for each selection scheme, estimating the time interval between the target elevator starting the passenger with the selected elevator request signal from a given high-traffic floor and the return time of the target elevator to the destination floor and back to the given high-traffic floor; step S3-2-54, calculating the quotient of the sum of waiting times obtained in step S3-2-53 and the time interval obtained in step S3-2-54; step S3-2-55, taking the elevator request signal selected by the selection scheme corresponding to the maximum quotient as the final selected elevator request signal.

[0030] Preferably, step S3-2 further includes: step S3-2-61, enumerating all possible elevator request signals that have never been selected before and selecting a selection scheme for the selected elevator request signal; step S3-2-62, determining each passenger involved in the selection scheme; step S3-2-63, calculating the distance between the destination floor and the given high-traffic floor for each passenger involved in the selection scheme, where the distance is defined as a single distance; step S3-2-64, calculating the total travel distance of each passenger involved in the selection scheme using the single distance; step S3-2-65, for each selection scheme, estimating the time interval between the target elevator starting the passenger with the selected elevator request signal from the given high-traffic floor and the time interval from the target elevator transporting the passenger to the destination floor and returning to the given high-traffic floor; step S3-2-66, calculating the quotient of the total travel distance obtained in step S3-2-64 and the time interval obtained in step S3-2-65; step S3-2-67, taking the elevator request signal selected by the selection scheme corresponding to the maximum quotient as the final selected elevator request signal.

[0031] Preferably, step S3-2 further includes: step S3-2-71, enumerating all possible elevator request signals that have never been selected and selecting a selection scheme for the selected elevator request signal; step S3-2-72, counting the number of passengers and the number of destination floors involved in each selection scheme respectively; step S3-2-73, calculating the difference between the first number of passengers and the number of passengers involved in each selection scheme for each selection scheme respectively; step S3-2-74, selecting the small threshold selection scheme from the selection schemes where the difference is less than a threshold; step S3-2-75, selecting the selection scheme with the smallest number of destination floors from the small threshold selection schemes; step S3-2-76, taking the elevator request signal corresponding to the selection scheme obtained in step S3-2-75 as the final selected elevator request signal.

[0032] Preferably, step S3 further includes: step S3-3, comparing the size of the first number of passengers and the second number of passengers to form the following results: Result 1, when the first number of passengers is less than the second number of passengers, selecting the first number of passengers from the elevator request signals with the destination floor corresponding to the second number of passengers as the desired destination floor and allocating them to the target elevator; Result 2, when the first number of passengers is equal to the second number of passengers, all elevator request signals with the destination floor corresponding to the second number of passengers as the desired destination floor are allocated to the target elevator; Result 3, when the first number of passengers is greater than the second number of passengers, all elevator request signals with the destination floor corresponding to the second number of passengers as the desired destination floor are allocated to the target elevator, and selecting from the remaining elevator request signals that allow the target elevator to reach its rated number of passengers and allocating them to the target elevator.

[0033] Preferably, when result one is satisfied, the elevator request signal of the first number of passengers with the longest waiting time is selected.

[0034] Preferably, when result three is satisfied, the selection from the remaining elevator request signals is carried out according to any of the following principles: Principle 1, the number of passengers on the destination floor participating in the mixed ride is closest to the remaining number of passengers; Principle 2, the distance between the destination floor participating in the mixed ride and the previous destination floor is the smallest; Principle 3, the number of destination floors participating in the mixed ride is as small as possible; Principle 4, the difference between the number of the first passenger minus the number of the second passenger and the sum of the number of passengers corresponding to the elevator request signals selected from the remaining elevator request signals is the smallest; Principle 5, an appropriate number of elevator request signals with the longest waiting time are selected from the remaining elevator request signals as mixed ride passengers.

[0035] Preferably, the number of passengers is the natural number of passengers corresponding to the elevator request signal, or the weighted number of passengers.

[0036] Preferably, the weighted number of passengers at a certain destination floor is the sum of the weighted number of individual passengers for all passengers at that destination floor, wherein the weighted number of individual passengers is the product of the number of passengers and their waiting time coefficient, and the waiting time coefficient is a coefficient determined by the waiting time of passengers.

[0037] Preferably, the weighted number of passengers on a certain destination floor is the product of the natural number of all passengers on that destination floor and the weight coefficient of that destination floor, and the weight coefficient of that destination floor is determined by the longest waiting time among all passengers on that destination floor.

[0038] Preferably, the elevator request signal further includes the passenger's registration time, and step S3-2 calculates the waiting time of each passenger with elevator request information based on the registration time.

[0039] Compared with existing technologies, this invention targets a given high-traffic floor and allocates elevator request signals by rationally selecting unresponsive elevator request signals as allocation targets for the target elevator. Essentially, it is an allocation method for elevator request signals rather than the traditional elevator group management method for elevator allocation. Therefore, it can allocate elevators more rationally and thus more effectively alleviate the congestion in the elevator hall during periods of high passenger flow. Attached Figure Description

[0040] Figure 1 This is a schematic diagram of an elevator dispatching method in Example 1. Detailed Implementation

[0041] The embodiments of the present invention are described below with reference to the accompanying drawings and specific examples. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. Specific details are set forth in the following description to provide a thorough understanding of the present invention; however, the present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be based on different viewpoints and applications. Those skilled in the art can make various similar extensions and substitutions without departing from the spirit of the present invention.

[0042] Example 1

[0043] like Figure 1 As shown, this embodiment provides an elevator dispatching method, which includes:

[0044] Step S1: Obtain the current operating information and elevator request signal of each elevator in the elevator group. The current operating information includes at least the operating direction, current position and waiting floor of each elevator. The elevator request signal includes at least the passenger's destination floor information. The elevator request signal takes a given high passenger flow floor as the departure floor.

[0045] Step S2: Determine the target elevator that meets the target elevator conditions based on the current operating information and the elevator request signal. The target elevator conditions include at least: Condition 1, the corresponding waiting floor includes the given high passenger flow floor; Condition 2, the earliest arrival at the given high passenger flow floor.

[0046] Step S3: Select an elevator request signal as the selected elevator request signal. The selection range of elevator request signals is all unassigned elevator request signals.

[0047] Step S4: Assign the selected elevator request signal to the target elevator.

[0048] Preferably, the given high-traffic floor is a non-terminal floor, and the target elevator conditions further include: condition three, moving towards the given high-traffic floor along the high-traffic direction; condition four, when starting to leave the given high-traffic floor, taking the high-traffic direction as the running direction.

[0049] Preferably, the target elevator condition further includes: condition five, the distance between the elevator car and the given high-passenger-flow floor is less than a distance threshold. The distance threshold is the floor spacing between the given high-passenger-flow floor and the adjacent floor in the opposite direction of the target elevator's travel towards the given high-passenger-flow floor.

[0050] Preferably, in step S3, the selection range is the elevator request signal with the desired elevator direction as the running direction when the target elevator starts and leaves from a given high-traffic floor.

[0051] Preferably, step S3 further includes:

[0052] Step S3-1: Determine the selection principle to be followed when selecting a selected elevator request signal from the elevator request signals;

[0053] Step S3-2: Select the elevator request signal as the selected elevator request signal according to the selection principle.

[0054] Preferably, step S2 determines the target elevator according to the following sub-steps:

[0055] Sub-step S2-11: Estimate the arrival time of each elevator to the given high-traffic floor based on the current operating information of each elevator;

[0056] Sub-step S2-12: Determine the elevator that arrives first at the given high-traffic floor based on the arrival time;

[0057] Sub-step S2-13: Monitor the distance between the elevator car that first arrives at the given high-passenger-flow floor and the given high-passenger-flow floor. When the distance is less than the distance threshold, determine the elevator that first arrives at the given high-passenger-flow floor as the target elevator.

[0058] Preferably, step S2 can also determine the target elevator according to another seed step different from the one described above, for example:

[0059] Sub-step S2-21: Monitor the current operating information of each elevator. Monitor the current position of each elevator car and the distance and direction of operation between it and the given high passenger flow floor.

[0060] Sub-step S2-22: Select the elevator that is heading to the given high passenger flow floor from among the elevators based on the monitoring results of sub-step S2-21;

[0061] Sub-step S2-23: Select the elevator with the smallest distance from the given high-traffic floor from the elevators that are heading to the given high-traffic floor, and when the distance is less than the distance threshold, determine the elevator as the target elevator.

[0062] In this embodiment, the selection principle in step S3 is to prioritize transporting passengers who depart from a given high-traffic floor and whose destination floor has the largest number of passengers.

[0063] Under this selection principle, preferably, step S3-2 further includes:

[0064] Step S3-2-11: Determine all destination floors based on the elevator request signal;

[0065] Step S3-2-12: Count the number of passengers on each destination floor according to the elevator request signal;

[0066] Step S3-2-13: Compare the number of passengers on each destination floor with the first number of passengers, and select the elevator request signal as the selected elevator request signal based on the passenger comparison result. The first number of passengers is the number of passengers that the target elevator can carry.

[0067] Preferably, step S3 further includes:

[0068] Step S3-3: Compare the first number of passengers and the second number of passengers. The second number of passengers is the largest among the passenger counts of each destination level. The comparison yields the following results.

[0069] Result 1: When the number of the first passenger is less than the number of the second passenger, the number of the first passenger is selected from the elevator request signals that take the destination floor corresponding to the number of the second passenger as the desired destination floor and assigned to the target elevator.

[0070] Result 2: When the number of the first passengers is equal to the number of the second passengers, all elevator request signals with the destination floor corresponding to the number of the second passengers as the desired destination floor will be allocated to the target elevator;

[0071] Result 3: When the number of the first passengers is greater than the number of the second passengers, all elevator request signals with the destination floor corresponding to the number of the second passengers as the desired destination floor will be allocated to the target elevator, and elevator request signals that enable the target elevator to reach its rated number of passengers will be selected from the remaining elevator request signals and allocated to the target elevator.

[0072] When result one is satisfied, select the elevator request signal of the first number of passengers with the longest waiting time.

[0073] When result three is met, that is, when the number of passengers corresponding to all destination floors is less than the number of passengers that the target elevator can carry, it is necessary to consider allocating the elevator request signals of different destination floors to the target elevator, so that passengers from different destination floors can ride the same elevator together.

[0074] At this point, the selection from the remaining elevator request signals shall be made according to any of the following principles:

[0075] Principle 1: The number of passengers on the destination floor who subsequently participate in mixed rides is closest to the remaining number of passengers available.

[0076] Principle 2: The distance between the destination layer participating in subsequent multiplication and the previous destination layer should be minimized;

[0077] Principle 3: Minimize the number of destination floors for mixed rides;

[0078] Principle 4: The difference between the first passenger count minus the second passenger count and the sum of the passenger counts corresponding to the elevator request signals selected from the remaining elevator request signals is minimized; or further, if the difference is greater than a threshold, then a destination floor is selected such that the sum of the passenger counts of the destination floor and the second passenger count is greater than the first passenger count, but only a portion of the passengers of the subsequently selected destination floor are assigned to the target elevator.

[0079] Principle 5: Select an appropriate number of elevator request signals with the longest waiting time from the remaining elevator request signals as mixed passengers.

[0080] When there are multiple mixed ride selection principles, the weighted method is used to calculate the total evaluation index. The smaller the distance between the destination floor of the subsequent mixed ride and the previous destination floor, the greater the weight; the smaller the difference between the number of passengers on the destination floor of the subsequent mixed ride and the nearest remaining number of passengers, the greater the weight; the smaller the number of destination floors of the mixed ride, the greater the weight, and vice versa.

[0081] Compared with the prior art, this embodiment can more effectively alleviate the congestion in the waiting hall of high-traffic floors by reasonably determining the target elevator and prioritizing the elevator request signal of the destination floor with the largest number of passengers and allocating it to the target elevator. This allows passengers waiting in high-traffic floors to be transported away quickly, and the target elevator can complete its task and return to the high-traffic floor as soon as possible.

[0082] Example 2

[0083] This embodiment is similar to Embodiment 1, except that the method used to count the number of passengers corresponding to each destination floor is different. In Embodiment 1, the number of passengers corresponding to each destination floor is directly counted as the total number of passengers whose destination floor is a certain floor (i.e., the number of passengers is the natural number of passengers corresponding to the elevator request signal). However, this method of counting and selecting the target elevator may lead to excessively long waiting times for some passengers in certain special cases. This necessitates the introduction of a weighted number of passengers at the destination floor.

[0084] The weighted number of passengers on a certain destination floor is the sum of the individual weighted numbers of all passengers on that destination floor. The individual weighted number is the product of the passenger count and its waiting time coefficient, which is determined by the passenger's waiting time. The weighted number of passengers on a certain destination floor is the product of the total number of passengers on that destination floor and the weight coefficient of that destination floor, which is determined by the longest waiting time among all passengers on that destination floor.

[0085] When determining the weight coefficient of the target layer, the following principle should be followed: the longer the waiting time, the larger the coefficient. For example: less than one minute, the coefficient is 1; 1 minute to 1 minute and 30 seconds, the coefficient is 1.2; 1 minute and 30 seconds to 2 minutes, the coefficient is 1.5; 2 minutes to 2 minutes and 30 seconds, the coefficient is 2; 2 minutes and 30 seconds to 3 minutes, the coefficient is 2.5; more than 3 minutes, the coefficient is 3, and so on.

[0086] Compared with existing technologies, this embodiment can further accommodate passengers with excessively long waiting times. Embodiment 3

[0087] This embodiment is similar to Embodiment 1, except that the selection principle is different when selecting the elevator from all existing but not yet responded elevator request signals for the elevator that is about to arrive.

[0088] The selection principle is to maximize the passenger departure speed (i.e., to maximize the number of passengers transported from the given high passenger flow floor per unit time by selecting the elevator request signal).

[0089] Step S3-2 further includes:

[0090] Step S3-2-21: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal;

[0091] Step S3-2-22: Calculate the number of passengers transported by the target elevator from the given high-traffic floor in each option.

[0092] Step S3-2-23: Estimate the time interval between the start of the target elevator from the given high passenger flow floor to the time when the target elevator transports the passengers to the destination floor and returns to the given high passenger flow floor (the direction of operation after the start is consistent with the expected direction of the elevator request signal);

[0093] Step S3-2-24: Calculate the quotient of the number of passengers transported by the target elevator from the given high-traffic floor obtained in step S3-2-22 and the time interval obtained in step S3-2-23;

[0094] Step S3-2-25: Select the elevator request signal corresponding to the maximum quotient selection scheme as the selected elevator request signal.

[0095] Example 1 selects the elevator request signal corresponding to the destination floor with the most passengers. However, this selection may not be the optimal way to alleviate congestion in the first-floor lobby in some situations. For example, in a 50-story building with an elevator rated to carry 21 people, the destination floor with the most passengers is the 48th floor (21 people). There are 10 passengers heading to the 4th floor and 11 passengers heading to the 5th floor. According to Example 1, the elevator request signal corresponding to the 48th floor would naturally be selected and assigned to the elevator. However, in reality, considering that the time it takes for the elevator to travel to the 48th floor and then return to the first-floor lobby might be longer than the time it would take for the elevator to simultaneously transport 10 people heading to the 4th floor and 11 people heading to the 5th floor, stopping at the 4th and 5th floors respectively before returning to the first-floor lobby, the first-floor lobby still sees a reduction of 21 passengers, but the time taken is different. That is, the number of passengers reduced per unit time is different. In this example, the latter selection is more effective in alleviating congestion in the first-floor lobby. Therefore, to more effectively alleviate congestion in the first-floor lobby, an index is established to describe the speed at which elevators transport passengers from the first-floor lobby—the passenger departure speed. This speed is calculated by dividing the number of passengers transported by an elevator during a single departure from the first-floor lobby by the time it takes for the elevator to return to the first-floor lobby after completing the transport of passengers within its car. Thus, when an elevator is about to arrive at the first-floor lobby, for all existing but unresponded elevator request signals, based on the number of passengers corresponding to each destination floor and the rated passenger capacity of the car, all possible combinations are enumerated. Then, for each combination, the corresponding passenger departure speed is calculated, and the combination with the highest passenger departure speed is selected. The elevator request signal from this combination is then assigned to the target elevator.

[0096] Compared with the prior art, this embodiment maximizes the passenger departure speed by selecting unassigned elevator request signals, thus maximizing the relief of congestion in the waiting hall of high-traffic floors.

[0097] Example 4

[0098] This embodiment is similar to Embodiment 1, except that the selection principle is to prioritize transporting passengers whose destination floor is the floor where the passenger with the longest waiting time for the elevator is located.

[0099] Step S3-2 further includes:

[0100] Step S3-2-31: Determine the longest waiting time among all passengers.

[0101] Step S3-2-32: Determine the destination floor corresponding to the longest waiting time for the elevator;

[0102] Step S3-2-33: Count the number of passengers on the destination floor corresponding to the longest waiting time;

[0103] Step S3-2-34: Compare the number of passengers on the destination floor corresponding to the longest waiting time with the number of first passengers, and select the elevator request signal as the selected elevator request signal based on the passenger comparison result.

[0104] Furthermore, the specific processing method for selecting the elevator request signal based on the comparison result with the first number of passengers is similar to that in Example 1, only the first and second passenger numbers are slightly replaced according to the different scenarios. Example 5

[0105] This embodiment is similar to Embodiment 1, except that the selection principle is to minimize the total waiting time of all passengers in the elevator lobby in one trip.

[0106] Step S3-2 further includes:

[0107] Step S3-2-41: Determine the waiting time for each passenger in the elevator lobby;

[0108] Step S3-2-42: Sort the elevator request signals according to the length of the waiting time;

[0109] Step S3-2-43: Select the elevator request signal with the longest waiting time from the sorted elevator request signals as the selected elevator request signal.

[0110] Example 6

[0111] This embodiment is similar to Embodiment 1, except that the selection principle is to minimize the total waiting time of all passengers in the waiting hall per unit time.

[0112] Step S3-2 further includes:

[0113] Step S3-2-51: Determine the waiting time for each passenger in the elevator lobby;

[0114] Step S3-2-52: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal;

[0115] Step S3-2-53: Calculate the sum of the waiting times for each selected elevator request signal in each selection scheme;

[0116] Step S3-2-54: For each selection scheme, estimate the time interval between the start of the target elevator from the given high passenger flow floor to the destination floor and the return time of the passenger selected by the elevator request signal.

[0117] Step S3-2-54: Calculate the quotient of the sum of the waiting times obtained in step S3-2-53 and the time interval obtained in step S3-2-54;

[0118] Step S3-2-55: Select the elevator request signal corresponding to the maximum quotient selection scheme as the final selected elevator request signal.

[0119] Example 7

[0120] This embodiment is similar to Embodiment 1, except that the selection principle is to maximize the total movement distance of passengers leaving the high-traffic floor by elevator per unit time.

[0121] Step S3-2 further includes:

[0122] Step S3-2-61: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal;

[0123] Step S3-2-62: Determine all passengers involved in the selected options;

[0124] Step S3-2-63: Calculate the distance between the destination floor of each passenger involved in the selected scheme and the given high passenger flow floor, where the distance is defined as a single distance;

[0125] Step S3-2-64: Calculate the total travel distance of each passenger involved in the selected scheme using the single distance calculation;

[0126] Step S3-2-65: For each selection scheme, estimate the time interval between the start of the target elevator from the given high passenger flow floor to the destination floor and the return time of the passenger selected by the elevator request signal.

[0127] Step S3-2-66: Calculate the quotient of the total travel distance obtained in step S3-2-64 and the time interval obtained in step S3-2-65;

[0128] Step S3-2-67: Take the elevator request signal corresponding to the maximum quotient selection scheme as the final selected elevator request signal.

[0129] Example 8

[0130] This embodiment is similar to Embodiment 1, except that the selection principle is to minimize the number of passengers on the destination floor when the difference between the number of second passengers and the number of passengers allocated to the target elevator is less than a threshold.

[0131] Step S3-2 further includes:

[0132] Step S3-2-71: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal;

[0133] Step S3-2-72: Count the number of passengers and the number of destination layers involved in each option.

[0134] Step S3-2-73: For each selection scheme, calculate the difference between the first number of passengers and the number of passengers involved in each selection scheme.

[0135] Step S3-2-74: Select the small threshold selection scheme from the selection schemes, where the difference is less than the threshold.

[0136] Step S3-2-75: Select the scheme with the smallest number of target layers from the small threshold selection schemes;

[0137] Step S3-2-76: Take the elevator request signal corresponding to the selection scheme obtained in step S3-2-75 as the final selected elevator request signal.

[0138] Example 9

[0139] Based on the aforementioned embodiments 1, 2, 4, 5, and 6, this embodiment further includes the passenger's registration time in the elevator request signal. Step S3-2 calculates the waiting time for each passenger with an elevator request based on the registration time.

[0140] The present invention has been described in detail above through specific embodiments. These embodiments are merely preferred embodiments of the present invention, and the present invention is not limited to the above-described implementation methods. Equivalent substitutions and improvements made by those skilled in the art without departing from the principles of the present invention should be considered within the scope of the technology protected by the present invention.

Claims

1. An elevator dispatching method, characterized in that, The elevator dispatching method includes: Step S1: Obtain the current operating information and elevator request signal of each elevator in the elevator group. The current operating information includes at least the operating direction, current position and waiting floor of each elevator. The elevator request signal includes at least the passenger's destination floor information. The elevator request signal takes a given high passenger flow floor as the departure floor. Step S2: Determine the target elevator that meets the target elevator conditions based on the current operating information and the elevator request signal. The target elevator conditions include at least: Condition 1: The corresponding floor to be stopped includes the given high-traffic floor; Condition 2: Arrive at the given high-traffic floor earliest; Step S3: Select an elevator request signal as the selected elevator request signal. The selection range of elevator request signals is all unassigned elevator request signals. Step S4: Assign the selected elevator request signal to the target elevator; Step S3 further includes: Step S3-1: Determine the selection principle to be followed when selecting a selected elevator request signal from the elevator request signals; Step S3-2: Select the elevator request signal as the selected elevator request signal according to the selection principle; The selection principle is to prioritize transporting passengers who depart from a given high-traffic floor and whose destination floor has the largest number of passengers. Alternatively, the selection principle is to maximize the passenger disembarkation speed; Alternatively, the selection principle is to prioritize transporting passengers whose destination floor is the floor where the passenger with the longest waiting time for the elevator is located; Alternatively, the selection principle is to minimize the total waiting time of all passengers in the waiting hall in a single elevator trip; Alternatively, the selection principle is to minimize the total waiting time of all passengers in the waiting hall per unit time. Alternatively, the selection principle is to maximize the total movement distance of passengers who leave the high-traffic floor by elevator per unit time. Alternatively, the selection principle is to minimize the number of passengers on the destination floor while ensuring that the difference between the number of second passengers and the number of passengers allocated to the target elevator is less than a threshold, and the number of second passengers is the largest among the number of passengers on each destination floor.

2. The elevator dispatching method as described in claim 1, characterized in that, The given high-passenger-flow floor is a non-terminal floor, and the target elevator conditions also include: Condition 3: Drive towards the given high-traffic level along the direction of the high-traffic flow; Condition 4: When departing from the given high-passenger-flow level, the direction of operation shall be the direction of high-passenger-flow.

3. The elevator dispatching method as described in claim 1 or 2, characterized in that, The target elevator conditions also include: Condition 5: The distance between the elevator car and the given high-traffic floor is less than the distance threshold.

4. The elevator dispatching method as described in claim 2, characterized in that, In step S3, the selection range is the elevator request signal with the desired elevator direction as the running direction when the target elevator starts and leaves from a given high-traffic floor.

5. The elevator dispatching method as described in claim 3, characterized in that, Step S2 determines the target elevator according to the following sub-steps: Sub-step S2-11: Estimate the arrival time of each elevator to the given high-traffic floor based on the current operating information of each elevator; Sub-step S2-12: Determine the elevator that arrives first at the given high-traffic floor based on the arrival time; Sub-step S2-13: Monitor the distance between the elevator car that first arrives at the given high-passenger-flow floor and the given high-passenger-flow floor. When the distance is less than the distance threshold, determine the elevator that first arrives at the given high-passenger-flow floor as the target elevator.

6. The elevator dispatching method as described in claim 3, characterized in that, Step S2 determines the target elevator according to the following sub-steps: Sub-step S2-21: Monitor the current operating information of each elevator. Monitor the current position of each elevator car and the distance and direction of operation between it and the given high passenger flow floor. Sub-step S2-22: Select the elevator that is heading to the given high passenger flow floor from among the elevators based on the monitoring results of sub-step S2-21; Sub-step S2-23: Select the elevator with the smallest distance from the given high-traffic floor from the elevators that are heading to the given high-traffic floor, and when the distance is less than the distance threshold, determine the elevator as the target elevator.

7. The elevator dispatching method as described in claim 1, 5, or 6, characterized in that: The distance threshold is the distance between adjacent floors of the given high-passenger-flow floor and the target elevator traveling in the opposite direction to the given high-passenger-flow floor.

8. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle prioritizes transporting passengers who depart from a given high-traffic floor and arrive at the destination floor with the largest number of passengers, step S3-2 further includes: Step S3-2-11: Determine all destination floors based on the elevator request signal; Step S3-2-12: Count the number of passengers on each destination floor according to the elevator request signal; Step S3-2-13: Compare the number of passengers on each destination floor with the first number of passengers, and select the elevator request signal as the selected elevator request signal based on the passenger comparison result. The first number of passengers is the number of passengers that the target elevator can carry.

9. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle is to maximize the passenger departure speed, step S3-2 further includes: Step S3-2-21: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal; Step S3-2-22: Calculate the number of passengers transported by the target elevator from the given high-traffic floor in each option. Step S3-2-23: Estimate the time interval between the start of the target elevator from the given high passenger flow floor to the return time of the target elevator transporting passengers to the destination floor and returning to the given high passenger flow floor; Step S3-2-24: Calculate the quotient of the number of passengers transported by the target elevator from the given high-traffic floor obtained in step S3-2-22 and the time interval obtained in step S3-2-23; Step S3-2-25: Select the elevator request signal corresponding to the maximum quotient selection scheme as the selected elevator request signal.

10. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle prioritizes transporting passengers whose destination floor is the floor with the longest waiting time for the elevator, step S3-2 further includes: Step S3-2-31: Determine the longest waiting time among all passengers. Step S3-2-32: Determine the destination floor corresponding to the longest waiting time for the elevator; Step S3-2-33: Count the number of passengers on the destination floor corresponding to the longest waiting time; Step S3-2-34: Compare the number of passengers on the destination floor corresponding to the longest waiting time with the first number of passengers, and select the elevator request signal as the selected elevator request signal based on the passenger comparison result. The first number of passengers is the number of passengers that the target elevator can carry.

11. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle is to minimize the total waiting time of all passengers in the elevator lobby in a single elevator trip, step S3-2 further includes: Step S3-2-41: Determine the waiting time for each passenger in the elevator lobby; Step S3-2-42: Sort the elevator request signals according to the length of the waiting time; Step S3-2-43: Select the elevator request signal with the longest waiting time from the sorted elevator request signals as the selected elevator request signal.

12. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle is to minimize the total waiting time of all passengers in the elevator lobby per unit time, step S3-2 further includes: Step S3-2-51: Determine the waiting time for each passenger in the elevator lobby; Step S3-2-52: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal; Step S3-2-53: Calculate the sum of the waiting times for each selected elevator request signal in each selection scheme; Step S3-2-54: For each selection scheme, estimate the time interval between the start of the target elevator from the given high passenger flow floor to the return time of the passenger selected by the elevator request signal to the destination floor and back to the given high passenger flow floor. Step S3-2-54: Calculate the quotient of the sum of the waiting times obtained in step S3-2-53 and the time interval obtained in step S3-2-54; Step S3-2-55: Select the elevator request signal corresponding to the maximum quotient selection scheme as the final selected elevator request signal.

13. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle is to maximize the total movement distance of passengers leaving the high-traffic floor by elevator per unit time, step S3-2 further includes: Step S3-2-61: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal; Step S3-2-62: Determine all passengers involved in the selected options; Step S3-2-63: Calculate the distance between the destination floor of each passenger involved in the selected scheme and the given high passenger flow floor, where the distance is defined as a single distance; Step S3-2-64: Calculate the total travel distance of each passenger involved in the selected scheme using the single distance calculation; Step S3-2-65: For each selection scheme, estimate the time interval between the start of the target elevator from the given high passenger flow floor to the return time of the passenger selected by the elevator request signal to the destination floor and back to the given high passenger flow floor. Step S3-2-66: Calculate the quotient of the total travel distance obtained in step S3-2-64 and the time interval obtained in step S3-2-65; Step S3-2-67: Take the elevator request signal corresponding to the selection scheme with the maximum quotient as the final selected elevator request signal.

14. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle is to minimize the number of passengers on the destination floor by ensuring that the difference between the number of second passengers and the number of passengers allocated to the target elevator is less than a threshold, step S3-2 further includes: Step S3-2-71: Enumerate all possible elevator request signals that have never been selected and select the selection scheme for the selected elevator request signal; Step S3-2-72: Count the number of passengers and the number of destination layers involved in each option. Step S3-2-73: For each selection scheme, calculate the difference between the first number of passengers and the number of passengers involved in each selection scheme; the first number of passengers is the number of passengers that the target elevator can carry. Step S3-2-74: Select the small threshold selection scheme from the selection schemes, where the difference is less than the threshold. Step S3-2-75: Select the scheme with the smallest number of target layers from the small threshold selection schemes; Step S3-2-76: Take the elevator request signal corresponding to the selection scheme obtained in step S3-2-75 as the final selected elevator request signal.

15. The elevator dispatching method as described in claim 1, characterized in that, When the selection principle prioritizes transporting passengers who depart from a given high-traffic floor and arrive at the destination floor with the largest number of passengers, step S3 further includes: Step S3-3: Compare the number of the first passenger and the number of the second passenger to obtain the following results. Result 1: When the first number of passengers is less than the second number of passengers, the first number of passengers is selected from the elevator request signals with the destination floor corresponding to the second number of passengers as the desired destination floor and allocated to the target elevator; the first number of passengers is the number of passengers that the target elevator can carry; Result 2: When the number of the first passengers is equal to the number of the second passengers, all elevator request signals with the destination floor corresponding to the number of the second passengers as the desired destination floor will be allocated to the target elevator; Result 3: When the number of the first passengers is greater than the number of the second passengers, all elevator request signals with the destination floor corresponding to the number of the second passengers as the desired destination floor will be allocated to the target elevator, and elevator request signals that enable the target elevator to reach its rated number of passengers will be selected from the remaining elevator request signals and allocated to the target elevator.

16. The elevator dispatching method as described in claim 15, characterized in that, When result one is satisfied, select the elevator request signal of the first number of passengers with the longest waiting time.

17. The elevator dispatching method as described in claim 15, characterized in that, When result three is satisfied, the selection from the remaining elevator request signals shall be implemented according to any of the following principles: Principle 1: The number of passengers on the destination floor who subsequently participate in mixed rides is closest to the remaining number of passengers available. Principle 2: The distance between the destination layer participating in subsequent multiplication and the previous destination layer should be minimized; Principle 3: Minimize the number of destination floors for mixed rides; Principle 4: The difference between the first number of passengers minus the second number of passengers and the sum of the number of passengers corresponding to the elevator request signals selected from the remaining elevator request signals should be minimized. Principle 5: Select an appropriate number of elevator request signals with the longest waiting time from the remaining elevator request signals as mixed passengers.

18. The elevator dispatching method as described in claim 1, characterized in that, The number of passengers is the natural number of passengers corresponding to the elevator request signal, or the weighted number of passengers.

19. The elevator dispatching method as described in claim 18, characterized in that, The weighted number of passengers at a certain destination level is the sum of the weighted numbers of individual passengers for all passengers at that destination level. The weighted number of individual passengers is the product of the number of passengers and their waiting time coefficient, which is a coefficient determined by the waiting time of passengers.

20. The elevator dispatching method as described in claim 18, characterized in that, The weighted number of passengers at a certain destination level is the product of the total number of passengers at that destination level and the weight coefficient of that destination level. The weight coefficient of that destination level is determined by the longest waiting time among all passengers at that destination level.

21. The elevator dispatching method as described in claims 1, 10, 11, 12, 16, 19, or 20, characterized in that, The elevator request signal also includes the passenger's registration time. Step S3-2 calculates the waiting time of each passenger with an elevator request based on the registration time.

Images