Elevator and elevator control method

Abstract

To provide an elevator capable of eliminating imbalances in the number of people waiting at a landing and the waiting time of users, and shortening the waiting time at the entire landing.SOLUTION: An elevator includes a memory unit that stores information indicating the number of users assigned to each car, a calculation unit that calculates the number of users that can ride in each car based on the information stored in the memory unit, and an assignment processing unit that assigns the destination floor registered by the destination floor registration device to one of the cars based on the number of users that can ride in each car calculated by the calculation unit.SELECTED DRAWING: Figure 1

Description

[Technical field]

[0001] The present invention generally relates to an elevator in which a destination floor is registered by a destination floor registration device. [Background technology]

[0002] The elevator group control system provides more efficient operation services to users by treating multiple cars as one group. More specifically, it manages multiple cars as one group, and when a hall call occurs at a certain floor, it selects one of the most suitable cars from the group and assigns the hall call to the selected car.

[0003] Destination floor reservation system-type group control (hereafter referred to as destination floor reservation-type group control) is a type of group control in which a destination floor is registered on a destination floor registration device installed at the elevator hall before boarding the car. In general elevator group control, an upward or downward call is registered at the elevator hall, and the destination floor is registered after boarding the elevator that has arrived. In contrast, with destination floor reservation-type group control, the destination floor of the user is known in advance, so a more optimal car can be assigned according to the destination floor.

[0004] Patent Document 1 relates to an elevator group management system equipped with a destination floor registration device, and discloses that when a user operates an HDC (landing destination floor registration device) at the landing of any floor to specify a destination floor, a destination call pairing the destination floor with the departure floor is issued from the HDC, and an allocation control unit provided in the group management control device uses this destination call to assign the destination call to the optimal elevator car based on an evaluation formula E which is based on waiting time, boarding time, etc.

[0005] Patent Document 2 discloses an elevator group management system equipped with a destination floor registration device, which discloses that a passenger group car allocation unit allocates cars on a passenger group basis, so that passengers at the same boarding floor and the same destination floor can be set to different passenger groups, thereby enabling appropriate car allocation processing to be performed without leaving any passengers behind, even when there are a large number of passengers at the same boarding floor and the same destination floor. [Prior art documents] [Patent documents]

[0006] [Patent Document 1] JP 2020-125189 A [Patent Document 2] WO 10 / 032625 Summary of the Invention [Problem to be solved by the invention]

[0007] In the method described in Patent Document 1, priority is given to assigning destination calls to cars that are assigned the same departure floor and the same destination floor when the assignment is determined and when the assignment is changed, which results in an imbalance in the number of people waiting between floors and worsening waiting times throughout the building.

[0008] The method described in Patent Document 2, when creating passenger groups, does not take into consideration the imbalance in the number of people waiting at each departure floor, or the fact that when a crowded floor is full, passengers whose departure floor is an intermediate floor between the crowded floor and the destination floor will not be able to board the train.

[0009] The present invention has been made in consideration of the above points, and aims to propose an elevator or the like that can eliminate imbalances in the number of people waiting at a landing and in the waiting time of users, thereby shortening the waiting time at the entire landing. [Means for solving the problem]

[0010] In order to solve this problem, the present invention provides an elevator equipped with a destination floor registration device that can register a destination floor of a car specified by a user from among a plurality of cars, and includes a memory unit that stores information indicating the number of users, which is the number of users assigned to each car, for each departure floor, a calculation unit that calculates, for each departure floor, a maximum number of passengers, which is the number of users who can board, for each car based on the information indicating the number of users stored in the memory unit, and an allocation processing unit that assigns the destination floor registered by the destination floor registration device to one of the cars based on the maximum number of passengers calculated by the calculation unit.

[0011] In the above configuration, the number of passengers allowed to board is set for each departure floor, so passengers are transported evenly, preventing an excessive increase in the number of people waiting. By leveling out the waiting time of passengers, the waiting time at the entire boarding area is shortened. In addition, passengers waiting at floors between the departure floor and the destination floor, where there are many passengers, can board more easily, which leads to a shortening of the waiting time at the entire boarding area. Effect of the Invention

