公开(公告)号：US07562746B2

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

申请号：US11356234

申请日：2006-02-17

Applicant: Toshifumi Yoshikawa ,  Satoru Toriyabe ,  Takamichi Hoshino ,  Shunichi Tanae ,  Atsuya Fujino ,  Ryou Okabe ,  Masaya Furuhashi ,  Kenji Yoneda

Inventor： Toshifumi Yoshikawa ,  Satoru Toriyabe ,  Takamichi Hoshino ,  Shunichi Tanae ,  Atsuya Fujino ,  Ryou Okabe ,  Masaya Furuhashi ,  Kenji Yoneda

IPC: B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/226 ,  B66B2201/235 ,  B66B2201/403

Abstract: A method and a display for elevator allocation evaluating are provided. When an elevator allocated to a hall call is selected by employing two different view points such as a real and a future call evaluation index, an elevator allocation reason and a balance between the two view points can be easily grasped. An elevator allocated to a hall call is evaluated on orthogonal coordinates in which the real call evaluation index and the future call evaluation index are defined as an X and a Y coordinate axis. Evaluation indexes of first to fourth elevator cars are evaluated by employing contour lines of a synthetic evaluation function, which is represented as the real and the future call evaluation index. A weight for allocating is displayed visually.

Abstract translation: 提供了一种用于电梯分配评估的方法和显示器。 当通过使用诸如实际和未来呼叫评估指数的两个不同的观点来选择分配给门厅呼叫的电梯时，可以容易地掌握两个视点之间的电梯分配原因和平衡。 在实际呼叫评价指标和将来呼叫评价指标被定义为X和Y坐标轴的正交坐标上对分配给门厅呼叫的电梯进行评估。 通过采用综合评估函数的轮廓线来评估第一至第四梯形电梯轿厢的评估指标，其被表示为实际和未来的呼叫评价指标。 目视显示用于分配的重量。

公开(公告)号：US07475757B2

公开(公告)日：2009-01-13

申请号：US10554131

申请日：2003-06-23

Applicant: Mary Ann T. Valk ,  David J. Sirag

Inventor： Mary Ann T. Valk ,  David J. Sirag

IPC: B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/235

Abstract: A perceived waiting time for a hall call to be answered by a car is determined as a constant times the square (46) of the summation (45) of remaining response time (39) and the amount of time that has expired since the call was registered (38). The time that may be perceived by a passenger to travel to the passenger's destination is determined as a constant times the square (51) of the distance between an estimated destination floor and the floor of the call and a constant times an estimated number of new hall stops and committed hall stops that each car will make (47). Perceived service time is (52) the sum of perceived wait time and perceived travel time. Constants are adjusted so that a long waiting time will yield a quick travel time. Assignment of calls to cars (60) is in accordance (61) with the smallest summation of square (59) of perceived service times for all waiting up calls and down calls.

Abstract translation: 确定由轿厢应答的门厅呼叫的等待时间被确定为剩余响应时间（39）的求和（45）的平方（46）和从呼叫以来已经过去的时间量的常数乘以 注册（38）。 乘客旅行到乘客目的地的时间被确定为与估计的目的地楼层和呼叫的楼层之间的距离的平方（51）的恒定倍数，并且恒定乘以估计的新厅的数量 停车和停车，每辆车都会制造（47）。 感知服务时间是（52）感觉到的等待时间和感知旅行时间的总和。 调整常数，以便长时间的等待时间能够快速旅行。 对轿厢（60）的分配符合（61）所有等待呼叫和下线呼叫的感知服务时间的平方（59）的最小求和。

公开(公告)号：US20080296099A1

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

申请号：US12216314

申请日：2008-07-02

Applicant: Tapio Tyni ,  Jari Ylinen

Inventor： Tapio Tyni ,  Jari Ylinen

IPC: B66B1/18

CPC classification number: G06N3/126 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/40 ,  Y02B50/122

Abstract: 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.

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

公开(公告)号：US20070131484A1

公开(公告)日：2007-06-14

申请号：US10576947

申请日：2004-08-26

Applicant: Shiro Hikita

Inventor： Shiro Hikita

IPC: B66B9/00

CPC classification number: B66B1/2433 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/224 ,  B66B2201/231 ,  B66B2201/243 ,  B66B2201/301 ,  B66B2201/302 ,  Y10S187/902

