公开(公告)号：US20150053509A1

公开(公告)日：2015-02-26

申请号：US14256624

申请日：2014-04-18

Applicant: INVENTIO AG

Inventor： Paul Friedli

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: A method of allocating calls of a lift installation with at least one lift and at least one car per lift to move passengers in a journey from at least one input floor to at least one destination floor, a system for executing the method and a computer readable memory with instructions for executing the method. The method includes receiving input calls from passengers travelling from an input floor to a destination floor, each call identifying at least one floor as an input floor or a destination floor. A start zone with identified input floors and a destination zone with identified destination floors are determined from the input calls and destination calls. Each identified floor within a corresponding zone is considered using at least one selection criterion and a stopping floor is selected which satisfies the criterion. The car is caused to stop at fewer than all the identified input floors and identified destination floors during the journey.

Abstract translation: 一种分配具有至少一个升降机和每个电梯至少一个轿厢的升降机装置的呼叫的方法，用于将旅程从至少一个输入楼层移动到至少一个目的地楼层，用于执行该方法的系统和计算机可读 具有执行该方法的指令的存储器。 该方法包括接收从输入层到目的地楼层的乘客的输入呼叫，每个呼叫识别至少一个楼层作为输入层或目的地楼层。 从输入的呼叫和目的地呼叫确定具有识别的输入层的起始区和具有确定的目的地楼层的目的地区。 使用至少一个选择标准来考虑相应区域内的每个识别的楼层，并且选择满足该标准的停止楼层。 在行驶期间，汽车停在少于所有确定的输入楼层和确定的目的地楼层。

公开(公告)号：US20140284145A1

公开(公告)日：2014-09-25

申请号：US14350372

申请日：2012-10-05

Applicant: Inventio AG

Inventor： Lukas Finschi

IPC: B66B1/46

CPC classification number: B66B1/468 ,  B66B1/2458 ,  B66B1/2466 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/401 ,  B66B2201/402 ,  B66B2201/403 ,  Y02B50/122

Abstract: Elevator system passengers are transported in one or more of a plurality of elevator cars. The elevator cars can require different amounts of energy to operate. Passenger trips can be allocated to one car or another car based on the expected energy consumption for the trips in one or the other car.

Abstract translation: 电梯系统乘客在一个或多个电梯轿厢中运输。 电梯轿厢可能需要不同的能量来操作。 乘客旅行可以根据一辆或另一辆车中行驶的预期能量消耗分配给一辆汽车或另一辆汽车。

公开(公告)号：US08286755B2

公开(公告)日：2012-10-16

申请号：US12599895

申请日：2007-05-23

Applicant: Masaharu Eto ,  Shiro Hikita

Inventor： Masaharu Eto ,  Shiro Hikita

IPC: B66B1/16

CPC classification number: B66B3/00 ,  B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/231 ,  B66B2201/235 ,  B66B2201/403

Abstract: In an elevator system floors each include: a hall registration device that places a plurality of car calls for moving a car to destination floors different from one another; and a display device that displays the car that has been assigned the plurality of car calls. A limit value setting mechanism sets, for each of the plurality of floors separately, a limit value for limiting a count of the plurality of car calls that can be assigned to the same car. A count-up mechanism obtains, when a new car call is made, a call count of each car by a given method, based on information about the plurality of car calls that have been assigned to the car. A candidate car selector compares the limit value set to a floor where the new car call is made and the call count of the each car, to thereby select, as a candidate car, the car to which the new car call can be assigned from among the cars.

Abstract translation: 在一个电梯系统中，每个楼层包括：一个门厅登记装置，其将用于将轿厢移动到彼此不同的目的地楼层的多个轿厢呼叫; 以及显示装置，其显示已经分配了多个轿厢呼叫的轿厢。 极限值设定机构分别对多个楼层中的每一层分别设定用于限制能分配给同一轿厢的多个轿厢呼梯的计数的极限值。 根据关于已经分配给轿厢的多个轿厢呼叫的信息，通过给定的方法，当进行新的轿厢呼叫时，计数机构获得每个轿厢的呼叫计数。 候选车辆选择器将设定的限制值与进行新的轿厢呼梯的楼层和每个轿厢的呼梯计数器进行比较，从而选择可以从其中分配新的轿厢呼叫的轿厢 汽车。

公开(公告)号：US20110048866A1

公开(公告)日：2011-03-03

申请号：US12524863

申请日：2007-03-26

Applicant: Sakurako Tokura

Inventor： Sakurako Tokura

IPC: B66B1/20

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/401 ,  B66B2201/403

