Allocation decision calculation in elevator system

Abstract

A method, apparatus, medium, and system for calculating allocation decisions in an elevator system are provided. Obtaining historical passenger batch journey data related to the elevator system, the historical passenger batch journey data including historical achievement data about starting and destination floors of a past journey, the number of passengers of the past journey, and the time of the past journey within a predetermined day period; constructing historical passenger transportation statistics based on the passenger batch travel data; modeling future expected calls based on historical passenger transport statistics; receiving at least one call; and taking into account the at least one modeled expected call as a received call when calculating an allocation decision for the at least one call in the elevator system.

Description

[0001] This application is a divisional application of an invention patent application with an application date of June 17, 2016, application number 201680086819.1 (international application number PCT / FI2016 / 050441), and invention name “Allocation Decision Calculation in Elevator System”. Technical Field Background Art

[0002] The elevator control in an elevator system can implement a reallocation of calls after the initial call allocation. This means that in some cases it would be beneficial to reallocate a new elevator to an existing call. However, this situation is different, for example, in elevator systems using instant call allocation. An example of instant call allocation is a destination control system (DCS). In instant call allocation, already allocated calls are usually not reallocated. This can lead to a situation where, after a call has been allocated to a first elevator, it may be found that it would be more beneficial and optimal to serve the call with a second elevator. However, as already mentioned above, it may not be possible to reallocate a call from an already allocated call to the first elevator, because in a destination control system the serving (allocated) elevator is signaled to the passenger immediately after the call is given.

[0003] In addition, the elevator may become full before serving all calls and passengers assigned to it. This may on the other hand lead to a reduced level of passenger service, particularly in destination control systems. Summary of the invention

[0004] According to a first aspect of the present invention, a method for calculating allocation decisions in an elevator system is provided. The method comprises obtaining historical passenger batch trip data related to the elevator system, wherein each passenger batch trip comprises a starting and destination floor of the trip, a number of passengers in the trip, and a time of the trip; constructing historical passenger transportation statistics based on the passenger batch trip data; modeling expected calls based on the passenger transportation statistics; and considering the modeled expected calls when calculating subsequent allocation decisions in the elevator system.

[0005] In one embodiment, the method further comprises estimating elevator loads in the elevators of the elevator system based on historical passenger traffic statistics; and considering the estimated elevator loads when calculating subsequent allocation decisions in the elevator system.

[0006] In one embodiment, alternatively or additionally, the method further comprises estimating the elevator load in the elevators of the elevator system for each elevator trip respectively based on passenger batch trip intensity and batch size distribution obtained from historical passenger transportation statistics and simulated service times.

[0007] In one embodiment, alternatively or additionally, the modeled expected calls include at least one landing and car call pair.

[0008] In one embodiment, alternatively or additionally, the modeled expected calls include at least one destination call.

[0009] In one embodiment, alternatively or additionally, the passenger batch trip data comprises a building origin-destination matrix formed for each day within a predetermined day period.

[0010] In one embodiment, the elevator system alternatively or additionally uses immediate call distribution.

[0011] According to a second aspect, an elevator control device for calculating allocation decisions in an elevator system is provided. The device includes at least one processor and at least one memory connected to the at least one processor. The at least one memory stores program instructions that, when executed by the at least one processor, cause the device to obtain historical passenger batch trip data related to the elevator system, wherein each passenger batch trip includes a starting and destination floor of the trip, a number of passengers in the trip, and a time of the trip; construct historical passenger transportation statistics based on the passenger batch trip data; model expected calls based on the passenger transportation statistics; and consider the modeled expected calls when calculating subsequent allocation decisions in the elevator system.

[0012] In one embodiment, at least one memory stores program instructions that, when executed by at least one processor, cause the apparatus to estimate elevator loads in elevators of the elevator system based on historical passenger traffic statistics; and to consider the estimated elevator loads when calculating subsequent allocation decisions in the elevator system.

