Elevator destination floor assignment method, apparatus, and computer readable storage medium

Abstract

The application discloses an elevator destination floor distribution method, comprising the following steps: step S101, setting a limit value; step S110, generating a new elevator call; step S111, counting the elevator calls; step S112, judging whether there is a car below the limit value; step S114, selecting a car with the elevator call registration number below the limit value as a primary selected car; step S115, judging whether a priority car selection rule is met; step S117, finding a car meeting the priority car selection rule and selecting the car meeting the priority car selection rule as a final selected car; if no car meeting the priority car selection rule is found, the primary selected car is selected as the final selected car. The candidate car selection rule provided by the application can distribute the destination floor registrations of similar floors to the same car as much as possible, and can further shorten the travel time of the elevator and improve the operation efficiency of the elevator group.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of elevators, and in particular to an elevator destination floor allocation method, device and computer readable storage medium. BACKGROUND

[0002] In the past, when the destination control is used in peak hours, the destination call registration limit value for each floor is set according to the predicted passenger flow, then all the cars with the call registration number below the limit value are selected as candidates and the evaluation value is calculated, and finally the car with the optimal evaluation value is selected from the candidate cars as the allocation car. Although this method can select the optimal car for a single call, considering the stop floor of the elevator group, it may result in the stop floors of each car being far apart and dispersed, which will result in a significant increase in the travel time of each elevator, a decrease in the transportation capacity, and a decrease in the efficiency of the elevator operation. For example, CN 101674995 B discloses a group management control device. SUMMARY

[0003] To solve the defects of the above background technology, the present application provides an elevator destination floor allocation method, comprising the following steps:

[0004] Step S101, setting a limit value;

[0005] Step S110, generating a new call;

[0006] Step S111, calculating the call count;

[0007] Step S112, determining whether there is a car with a call registration number below the limit value;

[0008] Step S114, selecting a car with a call registration number below the limit value as the initial selected car;

[0009] Step S115, determining whether the priority car selection rule is met;

[0010] Step S117, finding a car that meets the priority car selection rule and selecting the car that meets the priority car selection rule as the final candidate car; if no car that meets the priority car selection rule is found, the initial selected car is selected as the final candidate car.

[0011] Preferably, after the step S112, step S113 is further performed, in which the limit value is relaxed; when the call count of all cars exceeds the limit value, i.e., there is no car with a call registration number below the limit value, the value of the limit value is increased.

[0012] Preferably, after the step S115, step S116 is further performed, in which if there is no car that meets the priority car selection rule, the priority car selection rule is relaxed.

[0013] Preferably, in step S101, a limit value for limiting the number of destination floor calls is set for each floor according to the passenger flow and the service floor condition.

[0014] Preferably, in step S111, in the case that a new destination floor call is assigned to each car, the number of stops of each car is calculated as the total number of calls of each car, and the total number of calls refers to the total number of stops of the car after the new destination floor call is generated.

[0015] Preferably, in step S115, the priority selection rule is composed of one or more rules, and the priority selection rule is used to determine whether the new destination floor call is adjacent to the registered destination floor call of each car.

[0016] Preferably, in step S115, the following steps are further included:

[0017] Step S201, searching for a new destination floor call in each car to obtain a landing with registered instructions on the floor above and below the new destination floor call;

[0018] Step S202, determining whether the landing exists, and if it exists, entering step S117;

[0019] Step S203, if there is no landing with registered instructions on the floor above and below the new destination floor call, obtaining a landing with registered instructions on the floor above or below the new destination floor call.

[0020] Preferably, after step S203, the following steps are further included:

[0021] Step S202, determining whether the landing exists, and if it exists, entering step S117;

[0022] Step S204, if there is no landing with registered instructions on the floor above and below the new destination floor call, obtaining a landing with registered instructions on the floor above or below the new destination floor call.

[0023] The application further discloses an elevator destination floor assignment device for implementing the elevator destination floor assignment method, comprising:

[0024] A limit value setting unit is configured to limit the number of destination floor calls that can be assigned to the same car.

[0025] A call counting unit is configured to count the number of calls.

[0026] A registered call recording unit is configured to record all the destination floors registered before the car departs from the main landing.

[0027] The car preliminary selection unit first selects a car that can be assigned to a new destination floor call as a preliminary selected car based on information from the limit value setting unit and the call count unit;

