Elevator and elevator control method

Abstract

Provided is an elevator capable of eliminating imbalance in the number of people waiting in a lobby and the waiting time of users, and reducing the waiting time in the entire lobby. A storage section stores information indicating the number of users, i.e., the number of people waiting in each car, for each departure floor. An arithmetic section calculates the number of people who can board each car for each departure floor based on the information indicating the number of users stored by the storage section. A distribution processing section distributes the destination floor registered by a destination floor registration device to any car based on the number of people who can board calculated by the arithmetic section.

Description

Technical Field

[0001] The present invention generally relates to elevators that register their destination floors using a destination floor registration device. Background Technology

[0002] Elevator group management systems provide more efficient operational services to users by treating multiple elevator cars as a group. More specifically, the following process is implemented: when multiple elevator cars are managed as a group and a hall call occurs on a certain floor, the optimal car is selected from the group, and the hall call is assigned to the selected car.

[0003] The so-called destination floor reservation system-based group management (hereinafter referred to as destination floor reservation group management) is a group management method in which the destination floor is registered by a destination floor registration device located in the lobby before the user enters the elevator car. In general elevator group management, upward or downward calls are registered in the lobby, and the destination floor is registered after the user enters the arriving car. In contrast, in destination floor reservation group management, since the user's destination floor is known in advance, a more optimal car can be allocated according to the destination floor.

[0004] In Patent Document 1, regarding an elevator group management system equipped with a destination floor registration device, the following technology is disclosed: In the lobby of any floor, if the user operates the HDC (Lobby Destination Floor Registration Device) to specify the destination floor, a destination call that pairs the destination floor and the departure floor is issued from the HDC. The allocation control unit installed in the group management control device uses the destination call and allocates the destination call to the optimal car based on an evaluation formula E based on standby time, elevator travel time, etc.

[0005] In Patent Document 2, an elevator group management system with a destination floor registration device is disclosed, which discloses the following technology: by allocating cars to units in the same passenger group by the same passenger group car allocation unit, even passengers with the same boarding floor and the same destination floor can be set into different passenger groups. Therefore, even if there are a large number of passengers with the same boarding floor and the same destination floor, the appropriate car allocation process will be carried out without any surplus.

[0006] Prior art literature

[0007] Patent documents

[0008] Patent Document 1: JP 2020-125189

[0009] Patent Document 2: International Publication No. 10 / 032625 Summary of the Invention

[0010] The problem that the invention aims to solve

[0011] In the method described in Patent Document 1, since the cars that have been assigned to the same departure floor and the same destination floor are given priority in destination call allocation when the allocation decision is made and when the allocation is changed, there is a problem that the number of waiting passengers between floors is unbalanced and the waiting time in the whole building is worse.

[0012] In the method described in Patent Document 2, the following situation was not considered in the creation of the riding group: the uneven number of waiting people on each departure floor, and the fact that when the congested floor becomes full, users whose departure floor is located on the intermediate floor between the congested floor and the destination floor can no longer ride the elevator.

[0013] This invention takes into account the above points and aims to provide an elevator that can eliminate the imbalance between the number of people waiting in the lobby and the waiting time of users, and shorten the overall waiting time in the lobby.

[0014] Methods for solving problems

[0015] In the present invention, which addresses the related issues, an elevator is provided with a destination floor registration device capable of registering the destination floor of a car specified by a user from a plurality of cars. The elevator includes: a storage unit that stores information representing the number of users allocated to each car, i.e., the number of users, per departure floor; a calculation unit that, based on the information representing the number of users stored in the storage unit, calculates the number of users who can ride the elevator, i.e., the number of passengers who can ride the elevator, per departure floor for each car; and an allocation processing unit that, based on the number of passengers who can ride the elevator calculated by the calculation unit, allocates the destination floor registered by the destination floor registration device to any car.

[0016] In the above structure, by setting the number of passengers allowed per departure floor to ensure that no user is missed, extreme increases in waiting times can be prevented. By averaging out waiting times, the overall waiting time in the lobby is reduced. Furthermore, users waiting on floors between departure and destination floors with high user numbers find it easier to access the elevator, further reducing the overall waiting time in the lobby.

[0017] The effects of the invention

[0018] According to the present invention, an elevator with high convenience can be realized. Other issues, structures, and effects beyond those described above will become clear through the following description of embodiments. Attached Figure Description

[0019] Figure 1 This is a diagram illustrating an example of the structure involved in the elevator of the first embodiment.

[0020] Figure 2This is a diagram illustrating an example of information from the first embodiment.