[0013] In one embodiment, at least one memory stores program instructions which, when executed by at least one processor, cause the apparatus to estimate, for each elevator trip, the elevator load in the elevators of the elevator system, respectively, based on passenger batch trip intensity and batch size distribution obtained from historical passenger transportation statistics and simulated service times.

[0014] In one embodiment, alternatively or additionally, the modeled expected calls include at least one landing and car call pair.

[0015] In one embodiment, alternatively or additionally, the modeled expected calls include at least one destination call.

[0016] In one embodiment, alternatively or additionally, the passenger batch trip data comprises a building origin-destination matrix formed for each day within a predetermined day period.

[0017] In one embodiment, the elevator system alternatively or additionally uses immediate call distribution.

[0018] According to a third aspect, there is provided a computer program comprising program code which, when executed by at least one processing unit, causes the at least one processing unit to carry out the method of the first aspect.

[0019] In one embodiment, the computer program is embodied on a computer readable medium.

[0020] According to a third aspect, there is provided an elevator system comprising a plurality of elevators and the elevator control device according to the second aspect.

[0021] In one example, the present invention provides a method for calculating allocation decisions in an elevator system using instant call allocation, the method comprising the steps of: obtaining historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes historical realization data on the start and destination floors of past trips, the number of passengers in the past trips, and the time of the past trips within a predetermined day period; constructing historical passenger transportation statistics based on the passenger batch trip data; modeling future expected calls based on the historical passenger transportation statistics; receiving at least one call; and considering at least one modeled expected call as the received call when calculating the allocation decision for at least one call in the elevator system.

[0022] In one embodiment, the present invention provides an elevator control device for calculating allocation decisions in an elevator system using instant call allocation, the device comprising: at least one processor; and at least one memory connected to the at least one processor; wherein the at least one memory stores program instructions, which, when executed by the at least one processor, cause the device to: obtain historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes historical realization data on the starting and destination floors of past trips, the number of passengers in the past trips, and the time of the past trips within a predetermined day period; construct historical passenger transportation statistics based on the passenger batch trip data; model future expected calls based on the historical passenger transportation statistics; receive at least one call; and consider at least one modeled expected call as the received call when calculating the allocation decision for the at least one call in the elevator system.

[0023] In one embodiment, the present invention provides an elevator system, comprising a plurality of elevators. In one embodiment, the present invention provides a method for calculating allocation decisions in an elevator system using instant call allocation, the method comprising the following steps: obtaining historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes the starting and destination floors of the trip, the number of passengers in the trip, and the time of the trip; constructing historical passenger transportation statistics based on the passenger batch trip data; modeling future expected calls based on the historical passenger transportation statistics; receiving at least one call; considering at least one modeled expected call as a received call when calculating allocation decisions for at least one call in the elevator system; estimating elevator loads in elevators of the elevator system for each elevator trip based on the passenger batch trip intensity and batch size distribution obtained from the historical passenger transportation statistics and the simulated service time; and considering the estimated elevator loads when calculating subsequent allocation decisions in the elevator system. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The accompanying drawings, which are included to provide a further understanding of the present invention and constitute a part of this specification, illustrate embodiments of the present invention and together with the description help explain the principles of the present invention. In the drawings:

[0025] Figure 1A is a flow chart illustrating a method for computing assignment decisions in an elevator system.

[0026] Figure 1B is a flow chart illustrating a method for computing assignment decisions in an elevator system.

[0027] Figure 2A and 2B An example is disclosed that illustrates making assignment decisions in an elevator system.

[0028] Figure 3 is a block diagram showing an apparatus for operating elevator cars in a multi-car elevator system. DETAILED DESCRIPTION

[0029] Figure 1A is a flow chart illustrating a method for computing assignment decisions in an elevator system.

