公开(公告)号：US20050269164A1

公开(公告)日：2005-12-08

申请号：US11127269

申请日：2005-05-12

申请人： Tapio Tyni ,  Jari Ylinen ,  Mika Matela ,  Toni Rintala

发明人： Tapio Tyni ,  Jari Ylinen ,  Mika Matela ,  Toni Rintala

IPC分类号： B66B1/20 ,  B66B1/18

CPC分类号： B66B1/20

摘要： An allocation method in an elevator group for allocating a landing call to one of several elevator cars comprised in the elevator group, said cars moving and stopping within the area of several different floors, by using a genetic allocation method. In the method, the elevator travel routes are encoded into alternative chromosomes; using genetic methods, alternative chromosomes are developed and the best one among these is selected; and the elevator group is controlled in accordance with the best chromosome. According to the invention, the floors served by the elevator group are divided into a first group and a second group; on the floors comprised in the first group, landing calls are given as passenger-specific destination calls; on the floors comprised in the second group, landing calls are given as floor-specific up/down calls, so that when the destination calls and up/down calls are encoded into the same chromosome, best chromosome represents an allocation decision, in which the gene values indicate which elevator car is to serve each passenger and each up/down call.

摘要翻译： 一种电梯组中的分配方法，用于通过使用遗传分配方法将包括在电梯组中的若干电梯轿厢之一的层站呼梯分配给所述轿厢，并在几个不同楼层的区域内移动和停止。 在该方法中，电梯行进路线被编码为替代染色体; 使用遗传方法，开发出替代染色体，选择其中最好的染色体; 电梯组根据最佳染色体进行控制。 根据本发明，由电梯组服务的楼层分为第一组和第二组; 在第一组中包含的地板上，着陆呼叫被给予作为特定目的地的呼叫; 在第二组中包含的楼层，登陆呼叫被给予作为楼层特定的向上/向下呼叫，使得当目的地呼叫和向上/向下呼叫被编码到相同的染色体中时，最佳染色体表示分配决定，其中 基因值表示哪个电梯轿厢将为每个乘客和每个上/下呼叫提供服务。

公开(公告)号：US06889799B2

公开(公告)日：2005-05-10

申请号：US10642623

申请日：2003-08-19

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/20 ,  B66B1/24 ,  B66B1/18

CPC分类号： B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/215 ,  B66B2201/216 ,  B66B2201/243 ,  B66B2201/40

摘要： The invention concerns a method for solving an optimization task consisting of a plurality of sub-functions in the control of the operation of an apparatus. In the method, a set of a plurality of solution alternatives is generated and, according to the method, each sub-function is normalized. Normalized cost functions of the sub-functions are generated for each solution alternative for solving the optimization task, and based on the normalized cost functions of the sub-functions, a set of solutions to the optimization task is formed. From the set of solutions, the best solution is selected and the apparatus is controlled in accordance with the solution thus selected.

摘要翻译： 本发明涉及一种用于解决在控制装置的操作中由多个子功能组成的优化任务的方法。 在该方法中，生成多个解决方案的集合，并根据该方法对每个子功能进行归一化。 为求解优化任务的每个解决方案生成子功能的归一化成本函数，并且基于子功能的归一化成本函数，形成一组优化任务的解决方案。 从一组解决方案中，选择最佳解决方案，并根据所选择的解决方案来控制设备。

公开(公告)号：US06857506B1

公开(公告)日：2005-02-22

申请号：US10645630

申请日：2003-08-22

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/06 ,  B66B1/18 ,  B66B1/20 ,  B66B1/24 ,  B66B1/28

CPC分类号： B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/403 ,  Y02B50/122

摘要： An elevator group control method for allocating landing calls and car calls to elevators so that the objectives set are met. In the method, a car-specific energy consumption file is generated to describe the energy consumption occurring during each trip of the elevator from each floor to each one of the other floors with different loads, and the calls are so allocated that the energy consumption resulting from serving all the active calls is minimized.