Abstract: An elevator group supervisory control apparatus is obtained which can achieve efficient group supervisory control while preventing or reducing the possibility of collision and the safe stopping of an upper car and a lower car in one and the same shaft as much as possible. The apparatus includes a hall destination floor registration device 4 that is installed in each hall and has a destination floor registration function and a function of providing a predictive indication of a response car for each destination floor, a zone setting section 12 that sets priority zones and a common zone for each of upper and lower cars, an entry determination section 13 that determines whether the upper and lower cars can come into the common zone, a safe waiting section 14 that makes the cars 20 wait safely in accordance with the determination result of the entry determination section 13, a shunting section 15 that makes each car 20 move to a shunting floor as required at the instant when each car finished its service, a confinement time prediction section 16 that predicts a confinement time due to safe waiting when each car is assigned to a destination call generated in a hall, an evaluation value calculation section 17 that evaluates a waiting time, the confinement time, etc., upon assignment of each car, and an assignment section 18 that determines a final assigned car on the basis of the calculation result of the evaluation value calculation section 17.

Abstract translation: 获得了能够在尽可能地防止或减少碰撞的可能性和同一轴上的上部轿厢和下部轿厢的同时，实现有效的组群管理控制的电梯组管理控制装置。 该装置包括安装在每个厅中的具有目的地楼层登记功能和提供每个目的地楼层的响应车辆的预测指示的功能的厅厅目的地楼层登记装置4，设置优先区域的区域设定部分12和 用于上下车辆的公共区域，确定上下车厢是否可以进入公共区域的入场确定部分13，使得轿厢20根据确定结果的确定结果安全地等待的安全等待部分14 入场确定部13，使每个轿厢20在每个轿厢完成服务的时刻根据需要移动到分流地板的分流部15;预约在每个轿厢安全等待时的限制时间的限制时间预测部16 被分配给在大厅中产生的目的地呼叫，评估值计算部17评估等待时间，限制时刻 e等等，以及基于评估值计算部17的计算结果确定最终分配轿厢的分配部18。

公开(公告)号：US20070080027A1

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

申请号：US11583158

申请日：2006-10-19

Applicant: Johannes De Jong ,  Pentti Laihanen

Inventor： Johannes De Jong ,  Pentti Laihanen

IPC: B66B1/20

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/214 ,  B66B2201/235 ,  B66B2201/301 ,  B66B2201/305

Abstract: The present invention relates to a method for controlling the elevators of an elevator group in a building divided into zones comprising different floors in such manner that, at the passenger's departure floor, the elevators are given calls to floors beyond the zone limits of the departure zone. According to the invention, the aforesaid call is divided into two or more calls.

Abstract translation: 本发明涉及一种用于控制建筑物中的电梯组的电梯的方法，该建筑物分成包括不同楼层的区域，使得在乘客的出发楼层，电梯被呼叫到超出出发区域的范围的楼层 。 根据本发明，上述呼叫被分为两个或更多个呼叫。

公开(公告)号：US20060243536A1

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

申请号：US11406234

申请日：2006-04-19

Applicant: Tapio Tyni ,  Jari Ylinen

Inventor： Tapio Tyni ,  Jari Ylinen

IPC: B66B1/18

CPC classification number: B66B1/2408 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  Y02B50/122

Abstract: An elevator group control method for the allocation of calls, in which method a given service time of the elevator group is assigned a target value. The service time may be passenger waiting time, call time, traveling time, riding time or an average value of one of these quantities. The method aims at fulfilling the assigned target value in such a way that the energy consumption of the elevator system is minimized. Optimization is implemented using a model of the elevator system, by means of which the desired service time can be predicted. This prediction is utilized in a controller controlling the optimizer. This makes it possible to improve the construction and operation of the controller and optimizer so that the energy consumption of the elevator system can be reduced while the condition regarding the target service time is fulfilled at the same time.

Abstract translation: 一种用于分配呼叫的电梯组控制方法，在该方法中，为电梯组的给定服务时间被分配目标值。 服务时间可以是乘客等待时间，通话时间，行驶时间，乘坐时间或其中一个数量的平均值。 该方法旨在以使得电梯系统的能量消耗最小化的方式实现所分配的目标值。 使用电梯系统的模型实现优化，通过该模型可以预测期望的服务时间。 该预测用于控制优化器的控制器。 这使得可以改进控制器和优化器的结构和操作，使得能够在同时满足关于目标服务时间的条件的同时降低电梯系统的能量消耗。

公开(公告)号：US07114595B2

公开(公告)日：2006-10-03

申请号：US10661185

申请日：2003-09-11

Applicant: Masazumi Urata

Inventor： Masazumi Urata

IPC: B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/225 ,  B66B2201/301 ,  B66B2201/303 ,  B66B2201/305

Abstract: An elevator operation system and apparatus reduce the round trip time of an elevator, by determining a target floor that corresponds to the destination floor requested by a passenger; and assigning the target floor to one of a plurality of elevators for service exclusively to the target floor.

Abstract translation: 电梯操作系统和装置通过确定对应于乘客所请求的目的地楼层的目标楼层来减少电梯的往返时间; 并且将目标楼层分配给多个电梯中的一个，以专门服务于目标楼层。

公开(公告)号：US06976560B2

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

申请号：US10411652

申请日：2003-04-12

Applicant: William Newby

