公开(公告)号：US5024295A

公开(公告)日：1991-06-18

申请号：US318307

申请日：1989-03-03

Applicant: Kandasamy Thangavelu

Inventor： Kandasamy Thangavelu

IPC: B66B1/18 ,  B66B1/20 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/233 ,  B66B2201/235 ,  B66B2201/243 ,  B66B2201/402 ,  B66B2201/403

Abstract: An elevator system employing a micro-processor-based group controller (FIG. 2) communicating with the cars (3, 4) to assign cars to hall calls based on a Relative System Response (RSR) approach. However, rather than using unvarying bonuses and penalties, the assigned bonuses and penalties are varied using "artificial intellience" techniques based on combined historic and real time traffic predictions to predict the number of people behind a hall call, and, calculating and using the average boarding and de-boarding rates at "en route" stops, and the expected car load at the hall call floor. Prediction of the number of people waiting behind hall calls for a few minute intervals are made using traffic levels measured during the past few time intervals on that day as real time predictors, using a linear exponential smoothing model, and traffic levels measured during similar time intervals on previous similar days as historic traffic predictors, using a single exponential smoothing model. The remaining capacity in the car at the hall call floor is matched to the waiting queue using a hall call mismatch penalty. The car stop and hall stop penalties are varied based on the number of people behind the hall call and the variable dwell times at "en route" stops. The stopping of a heavily loaded car to pick up a few people is penalized using a car load penalty. These enhancements to RSR result in equitable distribution of car stops and car loads, thus improving handling capacity and reducing waiting and service times.

Abstract translation: 一种使用基于微处理器的组控制器（图2）的电梯系统，其基于相对系统响应（RSR）方法与轿厢（3,4）进行通信，以将轿厢分配给门厅呼叫。 然而，不是使用不变的奖金和罚款，而是使用基于组合的历史和实时交通预测的“人工智能”技术来改变所分配的奖金和罚则，以预测大厅呼叫后面的人数，以及计算和使用平均值 在“途中”停车的登机和登机费，以及大厅通话楼层的预期车载量。 使用线性指数平滑模型和在类似的时间间隔期间测量的流量水平，使用在当天的过去几个时间间隔内测量的流量水平作为实时预测器，预测在大厅后面等待的人数呼叫几分钟间隔 在以前类似的日子作为历史交通预测因子，使用单一指数平滑模型。 在门厅呼叫楼层的汽车中的剩余容量与使用门厅呼叫不匹配罚款的等待队列进行匹配。 停车场和停车场停车处罚情况根据门厅通话人数和“途中停”时段的可变停留时间各不相同。 一辆装载重载的汽车停下来拿起几个人，都会被罚款。 RSR的这些改进导致汽车停车和汽车负载的公平分配，从而提高处理能力，减少等待和使用时间。

公开(公告)号：US5022497A

公开(公告)日：1991-06-11

申请号：US318295

申请日：1989-03-03

Applicant: Kandasamy Thanagavelu

Inventor： Kandasamy Thanagavelu

IPC: B66B1/18 ,  B66B1/20 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/235 ,  B66B2201/243 ,  B66B2201/402 ,  B66B2201/403

Abstract: An elevator control system employing a micro-processor-based group controller (FIG. 2), which communicates with the cars (3, 4) of the system to determine the conditions of the cars, and responds to hall calls registered at a plurality of landings in the building serviced by the cars under control of the group controller, assigning hall calls to cars based on the summation for each car, relative to each call, a weighted summation of a plurality of system response factors, some indicative, and some not, of conditions of the car irrespective of the call being assigned, assigning varying "bonuses" and "penalties" to them in the weighted summation. "Artificial intelligence" techniques are used to predict traffic levels and any crowd build up at various floors to better assign one or more cars to the "crowd" predicted floors, either parking them there, if they were empty, or more appropriately assigning car(s) to the hall calls. Traffic levels at various floors are predicted by collecting passengers and car stop counts in real time and using real time and historic prediction for the traffic levels, with single exponential smoothing and/or linear exponential smoothing. Predicted passenger arrival counts are used to predict any crowd at fifteen second intervals at floors where significant traffic is predicted. Crowd prediction is then adjusted for any hall call stops made and the number of passengers picked up by the cars. The crowd dynamics are matched to car assignment, with one or more cars being sent to crowded floor(s).