[0030] Historical passenger batch trip data related to the elevator system is obtained at 100. Each passenger batch trip includes the starting and destination floors of the trip, the number of passengers in the trip (i.e., the passenger batch size), and the time of the trip. The passenger batch trip data provides historical actual data on the usage of the elevators in the elevator system.

[0031] At 102, historical passenger transportation statistics are constructed based on the passenger batch trip data. The historical passenger transportation statistics can be based on a building origin-destination (OD) matrix, which in turn can be based on the above passenger batch trips. The historical passenger transportation statistics can be constructed based on the passenger batch trips for each day d, d = 1, 2, ..., D and a fixed interval [t k , t k +1], k=1, 2, ..., K respectively form a building-specific OD matrix, where D is the number of days in a cycle and K is the number of intervals in a day. For example, if D is set to "7", the building-specific OD matrix covers every weekday.

[0032] The N×N building-specific OD matrix can be expressed as where N is the number of floors in the building and b, b=1, 2, ..., B, represents the batch size (i.e., the number of passengers). The elements in the building-specific OD matrix are Corresponding to the intensity of passenger batch travel, the intensity of passenger batch travel is equal to the batch size b from the starting floor i to the destination floor j within the interval k of one day d.

[0033] In elevator group control, each candidate solution gives a call allocation to the elevators in the group. In order to calculate the cost or fitness value of the solution, the service order of the calls or passengers of each elevator must be determined. This can be done for each elevator independently of each other, for example, as follows.

[0034] Assume that there is a given set of calls, some of which may be virtual calls. First, the service order of the calls is determined by the centralized control principle. Then, the routes of the elevators throughout the calls are simulated in this order. Calls can be represented by nodes. A landing call corresponds to a single start node, and a destination call corresponds to the start and destination nodes. Let N = [n1, n2, ..., n k ] represents an ordered set of nodes. The service time t for calling n1 i can be recursively calculated as t i =t i-1 +τ i-1,i , where τ i,j is from node n i To node n j time, i.e., from node n i To node n j The flight time plus the time at node n i The node n0 is the current position of the elevator, t0 = 0 and τ 01 is the flight time between the current position of the elevator and the first node n1.

[0035] If n iCorresponding to the existing or virtual landing call, it can be assumed that the service landing call n i A set of virtual car calls given at is modeled and added to the route in the correct position. Table 1 lists examples of different call types and items that can be modeled.

[0036] Table 1

[0037]

[0038] Once the simulation is finished, the service time for each call is determined. Then, an objective function can be used to calculate the fitness value of each candidate solution, i.e. the allocation of calls. Typical objective functions are average waiting time, average travel time, or a weighted sum of the two.

[0039] At 104, the expected calls (or "virtual" calls) are modeled based on passenger transportation statistics. represents a matrix containing the passenger batch trip intensities for each pair of floors in interval k on day d. The element λ ijkd is the trip intensity from origin floor i to destination floor j. It is also assumed here that batch trips occur according to a Poisson process. In addition, the batch size distribution for each pair of floors can be given by the matrix By omitting the interval and day indices, the time t to reach the next pair of virtual landing and car calls or virtual destination calls from the starting floor i to the destination floor j can be ij Defined as:

[0040]

[0041] Among them, λ ij is the batch arrival intensity in seconds from the origin floor i to the destination floor j according to the Poisson process, γ ij is the time since the last landing or destination call from origin floor i to destination floor j.

[0042] Because λ ij is the rate parameter of the Poisson process, 1 / λ ij is the average time between two consecutive arrivals, i.e., two consecutive calls. Then, the above equation means that even if we assume that the batch arrivals occur according to a Poisson process, they will only arrive if the time since the last call is longer than a predefined time limit The forgetfulness property of the process is assumed only when . Suitable values ​​for the time limit can be determined, for example, using simulation studies.

