EP0846642B1 - Gruppenoptimierungssystem für Abwärtsspitzenverkehr - Google Patents
Gruppenoptimierungssystem für Abwärtsspitzenverkehr Download PDFInfo
- Publication number
- EP0846642B1 EP0846642B1 EP97120534A EP97120534A EP0846642B1 EP 0846642 B1 EP0846642 B1 EP 0846642B1 EP 97120534 A EP97120534 A EP 97120534A EP 97120534 A EP97120534 A EP 97120534A EP 0846642 B1 EP0846642 B1 EP 0846642B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- groups
- group
- cars
- overlapping
- allocable
- 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.)
- Expired - Lifetime
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/02—Control systems without regulation, i.e. without retroactive action
- B66B1/06—Control systems without regulation, i.e. without retroactive action electric
- B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
- B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages
- B66B1/20—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages and for varying the manner of operation to suit particular traffic conditions, e.g. "one-way rush-hour traffic"
Definitions
- the present invention relates to a System for optimizing the allocation of elevator down-peak traffic in an elevator group.
- Elevator control systems are computer controlled Handling strategy for assigning elevator traffic applied according to a time-oriented algorithm.
- a strategy with time-based Algorithm is described in U.S. Patent No. 4,492,288 all of which are expressly referred to here becomes.
- patent 4,492,288 there are down hall calls combined to form groups based on a rough chronological order of entered hall calls based.
- the down hall calls are in time Order stored in a RAM.
- the oldest call becomes an elevator cabin with the highest priority assigned, and the next oldest call is based on the specific circumstance either the elevator car with the highest priority or a cabin with second priority allocated.
- U.S. Patent No. 5,480,006 Another system for assigning down hall calls is disclosed in U.S. Patent No. 5,480,006.
- the system divides the building into a number of Sectors that are the same as for downward peak traffic available number of cabins is. All other floors are redistributed to the lower one.
- a specific sector becomes a cabin depending on the age of the sector assigned. After assigning the sector, the cabin parks on top of the sector until a down hall call is made and serves the down hall calls from highest to highest lowest.
- the present invention may accordingly to a group optimization system for use with a Multi-cabin elevator group for the allocation of each cabin in the elevator group to operate a predefined one Within a predetermined number of times Group serving floors.
- the Group optimization system can provide a device for specifying of assignable cabins to operate the predefined Contain the need for a device for determining a specified number of cabins and a device for Initialization of a response area for the Elevator group contains.
- the response area can be a include predetermined number of adjacent floors.
- the group optimization system can also be a device for Storage of landing call requests, one device to scan the storage means to determine more specific Floors requesting elevator service and one Device for grouping the operator requesting specific floors in an order of one top floor to bottom floor included.
- the grouping device can not overlap groups with a size smaller than or equal to the response range.
- the system can also include a device for comparing a Number of those not formed by the grouping means overlapping groups with the specified number of assignable Cabins and a device for allocation of a one-time of the non-overlapping groups to each of the assignable Cabins included.
- the present Invention can equal the number of non-overlapping groups the number of cabins that can be allocated.
- the number of non-overlapping groups be greater than the number of assignable cabins specified.
- the comparison device can be a device to increase the response range by one floor if the Number of non-overlapping groups larger than the number specified assignable cabins is included.
- the system is a device for regrouping the specific operation requesting floors in one Order from top to bottom Floor included.
- the regrouping device can non-overlapping regrouped groups with one size less than or equal to the increased response range.
- the system provide a device for comparing a Number of non-overlapping regrouped groups with the Number of specified assignable cabins included, and the Allocation device can also be any of the allocable Cabins a unique one of the non-overlapping regrouped Allocate groups if the number does not overlap Groups less than or equal to the number of assignable specified Cabins is.
- the comparison device can be a device to increase the response range by one floor if the Number of non-overlapping regrouped groups greater than the number of specified assignable cabins is included, and the system can rearrange the steps specific operation requesting floors, comparing the number of regrouped groups and increasing the Repeat the response range until the number of not overlapping regrouped groups less than or equal to Number of allocable cabins specified.
- the system can be invented by initiating a Downward peak hours can be activated.
- the scanner can control the scanner to a specified Time after allocation of the allocable cabins Recapture storage device to specific To determine service-demanding floors.
- the grouping device specific operation requesting floors in one - Order from top to bottom Floor, the grouping means not overlapping Groups with a size equal to the response area for each Group above a lowest formed group and with a size less than or equal to the response range for the lowest educated group forms.
- the present invention can relate to Process for optimizing elevator car allocation in a multi-cabin elevator group refer to each cabin in the elevator group operating a predefined Allocate as needed.
- the elevator group can one Operate predetermined number of floors.
- the Group optimization procedures can specify assignable Cabins for serving the predefined needs and for Determination of a number of specified cabins and the Initialization of a response area for the Include elevator group, the response area a includes a predetermined number of adjacent floors.
- the method can also scan for pending Landing calls to determine specific Elevator operation requesting floors that Grouping of specific service requests Floors in an order from a top floor to a bottom floor and not making overlapping groups with a size smaller than that Response range and comparing a number of through the grouping means formed do not overlap Groups with the specified number of assignable cabins include.
- the procedure can also be the allocation of a unique of the non-overlapping groups to each of the assignable cabins included.
- According to another feature of the present Invention can equal the number of non-overlapping groups the number of cabins that can be allocated.
- According to yet another characteristic of the present Invention can increase the number of non-overlapping groups than the number of assignable cabins specified.
- According to another feature of the present Invention can increase the method Response area by one floor if the number is not overlapping groups larger than the number of specified assignable cabins is included.
- According to another feature of the present Invention can rearrange the method specific operation requesting floors in one Order from top to bottom Floor and forming non-overlapping regrouped Groups with a size equal to the increased response range and with a size less than or equal to the increased Response area for a lowest educated group and Compare a number of non-overlapping regrouped groups with the number of given assignable Cabins included.
- the procedure can also allocate a unique one of the non-overlapping regrouped ones Groups to each of the assignable cabins if the number non-overlapping groups less than or equal to the number specified assignable cabins is included.
- According to yet another characteristic of the present Invention can increase the method Response area by one floor if the number is not overlapping regrouped groups greater than the number specified assignable cabins is included. Can too the procedure repeating the regrouping steps floors requiring specific operation, Compare the number of regrouped groups and increase of the response range until the number does not overlap regrouped groups less than or equal to the number of specified assignable cabins is included.
- the method by initiating a Peak traffic time can be activated.
- According to another feature of the present Invention can postpone the process at a specified time Allocation of the allocable cabins the repeated scanning of the upcoming hall calls to determine Elevator operation requesting specific floors contain.
- the method can be grouping specific Operation requesting floors in an order of a top floor to a bottom floor and Form non-overlapping groups with one size equal to the response area for each group above one lowest educated group and with a size smaller equal to the response area for the lowest educated Group included.
- An elevator control system to optimize the Downward peak traffic according to the present invention shown generally in Figure 1 and similar to that in US Pat. 4,492,288 disclosed system on the Revelation in its entirety expressly reference here is taken.
- An elevator shaft 1 for an elevator A For example, an elevator group contains three Elevators shown as A, B and C.
- a Elevator cabin 4 is guided in elevator shaft 1 and by any suitable lifting or driving machine 2 by a lifting cable 3 or another similar Lifting device driven.
- the building can be an exemplary elevator system for example fifteen floors E1-E15 to be operated contain.
- the lifting or driving machine 2 can by a Drive control such as that shown in U.S. Patent No. 4 337 847, are controlled, on the disclosure of which in all of which are incorporated herein by reference.
- the Drive control can be a microcomputer system 5 for Implementation of reference value generation, the automatic Regulation and control functions and the initiation of stopping contain and can furthermore measuring and setting elements 6 contain such a drive control, which has a first interface IF1 with the microcomputer system 5 are connected.
- the microcomputer systems 5 of each Elevators A, B and C have a comparator 7 and one second interface IF2 and over Common line transmission system 8 and a third Interface IF3 interconnected. In this way the microcomputer system 5 forms a group control, such as for example, those described in U.S. Patent No. 4,335,705 the disclosure of which in its entirety is detailed herein Reference is made.
- the Microcomputer system 5 may also include a scanner 10 included, which RAM1 scans to identify which ones There are pending floor / hall calls, and stores the corridors in an allocation memory 11.
- the Scanning device 10 can with one in one programmable read-only memory, e.g. an EPROM, stored software function are implemented, and the Allocation memory 11 can be any conventional storage device, including for example a random access memory (RAM - random access memory).
- the scanner 10 can be activated when the elevator system in the down-peak hours, e.g. at 4:30 p.m.
- the time cannot be internal shown clock can be monitored.
- RAM1 is cleared and with the next series of floor / hall calls filled.
- the scanner 10 can be on Wait release signal from an allocation device 20, by a periodic timer or another suitable device can be implemented. This means, after allocation of those stored in the allocation memory 11
- Floor / hall calls to the available elevator cars for Operation of scanning traffic can Allocation device 20 of the scanning device signal the next number of waiting floors / hall calls pass.
- a switching system or Switching arrangement 9 can be used.
- During the Down-peak traffic time can be an input side Switching system 9 by means of a transmission device 12, which Descent and descent corridor calls in chronological order or time sequence of your input, with Descending or down hall call transmitters 13 connected his.
- the time input of down hall calls is transmitted to a circuit 14 via the switching system 9.
- Circuit 14 may be coupled to RAM1 to for a logical "high” or every pending landing call to display a logical "1". As shown, this can RAM1 one entry for each floor of the building, e.g. 15 Entries.
- the RAM1 can then with a sequence of oil and oil, operation on one Show expected users on the specified floor.
- the example shown in Figure 1 contains RAM1 down hall calls for floors E15, E13 and E5.
- the transmitter 12 After switching to a down-peak traffic time the transmitter 12 gives the floor locations for each Actuation of the descent or down hall call transmitters 13 continued in chronological order. For example, suppose that when operating the downward peak traffic function the Time sequence followed by entry of down hall calls E14 of E13 and then E15. Every downward corridor call is passed on to the circuit 14 via the switching system 9. Circuit 14 outputs each floor location Floor / hall call memory RAM1 continues where it is stored until the scanner 10 is released.
- the Scanning device After scanning the floor / hall call memory RAM1 and storage of the upcoming down hall call locations, e.g. E14, E13 and E15 in the allocation memory 11 by the Scanning device can, for example, in the Allocation device 20 stored program for Optimization of the assignable elevator cabins to respond downward peak traffic, i.e. on Downward peak traffic optimization system, for use come.
- FIG. 2 shows an exemplary flow diagram of the optimization system according to the invention for Down peak traffic.
- the flow chart begins with the Initiation of downward peak hours.
- the down-peak rush hour is generally an evening one Rush hour and can start, for example, at 4:30 p.m.
- the Time of day can be indicated by an internal clock or not shown similar device can be monitored.
- step 201 the optimization system for Down-peak traffic a group size for that Initialize the elevator group.
- the group size can be one predetermined number of floors to which one address any specific elevator group properly can. Assume the group size is on five floors then each down-peak traffic group can only respond to three hall calls per cycle.
- the group size can be determined by looking at the number be determined by cabins that respond to the Downward peak traffic and the number of floors in the Buildings can be allocated. Take for example indicate that the present invention in a fifteen-story Building is used and that the system to respond to Downward peak traffic then used three elevator cars the group size can be divided by dividing the total number of Floors through the assignable elevator cabins determine. In this particular example, the Group size five. So the largest group is that can be allocated to a single elevator car, one Group with five floors.
- the Step 202 a floor separation (response area) value First specification of floor separation (or area) between the first and last assignable to each group Call initialized.
- the Floor separation value initially specified as "1" is the Range of calls between the first and last assigned call "1" floor or two neighboring Floors.
- the range of values of calls for the elevator group a top floor with down hall calls and a number of floors below the first call corridor equal to the specific one Floor separation value included. So if the Floor separation value, for example, initiated as "1" each group is no larger than two neighboring ones Floors. If, for example, a highest floor / hall call comes from floor E10, then that is the first group of assignable range of calls Floors E10 and E9. All floor / hall calls that have their origin under floor E9, one group created below.
- Down floor / hall calls can be queried.
- this scanning by a Scanning device 10 are performed, which the in chronological order in the floor / hall call memory RAM1 samples entered values.
- the samples can then be stored in an allocation memory 11.
- the Allocation memory 11 contains a "snapshot" of the sampled storey / corridor call memory RAM1. So shows the allocation memory 11 indicates whether from a particular one Floor a down call has been issued and which Floors downward peak traffic allocation by the Require optimization system for downward peak traffic.
- FIG. 3 provides an example of the floor / hall call memory RAM1 where the calls are in chronological order are saved.
- Figure 4 shows an example of the Allocation memory 11 after scanning the floor / hall call memory RAM1 by scanner 10.
- the allocation memory 11 shows by a logical "1" at which floors pending down calls and / or which floors the address by an assignable down-peak traffic elevator cabin require.
- the Allocation memory 11 simply indicate which floors have requested downward operation, i.e. Floors E15, E14, E13, E11, E10, E9 and E7.
- the system can count the number of Groups starting with, for example, the top one Floor / hall call floor E15 to determine the To start grouping.
- Figure 5 shows an example of a first grouping by the optimization system for Down peak traffic.
- Group g1 can initially call from top down hall call, e.g.
- group g1 may initially be E15 and E14 included.
- the group g2 can be the next in Floor / hall call memory stored down floor / hall call included that is not in group g1 is included, e.g. E13.
- Group g2 can only E13 included as the only other floor that is for inclusion to group g2 as determined by the initial Floor separation value of "1" is available, only E12 would include.
- Group g3 can the next stored floor / corridor call, e.g. E11 and also E10, contain.
- Group g4 can contain E9.
- the group g5 can contain E7.
- each group has at least one Floor / corridor call must contain. It should also be noted that it is not necessary that every floor in the Grouping scheme is included. The grouping should but does not contain overlapping group members, i.e. each group is not formed overlapping.
- step 205 After the groups have been created for the first time in step 205 the number of specified groups with the total number of available to service the downward peak traffic load Elevator cabins are compared. Suppose the system is with three to service the downward peak traffic load available elevator cabins, then the three Elevators five in the initial grouping of the down hall calls formed groups not in an adequate way work off.
- step 207 If the system initially had a number of groups specifies which is greater than the total number to be used of the groups available elevator cabins, then that can Optimization system for downward peak traffic in step 207 increase the floor separation value by a value of "+1", so that the floor separation value can now be "2". So For example, each group can now have three neighboring groups Floors included.
- the flow chart returns to step 204 back to groups according to the new floor separation or to form the new response value range. So it shows Figure 6 shows an example of after increasing the response range by the optimization system according to the invention for the Downward peak traffic grouping.
- step 205 the optimization system for the Downward peak traffic count that three groups are formed have been.
- step 206 the system can now determine whether the number of designated groups is equal to that Number of available elevator cabins is. So the system can in step 208 the floor locations now correspond to the corresponding ones Allocate elevator cabins to reduce the downward traffic load serve.
- step 202 After assignment of the elevator cabins to respond that can affect the downward peak traffic needs Optimization system for downward peak traffic to step 202 return to the floor separation or the Initialize response range to "1" and steps 203 - Repeat 208.
- the building once queried and a "snapshot" of the present pending downstairs floor / hall calls are saved and used for the steps grouping-increasing-grouping.
- the "snapshot" deleted and the system repeats itself from the Initialization of the response area.
- the system when the number of educated Groups smaller than the number of available for allocation Cabins is the cab with the most advantageous response path the corresponding one-time groups of down calls will allocate.
- An additional advantage of the present invention is that the present system in Elevator zone systems, i.e. where specified cabins Zones or floors of a building are assigned, can be used. So can the routine discussed above optionally in each predefined building zone zone-wise optimization of downward peak traffic is used become.
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Elevator Control (AREA)
- Feedback Control In General (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Steroid Compounds (AREA)
- Traffic Control Systems (AREA)
- Indicating And Signalling Devices For Elevators (AREA)
- Telephonic Communication Services (AREA)
Description
Claims (10)
- Gruppenoptimierungssystem zur Verwendung in einer Mehrkabinen-Fahrstuhlgruppe (A, B, C) zur Zuteilung jeder Kabine (4) in der Fahrstuhlgruppe (A, B, C) für die Bedienung eines vordefinierten Bedarfs, wobei eine Fahrstuhlgruppe (A, B, C) eine vorbestimmte Anzahl von Stockwerken bedient und das Gruppenoptimierungssystem folgendes umfaßt:einen Zuteilungsspeicher (11) von zuteilbaren Kabinen (4) zur Bedienung des vordefinierten Bedarfs, wobei der Zuteilungsspeicher (11) eine Anzahl Kabinen (4) bestimmt;eine Zuteilungsvorrichtung (20)
zum Initialisieren eines Ansprechbereichs für die Fahrstuhlgruppe (A, B, C), wobei der Ansprechbereich eine vorbestimmte Anzahl von benachbarten Stockwerken umfaßt;eine Abtastvorrichtung (10) für anstehende Fluraufrufe zur Bestimmung von spezifischen Stockwerken, die Fahrstuhlbedienung anfordern;und dass die Zuteilungsvorrichtung (20) zuständig ist
zum Gruppieren der spezifischen Bedienung anfordernden Stockwerke in einer Reihenfolge von einem obersten Stockwerk zu einem untersten Stockwerk, wobei die Zuteilungsvorrichtung (20) nicht überlappende Gruppen (g1, g2,.., g5) mit einer Größe kleiner gleich dem Ansprechbereich bildet;
zum Vergleichen einer Anzahl durch die Zuteilungsvorrichtung (20) gebildeten nicht überlappenden Gruppen (g1, g2,.., g5) mit der angegebenen Anzahl von zuteilbaren Kabinen (4);
zum Zuordnen einer einmaligen der nicht überlappenden Gruppen (g1, g2,.., g5) zu jeder der zuteilbaren Kabinen (4). - Gruppenoptimierungssystem nach Anspruch 1, wobei die Anzahl nicht überlappender Gruppen (g1, g2,.., g5) gleich der Anzahl oder grösser als die Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Gruppenoptimierungssystem nach Anspruch 1, wobei die Zuteilungsvorrichtung (20) den Ansprechbereichs um ein Stockwerk erhöht, wenn die Anzahl nicht überlappender Gruppen (g1, g2,.., g5) größer als die Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Gruppenoptimierungssystem nach Anspruch 3, weiterhin mitder Zuteilungsvorrichtung (20) zum Umgruppieren der spezifischen Bedienung anfordernden Stockwerke in einer Reihenfolge von einem obersten Stockwerk zu einem untersten Stockwerk, wobei die Zuteilungsvorrichtung (20) nicht überlappende umgruppierte Gruppen (g1, g2,.., g5) mit einer Größe gleich dem erhöhten Ansprechbereich und mit einer Größe kleiner gleich dem erhöhten Ansprechbereich für eine niedrigste gebildete Gruppe (g1, g2,.., g5) bildet und die Anzahl der nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) mit der Anzahl angegebener zuteilbarer Kabinen (4) vergleicht;
- Gruppenoptimierungssystem nach Anspruch 4, wobei die Zuteilungsvorrichtung (20) den Ansprechbereich um ein Stockwerk erhöht, wenn die Anzahl nicht überlappender umgruppierter Gruppen (g1, g2,.., g5) größer als die Anzahl angegebener zuteilbarer Kabinen (4) ist; unddas Optimierungssystem die Schritte des Umgruppierens der spezifischen Bedienung anfordernden Stockwerke, Vergleichens der Anzahl der umgruppierten Gruppe (g1, g2,.., g5) und Erhöhens des Ansprechbereichs wiederholt, bis die Anzahl der nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) kleiner gleich der Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Verfahren zur Optimierung der Fahrstuhlkabinenzuteilung in einer Mehrkabinen-Fahrstuhlgruppe (A, B, C) zur Zuteilung jeder Kabine (4) in der Fahrstuhlgruppe (A, B, C) für die Bedienung eines vordefinierten Bedarfs, wobei eine Fahrstuhlgruppe (A, B, C) eine vorbestimmte Anzahl von Stockwerken bedient, wobei das Gruppenoptimierungsverfahren folgendes umfaßt:Angeben von zuteilbaren Kabinen (4) für die Bedienung des vorbestimmten Bedarfs und zur Bestimmung einer Anzahl von angegebenen Kabinen (4);Initialisieren eines Ansprechbereichs (202) für die Fahrstuhlgruppe (A, B, C), wobei der Ansprechbereich (202) eine vorbestimmte Anzahl benachbarter Stockwerke enthält;Abtasten auf anstehende Fluraufrufe (203) zur Bestimmung spezifischer Fahrstuhlbedienung anfordernder Stockwerke;Gruppieren der spezifischen Bedienung (204) anfordernden Stockwerke in einer Reihenfolge von einem obersten Stockwerk zu einem untersten Stockwerk und Bilden von nicht überlappenden Gruppen (g1, g2,.., g5) mit einer Größe kleiner gleich dem Ansprechbereich;Vergleichen einer Anzahl (206) der durch das Gruppierungsmittel gebildeten nicht überlappenden Gruppen (g1, g2,.., g5) mit der angegebenen Anzahl zuteilbarer Kabinen (4); undZuteilen (208) einer einmaligen der nicht überlappenden Gruppen (g1, g2,.., g5) zu jeder der zuteilbaren Kabinen (4).
- Gruppenoptimierungsverfahren nach Anspruch 6, wobei die Anzahl nicht überlappender Gruppen (g1, g2,.., g5) gleich der Anzahl oder grösser als die Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Gruppenoptimierungsverfahren nach Anspruch 6, mit Erhöhen des Ansprechbereichs um ein Stockwerk (207), wenn die Anzahl nicht überlappender Gruppen (g1, g2,.., g5) größer als die Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Gruppenoptimierungsverfahren nach Anspruch 8, weiterhin mit folgendem:Umgruppieren (204) der spezifischen Bedienung anfordernden Stockwerke in einer Reihenfolge von einem obersten Stockwerk zu einem untersten Stockwerk und Bilden von nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) mit einer Größe gleich dem erhöhten Ansprechbereich und mit einer Größe kleiner gleich dem erhöhten Ansprechbereich für eine niedrigste gebildete Gruppe (g1, g2,.., g5);Vergleichen (206) einer Anzahl der nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) mit der Anzahl angegebener zuteilbarer Kabinen (4); undZuteilen (208) einer einmaligen der nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) zu jeder der zuteilbaren Kabinen (4), wenn die Anzahl nicht überlappender Gruppen (g1, g2,.., g5) kleiner gleich der Anzahl angegebener zuteilbarer Kabinen (4) ist.
- Gruppenoptimierungsverfahren nach Anspruch 9, mit Erhöhen des Ansprechbereichs (207) um ein Stockwerk, wenn die Anzahl nicht überlappender umgruppierter Gruppen (g1, g2,.., g5) größer als die Anzahl angegebener zuteilbarer Kabinen ist (4); und
wobei das Verfahren die Schritte des Umgruppierens (204) der spezifischen Bedienung anfordernden Stockwerke, Vergleichens (206) der Anzahl umgruppierter Gruppen (g1, g2,.., g5) und Erhöhens des Ansprechbereichs (207) wiederholt, bis die Anzahl der nicht überlappenden umgruppierten Gruppen (g1, g2,.., g5) kleiner gleich der Anzahl angegebener zuteilbarer Kabinen (4) ist.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/758,827 US5883343A (en) | 1996-12-04 | 1996-12-04 | Downpeak group optimization |
US758827 | 1996-12-04 |
Publications (2)
Publication Number | Publication Date |
---|---|
EP0846642A1 EP0846642A1 (de) | 1998-06-10 |
EP0846642B1 true EP0846642B1 (de) | 2004-09-01 |
Family
ID=25053268
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP97120534A Expired - Lifetime EP0846642B1 (de) | 1996-12-04 | 1997-11-24 | Gruppenoptimierungssystem für Abwärtsspitzenverkehr |
Country Status (11)
Country | Link |
---|---|
US (1) | US5883343A (de) |
EP (1) | EP0846642B1 (de) |
JP (1) | JPH10167590A (de) |
CN (1) | CN1081161C (de) |
AT (1) | ATE275087T1 (de) |
AU (1) | AU730667B2 (de) |
BR (1) | BR9706232A (de) |
CA (1) | CA2223138A1 (de) |
DE (1) | DE59711882D1 (de) |
HK (1) | HK1011201A1 (de) |
ZA (1) | ZA9710915B (de) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4870863B2 (ja) * | 2000-04-28 | 2012-02-08 | 三菱電機株式会社 | エレベータ群最適管理方法、及び最適管理システム |
CN1201993C (zh) * | 2001-02-12 | 2005-05-18 | 因温特奥股份公司 | 将电梯轿厢分配成目标呼叫控制组的方法 |
FI113259B (fi) * | 2002-06-03 | 2004-03-31 | Kone Corp | Menetelmä hissiryhmän hissien ohjaamiseksi |
US7152714B2 (en) * | 2003-05-19 | 2006-12-26 | Otis Elevator Company | Elevator car separation based on response time |
AU2003251308A1 (en) * | 2003-05-19 | 2004-12-13 | Otis Elevator Company | Elevator car separation based on response time |
CN100491223C (zh) * | 2003-07-21 | 2009-05-27 | 奥蒂斯电梯公司 | 具有长呼梯应答的电梯下行高峰分段 |
CN100482560C (zh) * | 2003-08-06 | 2009-04-29 | 奥蒂斯电梯公司 | 一种控制电梯轿厢运行的方法 |
KR101024799B1 (ko) * | 2003-10-08 | 2011-03-24 | 오티스 엘리베이터 컴파니 | 승강기 통행 제어 |
US7490698B2 (en) * | 2003-10-08 | 2009-02-17 | Otis Elevator Company | Elevator traffic control |
US7921968B2 (en) * | 2005-03-18 | 2011-04-12 | Otis Elevator Company | Elevator traffic control including destination grouping |
DE102012022301A1 (de) | 2012-11-14 | 2014-05-15 | Bürkert Werke GmbH | BUS-System mit Teilnehmern, die Produzent und/oder Konsumenten von Prozesswerten sind, Vorrichtung umfassend ein BUS-System, fluidisches System mit einem BUS-System undVerfahren zum Betrieb eines BUS-Systems |
WO2016126688A1 (en) * | 2015-02-05 | 2016-08-11 | Otis Elevator Company | Operational modes for multicar hoistway systems |
US11027943B2 (en) | 2018-03-29 | 2021-06-08 | Otis Elevator Company | Destination dispatch sectoring |
CN112469653B (zh) * | 2018-07-24 | 2023-03-10 | 蓝鳗鱼株式会社 | 远程控制装置以及远程控制系统 |
JP7018846B2 (ja) * | 2018-07-31 | 2022-02-14 | 株式会社日立製作所 | 循環型マルチカーエレベーター及び循環型マルチカーエレベーター制御方法 |
CN109626150A (zh) * | 2018-11-14 | 2019-04-16 | 深圳壹账通智能科技有限公司 | 电梯调配方法及系统 |
KR102346361B1 (ko) * | 2019-11-07 | 2022-01-04 | 현대엘리베이터주식회사 | 선입선출 방식에 기초한 엘리베이터 제어 방법 |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4063620A (en) * | 1976-07-09 | 1977-12-20 | Westinghouse Electric Corporation | Elevator system |
CH649517A5 (de) * | 1979-09-27 | 1985-05-31 | Inventio Ag | Antriebssteuereinrichtung fuer einen aufzug. |
US4305479A (en) * | 1979-12-03 | 1981-12-15 | Otis Elevator Company | Variable elevator up peak dispatching interval |
CH648001A5 (de) * | 1979-12-21 | 1985-02-28 | Inventio Ag | Gruppensteuerung fuer aufzuege. |
CH658852A5 (de) * | 1982-04-08 | 1986-12-15 | Inventio Ag | Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs. |
AU637892B2 (en) * | 1990-04-12 | 1993-06-10 | Otis Elevator Company | Elevator dynamic channeling dispatching for up-peak period |
GB2251093B (en) * | 1990-10-01 | 1994-11-16 | Toshiba Kk | Apparatus for elevator group control |
US5317114A (en) * | 1991-11-27 | 1994-05-31 | Otis Elevator Company | Elevator system having dynamic sector assignments |
JP3175264B2 (ja) * | 1992-01-30 | 2001-06-11 | 三菱電機株式会社 | エレベーターの群管理装置 |
US5480006A (en) * | 1993-07-16 | 1996-01-02 | Otis Elevator Company | Elevator downpeak sectoring |
-
1996
- 1996-12-04 US US08/758,827 patent/US5883343A/en not_active Expired - Fee Related
-
1997
- 1997-11-24 AT AT97120534T patent/ATE275087T1/de not_active IP Right Cessation
- 1997-11-24 EP EP97120534A patent/EP0846642B1/de not_active Expired - Lifetime
- 1997-11-24 DE DE59711882T patent/DE59711882D1/de not_active Expired - Fee Related
- 1997-12-02 CA CA002223138A patent/CA2223138A1/en not_active Abandoned
- 1997-12-02 AU AU46791/97A patent/AU730667B2/en not_active Ceased
- 1997-12-03 CN CN97125401A patent/CN1081161C/zh not_active Expired - Fee Related
- 1997-12-04 ZA ZA9710915A patent/ZA9710915B/xx unknown
- 1997-12-04 JP JP9334689A patent/JPH10167590A/ja active Pending
- 1997-12-04 BR BR9706232-4A patent/BR9706232A/pt unknown
-
1998
- 1998-11-26 HK HK98112340A patent/HK1011201A1/xx not_active IP Right Cessation
Also Published As
Publication number | Publication date |
---|---|
ZA9710915B (en) | 1998-06-15 |
MX9709232A (es) | 1998-09-30 |
AU4679197A (en) | 1998-06-11 |
CN1081161C (zh) | 2002-03-20 |
EP0846642A1 (de) | 1998-06-10 |
CA2223138A1 (en) | 1998-06-04 |
DE59711882D1 (de) | 2004-10-07 |
US5883343A (en) | 1999-03-16 |
CN1190641A (zh) | 1998-08-19 |
HK1011201A1 (en) | 1999-07-09 |
AU730667B2 (en) | 2001-03-08 |
ATE275087T1 (de) | 2004-09-15 |
JPH10167590A (ja) | 1998-06-23 |
BR9706232A (pt) | 1999-11-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0846642B1 (de) | Gruppenoptimierungssystem für Abwärtsspitzenverkehr | |
DE69000837T2 (de) | Relativbeantwortungssystem fuer ein aufzugsverteilungssystem mit "kuenstlicher intelligenz" zum aendern von bonus- und strafbestimmungen. | |
DE68904124T2 (de) | System fuer die rufzuteilung von aufzuegen, basierend auf den wartezeiten unter verwendung von spitzenverkehrsvorhersagen. | |
EP1418147B1 (de) | Steuerungsvorrichtung für eine Aufzugsanlage mit Mehrfachkabine | |
DE69000807T2 (de) | Auf "kuenstlicher intelligenz" basierte vorrichtung zum abtasten des menschenstromes fuer aufzugskabinenzuteilung. | |
DE3820568C2 (de) | ||
DE69802876T2 (de) | Passagier-reisezeit optimierendes steuerverfahren für aufzugsgruppen aus doppeldeck-aufzügen | |
EP0091554B1 (de) | Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs | |
DE69833880T2 (de) | Genetisches verfahren zur zuteilung der aufzugszielrufe | |
DE3611173C2 (de) | Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen | |
EP0365782B1 (de) | Verfahren und Einrichtung zur Gruppensteuerung von Aufzügen mit Doppelkabinen | |
DE69126670T2 (de) | Aufwärtsverkehrsspitzen-Aufzugssteuerungssystem mit optimiertem Vorzugsbetrieb nach Stockwerken mit Hochintensitätsverkehr | |
EP0443188B1 (de) | Verfahren und Einrichtung zur sofortigen Zielrufzuteilung bei Aufzugsgrupppen, aufgrund von Bedienungskosten und von variablen Bonus-/Malus-Faktoren | |
DE112007001577B4 (de) | Aufzuggruppensteuervorrichtung | |
EP0312730B1 (de) | Gruppensteuerung für Aufzüge mit lastabhängiger Steuerung der Kabinen | |
DE69818080T2 (de) | Verfahren für aufzugsgruppe-steuerung in der virtueller personenverkehr erzeugt wird | |
DE3732204A1 (de) | Verfahren zur koordination des verkehrs von aufzuggruppen in gebaeuden mit umsteigetage | |
DE69205949T2 (de) | Aufzugssystem mit dynamisch veränderbarer Türhaltezeit. | |
EP0134892B1 (de) | Gruppensteuerung für Aufzüge mit Doppelkabinen | |
EP0010570A2 (de) | Verfahren und Einrichtung zur selbstadaptiven Zuordnung der Arbeitslast einer Datenverarbeitungsanlage | |
DE2411824C2 (de) | Verfahren zum Betreiben einer Aufzugsanlage | |
EP2804134B1 (de) | Verfahren und System zur Fuzzy-basierten Regelung einer Zuordnung von Ressourcen in einem System | |
DE10394268T5 (de) | Aufzugverkehrsteuerung | |
DE69405907T2 (de) | Ansammlungsmessung und -verminderung in einem Aufzugsverteiler mit mehrfachen Termen bei der Objektivitätsfunktion | |
DE60203514T2 (de) | Verfahren zur zuteilung von stockwerkanrufen |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT CH DE FR GB LI |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
17P | Request for examination filed |
Effective date: 19981116 |
|
AKX | Designation fees paid |
Free format text: AT CH DE FR GB LI |
|
RBV | Designated contracting states (corrected) |
Designated state(s): AT CH DE FR GB LI |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT CH DE FR GB LI |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040901 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REF | Corresponds to: |
Ref document number: 59711882 Country of ref document: DE Date of ref document: 20041007 Kind code of ref document: P |
|
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) |
Effective date: 20041019 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20041122 Year of fee payment: 8 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20041124 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20041130 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20041130 |
|
REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1011201 Country of ref document: HK |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050601 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
26N | No opposition filed |
Effective date: 20050602 |
|
EN | Fr: translation not filed | ||
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20051124 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20051124 |