摘要翻译： 一种电梯组控制方法，用于将升降机呼梯和轿厢呼叫分配给电梯，使得满足目标。 在该方法中，生成特定于汽车的能量消耗文件，以描述在电梯的每个行程期间从每个楼层到具有不同负载的其他楼层的每个行程期间发生的能量消耗，并且呼叫被如此分配以产生能量消耗 从服务所有的主动呼叫最小化。

公开(公告)号：US5932852A

公开(公告)日：1999-08-03

申请号：US945028

申请日：1997-10-21

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18 ,  B66B1/20 ,  B66B1/24

CPC分类号： B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/214 ,  Y10S706/91

摘要： A procedure for allocating the calls entered via landing call devices of the elevators in an elevator bank forms several allocation options. Each allocating option contains, for each active landing call, a call data item and an elevator data item which together are used to determine which elevator should service the call. The value of a cost function is calculated for each allocation option; one or more of the allocation options is repeatedly changed with respect to at least one data item, and the values of the cost functions of the new allocation options are calculated. Based on the values of the cost functions, the best allocation option is selected and the active elevator calls are allocated to the elevators in the elevator bank accordingly.

摘要翻译： PCT No.PCT / FI96 / 00216 Sec。 371日期1997年10月21日 102（e）1997年10月21日PCT PCT 1996年4月19日PCT公布。 WO96 / 33123 PCT出版物 日期1996年10月24日在电梯组中分配通过电梯的着陆呼叫装置输入的呼叫的过程形成若干分配选项。 每个分配选项包含用于每个活动着陆呼叫的呼叫数据项和电梯数据项，它们一起用于确定哪个电梯应该为呼叫服务。 为每个分配选项计算成本函数的值; 一个或多个分配选项相对于至少一个数据项重复地改变，并且计算新的分配选项的成本函数的值。 基于成本函数的值，选择最佳分配选项，并且相应地将有效电梯呼叫分配给电梯组中的电梯。

公开(公告)号：US07546906B2

公开(公告)日：2009-06-16

申请号：US12216314

申请日：2008-07-02

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18

CPC分类号： G06N3/126 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/40 ,  Y02B50/122

摘要： The present invention discloses an extension to a prior-art genetic algorithm, with which the routing of elevators based on the calls given in an elevator system is formed. A new type of gene, a so-called run type gene, is connected to the chromosome of the genetic algorithm according to the invention, with which gene the desired speed profile for the elevator trip can be set. In this way e.g. an upper limit can be set for the acceleration or for the maximum travel speed of the elevator. By means of the run type gene a kinetic energy term is included in the optimization. The energy consumed by the system can thus be minimized more effectively by means of the algorithm, because the varying travel speeds of the elevators create more freedom of choice for the chromosomes of the algorithm.

摘要翻译： 本发明公开了对现有技术遗传算法的扩展，其中基于电梯系统中给出的呼叫形成电梯的路由。 一种新型的基因，即所谓的运行型基因，连接到根据本发明的遗传算法的染色体，利用该基因可以设置用于电梯跳闸的期望速度分布。 以这种方式，例如 可以为电梯的加速度或最大行驶速度设定上限。 通过运行型基因，动能项被包括在优化中。 因此，由于电梯的变化的行进速度为算法的染色体创造了更多的选择自由度，因此通过该算法可以更有效地使系统消耗的能量最小化。

公开(公告)号：US20080105499A1

公开(公告)日：2008-05-08

申请号：US11907811

申请日：2007-10-17

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18

CPC分类号： H02J3/12 ,  B66B1/2458 ,  B66B5/027 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/241 ,  B66B2201/40 ,  H02J9/06 ,  Y02B50/122