[0021] Figure 3 This is a diagram illustrating an example of information from the first embodiment.

[0022] Figure 4 This is a diagram illustrating an example of the group management process in the first embodiment.

[0023] Figure 5 This is a diagram illustrating an example of information from the first embodiment.

[0024] Figure 6 This is a diagram illustrating an example of information from the first embodiment.

[0025] Figure 7 This is a diagram illustrating an example of information from the first embodiment.

[0026] Figure 8 This is a diagram illustrating an example of the group management process in the second embodiment. Detailed Implementation

[0027] (I) First Embodiment

[0028] Hereinafter, one embodiment of the present invention will be described in detail. However, the present invention is not limited to this embodiment.

[0029] The elevator of this embodiment includes: a group management device that manages the operation of multiple cars; and a destination floor registration device located in the lobby that registers the destination floors of users of the cars. The group management device includes a storage unit, a calculation unit, and an allocation processing unit. The storage unit stores the number of users allocated to each car for each departure floor (number of users). The calculation unit uses the number of users to calculate the number of users who can board the elevator for each departure floor (number of passengers). The allocation processing unit uses the output of the calculation unit to allocate destination floors to the multiple cars.

[0030] In the above structure, the storage unit can also store the number of users at each departure floor, differentiated by destination floor. The calculation unit can also use the number of users at each departure floor, differentiated by destination floor, to calculate the number of passengers that can ride in each car, based on each departure floor and destination floor.

[0031] In the above structure, for example, the upper limit (capacity) of the number of people who can ride the elevator can be different for each departure floor. In this case, the calculation unit can calculate the congestion level of each floor based on the number of people waiting for arrival at each departure floor, set an upper limit for each departure floor based on the congestion level of each floor, and calculate the number of people who can ride the elevator for each departure floor according to the set upper limit.

[0032] The designations "first," "second," "third," etc., in this specification and other documents are added for the purpose of identifying constituent elements and are not necessarily limited in number or order. Furthermore, the numbering used to identify constituent elements is used in each context, and a number used in one context is not limited to necessarily representing the same structure in other contexts. Moreover, a constituent element identified by a certain number does not preclude it from also functioning as a constituent element identified by other numbers.

[0033] Next, embodiments of the present invention will be described with reference to the accompanying drawings. The following description and drawings are illustrative of the invention, and omissions and simplifications are appropriate for clarity of explanation. The invention can also be implemented in various other ways. Unless otherwise specified, each component may be a single element or a plurality of elements.

[0034] Furthermore, in the following description, the same numbers are used for the same elements in the accompanying drawings, and the descriptions are appropriately omitted. Additionally, when describing elements without distinguishing them, the common portion (other than the branch numbers) of the reference numerals in the accompanying drawings is sometimes used; when describing elements that are different, reference numerals including branch numbers are sometimes used. For example, when describing a destination layer registration device without specifically distinguishing it, it is sometimes referred to as "destination layer registration device 110," while when describing different destination layer registration devices, it is sometimes referred to as "destination layer registration device 110A" or "destination layer registration device 110B."

[0035] exist Figure 1 In the text, 1 is used as a whole to represent the elevator of the first embodiment.

[0036] Figure 1 This diagram illustrates an example of the structure involved in elevator 1. Elevator 1 is composed of a group management device 100, a destination floor registration device 110, a car 120, and a car control device 130.

[0037] The group management device 100 manages the operation of multiple elevator cars 120 on multiple floors. The group management device 100 includes an elevator car information input / output unit 101, a floor information receiving unit 102, a storage unit 103, a calculation unit 104, a distribution processing unit 105, and an elevator car information sending unit 106.

[0038] The car information input / output unit 101 inputs and outputs information about the car 120 (number of passengers in the car 120, current floor of the car 120, direction of travel of the car 120, etc.). For example, the car information input / output unit 101 receives information about the car 120 from the car control device 130. The floor information receiving unit 102 receives destination floor information registered by the destination floor registration device 110 (including destination calls such as information indicating the departure floor and information indicating the destination floor). The storage unit 103 stores the information input / output by the car information input / output unit 101, the information received by the floor information receiving unit 102, etc. The calculation unit 104 performs a given calculation using the information stored in the storage unit 103 and notifies the allocation processing unit 105 of the result. Based on the information received from the calculation unit 104, the allocation processing unit 105 determines the cars 120 that have not been assigned destination calls (cars not assigned). After creating a group of cars to be assigned, it determines the cars 120 that will be assigned destination calls (the cars that will actually be used by users) and notifies the car information sending unit 106 of the determined cars. The car information sending unit 106 then sends the information received from the allocation processing unit 105 to the destination floor registration device 110.