Inventor： William Newby

IPC: B66B1/20 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/302

Abstract: An elevator car equalization computer program product includes software instructions for enabling a computer to perform predetermined operations, a computer readable medium bearing the software instructions, and a computer system including a processor and a memory. The predetermined operations include the steps of: (a) receiving at least one user input from at least one data input terminal; (b) determining a location of an originating demand unique to each of the user inputs; (c) determining a location of a destination demand unique to each of the user inputs; (d) calculating a total number of the user inputs received within a predetermined time interval; (e) determining whether the total number of user inputs is less than or more than a total number of available elevators; (f) assigning an elevator to each of the locations of the originating demand; and (g) forming temporary call response zones based upon the elevator assignments. The present system provides shorter average waits, transfer times, trip times, round trip times and equipment use.

Abstract translation: 电梯轿厢均衡计算机程序产品包括用于使计算机执行预定操作的软件指令，承载软件指令的计算机可读介质以及包括处理器和存储器的计算机系统。 预定操作包括以下步骤：（a）从至少一个数据输入终端接收至少一个用户输入; （b）确定每个用户输入唯一的发起请求的位置; （c）确定每个用户输入唯一的目的地需求的位置; （d）计算在预定时间间隔内接收的用户输入的总数; （e）确定用户输入的总数是否小于或大于可用电梯的总数; （f）将电梯分配给原始需求的每个位置; 和（g）基于电梯分配形成临时呼叫响应区域。 本系统提供较短的平均等待时间，传送次数，行程时间，往返时间和设备使用。

公开(公告)号：US06439349B1

公开(公告)日：2002-08-27

申请号：US09746784

申请日：2000-12-21

Applicant: Rory Smith

Inventor： Rory Smith

IPC: B66B118

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/233 ,  B66B2201/235

Abstract: The present invention provides a method and apparatus for use in elevator systems for assigning new hall calls to one of a plurality of available elevator cars. According to the invention, a call cost is calculated for each car for accepting the new hall call. The call cost is a function of the estimated time to the desired destination of the passenger requesting the new hall call and of the delay that other passengers who are using the elevator car will experience. In one embodiment, a destination is inferred for the passenger requesting the new hall call. In another embodiment, the passenger requesting the hall call may input a desired destination at the time the hall call request is made. The elevator system of the present invention allows for use of both standard up/down hall call entry devices and destination entry devices that allow a particular destination to be entered by a passenger at the time a hall call is requested.

Abstract translation: 本发明提供了一种用于电梯系统中的方法和装置，用于向多个可用电梯轿厢之一分配新的门厅呼叫。 根据本发明，为每个轿厢计算接受新的门厅呼叫的通话费用。 呼叫成本是对请求新的门厅呼叫的乘客的期望目的地的估计时间以及正在使用电梯轿厢的其他乘客将经历的延迟的函数。 在一个实施例中，针对请求新的门厅呼叫的乘客推断目的地。 在另一个实施例中，请求门厅呼叫的乘客可以在进行门厅呼叫请求时输入期望的目的地。 本发明的电梯系统允许在请求门厅呼叫时使用允许特定目的地由乘客输入的标准向上/向下门厅呼叫输入设备和目的地输入设备。

公开(公告)号：US20020112922A1

公开(公告)日：2002-08-22

申请号：US09746784

申请日：2000-12-21

Inventor： Rory Smith

IPC: B66B001/36

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/233 ,  B66B2201/235

Abstract: The present invention provides a method and apparatus for use in elevator systems for assigning new hall calls to one of a plurality of available elevator cars. The method comprises calculating for each car a call cost for accepting the new hall call. The call cost is a function of the estimated time to the desired destination of the passenger requesting the new hall call and of the delay that other passengers who are using the elevator car will experience. In one embodiment, a destination is inferred for the passenger requesting the new hall call. In another embodiment, the passenger requesting the hall call may input a desired destination at the time the hall call request is made. The elevator system of the present invention allows for use of both standard up/down hall call entry devices and destination entry devices that allow a particular destination to be entered by a passenger at the time a hall call is requested.

Abstract translation: 本发明提供了一种用于电梯系统中的方法和装置，用于向多个可用电梯轿厢之一分配新的门厅呼叫。 该方法包括为每个轿厢计算接受新的门厅呼叫的通话费用。 呼叫成本是对请求新的门厅呼叫的乘客的期望目的地的估计时间以及正在使用电梯轿厢的其他乘客将经历的延迟的函数。 在一个实施例中，针对请求新的门厅呼叫的乘客推断目的地。 在另一个实施例中，请求门厅呼叫的乘客可以在进行门厅呼叫请求时输入期望的目的地。 本发明的电梯系统允许在请求门厅呼叫时使用允许特定目的地由乘客输入的标准向上/向下门厅呼叫输入设备和目的地输入设备。