AU637892B2 - Elevator dynamic channeling dispatching for up-peak period - Google Patents

Elevator dynamic channeling dispatching for up-peak period Download PDF

Info

Publication number
AU637892B2
AU637892B2 AU74160/91A AU7416091A AU637892B2 AU 637892 B2 AU637892 B2 AU 637892B2 AU 74160/91 A AU74160/91 A AU 74160/91A AU 7416091 A AU7416091 A AU 7416091A AU 637892 B2 AU637892 B2 AU 637892B2
Authority
AU
Australia
Prior art keywords
sector
floors
sectors
cars
lobby
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
AU74160/91A
Other versions
AU7416091A (en
Inventor
Nader Kameli
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Otis Elevator Co
Original Assignee
Otis Elevator Co
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Otis Elevator Co filed Critical Otis Elevator Co
Publication of AU7416091A publication Critical patent/AU7416091A/en
Application granted granted Critical
Publication of AU637892B2 publication Critical patent/AU637892B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00Control systems of elevators in general
    • B66B1/24Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00Control systems of elevators in general
    • B66B1/24Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • B66B1/2458For elevator systems with multiple shafts and a single car per shaft
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/10Details with respect to the type of call input
    • B66B2201/102Up or down call input
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/20Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/211Waiting time, i.e. response time
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/20Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/214Total time, i.e. arrival time
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/20Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/222Taking into account the number of passengers present in the elevator car to be allocated
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/30Details of the elevator system configuration
    • B66B2201/301Shafts divided into zones
    • B66B2201/302Shafts divided into zones with variable boundaries
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/40Details of the change of control mode
    • B66B2201/402Details of the change of control mode by historical, statistical or predicted traffic data, e.g. by learning
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00Aspects of control systems of elevators
    • B66B2201/40Details of the change of control mode
    • B66B2201/403Details of the change of control mode by real-time traffic data

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)

Description