[0039] A destination floor registration device 110 is located in the lobby and registers the destination floor specified by users of the elevator car 120, sending the registered destination floor information to the group management device 100. If a user operates the destination floor registration device 110, the device will display the destination floor specified by the user and the elevator car name received from the group management device 100 to the user for a certain period of time. Furthermore, in this embodiment, the example of all users individually specifying their destination floors when operating the destination floor registration device 110 will be used for explanation.

[0040] As will be explained later, it is obvious that this embodiment can be implemented without being limited to the number of cars or floors.

[0041] Figure 2 as well as Figure 3 This diagram illustrates an example of information stored (managed) in the storage unit 103. The storage unit 103 stores, for example, passenger information 201 in each car, car information 202, information on the number of passengers waiting at the departure and destination levels 301, information on the number of users who have completed car assignments 302, and complete call history information 303.

[0042] The passenger information 201 and information 202 for each car reflect the information of each car 120 in real time. Passenger information 201, for example, stores information about the departure and destination floors of passengers in car 120. Information 202 stores information such as the current floor of each car 120, the direction of movement of each car 120, and the capacity of each car 120.

[0043] Whenever the destination layer registration device 110 registers a destination layer in response to a user's operation, the departure layer / destination layer distinguishing standby number information 301 is updated. Whenever the allocation processing unit 105 allocates a destination call to a car 120, the number of users allocated to each car is updated 302. The total call history information 303 represents the historical record of destination calls for a given period, and is updated whenever the destination layer registration device 110 registers a destination layer. Furthermore, the total call history information 303 represents information for each departure layer and destination layer, but it can also be information for only each departure layer.

[0044] Next, use Figure 4 Here is an example of the operation (group management processing) of the group management device 100 with the above structure.

[0045] Figure 4 This is a diagram illustrating an example of group management processing. For instance, group management processing begins when the destination layer is registered by the destination layer registration device 110.

[0046] In step S401, the layer information receiving unit 102 receives the destination call from the destination layer registration device 110.

[0047] In step S402, the arithmetic unit 104 obtains the information stored in the storage unit 103. The arithmetic unit 104 obtains passenger information 201 in each car, car information 202, number of passengers waiting at the departure level and destination level 301, number of users who have completed the allocation of each car 302, and full call history information 303, etc.

[0048] In step S403, the calculation unit 104 calculates the congestion level. The congestion level can be, for example, set as the proportion of users who have not completed their elevator rides at the time a destination call occurs, among all destination calls made in the same direction up to that point. This proportion can be calculated, for example, using the departure-destination-destination-level distinguishing standby information 301 and the total call history information 303. However, the method for calculating the congestion level is not limited to this. For example, other methods could include setting it as the number of destination calls made at the destination call originating floor within an arbitrary time interval, setting it as the proportion of standby users at the destination call originating floor relative to the total number of standby users in the lobby, or simply using the departure-destination-destination-level distinguishing standby information 301.

[0049] In step S404, the calculation unit 104 calculates the number of passengers in each car 120 who can take the elevator at the floor where the destination call originates, based on the information obtained from the storage unit 103 in step S402 and the congestion level calculated in step S403.

[0050] The maximum number of people allowed to take the elevator from each floor to the 120-car capacity (maximum value) can be as follows: Figure 5 The maximum passenger capacity information 500 is set according to the level of congestion. The congestion levels of "small," "medium," and "large" in the maximum passenger capacity information 500 can be set to any value depending on the actual situation. Furthermore, a table showing the relationship between this maximum capacity and congestion level can be provided as follows: Figure 6 The maximum number of passengers allowed can be set according to a time period, like the 600 limit. Figure 7 The maximum passenger capacity information 700 is set according to each combination of the departure floor and the destination floor. Incidentally, the maximum passenger capacity information 500, 600, and 700 are stored in the storage unit 103.

[0051] Here, we explain the scenario where a destination call (destination call A) occurs from the 6th floor to the 2nd floor. If we set the number of same-direction destination calls occurring up to the 6th floor (where destination call A originated) to 20, the number of users not using the elevator on the floor where destination call A originated to 13, and the congestion level to the non-ride rate on the floor where destination call A originated, then the congestion level becomes 65% (=13 / 20×100). Now, assuming a congestion level of 60% or higher, and with the maximum number of passengers on the departure floor of each car 120 set to 5, and the number of users allocated to cars 120A (Car A), 120B (Car B), and 120C (Car C) to be 5, 5, and 3 respectively, then the number of passengers that can ride in cars A and B is calculated to be 0, and the number of passengers that can ride in car C is calculated to be 2.