Abstract: An elevator system including a car call registration device by which an elevator user registers a car call before riding on a car and a group supervisory controller with a building specification data storage section in which building specification data including specially-assigned floors is stored. Further, a specially-assigned floor judgment section judges whether a departure floor is a specially-assigned floor when a car call is registered, and a traffic condition judgment section judges the traffic condition of elevators within a building. A car assignment is performed based on the traffic condition judgment section judging by the specially-assigned floor judgment section that the departure floor is a specially-assigned floor, and a car assignment is performed based on a building specification stored in the building specification data storage section when the specially-assigned floor judgment section judges the departure floor is not a specially-assigned floor.

Abstract translation: 一种电梯系统，其包括轿厢呼梯登记装置，电梯用户在乘坐轿厢之前登记轿厢呼叫，以及组群管理控制器，其中建筑规格数据存储部分存储有包括特别分配楼层的建筑物规格数据。 此外，特别分配的楼层判断部分，当登记车厢呼叫时，判断出发楼层是否是特别分配的楼层，并且交通条件判断部分判断建筑物内的电梯的交通状况。 基于由专门分配的楼层判断部判断为出发楼层为特别分配楼层的交通条件判断部进行轿厢分配，并且基于存储在建筑物规格数据存储器中的建筑规范进行轿厢分配 特别分配楼层判断部判断出发楼层的部分不是特别分配的楼层。

公开(公告)号：US06419051B2

公开(公告)日：2002-07-16

申请号：US09835425

申请日：2001-04-16

Applicant: Toshimitsu Mori ,  Zuhair Bahjat ,  Jannah Stanley ,  Mark Ross ,  Masanori Sahara ,  Hideyuki Honma

Inventor： Toshimitsu Mori ,  Zuhair Bahjat ,  Jannah Stanley ,  Mark Ross ,  Masanori Sahara ,  Hideyuki Honma

IPC: B66B118

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/222 ,  B66B2201/226 ,  B66B2201/233 ,  B66B2201/234 ,  B66B2201/243 ,  B66B2201/306 ,  Y10S187/902

Abstract: A control device for a double-deck elevator system having an upper deck and a lower deck, includes a group control device for assigning the upper and lower decks to respond to car calls from the upper and lower decks and boarding hall calls from a plurality of floors. The control device further includes an assignment control device for determining whether a plurality of the car calls and boarding hall calls can be responded to simultaneously and for directing said group control device to reassign the upper and lower decks to respond to the plurality of car calls and boarding hall calls simultaneously.

Abstract translation: 一种用于具有上甲板和下甲板的双层电梯系统的控制装置，包括用于分配上甲板和下甲板的组控制装置，以响应来自上甲板和下甲板的轿厢呼叫以及来自多个 地板。 控制装置还包括分配控制装置，用于确定是否可以同时响应多个轿厢呼叫和登机厅呼叫，并且用于指示所述组控制装置重新分配上和下甲板以响应多个轿厢呼叫， 登机大厅同时通话。

公开(公告)号：US06237721B1

公开(公告)日：2001-05-29

申请号：US09155154

申请日：1998-11-10

Applicant: Marja-Liisa Siikonen

Inventor： Marja-Liisa Siikonen

IPC: B66B118

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/402 ,  B66B2201/403 ,  Y10S187/902

Abstract: A method for controlling an elevator group of double-deck elevators. Landing calls are allocated to the elevators and elevator decks in such a way that the passenger journey time is optimized. The method takes into account the current landing call time and the estimated time of arrival to the destination floor. The method minimizes passenger journey time by allocating the landing call to the deck that will cause the fewest additional stops to the elevator and least additional delay on the way to the passenger destination floor. In addition, the elevator estimated time of arrival to a destination floor is calculated separately for each deck, taking into account the stops already existing for the elevator and the additional stops caused by the selected landing call. Further the landing call is allocated to the deck for which the estimated time of arrival to the destination floor is least. In addition, the best deck for each landing call is selected by minimizing a cost function. The cost function may include the estimated time of arrival to the destination floor. Alternatively, the cost function may also include the estimated time of arrival to the furthest call floor.

Abstract translation: 一种用于控制双层电梯的电梯组的方法。 着陆电话分配给电梯和电梯甲板，使乘客行驶时间得到优化。 该方法考虑了当前着陆呼叫时间和到达目的地楼层的预计到达时间。 该方法通过将登陆呼叫分配到甲板上来最小化乘客行驶时间，这将导致对电梯的最少额外的停靠和到乘客目的地楼层的途中的最小额外的延迟。 此外，考虑到电梯已经存在的停靠和由所选择的着陆呼叫引起的附加停止，电梯到达目的地楼层的估计时间被分别计算。 此外，着陆呼叫被分配到到达目的地楼层的预计到达时间最少的甲板。 此外，通过最小化成本函数来选择每个着陆呼叫的最佳甲板。 成本函数可以包括到达目的地楼层的估计时间。 或者，成本函数还可以包括到达最远呼叫楼层的估计时间。

公开(公告)号：US5252790A

公开(公告)日：1993-10-12

申请号：US583870