[0028] The priority car selection unit further selects the preliminary selected car selected by the car preliminary selection unit using a priority car selection rule based on destination floor information recorded by the registered call record unit.

[0029] The application also discloses a computer readable storage medium, which stores a computer program, and the program enables a processor to execute the elevator destination floor assignment method when executed by the processor.

[0030] Compared with the prior art, the application improves the selection rule of the candidate car. When selecting the candidate car after registering the destination floor, in addition to the requirement that the number of registered calls is below a preset limit value, a priority car selection rule is additionally added, i.e. the elevator with a registered destination floor on an adjacent floor is selected as the candidate car, and then simulation and evaluation value calculation are performed on the candidate car, and the car with the optimal evaluation value is selected as the final assigned car. BRIEF DESCRIPTION OF DRAWINGS

[0031] In order to more clearly illustrate the technical solutions of the embodiments of the application, the drawings needed in the embodiment description will be briefly introduced as follows.

[0032] Figure 1 Fig. 1 is a structural diagram of an elevator destination floor assignment device of a preferred embodiment of the application;

[0033] Figure 2 Fig. 2 is a flowchart of an elevator destination floor assignment method of a preferred embodiment of the application;

[0034] Figure 3 Fig. 3 is a flowchart of the action of a priority car selection unit of the elevator destination floor assignment device of a preferred embodiment of the application.

[0035] REFERENCE SIGNS DETAILED DESCRIPTION

[0036] The technical solutions of the application will be described in detail below with reference to the specific embodiments and the accompanying drawings. Those skilled in the art can easily understand other advantages and effects of the application from the content disclosed in the description. Obviously, the described embodiments are only some of the embodiments of the application, and are intended to facilitate those skilled in the art to fully understand the application, but the application can also be implemented or applied by other different specific embodiments. Based on the embodiments of the application, those skilled in the art can make various similar generalizations and replacements without departing from the spirit of the application.

[0037] Figure 1is a block diagram showing a preferred elevator destination floor assignment apparatus of the present application. It includes a limit value setting unit 1, a call count unit 2, a registered call record unit 3, a car preliminary selection unit 4, and a priority car selection unit 5.

[0038] The limit value setting unit 1 sets a call assignment limit value for each floor for each car based on the traffic volume, for limiting the number of destination floor calls that can be assigned to the same car. Since this embodiment is particularly for a destination floor assignment system during an up-peak period, the limit value setting takes into account the call count limit value when the main lobby is the departure floor, i.e., sets the limit on the number of destination floors registered for the car when the main lobby is the departure floor. The limit value can be appropriately increased when the passenger flow is heavy or the number of service floors is large.

[0039] The call count unit 2 counts the number of calls based on the assignment information for each car, i.e., assumes that a new destination floor call is assigned to each car, and calculates the number of stops for each car as the call count for each car.

[0040] The registered call record unit 3 records all the destination floors registered for each car before the car departs from the main lobby based on the historical assignment information for each car.

[0041] The car preliminary selection unit 4 first selects a car that can assign a new destination floor call as a preliminary selected car based on the information from the limit value setting unit 1 and the call count unit 2. That is, the car preliminary selection unit 4 first compares the limit value set for the floor where the new destination floor call is generated with the call count for each car, and selects a car whose call count is below the limit value as a preliminary selected car.

[0042] The priority car selection unit 5 further selects the preliminary selected car selected by the car preliminary selection unit 4 using a priority car selection rule based on the destination floor information recorded by the registered call record unit 3. That is, the priority car selection unit 5 compares the new destination floor with the registered call record list for each car, and finds a car whose adjacent floor has a registered call as a priority candidate car, and further selects the preliminary selected car selected by the car preliminary selection unit 4.

[0043] In addition, the limit value setting unit 1, the call count unit 2, the registered call record unit 3, the car preliminary selection unit 4, and the priority car selection unit 5 are implemented by a computer of a group management control device. That is, a program for implementing the functions of the limit value setting unit 1, the call count unit 2, the registered call record unit 3, the car preliminary selection unit 4, and the priority car selection unit 5 is stored in a storage section of the computer. An arithmetic processing section performs arithmetic processing of the functions based on the program stored in the storage section.