[0043] When 1 / λ ij <γ ij , that is, there are many transports from origin floor i to destination floor j, and the time since the last call is longer than the average inter-arrival time, then tij < 0. In this case, it is natural to assume that the time until the next future call will be very short, so we set t ij = 0. If in is a predefined time range, such as the elevator cycle time, then the arrival time from the starting floor i to the destination floor j is equal to t current +t ij A pair of virtual landing and car calls or virtual destination calls, where t current is, for example, the moment at which a new allocation decision is calculated.

[0044] Each origin floor may have several destination calls, therefore, generate all the calls from origin floor i to destination floor j such that Because there can only be one landing call in each direction on the starting floor i at a time, the virtual destination call in the same direction Among all virtual floor station and car call pairs, the virtual floor station and car call pair with the arrival time closest to the current time can be selected.

[0045] Let l i represents the arrival time, that is,

[0046] Therefore, on the starting floor i, in the direction defined by the virtual car call j, such that The arrival time of the next virtual landing call is t current +l i Furthermore, if, for example, there is an existing landing call at the starting floor i, only a landing call to the destination floor j is generated such that Virtual car call.

[0047] At 106, at least one modeled expected (or "virtual") call is taken into account when calculating subsequent allocation decisions. This improves the level of service for passengers because the allocation of elevator cars becomes more optimized.

[0048] Figure 1B is a flow chart illustrating a method for computing assignment decisions in an elevator system. Figure 1B The embodiment shown in Figure 1A In the embodiment shown in Figure 1A Steps 100, 102 and 104 have been shown.

[0049] At 108, the load in the elevator is modeled based on historical passenger traffic statistics. Figure 1Aand for each virtual car call discussed in more detail in its description, the intensity of a passenger traveling from origin floor i to destination floor j in interval k of day d is estimated as:

[0050]

[0051] Among them, t i is the service time of the landing call on floor I, and t i Defined during route simulation. ijkd ] is the expected number of passengers associated with each arrival, in other words, using the matrix The expected batch size is estimated by the batch size distribution defined as explained above. ijkd is the batch arrival intensity from the starting floor i to the destination floor j, that is, is defined as The elements in the matrix .

[0052] The strength is estimated similarly to that for virtual calls, as in Figure 1A In addition, if there is an existing car or destination call to a floor before the floor serving the existing or virtual landing call, the strength of this pair of floors can also be estimated. The reason is that a passenger boarding the elevator at a landing call floor may also be heading to a floor defined by an existing car or destination call, not only to a floor defined by a virtual call.

[0053] The estimated strength with its number of start and destination floors can be stored in memory. For existing cars and destination calls that the elevator will actually serve, the strength can be kept in memory as long as they are not served at the destination floor. For virtual cars and destination calls, the strength can be kept in memory as long as it is still possible to decelerate to the destination floor defined by the strength. The destination floor of the estimated strength can be represented by a node.

[0054] When the simulation of an elevator route ends, all destination nodes of estimated strength are iterated through in the order defined by the route. During the iteration, the route can be divided into consecutive elevator trips using two rules. An elevator trip will end at the current destination node if:

[0055] 1. The minimum starting node number (if any) of the strength associated with the next destination node is greater (less) than or equal to the maximum (minimum) number of destination nodes encountered so far when the elevator is moving in the ascending (descending) direction.

[0056] 2. The elevator changes its running direction at the node.

[0057] In one embodiment, the following steps are performed:

[0058] 1. During simulation of routes defined by existing calls, virtual landing, car and destination calls are generated and the strength is estimated based on passenger batch trip statistics of existing and virtual car and destination calls.

[0059] 2. The destination nodes defined by strength are iterated in their service order and the elevator routes are divided into consecutive elevator trips using these two rules.

[0060] After the above two steps, the intensity associated with each elevator trip is used to define the starting and destination floors of the elevator trip.

[0061] In one embodiment, the load of the elevator is then estimated individually for each elevator trip, as follows.