[0052] In step S405, the allocation processing unit 105 determines whether there are any elevator cars 120 whose passenger capacity has reached the upper limit (whether there are any elevator cars 120 with a passenger capacity of 0). If the allocation processing unit 105 determines that there are such cars, it moves the processing to step S406; if it determines that there are none, it moves the processing to step S407.

[0053] In step S406, the allocation processing unit 105 sets the car 120, whose passenger capacity has reached the upper limit, as an allocation exclusion car. Additionally, in the above-described case, cars A and B are also set as allocation exclusion cars.

[0054] In step S407, the allocation processing unit 105 calculates an evaluation value for the cars 120 that can be allocated destination calls, and selects a car to be allocated a destination call based on the calculated evaluation value. Furthermore, the cars 120 that can be allocated destination calls do not include cars that cannot be allocated. Incidentally, existing evaluation formulas can be used for calculating the evaluation value.

[0055] According to this embodiment, the number of passengers can be limited per departure floor. For example, if people going to the same floor are given too much priority to ride in the same car, there will be more cars going from crowded floors to crowded floors. However, according to this embodiment, since the number of passengers can be limited per departure floor, an unbalanced situation in the allocation of cars can be avoided.

[0056] Furthermore, in this embodiment, for example, information on the waiting time of users waiting in the lobby is stored per departure floor or per departure floor and destination floor, corresponding to a waiting time change limit. Therefore, allocation changes are not implemented for users whose elapsed time since the destination call exceeds a threshold. In this case, problems such as the waiting time of users whose allocation changes have been implemented becoming the sum of the waiting time for the originally scheduled car and the waiting time for the car after the allocation change, or the burden of imposing confirmation on allocation changes, are avoided.

[0057] (II) Second Embodiment

[0058] In this embodiment, the differences from the first embodiment will be mainly described.

[0059] Figure 8 Is Figure 4 The diagram shows the steps from the occurrence of the destination call to the selection of the elevator car, with some steps being different. Steps S801, S802, S804, S805, and S808 are the same as steps S401, S402, and S405 to S407. Figure 8 and Figure 4 The difference lies in steps S803, S806, and S807; therefore, the processing in these steps will be explained later.

[0060] In step S803, the calculation unit 104 calculates the number of passengers available at the destination call originating floor for each car 120 based on the information obtained from the storage unit 103 in step S802. For example, the calculation unit 104 refers to the passenger capacity limit information 600 and calculates the number of passengers available at the destination call originating floor for each car 120, based on each departure floor. Alternatively, for example, it may refer to the passenger capacity limit information 700 and calculate the number of passengers available at the destination call originating floor for each car 120, based on both the departure and destination floors. Incidentally, the calculation unit 104 may also calculate the congestion level as shown in the first embodiment and calculate the number of passengers available based on the congestion level.

[0061] In step S806, the allocation processing unit 105 determines whether there is a car 120 that has been allocated a destination call with the same combination of departure and destination floors as the originating destination call. If the allocation processing unit 105 determines that there is, it moves the processing to step S807; if it determines that there is not, it moves the processing to step S808.

[0062] In step S807, the allocation processing unit 105 sets the car 120 that meets the determination in step S807 as the allocation priority car. For example, if the destination call is a call from the 4th floor to the 2nd floor, car C is set as the allocation priority car based on the number of users who have completed allocation in each car information 302. Regarding the setting of the allocation priority car, for example, in the calculation of the evaluation value in step S808, a method of setting weights to calculate a better evaluation value is considered, but it is not limited to this.

[0063] According to this embodiment, when the number of passengers has not reached the upper limit, elevator cars can be allocated so that people going from the same floor to the same floor can take the elevator to the same car, which helps to shorten the waiting time in the lobby as a whole.

[0064] (III) Notes

[0065] The above-described embodiments include, for example, the following.

[0066] The above embodiments describe the application of the present invention to elevators, but the present invention is not limited thereto and can be widely applied to various other systems, devices, methods and procedures.

[0067] The group management device 100 is an example of an information processing device (computer), such as a notebook computer, server device, etc., and may include CPU (Central Processing Unit), RAM (Random Access Memory), ROM (Read Only Memory), HDD (Hard Disk Drive), communication unit, etc. (not shown in the figure).