Abstract translation: 一种使用基于微处理器的组控制器（图2）的电梯控制系统，其与系统的轿厢（3,4）进行通信，以确定轿厢的状况，并响应于在多个 在由集团控制器控制的汽车服务的建筑物中的着陆，基于每个汽车相对于每个呼叫的总和，向轿厢分配门厅呼叫，多个系统响应因子的加权和，一些指示，一些不是 无论电话被分配的情况如何，在加权求和中给他们分配不同的“奖金”和“罚款”。 “人造智能”技术用于预测交通水平，并且任何人群聚集在不同的楼层，以更好地将一辆或多辆汽车分配到“人群”预测的楼层，或者将其停放在那里，如果它们是空的，或者更适当地分配汽车（ s）到大厅呼叫。 通过采集单个指数平滑和/或线性指数平滑的方式，实时收集乘客和停车点数，并对流量水平进行实时和历史预测，预测各层楼层的交通状况。 预计乘客到达人数用于预测任何人群，以十五秒的间隔预测明显的交通流量。 然后，对于任何大厅通话站和乘坐车辆的乘客人数，对人群预测进行调整。 人群动态与汽车分配匹配，一辆或多辆汽车被发送到拥挤的地板。

公开(公告)号：US4058187A

公开(公告)日：1977-11-15

申请号：US610510

申请日：1975-09-04

Applicant: Herbert Jacoby ,  Arnold Mendelsohn

Inventor： Herbert Jacoby ,  Arnold Mendelsohn

IPC: B66B1/20 ,  B66B1/24 ,  B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/213 ,  B66B2201/225 ,  B66B2201/235 ,  B66B2201/242

Abstract: Apparatus for generating dispatching signals for a group of elevators operating between two terminals. The dispatching signals are generated at intervals computed in accordance with an estimated number of passengers the next car to be dispatched from each terminal will carry. This estimate is based on the actual number of passengers carried by previously dispatched cars. By functioning in this manner the apparatus distributes the passengers between the cars.

Abstract translation: 一种用于在两个终端之间操作的一组电梯产生调度信号的装置。 调度信号根据从每个终端将要发送的下一个轿厢承载的估计乘客数量计算的间隔产生。 这个估计是基于以前派出的汽车所携带的乘客的实际人数。 通过以这种方式工作，该装置在乘客之间分配乘客。

公开(公告)号：WO2014198302A1

公开(公告)日：2014-12-18

申请号：PCT/EP2013/062055

申请日：2013-06-11

Applicant: KONE CORPORATION

Inventor： RUOKOKOSKI, Mirko ,  SIIKONEN, Marja-Liisa

IPC: B66B1/24

CPC classification number: B66B1/2466 ,  B66B2201/20 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/233 ,  B66B2201/243 ,  Y02B50/122

Abstract: The invention relates to a method for handling destination calls in an elevator group comprising several elevators using destination call control, which method comprises an allocation procedure for situations where the calls can't be served by all elevators of the elevator group in one round trip, in which situation "n" open calls and "m" fixed calls are present, which fixed calls are already allocated but not served, in which allocation procedure a genetic algorithm (GA) is used in which the following succession of steps is performed: a) chromosomes comprising genes are formed, in which chromosomes: - n first genes comprise a correlation of each open call and a corresponding elevator, - n second genes comprise a correlation of each open call and the corresponding number of the round trip in which the open call will be served, and - m third genes comprise a correlation of each fixed call and the corresponding number of the round trip in which the fixed call will be served, b) for each chromosome round trips are calculated for each elevator of the elevator group according to collective control, c) the round trips of all elevators calculated in step b) are evaluated according to known optimization criteria, as e.g. passenger riding time, passenger waiting time, energy consumption, minimum number of round trips etc., d) chromosomes which are evaluated in step c) as sufficient are put forward to the forming of a new generation by per se known GA methods, as e.g. cross-breeding, mutation, etc., e) the steps b) to d) are repeated for each chromosome of each new generation of chromosomes until a stop criterion is achieved, f) the calls are served in collective control according to the best chromosome of the last generation, and g) the destinations of each elevator in its travelling direction in the current round trip according to the best chromosome are shown on a at least one common display shortly before its arrival at said landing. The invention solves the elevator dispatching problem under consideration of more than the current round trip of the elevators in the elevator group.