[0062] Let x ij represents the number of single passenger arrivals from node i to node j. Assuming that the arrivals occur according to a Poisson process, x ij Following with rate parameter μ ij Poisson distribution. After stopping at node k, the number of passengers in the elevator must not exceed the capacity of the elevator. Mathematically this can be written as follows:

[0063]

[0064] Where Q is the elevator capacity, and P is the number of nodes on the elevator journey.

[0065] Next, since we may not know x exactly ij , and therefore take into account the uncertainty associated with them by requiring that the probability of exceeding the elevator capacity Q after stopping at node k is less than some predefined small probability α. Assume x ij are independent, which can be expressed as follows:

[0066]

[0067] in The final equation above can be thought of as a penalty term, because the smaller the left-hand side, the greater the probability that the elevator capacity will not be exceeded during the elevator journey. The penalty term for a single elevator journey can be written as follows:

[0068]

[0069] where β is a scaling factor, the value of which can be determined, for example, by computational experimentation. It follows that the penalty term for the entire route is the sum of the penalties for the individual elevator trips described above. The penalty term for the entire route can thus be used when added to the objective function used. Typical objective functions are average waiting time, average travel time, or a weighted sum of the two.

[0070] At 110, at least one modeled expected (or "virtual") call and the modeled load are considered in calculating subsequent assignment decisions. The elevator group control can then build and use historical passenger transportation statistics based on passenger batch trips to estimate the load of an elevator during its route through the call assigned to it, taking this load into account when calculating assignment decisions, helping to improve passenger service levels.

[0071] Figure 2A and 2B An example is disclosed showing the making of allocation decisions in an elevator system. The example assumes that the destination control system is used in a building with eight floors and two elevators 200 and 202. It is also assumed that one of the elevators is at the topmost floor 9 and the other is at the bottommost floor 1.

[0072] Additionally, assume that two destination calls, one 204 from floor 8 to floor 2 and the other 206 from floor 5 to floor 1, occur at approximately the same time and, based on minimizing the average waiting time, the first is assigned to the first elevator 200 and the second is assigned to the second elevator 202. Next, assume that approximately 5 seconds later, when the elevators 200, 202 have already begun moving to serve the destination call, a new destination call 208 is given from floor 4 to floor 6. This has already been Figure 2B Shown in.

[0073] Now, from the point of view of average waiting time, the best allocation is to reallocate the destination call from floor 5 to floor 1 to the first elevator 200 and give the new destination call 208 to the second elevator 202. However, this is usually not possible because in the destination control system, the passenger is signaled to the serving elevator immediately after the call is given. Figure 1A As shown in the embodiment of , this problem can be overcome when the new destination call is considered as a predicted or virtual destination call when allocating the first two calls. Therefore, in this case, the first and second destination calls will first be allocated to the first elevator 200, and then the second elevator 202 will serve the subsequent new destination call 208.

[0074] Figure 3A block diagram of an elevator control device 300 for calculating allocation decisions in an elevator system is shown. The device 300 includes at least one processor 302 connected to at least one memory 304. The at least one memory 304 may include at least one computer program that, when executed by the processor 302 or multiple processors, causes the device 300 to perform programmed functions. The device 300 may also include input / output ports and / or one or more physical connectors, which may be Ethernet ports, Universal Serial Bus (USB) ports, IEEE 1394 (Firewire) ports, and / or RS-232 ports. The components illustrated are not required or all-inclusive, as any component may be deleted and other components may be added.

[0075] The elevator control 300 may be an elevator control entity configured to implement only the operational features disclosed above, or it may be part of a larger elevator control entity, such as a group controller.

[0076] The exemplary embodiments of the present invention may be included in any suitable device, for example, including a server, workstation, personal computer, portable computer capable of performing the processes of the exemplary embodiments. The exemplary embodiments may also store information related to the various processes described herein.