[0044] Figure 2 is a flowchart of the elevator destination floor assignment method of the present application. As shown in the figure, first, step S101 is performed, in which a limit value for limiting the number of destination calls is set for each floor in accordance with the passenger flow congestion and the service floor situation. In this embodiment, the up-peak passenger flow is mainly considered, and therefore the destination call limit value takes into account the case where the main floor station is the departure floor. The setting of the limit value is performed by a limit value setting unit 1.

[0045] Step S110 is performed to generate a new destination call, after which step S111, which is a step of counting the calls, is performed. First, assuming that a new destination call is assigned to each car, the number of stops for each car is calculated as the total number of calls for each car. The total number of calls refers to the total number of stops of the car after it departs from the floor at which the new destination call is generated, and in this embodiment, the up-peak passenger flow is mainly considered, and therefore the call count is the number of destination floors registered before the car departs from the main floor station. The calculation of the call count is performed by a call count unit 2.

[0046] Then, step S112, which is a step of determining whether there is a car below the limit value, is performed. The limit value set for the floor at which the new destination call is generated is compared with the call count for each floor by a car preliminary selection unit 4, and it is determined whether there is a car whose call count is below the limit value among the cars.

[0047] When the call count of all the cars exceeds the limit value, i.e., when there is no car whose call count is below the limit value, the value of the limit value is increased, and step S113, which is a step of relaxing the limit value, is performed. Then, the determination of whether there is a car below the limit value (step S112) and the relaxation of the limit value (step S113) are repeated until a car whose call count is below the limit value is found as a preliminary selected car, i.e., step S114.

[0048] Then, for all the preliminary selected cars, step S115, which is a step of determining a priority number selection rule, is performed again. The priority number selection rule can include one or more rules, and the rules need to be more stringent in the order of precedence. When the priority number selection is performed, it is first determined whether the rule is satisfied, and if there is no car that satisfies the rule, step S116, which is a step of relaxing the rule, is performed. The determination of whether the priority number selection rule is satisfied (i.e., step S115) and the relaxation of the priority number selection rule (i.e., step S116) are repeated until a rule is found that is satisfied, and then the car that satisfies the rule is selected as a final candidate car, i.e., step S117. If no car that satisfies any of the rules is found even after all the rules are traversed, the preliminary selected car is selected as the final candidate car.

[0049] Thereafter, the candidate cars are subjected to a prediction operation of various evaluation values such as a predicted time of arrival at the destination floor, and the evaluation value results of the prediction operation are used to select the car having the best evaluation value among the candidate cars as the final allocation car.

[0050] Next, the setting method of the priority car selection rule will be described.

[0051] The priority car selection rule can be set by one or more rules, and is used to determine whether the new call destination floor is adjacent to the registered call destination floors of each car. The number of rules is related to the passenger flow intensity and the number of car service floors. When the passenger flow is large or the number of service floors is large, the number of rules can be increased. The priority car selection rules should be from strict to loose. For example, rule one is that the car satisfies the condition that the new call destination floor is adjacent to the registered call destination floors, rule two is that the car satisfies the condition that the new call destination floor is adjacent to one of the registered call destination floors, and rule three is that the car satisfies the condition that the new call destination floor is adjacent to two of the registered call destination floors.

[0052] Next, the operation of the priority car selection unit will be described.

[0053] Suppose that there are three rules for the priority car selection rule, rule one is that the car satisfies the condition that the new call destination floor is adjacent to the registered call destination floors, rule two is that the car satisfies the condition that the new call destination floor is adjacent to one of the registered call destination floors, and rule three is that the car satisfies the condition that the new call destination floor is adjacent to two of the registered call destination floors. Figure 3 is a flow chart for describing the operation of the priority car selection unit 5 in the rule group. Figure 1 First, step S201 is to find the car in the initial selection car group that satisfies the condition that the new call destination floor is adjacent to the registered call destination floors. In the above example in which there are three rules for the priority car selection rule, the rule one is used to judge all the cars whose call registration number is below the limit value when selecting the priority car. Then, step S202 is to determine whether the car exists. If the car exists, all the cars that satisfy the condition are selected as candidates (step S117).

[0054] If the car that satisfies the condition that the new call destination floor is adjacent to the registered call destination floors does not exist, the rule two is used to judge all the cars whose call registration number is below the limit value, i.e., step S203 is to find the car in the initial selection car group that satisfies the condition that the new call destination floor is adjacent to one of the registered call destination floors. Then, step S202 is to determine whether the car exists. If the car exists, all the cars that satisfy the condition are selected as candidates (step S117).