申请日：1990-09-17

Applicant: Michel Aime

Inventor： Michel Aime

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

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

Abstract: In an elevator system with the immediate allocation of the floor calls, car calls are processed according to an algorithm implemented in a process computer. A preliminary processing of the car calls occurs upon entry of each of the car calls and a final processing occurs before the car call destination floor. A car call with a destination floor which coincides with the destination floor of an allocated call is allocated immediately during the preliminary processing. If there is no coincidence, the car call is shortened by one floor and registered. A car call registered during the preliminary processing is allocated with its original trip length during the final processing if there is coincidence with a destination floor of an allocated call. If no coincidence exists, the car call is allocated with a new destination floor which depends upon the allocated calls before and/or after the original car call destination floor.

Abstract translation: 在立即分配楼层电话的电梯系统中，根据在过程计算机中实现的算法对汽车呼叫进行处理。 轿厢呼叫的初步处理在每次轿厢呼叫进入时发生，并且最终处理发生在轿厢呼叫目的地楼层之前。 在预备处理期间立即分配与目的地楼层一致的轿厢呼叫，与目的地楼层一致。 如果没有巧合，车辆通话被缩短一层并注册。 如果与所分配的呼叫的目的地楼层一致，则在初始处理期间登记的轿厢呼叫在最终处理期间被分配其原始行程长度。 如果不存在巧合，则轿厢呼叫被分配有新的目的地楼层，这取决于在原车呼叫目的地楼层之前和/或之后的分配的呼叫。

公开(公告)号：US5243155A

公开(公告)日：1993-09-07

申请号：US879531

申请日：1992-05-04

Applicant: David J. Sirag, Jr.

Inventor： David J. Sirag, Jr.

IPC: B66B1/20 ,  B66B1/24 ,  B66B1/34

CPC classification number: B66B1/2458 ,  B66B1/2408 ,  B66B1/3484 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/401 ,  B66B2201/403 ,  Y10S706/90

Abstract: The number of hall passengers waiting at a stop for service by an elevator car is determined by first calculating instantaneous passenger rates whenever a hall call button is pressed or whenever passengers board an elevator car. The instantaneous passenger rates are scaled to compensate for the inherent differences in service rates of the stops. The scaled rates are averaged into one or more of an up, down, or off peak quantities depending upon the mode of the elevator system. The number of hall passengers waiting at a stop is then calculated by multiplying one or more of the up, down, or off peak quantities, depending upon the mode of the elevator system, by the elapsed time since the stop was last serviced.

Abstract translation: 通过电梯轿厢等待停车服务的大厅乘客的数量通过首先在按下门厅呼叫按钮或乘客登上电梯轿厢时计算即时乘客率来确定。 即时乘客率被缩放以补偿站点的服务速率的内在差异。 取决于电梯系统的模式，缩放的速率被平均为上，下或下峰值中的一个或多个。 然后，根据电梯系统的模式，乘以停止最后一次维修之后的经过时间，将上，下或下峰值之一乘以一个或多个。

公开(公告)号：US20160152438A1

公开(公告)日：2016-06-02

申请号：US14956037

申请日：2015-12-01

Applicant: KONE Corporation

Inventor： Marja-Liisa SIIKONEN ,  Mirko Ruokokoski

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, andg) 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.

公开(公告)号：US08701839B2

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

申请号：US13858431

申请日：2013-04-08

Applicant: Inventio AG

Inventor： Paul Friedli

IPC: B66B1/20

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

Abstract: A method of allocating calls of a lift installation with at least one lift and at least one car per lift to move passengers in a journey from at least one input floor to at least one destination floor, a system for executing the method and a computer readable memory with instructions for executing the method. The method includes receiving input calls from passengers travelling from an input floor to a destination floor, each call identifying at least one floor as an input floor or a destination floor. A start zone with identified input floors and a destination zone with identified destination floors are determined from the input calls and destination calls. Each identified floor within a corresponding zone is considered using at least one selection criterion and a stopping floor is selected which satisfies the criterion. The car is caused to stop at fewer than all the identified input floors and identified destination floors during the journey.

Abstract translation: 一种分配具有至少一个升降机和每个电梯至少一个轿厢的升降机装置的呼叫的方法，用于将旅程从至少一个输入楼层移动到至少一个目的地楼层，用于执行该方法的系统和计算机可读 具有执行该方法的指令的存储器。 该方法包括接收从输入层到目的地楼层的乘客的输入呼叫，每个呼叫识别至少一个楼层作为输入层或目的地楼层。 从输入的呼叫和目的地呼叫确定具有识别的输入层的起始区和具有确定的目的地楼层的目的地区。 使用至少一个选择标准来考虑相应区域内的每个识别的楼层，并且选择满足该标准的停止楼层。 在行驶期间，汽车停在少于所有确定的输入楼层和确定的目的地楼层。