[0077] Example embodiments may be implemented in software, hardware, application logic, or a combination of software, hardware, and application logic. Example embodiments may store information related to the various methods described herein. The information may be stored in one or more memories, such as a hard disk, an optical disk, a magneto-optical disk, a RAM, etc. One or more databases may store information for implementing example embodiments. Databases may be organized using data structures (e.g., records, tables, arrays, fields, graphs, trees, lists, etc.) included in one or more memories or storage devices listed here. The methods described with respect to example embodiments may include appropriate data structures for storing data collected and / or generated by the methods of the devices and subsystems of the example embodiments in one or more databases.

[0078] As will be appreciated by those skilled in the art of computers and / or software, all or part of the example embodiments can be conveniently implemented using one or more general purpose processors, microprocessors, digital signal processors, microcontrollers, etc. programmed according to the teachings of the example embodiments. As will be appreciated by those skilled in the art of software, based on the teachings of the example embodiments, programmers of ordinary skill can easily prepare appropriate software. In addition, as will be appreciated by those skilled in the art of electrical engineering, the example embodiments can be implemented by preparing application specific integrated circuits or by an appropriate network of interconnected conventional component circuits. Therefore, the examples are not limited to any particular combination of hardware and / or software. Examples stored on any one or a combination of computer readable media may include software for controlling components of the example embodiments, software for driving components of the example embodiments, software for enabling components of the example embodiments to interact with human users, etc. Such computer readable media may also include a computer program for executing all or part of the processing performed in implementing the example embodiments (if the processing is distributed). The computer code device of the example may include any suitable interpretable or executable code mechanism, including but not limited to scripts, interpretable programs, dynamic link libraries (DLLs), Java classes and applets, complete executable programs, etc.

[0079] As described above, the components of the example embodiments may include computer-readable media or memory for storing instructions programmed according to the teachings and for maintaining data structures, tables, records and / or other data described herein. In an example embodiment, application logic, software or instruction sets are maintained on any of various conventional computer-readable media. In the context of this document, "computer-readable media" can be any medium or tool that can contain, store, communicate, propagate or transmit instructions for use by an instruction execution system, device or equipment such as a computer or for use in combination with an instruction execution system, device or equipment such as a computer. Computer-readable media may include computer-readable storage media, which may be any medium or tool that can contain or store instructions for use by an instruction execution system, device or equipment such as a computer or for use in combination with an instruction execution system, device or equipment such as a computer. Computer-readable media may include any suitable media that participates in providing instructions to a processor for execution. This medium may take many forms, including but not limited to non-volatile media, volatile media, transmission media, etc.

[0080] Although the essential novel features as applied to the preferred embodiments thereof have been shown and described and pointed out, it will be understood that various omissions and substitutions and changes in the form and details of the described apparatus and methods may be made by those skilled in the art without departing from the spirit of the present disclosure. For example, all combinations of those elements and / or method steps which expressly indicate that they perform substantially the same function in substantially the same manner to achieve the same results are within the scope of the present disclosure. Furthermore, it will be recognized that the structures and / or elements and / or method steps shown and / or described in conjunction with any disclosed form or embodiment may be incorporated into any other disclosed or described or suggested form or embodiment as a general matter of design choice. Option. Moreover, in the claims, means-plus-function clauses are intended to cover the structures described herein that perform the recited functions and include not only structural equivalents but also equivalent structures.

[0081] Applicants hereby disclose separately each individual feature described herein and any combination of two or more such features, so that these features or combinations can be implemented based on the present specification as a whole in accordance with the common knowledge of those skilled in the art, regardless of whether these features or combinations of features solve any problems disclosed herein, and are not limited to the scope of the claims. Applicants point out that the disclosed aspects / embodiments may include any such individual features or combinations of features. In view of the above description, it will be apparent to those skilled in the art that various modifications may be made within the scope of the present disclosure.

Claims