[0055] If there is no new destination floor call floor or the next floor of the new destination floor call floor has no registered call, the judgment of rule three is performed on all the cars with the number of registered calls below the limit value, i.e. the new destination floor call floor or the next floor of the new destination floor call floor is searched for a car with a registered call (step S204), it is judged whether the car exists (step S202), and if the car exists, all the cars satisfying the condition are selected as candidates (step S117).

[0056] If there is no new destination floor call floor or the next floor of the new destination floor call floor has no registered call, i.e. after all the rules are traversed, there is no car satisfying any rule, all the cars with the number of registered calls below the limit value are selected (step S114), and the cars are selected as candidate cars (step S117), i.e. all the primary selected cars are directly selected as candidates.

[0057] The selection rule of the candidate car according to the application can distribute the destination floor calls of the adjacent floors to the same car as much as possible, and can further shorten the travel time of the elevator and improve the operation efficiency of the elevator group.

[0058] The application is described in detail above through specific embodiments, and the above embodiments are only the preferred embodiments of the application, and the application is not limited to the above embodiments. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the application should be included in the protection scope of the application.

Claims

1. An elevator destination floor allocation method, characterized by, The method comprises the following steps: Step S101, setting a limit value; Step S110, generating a new call; Step S111, calculating the call count; Step S112, determining whether there is a car with a call count below the limit value; Step S114, selecting the car with a call count below the limit value as the initial selected car; Step S115, determining whether the priority call selection rule is met; Step S117, finding a car meeting the priority call selection rule and selecting the car meeting the priority call selection rule as the final selected car; if no car meeting the priority call selection rule is found, the initial selected car is selected as the final selected car; In the step S115, the priority call selection rule comprises one or more rules, and the priority call selection rule is used to determine whether the destination floor of the new call is adjacent to the destination floor of the registered call of each car; The step S115 further comprises the following steps: Step S201, searching for a car with a registered call on the floor above or below the destination floor of the new call in the initial selected car; Step S202, determining whether the car exists, and if the car exists, proceeding to step S117; Step S203, if no car with a registered call on the floor above or below the destination floor of the new call exists, searching for a car with a registered call on the floor above or below the floor above or below the destination floor of the new call; After the step S203, the following steps are further included: Step S202, determining whether the car exists, and if the car exists, proceeding to step S117; Step S204, if no car with a registered call on the floor above or below the destination floor of the new call exists, searching for a car with a registered call on the floor above or below the floor above or below the destination floor of the new call.

2. The elevator destination floor allocation method according to claim 1, wherein After the step S112, the step S113 of relaxing the limit value is further performed; and when the call count of all cars exceeds the limit value, i.e., no car with a call count below the limit value exists, the value of the limit value is increased.

3. The elevator destination floor allocation method according to claim 1, wherein After the step S115, the step S116 of relaxing the priority call selection rule is further performed when no car meeting the priority call selection rule exists.

4. The elevator destination floor allocation method according to claim 1, wherein In the step S101, the limit value for limiting the number of destination calls is set for each floor according to the passenger flow and the service floor.

5. The elevator destination floor allocation method according to claim 1, wherein In the step S111, when a new destination call is allocated to each car, the number of stops of each car is calculated as the total number of calls of each car, and the total number of calls refers to the total number of stops of the car from the floor where the new destination call is generated.

6. An elevator destination floor allocation apparatus characterized by comprising: An elevator destination floor allocation method according to any one of claims 1-5 comprises: a limit value setting unit for limiting the number of destination calls that can be allocated to the same car; a call count unit for calculating the number of calls; a priority call selection rule unit for determining whether the destination floor of the new call is adjacent to the destination floor of the registered call of each car; and a final selected car selection unit for selecting the car meeting the priority call selection rule as the final selected car. a registered call recording unit for recording all the destination floors registered by each car before it departs from the main landing; a car preselection unit for preselecting, as preselected cars, cars that can be assigned to a new destination call based on information from the limit value setting unit and the call counting unit; a priority machine selection unit for further preselecting the preselected cars selected by the car preselection unit based on the destination floor information recorded by the registered call recording unit using a priority machine selection rule.

7. A computer-readable storage medium having stored thereon a computer program, characterized in that, The program, when executed by a processor, causes the processor to perform the elevator destination floor assignment method of one of claims 1-5.

Images