摘要： The present invention discloses a method for optimal routing of the elevators in an elevator system in a situation where the supply power received by the system is limited e.g. due to emergency power operation. In the invention, routes are optimized by using a cost function to which has been added a term containing the summed instantaneous power consumed. Power consumption is monitored in real time, and the elevators need a start permission from the control system. A route alternative that exceeds the power limit is penalized in the cost function by a so-called penal term. With the elevator routing obtained as a result, the instantaneous power consumed by the system remains continuously below the set power limit. Some call can thus be postponed to be served later. By the method of the invention, the number of elevators serving passengers in an emergency power situation can be varied dynamically.

摘要翻译： 本发明公开了一种在系统接收的供电功率有限的情况下电梯系统中的电梯的最佳路线选择方法。 由于应急电源运行。 在本发明中，通过使用已经添加了包含消耗的总和瞬时功率的术语的成本函数来优化路线。 实时监控功耗，电梯需要控制系统的启动许可。 超过功率极限的路由选择在成本函数中被所谓的刑罚惩罚。 由于获得的电梯路由，系统消耗的瞬时功率保持在设定功率极限以下。 因此可以推迟一些电话，以便稍后提供服务。 通过本发明的方法，可以动态地改变在紧急电力情况下为乘客服务的电梯的数量。

公开(公告)号：US07140472B2

公开(公告)日：2006-11-28

申请号：US11127269

申请日：2005-05-12

申请人： Tapio Tyni ,  Jari Ylinen ,  Mika Matela ,  Toni Rintala

发明人： Tapio Tyni ,  Jari Ylinen ,  Mika Matela ,  Toni Rintala

IPC分类号： B66B1/20

CPC分类号： B66B1/20

摘要： A genetic allocation method in an elevator group for allocating a landing call to one of several elevator cars in the elevator group, the cars moving and stopping within the area of several different floors. The elevator travel routes are encoded into alternative chromosomes. Using genetic methods, alternative chromosomes are developed and the best chromosome is selected. The elevator group is controlled in accordance with the best chromosome. The floors served by the elevator group are divided into a first group and a second group. On the floors of the first group, landing calls are given as passenger-specific destination calls. On the floors of the second group, landing calls are given as floor-specific up/down calls. When the destination calls and up/down calls are encoded into the same chromosome, the best chromosome represents an allocation decision, in which the gene values indicate which elevator car is to serve each passenger and each up/down call.

摘要翻译： 电梯组中的遗传分配方法，用于向电梯组中的几个电梯轿厢之一分配着陆呼叫，轿厢在几个不同楼层的区域内移动和停止。 电梯旅行路线被编码成替代染色体。 使用遗传方法，开发出替代染色体，选择最佳染色体。 电梯组根据最佳染色体进行控制。 由电梯组服务的楼层分为第一组和第二组。 在第一组的楼层，登陆呼叫被给予作为特定目的地的呼叫。 在第二组的楼层，着陆呼叫被给予作为楼层特定的上/下呼叫。 当目的地呼叫和向上/向下呼叫被编码到相同的染色体中时，最佳染色体表示分配决定，其中基因值指示哪个电梯轿厢将为每个乘客提供服务，并且每个上/下呼叫。

公开(公告)号：US5907137A

公开(公告)日：1999-05-25

申请号：US134370

申请日：1998-08-14

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18 ,  B66B1/20 ,  B66B1/24

CPC分类号： B66B1/2408

摘要： Genetic procedure for the allocation of calls for elevators comprised in an elevator group. In the procedure, a plurality of allocation options, i.e. chromosomes (33) are formed, each of which contains a call data item and an elevator data item for each landing call, and these data, i.e. genes together define an elevator to serve the landing call. A fitness function value (34) is determined for each chromosome (33) and one or more of the chromosomes (33) are modified and, based on the fitness function values, the best chromosome (33) is selected and the elevator group is controlled in accordance with this chromosome. According to the invention, the chromosomes (33) and the corresponding fitness function values (34) are collected in a file, i.e. a gene bank, and each chromosome (33) generated is compared with the chromosomes (33) in the gene bank, and a fitness function value (34) is only determined for a new chromosome (33).