s~9 2 COMMONWEALTH OF AUSTRALIA FORM COMP LET PATENTS ACT 1952 E SP ECIFICATION FOR OFFICE USE: Class Int.Class Application Number: Lodged: Complete Specification Lodged: Accepted: Published: Priority: SRelated Art: eg**: 0 *6e ee* Name of Applicant: OTIS ELEVATOR COMPANY Address of Applicant: Ten Farm Springs, Farmington, Connecticut 06032, United States of America :Actual Inventor: Nader Kameli Address for Service: SHELSTON WATERS, 55 Clarence Street, Sydney Complete Specification for the Invention entitled: "ELEVATOR DYNAMIC CHANNELING DISPATCHING FOR UP-PEAK PERIOD" The following statement is a full description of this invention, including the best method of performing it known to us:- 1 Description Elevator Dynamic Channeling Dispatching For Up-peak Period Technical Field This invention relates to an elevator dispatching system which collects information on traffic -flow and uses that information in assigning the floors of the building to sectors. The dispatching system then selects specific elevator cars to service designated sectors. In addition, such sectoring is optimized based on car capacity or the population density of the sector or channel.
*see 0 *060 0 00 *0 0 0*60 .660 0 0000 s o 0 *6 0 0600
S
0650 *0 0 4 006 Background Art 15 Elevator systems in the past have dispatched elevators in no particular fashion except that each elevator responds to hall calls (HC) from a passenger in the hall and car calls (CC) from a passenger in the car. Such elevator systems are inefficient because: cars are dispatched that are not full, (ii) the queue length, i.e. the number of people waiting to be served by the elevator, is unnecessarily long, (iii) the waiting time of passengers is unnecessarily long, and (iv) the number of stops by the car is more than it needs 25 to be to achieve the same level of service.
The goal of an improved dispatching system is to reduce the time required for elevator service, or simply, the service time. The service time is composed of waiting time and travel time. The waiting time is the time period from when a passenger presses a button to make a hall call to the time when the elevator arrives to receive the passenger.
The travel time is the time period from arrival of the elevator to receive the passenger to the arrival of the elevator at the destination floor and is dependent upon car speed and the number of car stops. Improved dispatching, while it cannot increase car speed, can both improve waiting la-
S
S
S
S
*5S9
S
S. time and reduce the number of car stops to reduce the time required for elevator service.
In order to maximize the efficiency of a dispatching system, the elevator should be dispatched when the number of people wishing to go to a floor is maximized this would minimize the percentage of time that the car is not full on a run. An improved dispatching system will also take into account the extent that the traffic flow in a given building follows certain general patterns during certain periods of the day. Traffic from the lobby to the upper floors of an office building, called up-peak, is high in the early morning when people are coming to work. Traffic from the upper floors of the building to the lobby, called down-peak, is highest in the late afternoon, when people are leaving work.
15 Interfloor traffic, traffic usually found between the hours of 10:00 a.m. and 12:00 p.m. or 1:00 and 4:00 when people have come to work and are working on a particular floor, but are not going to or from lunch, is less pronounced than up-peak or down-peak, and may be appropriately called off-peak.
An advance in efficient dispatching divides the building into sectors for elevator service so that certain floors are grouped in a specific sector and selected elevator cars are assigned to service that sector so that the number of car stops is minimized. A system of dividing the building into sectors may be found in U.S. Patent No. 4,804,069 by Bittar et al entitled "Contiguous Floor Channeling Elevator Dispatching." This patent discloses a system of "static channeling" in which the total number of floors in a building is divided into a constant number of sectors.
A system of dynamic channeling maybe found in U.S.
Patent No. 4,846,311 by Thangavelu, entitled "Optimized "Up- Peak" Elevator Channeling System With Predicted Traffic- Volume Equalized Sector Assignments." In this patern the number of floors per sector is variable, hence the name "dynamic" channeling. The number of floors in each sector is varied based upon the location of the passengers in the 0 55
S
s 2 building and their pattern of movement within the building and not upon the number of floors in a building. U.S. Patent No. 4,846,311 discloses an elevator dispatching system using dynamic channeling to decrease queue length and waiting time and increase elevator handling capacity. This system of "dynamic" channeling assigns floors to sectors such that the traffic volume per sector is equal. This is as opposed to static channeling in which a) the number of floors per sector is constant regardless of the number of people in the sectors, and b) the assignment of the floors to the sectors does not change. This system uses real and historic time predictions of traffic to determine the assignment of floors to sectors.
Static channeling is not the optimum dispatching 15 strategy because it does not consider variations in traffic see: patterns.
Dynamic channelling as disclosed in these patents has been effective, but may be further improved. While the number of floors in a sector is not constant in the patent, the number of sectors in the building is a constant.
Secondly, the reference does not constrain the number of floors in a sector with the result that there might be, for example, ten floors in a single sector allowing the potential for less than optimum dispatching. Thirdly, the above system of dynamic channeling allows one sector to overlap another.
Passengers planning to go to the overlapped floor may see that they can get to there quicker by boarding the car with the overlapped floor as its first stop rather than its last.
This will cause a reduction in the overall efficiency of the dispatching strategy.
It is noted that some of the general prediction techniques utilized in the present invention are discussed in general (but not in any elevator context or in any context analogous thereto) in Forecasting Methods Applications by Spiros Maridakis and Steven C. Wheelwright (John Wiley Sons, Inc., 1978).
3 Disclosure of the Invention Objects of the present invention include efficiently dispatching elevator cars to decrease passenger waiting time, to decrease passenger queue lengths, and to decrease elevator service time during the up-peak period.
Still further objects of the present invention include ensuring that cars in an elevator system are filled to capacity, power consumption is reduced, and the life of the elevator system being lengthened.
Still further objects of the present invention include reducing service and waiting times, and increasing the frequency of sector assignment to cars.
e According to a first aspect of the invention there is provided an elevator system, comprising: 15 a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time S..traffic data, collected at a first time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at 0 floors other than the lobby; means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby an deboarded cars at floors other than the lobby; predicting means, for predicting, based on said historical-time and real-time traffic data, the number of people who will be arriving at the lobby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car will service at a particular time; 4a signal processing means for determining when an up-peak condition occurs and, when such condition occurs, for further providing: signals for assigning, after execution of a static channelling elevator dispatching routine, floors to sectors when the number of deboarding counts at said floor, when added to said sector, csuses the sector population to exceed a percentage of the average sector population for assigning the number of floors in a building into a variable number of sectors, which do not overlap when the number of floors included in said sector, each sector comprising at least one floor but no more than some predetermined maximum number of floors, each sector containing a variable number of floors, said 15 floors in each sector being contiguous, said sectors :O within the building being contiguous; for assigning a sector to a car for transporting passengers to and from said sector; and 20 for indicating on said floor service indicator means said assignment; and communications means for passing signals between and among said counting means, said predicting means, said floor service indicator means, and said signal processing means.
According to a second aspect of the invention there is provided a method of dispatching elevator cars comprising the steps of: retrieving a table of historical-time traffic data which data consists of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a first time; 4a retrieving a table of real-time traffic data, which data consists of counts of the number of people who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a second time prior to said retrieving of said real-time traffic data; predicting, based on data collected from said steps of retrieving said historical-time and real-time traffic data, the number of people who will be arriving at the lobby at some future time and the floors to which those people will be taken away by any car; creating, after execution of a static channelling elevator dispatching routine, a variable number of non-overlapping, contiguous sectors, a floor not being 15 assigned to two or more sectors when the number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floors which number does not exceed a predetermined maximum; -assigning said cart to said sectors; and displaying in the lobby said assignments of cars to sectors.
According to a third aspect of the invention there is provided an elevator system, comprising: a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time traffic data, collected at a first time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; 4b means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; predicting means, for predicting, based on said historical-time and real-time traffic data, the number of people who will be arriving at the lobby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car will service at a particular time; a signal processing me is for determining wher an up-peak condition occurs and, when such condition occurs, 15 for further providing: signals for assigning, after execution of a static channelling elevator dispatching routine, floors to non-overlapping sectors, a floor not being assigned to two or more sectors when the 20 number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector •population, each sector comprising at least one floor but no more than some predetermined maximum number of floors, each sector containing a variable number of floors, said floors in each sector being contiguous, said sectors within the building being contiguous; for combining in adjacent sectors when the sum of the populations of said sectors as given by said summing means is less than a percentage of car capacity; for assigning a sector to a car for transporting passengers to and from said sector; and S4c a. V'>JI for indicating on said floor service indicator means said assignment; and communications means for passing signals between and among said counting means, said predicting means, said floor service indicator means, and said signal processing means.
According to a fourth aspect of the invention there is provided a method of dispatching elevator cars comprising the steps of: retrieving a table of historical-time traffic data, which data consists of counts of the number of passengers who, during an up-peak period, boarded oars at the lobby and deboarded cars at floors other than the lobby, said 15 counts having taken place at a first time; retrieving a table of real-time traffic data, which data consists of counts of the number of people who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said 20 counts having taken place at a second time prior to said retrieving of said real-time traffic data; predicting, based on data collected form said steps of retrieving said historical-time and real-time traffic data, the number of people who will be arriving at the lobby at some future time and the floors to which those people will be taken away be any car; creating, after execution of a static channelling elevator dispatching routine, a variable number of non-overlapping, contiguous sectors, a floor not being assigned to two or more sectors when the number of deboarding counts at said floor when added to said sector causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floors which number does not exceed a predetermined maximum; 4d combining adjacent sectors when the sum of the populations of said sectors as provided by said summing means is less than a percentage of car capacity; assigning said cars to said sectors; and displaying in the lobby [passengers presently awaiting one of said cars] said assignments of cars to sectors.
According to a fifth aspect of the invention there is provided an elevator system, comprising: a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time traffic data, collected at a first time, consisting of 15 counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of 20 the number of passengers who, during an up-peak ,eriod, boarded cars at the lobby and deboarded cars at floors other than the lobby; predicting means, for predicting, based on said historical-time and real-time traffic data, the number of people who will be arriving at the lobby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car wil? service at a particular time; a signal processing means for determining when an up-peak condition occurs and, when such condition occurs, for further providing: signals for assigning, after execution of a &tatic channelling elevator dispatching routine, floors to non-overlapping sectors, a floor not 4e being assigned to two or more sectors when the number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector population, each sector comprising at least one floor but no more than some predetermined maximum number of floors, each sector containing a variable number of floors, said floors in each sector being contiguous, said sectors within the building being contiguous; for combining adjacent sectors wL:en the sum of the populations of said sectors is greater than a percentage of the average number of people per sector; *for assigning a sector to a car for 15 transporting passengers to and from said sector; and for indicating on said floor service indicator means said assignment; *5* and communications means for passing signals between 20 and among said counting means, said predicting mcans, said floor service indicator means, and said signal S" processing means.
According to a sixth aspect of the invention there is provided a method of dispatching elevator cars comprising the steps of: retrieving a table of historical-time traffic data, which data consists of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a first time; retrieving a table of real-time traffic data, which data consists of counts of the number of people who, during an up-peak perio,', boarded cars at the lobby and deboarded cars at floors; other than the lobby, said counts having taken place at a second time prior to said retrieving of said real-time traffic data; f- predicting, based on data collected from said steps of retrieving said historical-time and real-time traffic data, the number of people who will be arriving at the lobby at somp future time and the floors to which those people wil'l be taken away by any car; creating, after execution of a static channelling elevator dispatching routine, a variable number of non overlapping, contiguous sectors, a floor not being assigned to two or mo:e sectors when the number of deboarding counts at said floor, when added to said sector causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floorr which !j number does not exceed a predetermined maximum; 15 combining adjacent sectors when the sum of the populations of said sectors is greater than a percentage of the average number of people per sector; assigning said cars to said sectors; and displaying in the lobby said assignment of cars to 20 sectors.
S::
A preferred embodiment of the invention will now be described, by way of example only, with reference to the accompanying drawings.
re r Brief Description of the Drawings Fig. 1 is a plan view of an elevator system in which the present invention may be 4g Ce..
ft ot gee.
oooe f* Sf eog.
ftftf C ooo f et f C C ecee C e e cc e Fig. 2 is a block diagram of a elevator control system using ring communication; Fig. 3 is a logic flow diagram as may be used in the present invention.
Fig. 4 is a logic flow diagram as may be used in the present invention.
Figs. 5A, 5B and 5C are sector definition tables.
Fig. 6 is a logic flow diagram as may be used in the present invention.
Figs. 7A, 7B, 7C and 7D are tables of the sector assignments.
Best Mode for Carrying Out the Invention.
An exemplary multi-car, multi-floor elevator application, with which the exemplary system of the present invention can be used, is illustrated in Fig. 1. Elevator cars 1-4 serve a building having a plurality of floors. The building has an exemplary 13 floors above a main floor, typically a ground floor or lobby However, some buildings have their main floor at some intermediate or other 20 portion of the building, and the inventio" can be adapted to them as well. Each car 1-4 contains a car operating panel (COP) 12 through which a passenger may make a car call to indicate a destination floor by pressing a button on the COP, producing a signal identifying the floor to which-the 25 passenger intends to travel. On each of the floors there is a hall fixture 14 through which a hall call (HC) is provided to indicate the intended direction of travel by a passenger on the floor. At the lobby there is also a hall call fixture 16, through which a passenger calls the car to the lobby.
The depiction of the elevator system in Fig. 1 is intended to illustrate the selection of cars during an ippeak period, according to the invention, at which time the floors 2-13 above the main floor or lobby are divided into an appropriate number of sectors depending upon the number of cars in operation and the traffic volume, with each C C CC S See.
cc c S e e e e 5 I I sector containing a number of contiguous floors assigned in accordance with the criteria and operation used in the present invention.
The number of sectors into which the building is divided may change based on variations in the values of system traffic parameters.and hence the building traffic. These traffic parameters may be car load weight or hall calls The number of sectors into which the building is divided will be greater than or equal to 1, not a constant.
The number of sectors is assigned such that each sector carries a volume of traffic approximately equal to that of any other sector. At the lobby, there is a floor service indicator (FSI) for each car which shows the temporary, current selection of available floors exclusively reachable 15 from the lobby by the car assigned to that sector, which assignment changes throughout the up-peak period. For distinguishing purposes each sector is given a sector number (SN) and each car is given a car number (CN).
The assignment of floors to sectors snown in Figure 1 represents only the sectors being used at a particular instant in time. The assignment of floors to the sectors shown, and consequently the division of the floors of the b:ilding into sectors, is dynamic, based on traffic variations. As empty cars arrive at the lobby, they are assigned to sectors in "round robin" fashion. Each car receives a sector assignment as it arrives at the lobby.
If, for example, car 4 has just left the lobby and cannot be given a new sector assignment car, one will receive the assignment as soon as it gets to the lobby.
Fig. 1 shows an eyamplary floor-car-sector assignment.
Car 1 is al'. .*ed to be unassicned to a sector; car 2 (CN=2), is assigned to serve the first sector Car 3 (CN=3) serves the second sector and car 4 (CN=4) serves the third sector As Car 1 is not assigned to a sector it may serve none of the floors. The floor service indicator (FSI) for car 2 will display, for example, floors 2-5, the presumed floors assigned to the first sector for this 6 example, to which floors that car will exclusively provide service from the lobby. Car 3 similarly provides service to a second sector, consisting of the floors assigned to that sector, for example floors 5-9, and the FSI for car 4 will show those floors. The FSI for car 4 indicates floors 10-13, the floors assigned to a third sector. Because of the roundrobin assignment of cars to sectors, Car 1, though not functioned at the instant shown, will be assigned the next available sector in the order.
The FSI for car 1 is not illuminated, showing that it is not serving any particular sector at this particular o, instant of time during the up-peak channelling sequence reflected in Figure 1.
Each car will only respond to car calls that are made 15 in the car from the lobby to floors that coincide with the floors in the sector assigned to that car. Car 4, for a e. instance, will only respond to car calls made at the lobby to floors 10-13. It will take passengers from the lobby to those floors (provided car calls are made to those floors) and then return to the lobby empty, unless it is assigned to a hall call.
This system can collect data on demand throughout the day, by means of load weighers, for example, to arrive at *r a historical record of traffic demands for each day of the week and compare it to actual demand to adjust the overall dispatching sequences.
All such signals HC, CC, as well as other signals, like load weight (LW) are read by a door control subsystem 111 and are communicated by means of a ring communication system (Fig There are three microprocessor systems associated with each car controller. Figure 2 shows an eight car group, each car having one operational controller subsystem (OCSS) 101, one door control subsystem (DCSS) 111 and one motion control subsystem (MCSS) 112. Such a system may be found in co-rending application serial number 07/029,495, (Otis Docket No. OT-522) entitled "Two Way Ring Communication 7 System For Elevator Group Control" by Auer and Jirgen (filed March 23, 1987).
There, elevator dispatching may be distributed to separate microprocessor systems, one per car. These microprocessor systems, known as operational control subsystems (OCSS) 101, are all connected together via two serial links (102, 103) i,n a two way ring communication system. Figure 2 shows an eight car group configuration.
For clarity purposes MCSS (112) and DCSS (111) are only shown in relation to a specific OCSS; however, it is to be understood that there would be eight sets of these systems, one set to correspond with each elevator.
Hall buttons and lights, the elevator group related fixtures as opposed to car related fixtures, are 15 connected with remote stations 104 and remote serial communication links 105 to the OCSS 101 via a switch-over module (SOM) 106. The car buttons, lights and switches are connected through remote rftations 107 and serial links 108 to the OCSS 101. Car specific hall features, such as car direction and position indicators, are connected through remote stations 109 and a remote serial link 110 to the OCSS 101.
The car load measurement is periodically read by a door control subsystem (DCSS) 111, which is part of each car 25 controller. This load is sent to motion control subsystem (MCSS) 112, which is also part of each car controller. DCSS 111 and MCSS 112 are microprocessor systems controlling door operation and car motion under the control of the OCSS.
The dispatching function is executed by the OCSS 101, under the control of an advanced dispatcher subsystem (ADSS) 113, which communicates with the OCSS 101 via an information control subsystem (ICSS) 114. The ICSS acts as a communication interface between the elements connected to the ring (OCSSs) and the ADSS. The car load measured may be converted into boarding and deboarding passenger counts by MCSS 112 and sent to OCSS 101. Each OCSS sends this data to the ADSS 113 via ICSS 114.
8 The ADSS, through signal processing, collects the passenger boarding and deboarding traffic data and car departure and arrival data at the lobby, so that, in accordance with its programming, it can predict traffic conditions at the lobby for predicting the start and end of peak periods, for example up-peak and down-peak. The ADSS 113 can also collect passenger boarding and deboarding counts at other floors and car arrival and departure counts for use in up-peak channeling and for varying bonuses and penalties based on predicted traffic. For further information on these techniques see U.S. Pat. No. 4,363,381, "Relative System Response Call Assignments", U.S. Pat. No. 4,323,142, "Dynamically Reevaluated Elevator Call Assignments", both to Bittar, and a magazine article entitled "Intelligent 15 Elevator Dispatching System" of Nader Kameli and Kandasamy ooo. Thangavelu (AI Expert, Sept,, 1989; pp. 32-37), the disclosure of which is also incorporated herein by reference.
The system can collect data on individual and group demands throughout the day to arrive at a historical record of traffic demands for each day of the week and compare it to actual demand to adjust the overall dispatching sequences to achieve a prescribed level of system and individual car performance. Following such an approach, car loading and lobby'traffic may also be analyzed through signals from each car, that indicate car load for each car.
Fig. 3 represents the flow of logic of the methodology of the present invention. The creation of sectors begins at the top of the building. Step 301 works from the fact that the dispatching methodology used before implementatiof of the present methodology was static channeling used during the up-peak period. Step 301 provides that in a system which recently used static channeling, but now will use dynamic channeling, the current sector under construction (SS1) has as its initial defining number the number of static sectors(s) used in the prior channeling scheme. It is initially assumed by the present system that the number of dynamic sectors to be created may be as high as the number 9 of static sectors which already exist. The first step, in effect, sets *a counter. For exampl., if there were 5 static sectors, then the current sector under construction is the fifth sector. There will not be more dynamic sectors created than there were static sectors in the embodiment shown. The maximuia limit on the number of dynamic sectors to be created need not be the number of static sectors uised; the limit can be changed.
Step 302 sets the size of the present sector under construction as equal to all of the floors in the building from the f loor above the lobby to the top floor in the building. The end of the sector under construction (ESi) is the top f loor of the building and the start of the sector under construction (SSl) is the floor above the lobby. Step 15 303 calculates the number of people predicted to be in the sector under construction (NSI) This is done by uising 0 41e 0 0 electrical signals to access a table of traffic data; the table, stored in a memory block associated with a signal e processor, is arrived at by sensing the number of passengers boarding and deboarding over the past several minutes at the same time of day at some earlier time, for example, one or more days ago. The former sensings of boarding/deboarding 0m are accumul~ated t orm a eltime prdcinof the numbe e0.mm of people predicted to be in the sector; the latter are accumulated for making an historic prediction of who will em.:be in the sector. These t,6wo predictions, obtained on the basis of boarding/deboarding data, are combined to provide a still better measure of how many people may be in the .meor une construction. Thsmeasurement isteinput into the present invention. The outputs will be: signals to the OCSS to assign cars to serve certain floors of the building, and signals to a floor service indicator to display information telling which cars are assigned to which floors.
Steps 304-7 work toward the same end: ensuring that the number of people in the sector is equal to a presekt number, usually the number of people in the building divided by the number of sectors. The number of people in the building is 10 estimated from information previously collected through load weighers or other means of collecting boarding/deboarding data. This information is also used "to predict the destinations of passengers. Ideally, the number of people in each sector would be constant. The difference between BAP (beginning average persons per sector window) and EAP (end average persons per sector window) represents the variation from an average number of people in a sector (AP) which is acceptable. BAP represents the beginning of an acceptable window of variation from AP while EAP represents the end of the window. BAP may be, for example, 90% of AP, while EAP is 110% of AP. Step 304, then, determines if the number of people in the sector under construction, NSI, is -less than EAP. If not, then we will want to subtract a floor from the sector, Sl. This will reduce NS1. This is the purpose of Step 305. As SS1 is the nth floor at the bottom of the building, increasing it will make the start of the sector the nth plus 1 floor of the sector; the size of the sector will be correspondingly decreased by one.
Having created a sector which has a population less than EAP, the higher end of a population within acceptable limits of AP, we will want to determine if the sector population has fallen below the limit set by the lower end of the window, namely BAP. Determining whether that condition is true or false is achieved by step 306. If it is true then i one floor will be reduced from the sector, in step 307, but if it is not true then the next step in the creation of the sector will be step 308.
Having created a sector with the desired population, some number of people not above EAP nor below BAP, it is desired to modify the cector such that the number of floors in the sector does not exceed some predetermined number.
Thus, step 308 determines if the number of floors in the sector, the difference between ES1 and SS1, exceeds MP, the maximum number of floors permitted in a sector. Step 309 subtracts a floor from the sector if there are too many floors in the sector. If there are not too many floors in 11 the sector the method of the present invention proceeds to step 310 which determines if every floor in the building has been covered. If not, step 311 reduces by 1 the counter which keeps track of how many sectors have been created.
Step 312 sets the size of the next sector as having in it all the floors in the building from the floor immediately below the bottom floor in the sector just created to the floor just above the lobby. If so, we must ask, in step 313, if the sector creation counter has been decremented to zero showing that the number of dynamic sectors created is the same as the number of static sectors which had been used.
If no, in step 314 the system will reduce the number of sectors to be used to be the number of static sectors which had been used less the number of sectors left over and note 15 the same in a table kept in the memory of ADSS; the table keeps track of how many sectors were created and what the definitions of these sectors are. If yes, in step 315 the sector creation has been completed. Therefore, in step 315: signals are sent from the ADSS to the OCSS to dispatch the elevators according to the sector assignments just obtained; the floor service indicator (Fig. 1) displays which cars are assigned to which sectors. In step 316, the "process is terminated.
The process is then run through again some interval later, during which time new boarding/deboarding information may necessitate restructuring the sectors; the value of S used in step 1 is that obtained in step 314 the first time the process was run through. The cycle will repeat itself as long as up-peak channeling is used.
Figure 4 shows a logic flow diagram for the present invention wherein sector assignments are based on car capacity. Inputs to the system are two: a sector definition table, which includes the sector numbers, (2) the starts of the sectors, the ends of the sectors, and the number of sectors created, and traffic data.
A table showing these inputs might be as seen in Fig. The goal is to combine sectors which are adjacent and have 12 a population less than 100% of a single cars capacity.
Combining of.. the sectors begins at the bottom of the building. This is to decrease the likelihood that sectors in the upper portion of the building will be combined; since the travel time to the upper sectors is longer than the ones below, it is desirable to have smaller sectors at the top of the building. Combined sectors will be larger sectors.
Considering that sectors are numbered from the bottom of the building to the top of the building step 401 denotes that the combining of the sectors will begin at the bottom of the building; the current sector is the zeroth sector. In step 402, the system determines whether the current sector being considered has a value equal to the number of sectors generated by a dynamic channeling method. If so, all of the 15 sectors that may be combined have been combined and the method of the present invention has been completed. If the •value of the current sector is not equal to the number of sectors generated by a dynamic channeling method, it is therefore less than that number, then, in step 404, the number of people in a sector is predicted based on the number of people predicted at each floor. These predictions may be based upon traffic measurements using load weighers, hall call button depressions and car call button depressions.
The present invention does not make these measurements but only accesses a table of these measurements stored in a memory associated with a signal processor. Having determined the population density for each floor including the lobby, the number of people in each sector is calculated. Step 403 .5 having been a step at which the methodology of the present invention terminated. The number of people in two adjacent sectors is NSO(s). This number represents the number of people between the point which is the start of the sector and the end of the adjacent sector Step 405 of the present invention determines whether the number of people in these two sectors is less than 100% of car capacity, and if it is not, the current sector need not be combined with its adjacent sector and the sector to be 13 considered is incremented by one in step 406. If however, the number of people in these two sectors is less than 100% of car capacity (CCP) then step 407 is implemented. In step 407, the end of the current sector is-given the same ending point as the end of the adjacent sector. In step 408, the number of sectors (NOS) generated by a dynamic channeling method is decremented by 1. This is done to reflect the reduction of available sectors by one. This is reflected in the table in Fig. 5B. In step 409, the sector number defining the uppermost sector is removed and rejustified to reflect the current number of sectors. At this point one goal of the present invention has been obtained: adjacent sectors each having populations less than 100% of the car capacity have been combined. A rejustified sector definition 15 table is found in Fig. One could see that it is possible to eventually combine every sector in the building into one large sector. This is desirable in some situations, namely where dynamic channeling is being done but the traffic density is too small to have a number of sectors. Dynamic channeling produces optimal results when the traffic is large enough to support the methodology thereof. Combining many sectors into one G*:i results in greater frequency of sector-to-car assignment which results in better service to sporadic traffic as opposed to traffic that is concentrated in time. In step 403, the new car assignments are communicated to the OCSSs (Fig. 2) for each car so that the cars may carry out their assignments. Also in step 412, the FSIs are updated to reflect the new sector assignments. This process is repeated while dynamic channeling is used after some interval.
Fig. 6 shows the logic flow diagram for the present invention. The combination of sectors begins at the bottom of the building so that the chances of combining sectors at tche top of the building are reduced. Since the travel time to the upper sectors is longer than the ones below, it is desirable to have smaller sectors on top. In a building with floors above the lobby an exemplary embodiment of the 14 invention could be used. The output from the previous channeling scheme would be the input to this procedure and have the form shown in Fig. 7A. Sector combination begins at the bottom of the building with the sector nearest the bottom of the building, the zeroth sector, S=0 in step 601.
In step 602, the average number of people in a sector is calculated. Also in step 602, the optimum number of people in a sector is calculated by muwltiplying 100% or greater by the average number of people in a sector. This is done by sensing the nuiber of people in the building, that being a function of the number of boarding counts at the lobby and deboarding counts at the floors above the lobby (deboarding counts at the lobby and boarding counts at the floors above the lobby will be insignificant during up-peak when people 15 are coming to work), divided by the number of sectors. In step 603, it is determined whether the current sector has S a value equal to the number of sectors generated by a dynamic channeling method. Stated differently, step 603 determines whether every sector generated by dynamic channeling was considered for optimization. If so, the loop is exited in step 604, and the sector assignments are communicated to the OCSSs. At this point an elevator drive system may carry out the sector assignments, and the floor service indicator will obtain the assignments from OCSS memories and display those assignments to passengers. If, however, the current sector S" being considered is not one to have a value equal to the 0*n number of sectors generated by a dynamic channeling method, then the number of people in two adjacent sectors, the current sector, NSO(S) is calculated. This number is the sum of people going to floors starting from the start o) the sector SS(F) to the end of the sector ES(F+1) as predicted by means for counting people boarding and deboarding, for example, car call buttons and hall call buttons. If this number is greater than the optimal average, then the current sector need not be combined with any other sector and the next sector is considered in step 607. If the number of people in a sector is not greater than the optimal average, 15 then, in step 608, the end of the current sector becomes the end of the adjacent sector. At this point, two adjacent sectors have been combined. However, it is undesirable for the number of floors in a sector to exceed a certain maximum number of floors permitted in a sector Thus, in step 609, it is determined whether the number of floors in the newly generated sector is smaller than MP. If not, in step 610 the end point of the current sector is restored such that no combination is effected. If however, the number of floors in the newly generated sector is smaller than MP, then, in step 611, the number of sectors generated by a dynamic channeling method is decremented by 1. This is followed, in step 612, by removing the sector definition for the sector adjacent to the current sector and rejustifying the sector definition table. At this point the sector definition table of Fig. 7A would have the form shown in Fig. 7B. A rejustified table appears in Fig. 7C; NOS now equals two. The process continues until step 604 is 20 a rived at. At this point, one car less is involved in the dispatching and this is reflected on the floor service indicators.
Although the invention has been described with reference to specific examples, it will be appreciated by those skilled in the art that the invention may be embodied in many other forms.
16

Claims (12)

1. An elevator system, comprising: a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time traffic data, collected at a first time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby an deboarded cars at floors other than the lobby; 15 predicting means, for predicting, based on said historical-time and real-time traffic data, the number of 'people whc will be arriving at the lAbby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car will service at a particular time; a signal prncessing means for determining when an up-peak condition occurs and, when such condition occurs, for further providing: signals For assigning, after execution of a static channelling elevator dispatching routine, floors to sectors when the number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector population for assigning the number of floors in a building into a variable number of sectors, which do not overlap when the number of floors included in said sector, each sector comprising at least one floor but no more than some predetermined maximum number of floors, 17 each sector containing a variable number bf floors, said floors in each sector being contiguous, said sectors within the building being contiguous; for assigning a sector to a car for transporting passengers to and from said sector; and for indicating on said floor sssevice indicator means said assignment; and communications means for passing signals between and among said counting means, said predicting means, said floor service indicator means, and said signal processing means.
2. The system of claim 1 wherein adjacent sectors are combined when the sum of the populations of said sectors as given by said summing means is less than 100% of car capacity.
3. The system of claim 1 wherein adjacent sectors are combined when the sum of the populations cf said sectors as given by said summing means is greater than 100% of said average number of people per sector.
4. A method of dispatching elevator cars comprising the steps of: retrieving a table of historical-time traffic data which data consists of counts of the number of passengers 0.0. 5 who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a first time; retrieving a table of real-time traffic data, which data consists of counts of the number of people who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a second time prior to said retrieving of said real-time traffic data; 18 predicting, based on data collected from said steps of retrieving said historical-time and real-time traffic data, the number of people who will be arri'ing at the lobby at some future time and the floors to which those people will be taken away by any car; creating, after execution of a static channelling elevator dispatching routine, a variable number of non-overlapping, contiguous sectors, a floor not being assigned to two or more sectors when the number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floors which number does not exceed a predetermined maximum; assigning said cars to said sectors; and displaying in the lobby said assignments of cars to sectors.
5. The method of claim 4, further comprising thr step of combining adjacent sectors when the sum of the populations of said sectors as given by said summing means is less than 130% of car capacity.
6. The method of claim 4, further comprising the step of combining adjacent sectors when the sum of the populations of said sectors as given by said summing means is greater than 100% of said average number of 5 people per sector.
7. An elevator system, comprising: a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time traffic data, collected at a first time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; 19 means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; predicting means, for predicting, based on said historical--time and real-time traffic data, the number of people who will be arriving at the lobby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car will service at a particular time; a signal processing means for determining when an up-peak condition occurs and, when such condition occurs, for further providing: 25 signals fot assigning, after execution of a S" static channelling elevator dispatching routine, floors to non-overlapping sectors, a floor not being assigned to two or more sectors when the number of deboarding counts at said floor, when 30 added to said sector, causes the sector population to exceed a percentage of the average sector :population, each sector comprising at least one floor but no more than some predetermined maximum number of floors, each sector containing a variable number of floors, said floors in each sector being contiguous, said sectors within the building being contiguous; for combining in adjacent sectors when the sum of the populations of said sectors as given by said summing means is less than a percentage of car capacity; for assigning a sector to a car for transporting passengers to and from said sector; and for indicating on said floor service indicator means said assignment; and 20 communications means for passing signals between and among said counting means, said predicting means, said floor service indicator means, and said signal processing means.
8. A method of dispatching elevator cars comprising the steps of: retrieving a table of historical-time traffic data, which data consists of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a first time; retrieving a table of real-time traffic data, which data consists of counts of the number of people who, 10 during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a second time prior to said retrieving of said real-time traffic data; predicting, based on data collected form said steps 15 of retrieving said historical-time and real-time traffic data, the number of people who will be arriving at the lobby at some future time and the floors to which those people will be taken away be any car; creating, after execution of a static channelling 20 elevator dispatching routine, a variable number of non-overlapping, contiguous sectors, a floor not being aseigned to two or more sectors when the number of deboarding counts at said floor when added to said sector causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floors which number does not exceed a predetermined maximum; combining adjacent sectors when the sum of the populations of said sectors as provided by said summing means is less than a percentage of car capacity; assigning said cars to said sectors; and displaying in the lobby [passengers presently awaiting one of said cars] said assignments of cars to sectors. 21
9. An elevator system, comprising: a plurality of cars for transporting passengers from one floor of a building to another floor in the building; means for retrieving a table of historical-time traffic data, collected at a first time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; means for retrieving a table of real-time traffic data, collected at a second time, consisting of counts of the number of passengers who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby; predicting means, for predicting, based on said historical-time and real-time traffic data, the number S of people who will be arriving at the lobby and the floors to which those people will go; a floor service indicator means, for indicating to passengers which floors a given car will service at a particular time; e a signal processing means for determining when an F up-peak condition occurs and, when such condition occurs, for further providing: signals for assigning, after execution of a static channelling elevator dispatching routine, floors to non-overlapping sectors, a floor not being assigned to two or more sectors when the number of deboarding counts at said floor, when added to said sector, causes the sector population to exceed a percentage of the average sector population, each sector comprising at least one floor but no more than some predetermined maximum number of floors, each sector containing a variable number of floors, said floors in each sector being contiguous, said sectors within the building being contiguous; 22 for comb 'ing adjacent sectors when the sum of the populations of said sectors is greater than a percentage of the average number of people per sector; for assigning a sector to a car for transporting passengers to and from said sector; and for indicating on said floor service indicator means said assignment; and communications means for passing signals between and among said counting means, said predicting means, said floor service indicator means, and said signal processing means.
A method of dispatching elevator cars comprising the steps of: rel:rieving a table of historical-time traffic data, S• which data consists of counts of the number of passengers 5 who, during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a first time; retrieving a table of real-time traffic data, which data consists of counts of the number of people who, 10 during an up-peak period, boarded cars at the lobby and deboarded cars at floors other than the lobby, said counts having taken place at a second time prior ho said retrieving of said real-time traffic data; predicting, based on data collected from said steps of retrieving said historical-time and real-time traffic data, the number of people who will be arriving at the lobby at some future time and the floors to which those people will be taken away by any car; creating, after execution of a static channelling elevator dispatching routine, a variable number of non overlapping, contiguous sectors, a floor not being assigned to two or more sectors when the number of deboarding counts at said floor, when added to said 23 sector causes the sector population to exceed a percentage of the average sector population, each sector containing a variable number of contiguous floors which number does not exceed a predetermined maximum; combining adjacent sectors when the sum of the populations of said sectors is greater than a percentage of the average number of people per sector; assigning said cars to said sectors; and displaying in the lobby said assignment of Dars to sectors.
11. An elevator system substantially as herein described with reference to the accompanying drawings.
12. A method of dispatching elevator cars substantially as herein described with reference to the accompanying drawings. DATED this 6th day of November 1992 OTIS ELEVATOR COMPANY Attorney: PETER HEATHCOTE Fellow Institute of Patent Attorneys of Australia of SHELSTON WATERS 24
AU74160/91A 1990-04-12 1991-04-05 Elevator dynamic channeling dispatching for up-peak period Ceased AU637892B2 (en)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US508312 1983-06-27
US50831390A 1990-04-12 1990-04-12
US50831290A 1990-04-12 1990-04-12
US50831890A 1990-04-12 1990-04-12
US508313 1990-04-12
US508318 1990-04-12

Publications (2)

Publication Number Publication Date
AU7416091A AU7416091A (en) 1991-10-17
AU637892B2 true AU637892B2 (en) 1993-06-10

Family

ID=27414372

Family Applications (1)

Application Number Title Priority Date Filing Date
AU74160/91A Ceased AU637892B2 (en) 1990-04-12 1991-04-05 Elevator dynamic channeling dispatching for up-peak period

Country Status (3)

Country Link
EP (1) EP0452225A3 (en)
JP (1) JPH04226288A (en)
AU (1) AU637892B2 (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3175264B2 (en) * 1992-01-30 2001-06-11 三菱電機株式会社 Elevator group management device
US5883343A (en) * 1996-12-04 1999-03-16 Inventio Ag Downpeak group optimization
CN1201993C (en) 2001-02-12 2005-05-18 因温特奥股份公司 Method of distributing elevator cages into destination call controlling groups
US7083027B2 (en) * 2002-10-01 2006-08-01 Kone Corporation Elevator group control method using destination floor call input
CA2626050C (en) 2005-10-12 2015-12-08 Carl Zeiss Vision Australia Holdings Limited Ophthalmic lens element for myopia correction
KR101444480B1 (en) 2006-09-15 2014-09-24 칼 자이스 비전 오스트레일리아 홀딩스 리미티드 Refractive optical body for progressive ophthalmic lens and method of designing it
TWI467266B (en) 2007-10-23 2015-01-01 Vision Crc Ltd Ophthalmic lens element
JP5566740B2 (en) * 2010-03-19 2014-08-06 東芝エレベータ株式会社 Elevator group management control device
CN103935850B (en) * 2014-04-23 2016-01-06 苏州汇川技术有限公司 Elevator group controlling partition method, elevator multiple control device and system
CN108367880B (en) * 2015-11-24 2021-08-10 通力股份公司 Control method for elevator control system
WO2017216416A1 (en) 2016-06-17 2017-12-21 Kone Corporation Computing allocation decisions in an elevator system
EP3519336A4 (en) 2016-09-29 2020-06-10 KONE Corporation Electronic information plate of an elevator component
CN107601191B (en) * 2017-08-30 2019-04-09 西安财经学院 A kind of elevator operation mode and elevator planning method of peak time of going to work
US11027943B2 (en) 2018-03-29 2021-06-08 Otis Elevator Company Destination dispatch sectoring
CN110950197B (en) * 2019-12-12 2022-04-01 中国联合网络通信集团有限公司 Selection method of intelligent elevator and intelligent elevator control device
CN114920097B (en) * 2022-06-07 2023-08-01 上海三菱电梯有限公司 Elevator group management method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU1747767A (en) * 1967-02-09 1968-08-15 Multiple zoned elevator control system
AU442308B2 (en) * 1970-12-09 1973-10-31 Otis Elevator Company Zoned elevator control system including an arrangement for controlling the operation of cars in response tothe level of traffic inthe zones
AU1778388A (en) * 1987-06-17 1988-12-22 Kone Corporation Method for sub-zoning of an elevator group

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3648805A (en) * 1963-09-24 1972-03-14 Westinghouse Electric Corp Available car elevator system
US4536842A (en) * 1982-03-31 1985-08-20 Tokyo Shibaura Denki Kabushiki Kaisha System for measuring interfloor traffic for group control of elevator cars
US4846311A (en) * 1988-06-21 1989-07-11 Otis Elevator Company Optimized "up-peak" elevator channeling system with predicted traffic volume equalized sector assignments

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU1747767A (en) * 1967-02-09 1968-08-15 Multiple zoned elevator control system
AU442308B2 (en) * 1970-12-09 1973-10-31 Otis Elevator Company Zoned elevator control system including an arrangement for controlling the operation of cars in response tothe level of traffic inthe zones
AU1778388A (en) * 1987-06-17 1988-12-22 Kone Corporation Method for sub-zoning of an elevator group

Also Published As

Publication number Publication date
EP0452225A2 (en) 1991-10-16
AU7416091A (en) 1991-10-17
EP0452225A3 (en) 1992-02-19
JPH04226288A (en) 1992-08-14

Similar Documents

Publication Publication Date Title
EP0348151B1 (en) Optimized "up-peak" elevator channeling system
EP0450766B1 (en) "Up-peak" elevator channeling system with optimized preferential service to high intensity traffic floors
AU637892B2 (en) Elevator dynamic channeling dispatching for up-peak period
EP0348152B1 (en) Queue based elevator dispatching system using peak period traffic prediction
EP0444969B1 (en) "Artificial Intelligence" based learning system predicting "Peak-Period" times for elevator dispatching
JP2509727B2 (en) Elevator group management device and group management method
JP2730788B2 (en) Elevator group management method and group management device
US5663538A (en) Elevator control system
US5168133A (en) Automated selection of high traffic intensity algorithms for up-peak period
US5511634A (en) Instantaneous elevator up-peak sector assignment
JPH02110088A (en) Group control unit for elevator
AU612780B2 (en) Contiguous floor channeling with up hall call elevator dispatching
US5241142A (en) "Artificial intelligence", based learning system predicting "peak-period" ti
US4804069A (en) Contiguous floor channeling elevator dispatching
EP0328423B1 (en) Contiguous floor channeling elevator dispatching
JPH064475B2 (en) Elevator group management device
JPH0712890B2 (en) Elevator group management control device
Closs Lift control-conservatism or progress
Thangavelu Artificial intelligence based learning system predicting ‘peak-period’times for elevator dispatching
Thangavelu et al. Artificial intelligence", based learning system predicting" peak-period" ti

Legal Events

Date Code Title Description
MK14 Patent ceased section 143(a) (annual fees not paid) or expired