[0068] The functions of the group management device 100 (car information input / output unit 101, floor information receiving unit 102, storage unit 103, arithmetic unit 104, allocation processing unit 105, elevator car information sending unit 106, etc.) can be implemented, for example, by a CPU reading a program stored in ROM into RAM and executing it (software), or by dedicated circuitry or other hardware, or by a combination of software and hardware. The functions of the group management device 100 can be a VM (Virtual Machine) operating in a computer, a container operating on an OS (Operating System), or an application operating on an OS. Furthermore, one function of the group management device 100 can be divided into multiple functions, or multiple functions can be combined into one function. Additionally, a part of the functions of the group management device 100 can be set as other functions, or included in other functions. Furthermore, all or part of the functions of the group management device 100 can be implemented by other computers capable of communicating with the group management device 100, or on a cloud system. In addition to the functions mentioned above, the group management device 100 may also have functions such as an operating system, device drivers, file system, and DBMS (Database Management System).

[0069] Furthermore, in the above embodiments, part or all of the program can be installed from a program source to a device such as a computer implementing the group management device 100. The program source can be, for example, a program distribution server connected to a network or a computer-readable recording medium (e.g., a non-transitory recording medium). Additionally, in the above description, two or more programs can be implemented as one program, or one program can be implemented as two or more programs.

[0070] Furthermore, in the above embodiments, the structure of each table is an example. One table can also be divided into two or more tables, and all or part of two or more tables can also be one table.

[0071] Furthermore, in the above embodiments, tables are used to illustrate the information related to the elevator for ease of explanation, but the data structure is not limited to tables. The information related to the elevator can also be represented by data structures other than tables, such as XML (Extensible Markup Language), YAML (YAML Ain't a Markup Language), hash tables, and tree structures.

[0072] Furthermore, as described above, the programs, tables, files, and other information that implement each function can be stored in storage devices such as memory, hard disks, SSDs (Solid State Drives), or recording media such as IC cards, SD cards, and DVDs.

[0073] The above-described embodiments have, for example, the following characteristic structures. (1)

[0075] The elevator of this embodiment is an elevator (e.g., elevator 1) equipped with a destination floor registration device (e.g., destination floor registration device 110) that can register the destination floor of a car specified by a user from a plurality of cars (e.g., car 120). It includes: a storage unit (e.g., storage unit 103) that stores information indicating the number of users allocated to each car (e.g., user number information 302 after allocation to each car) for each departure floor; a calculation unit (e.g., calculation unit 104) that calculates the number of users who can ride the elevator for each car, i.e., the number of passengers who can ride the elevator, based on the information indicating the number of users stored in the storage unit; and an allocation processing unit (e.g., allocation processing unit 105) that allocates the destination floor registered by the destination floor registration device to any car based on the number of passengers who can ride the elevator calculated by the calculation unit.

[0076] In the above structure, by setting the number of passengers allowed on each departure floor to ensure that no user is missed, extreme increases in waiting times can be prevented. By averaging out waiting times, the overall waiting time in the lobby is reduced. Furthermore, users waiting on floors between departure and destination floors with high user numbers find it easier to access the elevator, further reducing the overall waiting time in the lobby. (2)

[0078] The aforementioned storage unit stores information representing the number of users allocated to each car, i.e., the number of users, for each departure level and each destination level (e.g., refer to...). Figure 3 Based on the information representing the number of users stored in the storage unit, the aforementioned calculation unit calculates the number of users who can ride the elevator for each car, based on each departure floor and each destination floor (for example, referring to...). Figures 4-8 ).

[0079] Based on the above structure, for example, by setting the number of passengers allowed per departure and destination floor, the transportation of users can be controlled in more detail. Therefore, users can be transported more efficiently, which helps to shorten the overall waiting time in the lobby. (3)

[0081] The aforementioned storage unit stores information indicating the number of users waiting in the lobby, i.e., the number of waiting users (e.g., waiting user information 301 distinguishing between departure and destination floors). The aforementioned calculation unit calculates a congestion level, indicating the degree of crowding in the lobby, based on the information indicating the number of waiting users stored in the aforementioned storage unit, and calculates the number of people who can take the elevator based on the calculated congestion level (e.g., referring to...). Figure 4 ).

[0082] Based on the above structure, even if the tendency of users to generate changes, for example, by setting the number of people who can take the elevator according to the level of congestion, the waiting time of users will be averaged out, thus helping to shorten the overall waiting time in the lobby. (4)