Abstract translation: 本发明涉及一种用于处理电梯组中的目的地呼叫的方法，该电梯组包括使用目的地呼叫控制的若干电梯，该方法包括用于在一次往返中不能由电梯组的所有电梯服务呼叫的情况的分配过程， 在哪种情况下“n”打开呼叫和“m”个固定呼叫，哪些固定呼叫已经被分配但没有服务，其中分配过程使用遗传算法（GA），其中执行以下连续步骤：a ）形成包含基因的染色体，其中染色体：-n第一个基因包括每个开放呼叫和相应的电梯的相关性，n个第二个基因包括每个开放呼叫和相应的往返次数的相关性，其中开放 电话将被送达，并且第三个基因包括每个固定呼叫的相关性和相应的往返行程的固定呼叫将被提供，b）对于每个 根据集体控制计算电梯组的每个电梯的染色体往返行程，c）根据已知的优化标准评估在步骤b）中计算的所有电梯的往返行程，例如， 乘客乘坐时间，乘客等待时间，能量消耗，最小往返次数等等，d）在步骤c）中评估的染色体足以提供通过本身已知的GA方法形成新一代，例如， 交叉育种，突变等，e）对于每一代染色体的每个染色体重复步骤b）至d），直到达到停止标准，f）根据最佳染色体在集体控制中服用呼叫 并且g）根据最佳染色体在当前往返中行进方向上的每个电梯的目的地在其到达所述着陆之前不久在至少一个公共显示器上显示。 本发明解决了电梯组电梯当前往返的电梯调度问题。

公开(公告)号：WO2013012410A1

公开(公告)日：2013-01-24

申请号：PCT/US2011/044188

申请日：2011-07-15

Applicant: OTIS ELEVATOR COMPANY ,  FARUKI, Tarique ,  STANLEY, Jannah, A. ,  CHAPMAN, Ashley

Inventor： FARUKI, Tarique ,  STANLEY, Jannah, A. ,  CHAPMAN, Ashley

IPC: B66B1/18 ,  B66B1/44

CPC classification number: B66B1/20 ,  B66B1/18 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/216 ,  B66B2201/40 ,  B66B2201/405

Abstract: An exemplary method of controlling an elevator system includes determining that a new passenger requests elevator service from a departure floor to a destination floor. Any candidate elevator cars are ranked. A number of stops for each assigned passenger for a ranked candidate elevator car is determined if the new passenger were assigned to that car. A determination is made whether any ranked candidate elevator car is a qualified car that can accept the new passenger and limit a number of stops for each passenger assigned to that car to a desired maximum number of stops. The new passenger is assigned to a qualified car that has a most favorable ranking of any qualified cars.

Abstract translation: 控制电梯系统的示例性方法包括确定新乘客从出发楼层到目的地楼层请求电梯服务。 任何候选电梯轿厢排名。 如果新乘客被分配到该车，则确定排列候选电梯轿厢的每个分配的乘客的多个停靠点。 确定任何排名的候选电梯轿厢是否是能够接受新乘客的合格汽车，并且将分配给该轿厢的每个乘客的停靠点限制到期望的最大停靠点数。 新乘客被分配到一个合格的汽车，具有最优惠的任何合格的汽车排名。

公开(公告)号：WO2009090206A1

公开(公告)日：2009-07-23

申请号：PCT/EP2009/050409

申请日：2009-01-15

Applicant: INVENTIO AG ,  FRIEDLI, Paul

Inventor： FRIEDLI, Paul

IPC: B66B1/24

CPC classification number: B66B1/2458 ,  B66B1/20 ,  B66B1/24 ,  B66B2201/103 ,  B66B2201/104 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/222 ,  B66B2201/302

Abstract: Die Erfindung betrifft ein Verfahren zur Zuteilung von Rufen einer Aufzugsanlage mit mindestens einem Aufzug und mindestens einer Kabine (1, 1') pro Aufzug. Von mindestens einem Passagier wird mindestens ein Ruf auf ein Zielstockwerk eingegeben. Eine Mehrzahl von Passagieren wird gemäss eingegebener Rufe von der Kabine (1, 1') in mindestens einer Fahrt von mindestens einem Eingabestockwerk auf mindestens ein Zielstockwerk verfahren. Für die eingegebenen Rufe der Fahrt wird mindestens eine Startzone (9, 9') mit einem oder mehreren Eingabestockwerken ermittelt. Für die eingegebenen Rufe der Fahrt wird mindestens eine Zielzone (10, 10') mit einem oder mehreren Zielstockwerken ermittelt. Falls mindestens eine Anzahl Halte in der Startzone (9, 9') und/oder in der Zielzone (10, 10') grösser Eins ist, wird diese Anzahl Halte reduziert.

Abstract translation: 本发明涉及具有每升降机至少一个提升和至少一个保持架（1,1“）的电梯系统的呼叫的分配的方法。 呼叫至少进入至少一个乘客的目的地楼层。 多个乘客在至少一个驱动器从至少一个输入楼层根据从展台（1，1“）进入呼叫移动到至少一个目的地楼层。 对于所输入的呼叫驱动至少一个开始区域（9,9“）是使用一个或多个输入楼层来确定的。 对于所输入的电话驱动的至少一个目标区域（10，10“）与一个或多个目的地楼层来确定。 如果至少一个数在开始区（9,9“）和/或在目标区（10，10”）的停止大于一，此数目减少保持。