摘要翻译： 用于分配电梯组中电梯呼叫的遗传程序。 在该过程中，形成多个分配选项，即染色体（33），每个分配选项包含用于每个着陆呼叫的呼叫数据项和电梯数据项，并且这些数据，即基因一起定义用于服务着陆的电梯 呼叫。 对每个染色体（33）确定适应度函数值（34），并修改一个或多个染色体（33），并且基于适应度函数值，选择最佳染色体（33）并且控制电梯组 根据这个染色体。 根据本发明，将染色体（33）和相应的适应度函数值（34）收集在文件中，即基因库，并将所产生的每个染色体（33）与基因库中的染色体（33）进行比较， 并且仅针对新染色体确定适应度函数值（34）（33）。

公开(公告)号：US07909143B2

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

申请号：US11907811

申请日：2007-10-17

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18

CPC分类号： H02J3/12 ,  B66B1/2458 ,  B66B5/027 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/241 ,  B66B2201/40 ,  H02J9/06 ,  Y02B50/122

摘要： The present invention pertains to a method for optimal routing of the elevators in an elevator system in a situation where the supply power received by the system is limited e.g. due to emergency power operation. In the invention, routes are optimized by using a cost function to which has been added a term containing the summed instantaneous power consumed. Power consumption is monitored in real time, and the elevators need a start permission from the control system. A route alternative that exceeds the power limit is penalized in the cost function by a so-called penal term. With the elevator routing obtained as a result, the instantaneous power consumed by the system remains continuously below the set power limit. Some call can thus be postponed to be served later. By the method of the invention, the number of elevators serving passengers in an emergency power situation can be varied dynamically.

摘要翻译： 本发明涉及一种在系统所接收的供​​电功率被限制的情况下电梯系统中电梯的最佳路由选择方法。 由于应急电源运行。 在本发明中，通过使用已经添加了包含消耗的总和瞬时功率的术语的成本函数来优化路线。 实时监控功耗，电梯需要控制系统的启动许可。 超过功率极限的路由选择在成本函数中被所谓的刑罚惩罚。 由于获得的电梯路由，系统消耗的瞬时功率保持在设定功率极限以下。 因此可以推迟一些电话，以便稍后提供服务。 通过本发明的方法，可以动态地改变在紧急电力情况下为乘客服务的电梯的数量。

公开(公告)号：US20080296099A1

公开(公告)日：2008-12-04

申请号：US12216314

申请日：2008-07-02

申请人： Tapio Tyni ,  Jari Ylinen

发明人： Tapio Tyni ,  Jari Ylinen

IPC分类号： B66B1/18

CPC分类号： G06N3/126 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/40 ,  Y02B50/122

摘要： The present invention discloses an extension to a prior-art genetic algorithm, with which the routing of elevators based on the calls given in an elevator system is formed. A new type of gene, a so-called run type gene, is connected to the chromosome of the genetic algorithm according to the invention, with which gene the desired speed profile for the elevator trip can be set. In this way e.g. an upper limit can be set for the acceleration or for the maximum travel speed of the elevator. By means of the run type gene a kinetic energy term is included in the optimization. The energy consumed by the system can thus be minimized more effectively by means of the algorithm, because the varying travel speeds of the elevators create more freedom of choice for the chromosomes of the algorithm.

摘要翻译： 本发明公开了对现有技术遗传算法的扩展，其中基于电梯系统中给出的呼叫形成电梯的路由。 一种新型的基因，即所谓的运行型基因，连接到根据本发明的遗传算法的染色体上，利用该基因可以设置用于电梯跳闸的期望的速度分布。 以这种方式，例如 可以为电梯的加速度或最大行驶速度设定上限。 通过运行型基因，动能项被包括在优化中。 因此，由于电梯的变化的行进速度为算法的染色体创造了更多的选择自由度，因此通过该算法可以更有效地使系统消耗的能量最小化。