[0012] According to the present invention, it is possible to realize an elevator that is highly convenient. Problems, configurations, and effects other than those described above will become apparent from the following description of the embodiment. [Brief description of the drawings]

[0013] [Figure 1] FIG. 1 is a diagram showing an example of a configuration of an elevator according to a first embodiment. [Diagram 2] FIG. 4 is a diagram showing an example of information according to the first embodiment. [Diagram 3] FIG. 4 is a diagram showing an example of information according to the first embodiment. [Figure 4] FIG. 2 is a diagram illustrating an example of group management processing according to the first embodiment. [Diagram 5] FIG. 4 is a diagram showing an example of information according to the first embodiment. [Figure 6] FIG. 4 is a diagram showing an example of information according to the first embodiment. [Figure 7] FIG. 4 is a diagram showing an example of information according to the first embodiment. [Figure 8] FIG. 11 is a diagram illustrating an example of group management processing according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] (I) First embodiment An embodiment of the present invention will be described in detail below, however, the present invention is not limited to the embodiment.

[0015] The elevator of this embodiment comprises a group control device that manages the operation of multiple cars, and a destination floor registration device that is provided at the landing and can register destination floors for car users. The group control device comprises a memory unit, a calculation unit, and an allocation processing unit. The memory unit stores the number of users (number of users) allocated to each car for each departure floor. The calculation unit uses the number of users to calculate the number of users who can board a car (number of passengers allowed) for each departure floor. The allocation processing unit uses the output of the calculation unit to assign destination floors to the multiple cars.

[0016] In the above configuration, the memory unit may store the number of users for each departure floor and each destination floor. The calculation unit may use the number of users for each departure floor and each destination floor to calculate the number of passengers that can board each car for each departure floor and each destination floor.

[0017] In the above configuration, for example, the upper limit (capacity) of the number of passengers that can board may be different for each departure floor. In this case, the calculation unit may calculate the congestion level of each floor based on the number of passengers waiting for each destination floor for each departure floor, set an upper limit for each departure floor based on the congestion level of each floor, and calculate the number of passengers that can board for each departure floor according to the set upper limit.

[0018] The designations "first," "second," "third," and the like in this specification are given to identify components and do not necessarily limit the number or order. Furthermore, numbers for identifying components are used in each context, and a number used in one context does not necessarily indicate the same configuration in another context. Furthermore, a component identified by a certain number is not prevented from also having the function of a component identified by another number.

[0019] Next, an embodiment of the present invention will be described based on the drawings. The following description and drawings are examples for explaining the present invention, and are omitted and simplified as appropriate for clarity of explanation. The present invention can be implemented in various other forms. Unless otherwise specified, each component may be singular or plural.

[0020] In the following description, the same elements in the drawings are given the same numbers, and the description is omitted as appropriate. When describing elements of the same type without distinguishing between them, the common part (part excluding the branch number) of the reference sign including the branch number is used, and when describing elements of the same type while distinguishing between them, the reference sign including the branch number may be used. For example, when describing destination floor registration devices without distinguishing between them, they may be described as "destination floor registration device 110," and when describing individual destination floor registration devices while distinguishing between them, they may be described as "destination floor registration device 110A," "destination floor registration device 110B," and so on.

[0021] In FIG. 1, 1 indicates as a whole an elevator according to a first embodiment.

[0022] 1 is a diagram showing an example of the configuration of an elevator 1. The elevator 1 includes a group control device 100, a destination floor registration device 110, a car 120, and a car control device .

[0023] The group control device 100 controls the operation of a plurality of cars 120 serving a plurality of floors. The group control device 100 includes a car information input / output unit 101, a floor information receiving unit 102, a memory unit 103, a calculation unit 104, an allocation processing unit 105, and a car information transmitting unit 106.