1. A method for calculating allocation decisions in an elevator system using instant call allocation, the method The following steps are involved: obtaining historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes historical realization data regarding the origin and destination floors of past trips, the number of passengers of the past trips, and the time of the past trips within a predetermined daily period; constructing historical passenger transportation statistics based on the passenger batch travel data; modeling future expected calls based on the historical passenger transportation statistics; receiving at least one call; and At least one modeled expected call is considered as a received call when calculating an assignment decision for the at least one call in the elevator system.

2. The method according to claim 1, further comprising: include: estimating elevator loads in elevators of the elevator system based on the historical passenger traffic statistics; and The estimated elevator loads are taken into account when calculating subsequent assignment decisions in the elevator system.

3. The method according to claim 2, further comprising: include: Based on passenger batch trip intensity and batch size distribution obtained from the historical passenger transportation statistics and simulated service times, elevator loads in elevators of the elevator system are estimated for each elevator trip, respectively.

4. The method according to any one of claims 1 to 3, in, The modeled expected calls include at least one landing and car call pair.

5. The method according to any one of claims 1 to 3, in, The modeled expected calls include at least one destination call.

6. The method according to claim 1 or 2, in, The passenger batch trip data includes a building origin-destination matrix formed for each day within a predetermined day cycle.

7. An elevator control device for calculating allocation decisions in an elevator system using immediate call allocation, the device include: at least one processor; and at least one memory connected to the at least one processor; The at least one memory stores program instructions, which, when executed by the at least one processor, cause the device to: obtaining historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes historical realization data regarding the origin and destination floors of past trips, the number of passengers of the past trips, and the time of the past trips within a predetermined daily period; constructing historical passenger transportation statistics based on the passenger batch travel data; modeling future expected calls based on the historical passenger transportation statistics; receiving at least one call; and At least one modeled expected call is considered as a received call when calculating an assignment decision for the at least one call in the elevator system.

8. The elevator control device according to claim 7, in, The at least one memory stores program instructions which, when executed by the at least one processor, cause the apparatus to: estimating elevator loads in elevators of the elevator system based on the historical passenger traffic statistics; and The estimated elevator loads are taken into account when calculating subsequent assignment decisions in the elevator system.

9. The elevator control device according to claim 8, in, The at least one memory stores program instructions which, when executed by the at least one processor, cause the apparatus to: Based on passenger batch trip intensity and batch size distribution obtained from the historical passenger transportation statistics and simulated service times, elevator loads in elevators of the elevator system are estimated for each elevator trip, respectively.

10. The elevator control device according to any one of claims 6 to 8, in, The modeled expected calls include at least one landing and car call pair.

11. The elevator control device according to any one of claims 6 to 8, in, The modeled expected calls include at least one destination call.

12. The elevator control device according to claim 7 or 8, in, The passenger batch trip data includes a building origin-destination matrix formed for each day within a predetermined day cycle.

13. A computer-readable medium having a computer program recorded thereon, the computer program comprising program code, and when the program code is executed by at least one processing unit, the at least one processing unit executes the method according to any one of claims 1 to 6.

14. An elevator system, include: Multiple elevators; and An elevator control device according to any one of claims 7 to 12.

15. A method for calculating allocation decisions in an elevator system using instant call allocation, the method The following steps are involved: Obtaining historical passenger batch trip data related to the elevator system, wherein the historical passenger batch trip data includes the starting and destination floors of the trip, the number of passengers in the trip, and the time of the trip; constructing historical passenger transportation statistics based on the passenger batch travel data; modeling future expected calls based on the historical passenger transportation statistics; receiving at least one call; taking into account at least one modeled prospective call as a received call when calculating an assignment decision for the at least one call in the elevator system; estimating, for each elevator trip, elevator loads in the elevators of the elevator system based on passenger batch trip intensity and batch size distribution obtained from the historical passenger transportation statistics and simulated service times; and The estimated elevator loads are taken into account when calculating subsequent assignment decisions in the elevator system.

Images