公开(公告)号：JP5710073B2

公开(公告)日：2015-04-30

申请号：JP2014520173

申请日：2011-07-15

Applicant: オーチス エレベータ カンパニー ,  OTIS ELEVATOR COMPANY

Inventor： ファルキ,タリク ,  スタンリー,ジャンナ,エー. ,  チャップマン,アシュリー

IPC: B66B1/18

CPC classification number: B66B1/20 ,  B66B1/18 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/216 ,  B66B2201/40 ,  B66B2201/405

公开(公告)号：JP5477387B2

公开(公告)日：2014-04-23

申请号：JP2011539185

申请日：2009-11-09

Applicant: 三菱電機株式会社

Inventor： 直彦 鈴木

IPC: B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/306 ,  B66B2201/403 ,  Y10S187/902

公开(公告)号：US09126807B2

公开(公告)日：2015-09-08

申请号：US13634398

申请日：2010-04-12

Applicant: Jannah A. Stanley ,  Ashley Kaminski

Inventor： Jannah A. Stanley ,  Ashley Kaminski

IPC: B66B1/16 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/216

Abstract: An exemplary method of controlling an elevator system includes determining a source floor of a new call from a passenger desiring elevator service. A direction of travel from the source floor for the new call is also determined. A path of a considered elevator car is simulated as if the new call were assigned to the considered elevator car by determining at least one of (i) a relationship between a position of the considered elevator car and the source floor or (ii) a relationship between a direction of movement of the considered elevator car and the direction of travel. The new call is assigned to one of a plurality of elevator cars if the assigning will satisfy each of (i) the one of the elevator cars will not move in a direction opposite the direction of travel during a time between the passenger boarding the one of the elevator cars and arriving at a destination of the passenger and (ii) the one of the elevator cars will not move in a direction opposite a travel direction of any currently assigned passenger during a time between the currently assigned passenger boarding the one of the elevator cars and arriving at a destination of the currently assigned passenger.

Abstract translation: 控制电梯系统的示例性方法包括从乘客希望电梯服务确定新呼叫的源楼层。 来自新的呼叫的源楼层的旅行方向也被确定。 模拟所考虑的电梯轿厢的路径，就好像新呼叫被分配给所考虑的电梯轿厢，通过以下至少之一确定以下至少之一：（i）所考虑的电梯轿厢的位置与源楼层之间的关系，或（ii） 在所考虑的电梯轿厢的运动方向与行驶方向之间。 如果分配将满足（i）电梯轿厢中的一个不会在乘客登机之间的时间内在与行驶方向相反的方向上移动，则将新呼叫分配给多个电梯轿厢中的一个 电梯轿厢到达乘客的目的地，并且（ii）电梯轿厢中的一个不会在当前分配的乘客登上电梯中的一个之间的时间内沿与任何当前分配的乘客的行进方向相反的方向移动 汽车并抵达当前分配的乘客的目的地。

公开(公告)号：US08978833B2

公开(公告)日：2015-03-17

申请号：US13392553

申请日：2009-11-09

Applicant: Naohiko Suzuki

Inventor： Naohiko Suzuki

IPC: B66B1/18 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/306 ,  B66B2201/403 ,  Y10S187/902

Abstract: A double-deck elevator group controller including a hall-installed car call registration device, cars of the first operation mode which are in charge of operation between even-numbered floors or between odd-numbered floors and cars of the second operation mode which serve all of the floors at which the cars can stop, are set, and in consideration of both combinations of boarding and alighting floors of registered from-hall car calls and an increment of the number of stops, the from-hall car calls are divided for assignment to the cars of the first operation mode and the cars of the second operation, whereby it is possible to meet from-hall car calls having arbitrary floors as the boarding and alighting floors and it is possible to improve the operation efficiency.

Abstract translation: 一个双层电梯组控制器，包括一个安装车厢的呼梯登记装置，负责第二操作模式中的偶数地板之间或奇数地板与轿厢之间的操作的第一操作模式的轿厢， 在车辆可以停下的地板上进行设置，考虑到登记的大厅轿厢呼叫的登机和下车地板的组合以及停靠站数量的增加，将大厅内的轿厢呼叫分配 对于第一操作模式的轿厢和第二操作的轿厢，由此可以满足具有任意楼层的大厅轿厢呼叫作为登机和下车地板，并且可以提高操作效率。