[0084] In the destination floor registration device located on the first floor, if the user indicates a second floor different from the first floor, the first floor is the departure floor and the second floor is the destination floor. The allocation processing unit sets the car assigned to the same departure and destination floors as the priority car (e.g., refer to...). Figure 8 ).

[0085] Based on the above structure, for example, when the number of passengers has not reached the upper limit, priority cars can be assigned so that people going to the same floor can take the same car, thus helping to shorten the overall waiting time in the lobby. (5)

[0087] The aforementioned allocation processing unit sets cars with a capacity of 0 passengers as excluded cars, and assigns the destination floor registered by the aforementioned destination floor registration device to any car other than the designated excluded cars (e.g., refer to...). Figure 4 , Figure 8 ).

[0088] Based on the above structure, for example, for a car that can carry 0 people, even if the car itself has empty seats, the destination floor is not assigned to the car. Therefore, it is possible to avoid the situation of taking the elevator from a specific floor too often.

[0089] Furthermore, the above-described structure can be appropriately modified, rearranged, combined, or omitted without departing from the spirit of the present invention.

[0090] It is important to understand that the items included in a list in the form "at least one of A, B, and C" can mean (A), (B), (C), (A and B), (A and C), (B and C), or (A, B, and C). Similarly, the items included in a list in the form "at least one of A, B, or C" can mean (A), (B), (C), (A and B), (A and C), (B and C), or (A, B, and C).

[0091] Explanation of reference numerals in the attached figures

[0092] 1... Elevator, 103... Storage unit, 104... Computing unit, 105... Distribution and processing unit, 110... Destination floor registration device, 120... Car.

Claims

1. An elevator, comprising a destination floor registration device capable of registering the destination floor of a car specified by a user from a plurality of cars, The elevator is characterized by having: The storage department stores information on the number of users allocated to each car, i.e., the number of users, at each departure level; The calculation unit, based on information representing the number of users stored in the storage unit, calculates the number of users who can ride the elevator, i.e., the number of passengers, for each car at each departure floor; and The allocation processing unit, based on the number of passengers that can take the elevator calculated by the calculation unit, allocates the destination floors registered by the destination floor registration device to any elevator car. The storage unit stores information indicating the number of users waiting in the lobby, i.e., the number of users on standby. The calculation unit calculates the congestion level, which indicates the degree of crowding in the lobby, based on the information representing the number of people waiting in the storage unit. Based on the calculated congestion level, it sets an upper limit value for the number of people who can ride the elevator. For each car, it calculates the number of people who can ride the elevator based on the difference between the set upper limit value and the number of users allocated to that car, which is indicated by the information stored in the storage unit.

2. The elevator according to claim 1, wherein, The storage unit stores information representing the number of users allocated to each car, i.e., the number of users, for each departure level and each destination level. The calculation unit calculates the number of users who can ride the elevator for each car, based on the information representing the number of users stored by the storage unit, and for each departure floor and each destination floor.

3. The elevator according to claim 1, wherein, In the case where the user indicates a second floor, which is different from the first floor, at the destination floor registration device located on the first floor, The first floor is the departure floor, and the second floor is the destination floor. The allocation processing unit sets cars assigned to the same departure and destination floors as the departure and destination floors as priority allocation cars.

4. The elevator according to claim 1, wherein, The allocation processing unit sets a car with zero passengers as an excluded car and assigns the destination floor registered by the destination floor registration device to any car other than the excluded car.

5. An elevator control method, comprising an elevator control method for an elevator equipped with a destination floor registration device capable of registering the destination floor of a car specified by a user from multiple cars. The elevator control method is characterized in that... The elevator is equipped with a storage unit that stores information representing the number of users allocated to each car, i.e., the number of users, according to each departure floor. The elevator control method includes: Based on the information representing the number of users stored in the storage unit, the calculation unit calculates the number of users who can ride the elevator, i.e., the number of passengers, for each car and each departure floor; and The allocation processing unit, based on the number of passengers that can take the elevator calculated by the calculation unit, allocates the destination floors registered by the destination floor registration device to any elevator car. The storage unit stores information indicating the number of users waiting in the lobby, i.e., the number of users on standby. The calculation unit calculates the congestion level, which indicates the degree of crowding in the lobby, based on the information representing the number of people waiting in the storage unit. Based on the calculated congestion level, it sets an upper limit value for the number of people who can ride the elevator. For each car, it calculates the number of people who can ride the elevator based on the difference between the set upper limit value and the number of users allocated to that car, which is indicated by the information stored in the storage unit.

Images