[0024] The car information input / output unit 101 inputs and outputs information about the car 120 (the number of passengers in the car 120, the current floor of the car 120, the moving direction 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 (destination call including information indicating the departure floor, information indicating the destination floor, etc.). The memory 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 predetermined calculation using the information stored in the memory unit 103, and notifies the allocation processing unit 105 of the result. The allocation processing unit 105 determines a car 120 to which the destination call is to be allocated (a car excluded from allocation) based on the information received from the calculation unit 104, creates an allocation candidate car group, and then determines a car 120 to which the destination call is to be allocated (a boarding car to which the user actually boards) and notifies the boarding car information transmitting unit 106 of information on the determined boarding car. The boarding car information transmitting unit 106 transmits the information received from the allocation processing unit 105 to the destination floor registration device 110.

[0025] The destination floor registration device 110 is provided at the landing, registers a destination floor specified by a user of the car 120, and transmits information on the registered destination floor to the group control device 100. When the destination floor registration device 110 is operated by a user, the destination floor registration device 110 displays for a certain period of time to the user the destination floor specified by the user and the car name received from the group control device 100. Note that in this embodiment, an example will be described in which all users operating the destination floor registration device 110 individually specify a destination floor.

[0026] As will be described later, it is apparent that this embodiment can be implemented without being limited by the number of cars and the number of floors.

[0027] 2 and 3 are diagrams showing an example of information stored (managed) in the storage unit 103. The storage unit 103 stores, for example, passenger information 201 in each car, information 202 about each car, information 301 about the number of people waiting by departure floor and destination floor, information 302 about the number of users assigned to each car, and all call history information 303.

[0028] The information about each cage 120 is continuously reflected in the information about passengers in each cage 201 and the information about each cage 202. The information about passengers in each cage 201 stores, for example, information about the departure floor and destination floor for passengers in the cage 120. The information about each cage 202 stores, for example, the current floor of each cage 120, the direction of movement of each cage 120, the capacity of each cage 120, etc.

[0029] Information 301 on the number of people waiting by departure floor and destination floor is updated every time a destination floor is registered by the destination floor registration device 110 in response to an operation by a user. Information 302 on the number of users assigned to each car is updated every time a destination call is assigned to a car 120 by the assignment processing unit 105. Total call history information 303 is information indicating the history of destination calls for a predetermined period of time, and is updated every time a destination floor is registered by the destination floor registration device 110. Note that, although total call history information 303 indicates information for each departure floor and destination floor, it may be information for each departure floor.

[0030] Next, an example of operation (group management processing) of the group management device 100 having the above-mentioned configuration will be described with reference to FIG.

[0031] 4 is a diagram showing an example of the group management process. For example, the group management process starts when the destination floor registration device 110 registers a destination floor.

[0032] In step S401, the floor information receiving unit 102 receives a destination call from the destination floor registration device 110.

[0033] In step S402, the calculation unit 104 acquires information stored in the memory unit 103. The calculation unit 104 acquires passenger information 201 in each car, information 202 for each car, information 301 on the number of people waiting by departure floor and destination floor, information 302 on the number of users assigned to each car, and all call history information 303.

[0034] In step S403, the calculation unit 104 calculates the congestion degree. The congestion degree may be, for example, the ratio of users who have not completed boarding among destination calls that have occurred so far on the floor where the destination call occurs and that are in the same direction as the destination call at the time when the destination call occurs. This ratio can be calculated, for example, using the departure floor destination floor number of people waiting information 301 and the total call history information 303. However, the method of calculating the congestion degree is not limited to this. For example, as another method, it may be the number of destination calls that occurred on the destination call occurrence floor within a certain arbitrary time period, or the ratio of the number of people waiting on the destination call occurrence floor to the number of people waiting at all the boarding halls, or the departure floor destination floor number of people waiting information 301 may simply be used.

[0035] In step S404, the calculation unit 104 calculates the number of passengers that can board each car 120 at the floor where the destination call occurs, based on the information acquired from the storage unit 103 in step S402 and the congestion degree calculated in step S403.

[0036] The upper limit (upper limit value) of the number of people who can board the car 120 from each floor may be set according to the degree of congestion, as in the passenger number upper limit value information 500 of Fig. 5. Any value may be set for the degree of congestion, "low", "medium", or "high", in the passenger number upper limit value information 500, according to the situation at the site. In addition, such a relationship table between the upper limit value and the degree of congestion may be set according to the time period, as in the passenger number upper limit value information 600 of Fig. 6, or may be set for each combination of the departure floor and the destination floor, as in the passenger number upper limit value information 700 of Fig. 7. In addition, the passenger number upper limit value information 500, the passenger number upper limit value information 600, and the passenger number upper limit value information 700 are stored in the storage unit 103.

[0037] Here, a case where a destination call (destination call A) from the 6th floor to the 2nd floor occurs will be described. If the number of destination calls in the same direction that have occurred so far on the floor where destination call A occurs (6th floor) is 20, the number of passengers who have not yet boarded on the floor where destination call A occurs is 13, and the congestion degree is the unboarded rate on the floor where destination call A occurs, the congestion degree is 65% (=13 / 20×100). In this case, if the congestion degree is 60% or more and the upper limit is set to 5 people on the departure floor for each car 120, when the number of passengers assigned to car 120A (car A), car 120B (car B), and car 120C (car C) are 5, 5, and 3, respectively, the number of passengers that can board car A and car B is calculated to be 0, and the number of passengers that can board car C is calculated to be 2.

[0038] In step S405, the allocation processing unit 105 judges whether or not there is a car 120 whose number of passengers has reached the upper limit (whether or not there is a car 120 whose number of passengers is 0). If the allocation processing unit 105 judges that there is a car 120, it moves the process to step S406, and if it judges that there is no car 120, it moves the process to step S407.

[0039] In step S406, the allocation processing unit 105 sets the car 120 in which the number of passengers has reached the upper limit as a car not to be allocated. In the above case, the cars A and B are set as cars not to be allocated.

[0040] In step S407, the allocation processing unit 105 calculates an evaluation value for the car 120 to which the destination call can be assigned, and selects a car to which the destination call is assigned based on the calculated evaluation value. Note that the cars 120 to which the destination call can be assigned do not include cars excluded from allocation. In addition, an existing evaluation formula may be used as the evaluation formula for calculating the evaluation value.

[0041] According to this embodiment, it is possible to limit the number of passengers per departure floor. For example, if too much priority is given to putting passengers going to the same floor in the same car, there will be many cars going from one crowded floor to another, but according to this embodiment, it is possible to limit the number of passengers per departure floor, so it is possible to avoid a situation where the allocation of cars is biased.

[0042] In addition, in this embodiment, for example, by storing information on the waiting time of users waiting at a landing for each departure floor or for each departure floor and destination floor, and changing the upper limit according to the waiting time, it becomes unnecessary to change the allocation of users whose elapsed time from the issuance of a destination call exceeds a threshold value. In this case, problems such as the waiting time of a user who has been reassigned being the sum of the waiting time for the car that he was originally scheduled to board and the waiting time for the car after the reassignment, and the burden of confirming the reassignment do not occur.

[0043] (II) Second embodiment In this embodiment, differences from the first embodiment will be mainly described.

[0044] In Fig. 8, some steps are different from those in the procedure from the generation of a destination call to the selection of a car shown in Fig. 4. Steps S801, S802, S804, S805, and S808 are the same as steps S401, S402, and S405 to S407, respectively. Fig. 8 differs from Fig. 4 in steps S803, S806, and S807, and the processing in these steps will be described below.

[0045] In step S803, the calculation unit 104 calculates the number of passengers that can board at the floor where the destination call occurs for each car 120 based on the information acquired from the storage unit 103 in step S802. For example, the calculation unit 104 refers to the passenger number upper limit information 600 and calculates the number of passengers that can board at the floor where the destination call occurs for each departure floor for each car 120. Also, for example, the calculation unit 104 may refer to the passenger number upper limit information 700 and calculate the number of passengers that can board at the floor where the destination call occurs for each departure floor and destination floor for each car 120. In addition, the calculation unit 104 may calculate the congestion degree and calculate the number of passengers that can board according to the congestion degree as shown in the first embodiment.

[0046] In step S806, the allocation processing unit 105 judges whether there is a car 120 to which a destination call with the same combination of departure floor and destination floor as the generated destination call is assigned. If the allocation processing unit 105 judges that there is, it moves the process to step S807, and if it judges that there is not, it moves the process to step S808.

[0047] 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 generated destination call is going from the 4th floor to the 2nd floor, car C is set as the allocation priority car based on the information 302 on the number of users assigned to each car. In setting the allocation priority car, for example, a method of setting a weight so that a better evaluation value is calculated in the calculation of the evaluation value in step S808 can be considered, but is not limited to this.

[0048] According to this embodiment, when the number of passengers has not reached the upper limit, the cars can be assigned so that passengers travelling from the same floor to the same floor board the same car, which leads to a reduction in waiting time at the entire platform.

[0049] (III) Supplementary Note The above-described embodiment includes, for example, the following contents.

[0050] In the above embodiment, the present invention is described as being applied to an elevator, but the present invention is not limited to this and can be widely applied to various other systems, devices, methods, and programs.

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

[0052] The functions of the group management device 100 (the car information input / output unit 101, the floor information receiving unit 102, the storage unit 103, the calculation unit 104, the allocation processing unit 105, the boarding car information transmitting unit 106, etc.) may be realized, for example, by a CPU reading a program stored in a ROM into a RAM and executing it (software), or may be realized by hardware such as a dedicated circuit, or may be realized by a combination of software and hardware. The functions of the group management device 100 may be a VM (Virtual Machine) that runs on a computer, a container that runs on an OS (Operating System), or an application that runs on an OS. Note that one function of the group management device 100 may be divided into multiple functions, or multiple functions may be integrated into one function. Also, a part of the functions of the group management device 100 may be provided as a separate function, or may be included in another function. Also, all or a part of the functions of the group management device 100 may be realized by another computer that can communicate with the group management device 100, or may be realized on a cloud system. In addition to the above functions, the group management device 100 may further include functions such as an operating system, a device driver, a file system, and a DBMS (DataBase Management System).

[0053] Furthermore, in the above-described embodiment, some or all of the programs may be installed from a program source into a device such as a computer that realizes group management device 100. The program source may be, for example, a program distribution server connected via a network or a computer-readable recording medium (for example, a non-transitory recording medium). Furthermore, in the above description, two or more programs may be realized as one program, and one program may be realized as two or more programs.

[0054] Furthermore, in the above-described embodiments, the configuration of each table is an example, and one table may be divided into two or more tables, or all or part of two or more tables may be one table.

[0055] In the above embodiment, for convenience of explanation, the elevator-related information is described using a table, but the data structure is not limited to a table. The elevator-related information may be expressed by a data structure other than a table, such as XML (Extensible Markup Language), YAML (YAML Ain't a Markup Language), a hash table, a tree structure, or the like.

[0056] In addition, in the above description, information such as programs, tables, files, etc. that realize each function can be placed in a storage device such as a memory, a hard disk, or an SSD (Solid State Drive), or in a recording medium such as an IC card, an SD card, or a DVD.

[0057] The above-described embodiment has the following characteristic configurations, for example.

[0058] (1) 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 a destination floor of a car specified by a user from among a plurality of cars (e.g., car 120), and is equipped with a memory unit (e.g., memory unit 103) that stores information indicating the number of users (e.g., information 302 on the number of users assigned to each car) for each departure floor, a calculation unit (e.g., calculation unit 104) that calculates the maximum number of passengers, which is the number of users who can board, for each car for each departure floor based on the information indicating the number of users stored in the memory unit, and an allocation processing unit (e.g., allocation processing unit 105) that assigns the destination floor registered by the destination floor registration device to one of the cars based on the maximum number of passengers calculated by the calculation unit.

[0059] In the above configuration, the number of passengers allowed to board is set for each departure floor, so passengers are transported evenly, preventing an excessive increase in the number of people waiting. By leveling out the waiting time of passengers, the waiting time at the entire boarding area is shortened. In addition, passengers waiting at floors between the departure floor and the destination floor, where there are many passengers, can board more easily, which leads to a shortening of the waiting time at the entire boarding area.

[0060] (2) The memory unit stores information indicating the number of users, which is the number of users assigned to each cage, for each departure floor and for each destination floor (see, for example, Figure 3), and the calculation unit calculates the maximum number of passengers, which is the number of users who can board each cage, for each departure floor and for each destination floor based on the information indicating the number of users stored by the memory unit (see, for example, Figures 4 to 8).

[0061] According to the above configuration, for example, by setting the number of passengers permitted for each departure floor and destination floor, passenger transportation can be controlled in more detail, allowing passengers to be transported more evenly and leading to reduced waiting times at all boarding areas.

[0062] (3) The memory unit stores information indicating the number of waiting passengers, which is the number of users waiting at the boarding area (for example, information 301 on the number of waiting passengers by departure floor and destination floor), and the calculation unit calculates a congestion degree indicating the degree of congestion at the boarding area based on the information indicating the number of waiting passengers stored in the memory unit, and calculates the number of passengers that can board based on the calculated congestion degree (for example, see Figure 4).

[0063] According to the above configuration, even if the trend in the number of users changes, for example, by setting the number of passengers that can board according to the degree of congestion, the waiting time of users can be leveled out, which leads to a reduction in the waiting time at the entire boarding area.

[0064] (4) When a second floor different from the first floor is specified by a user in a destination floor registration device installed on a first floor, the first floor is the departure floor and the second floor is the destination floor, and the allocation processing unit sets a car to which the same departure floor and destination floor as the departure floor and the destination floor are assigned as an allocation priority car (see, for example, Figure 8).

[0065] According to the above configuration, for example, when the number of passengers has not reached the upper limit, the assigned priority car is set so that passengers going to the same floor board the same car, which leads to a reduction in waiting time at the entire platform.

[0066] (5) The allocation processing unit sets cars with a passenger capacity of zero as cars excluded from allocation, and allocates the destination floor registered by the destination floor registration device to any car other than the set cars excluded from allocation (for example, see Figures 4 and 8).

[0067] According to the above configuration, for example, in the case of an elevator with a capacity of zero passengers, even if the elevator itself has vacant seats, a destination floor is not assigned to the elevator, thereby making it possible to avoid a situation in which too many passengers board at a particular floor.

[0068] Furthermore, the above-described configurations may be modified, rearranged, combined, or omitted as appropriate without departing from the spirit and scope of the present invention.

[0069] It should be understood that items listed in the format "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, items listed in the format "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). [Explanation of symbols]

[0070] 1: elevator, 103: memory unit, 104: calculation unit, 105: allocation processing unit, 110: destination floor registration device, 120: cage.

Claims

1. An elevator equipped with a destination floor registration device capable of registering a destination floor of a car designated by a user from among a plurality of cars, A storage unit that stores information indicating the number of passengers assigned to each car for each departure floor; a calculation unit that calculates a maximum number of passengers, which is the number of passengers that can board each car, for each departure floor based on the information indicating the number of passengers stored in the memory unit; an allocation processing unit that allocates a destination floor registered by the destination floor registration device to any one of the cars based on the number of passengers that can be accommodated calculated by the calculation unit; An elevator equipped with.

2. The memory unit stores information indicating the number of passengers, which is the number of passengers assigned to each car, for each departure floor and for each destination floor, The calculation unit calculates a maximum number of passengers, which is the number of passengers that can board each car, for each departure floor and for each destination floor based on the information indicating the number of passengers stored in the storage unit.

2. The elevator according to claim 1.

3. The memory unit stores information indicating a number of waiting users, which is the number of users waiting at a boarding area; The calculation unit calculates a congestion degree indicating a degree of congestion at the boarding hall based on information indicating the number of waiting people stored in the storage unit, and calculates the number of passengers that can board based on the calculated congestion degree.

2. The elevator according to claim 1.

4. When a second floor different from the first floor is designated by a user in a destination floor registration device provided on a first floor, The first floor is a departure floor, and the second floor is a destination floor; The allocation processing unit sets a car to which the same departure floor and destination floor as the departure floor and the destination floor are assigned as an allocation priority car.

2. The elevator according to claim 1.

5. the allocation processing unit sets a car having a capacity of zero passengers as an excluded car, and allocates a destination floor registered by the destination floor registration device to any car other than the set excluded car; 2. The elevator according to claim 1.

6. An elevator control method for an elevator having a destination floor registration device capable of registering a destination floor of a car designated by a user from among a plurality of cars, comprising: The elevator includes a storage unit that stores information indicating the number of users, which is the number of users assigned to each car, for each departure floor, A calculation unit calculates a maximum number of passengers, which is the number of passengers that can board each car, for each departure floor based on the information indicating the number of passengers stored in the storage unit; an allocation processing unit allocates the destination floor registered by the destination floor registration device to any one of the cars based on the number of passengers calculated by the calculation unit; An elevator control method comprising:

Images