METHOD FOR CONTROLLING AN ELEVATOR SYSTEM AND CONTROLLER FOR AN ELEVATOR SYSTEM
    1.
    发明申请
    METHOD FOR CONTROLLING AN ELEVATOR SYSTEM AND CONTROLLER FOR AN ELEVATOR SYSTEM 审中-公开
    电梯系统的控制方法和电梯系统的控制器

    公开(公告)号:WO2004043840A2

    公开(公告)日:2004-05-27

    申请号:PCT/JP0313128

    申请日:2003-10-14

    Abstract: A method controls the distribution of free cars in an elevator system. First, the number of free cars in the elevator system are counted whenever this number changes. At the same time, the arrival/destination rates of passengers at each of the floor is determined. The rates are used to identify up-peak and down-peak traffic patterns. The floors of the building are then assigned to zones. The number of floors in each zone is determined according to the arrival rates, and the free cars are then parked in the zones so that the expected waiting time of the next arriving passenger is minimized.

    Abstract translation: 一种方法控制电梯系统中免费汽车的分配。 首先,只要这个数字发生变化,电梯系统中的免费轿厢数量就会被计算在内。 同时,确定每个楼层的乘客到达/目的地费率。 费率用于识别高峰和低峰交通模式。 然后将建筑物的楼层分配到区域。 每个区域的楼层数量根据到达率确定,然后将免费汽车停放在区域中,以便下一个到达的乘客的预期等待时间最小化。

    3.
    发明专利
    未知

    公开(公告)号:DE602007001161D1

    公开(公告)日:2009-07-09

    申请号:DE602007001161

    申请日:2007-03-23

    Abstract: A method schedules cars of an elevator system. Each possible assignment of a set of hall calls to a set of cars is represented by a solution vector maintained as a node in a search tree. Each solution vector is evaluated using an ESA-DP process according to an immediate policy to determine initially a best solution. A branch-and-bound process is applied to each solution vector using the initial best solution and the search tree to determine a globally optimal solution for scheduling the cars according to a reassignment policy.

    4.
    发明专利
    未知

    公开(公告)号:DE602007000334D1

    公开(公告)日:2009-01-22

    申请号:DE602007000334

    申请日:2007-03-23

    Abstract: A method schedules cars of an elevator system, the elevator system including a set of cars, and a set of hall calls. For each car, a waiting time is determined independently if the hall call is the only hall call assigned to the car. For each car, a mutual delay ” W ( h | g ) is determined for each possible pair of unassigned hall calls h and assigned hall calls g. The waiting time and mutual delays are summed. Then, the assignments are made to the set of cars so that the sum is a minimum.

    7.
    发明专利
    未知

    公开(公告)号:DE602004017308D1

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

    申请号:DE602004017308

    申请日:2004-06-18

    Abstract: A method schedules cars of an elevator system in a building. The method begins execution whenever a newly arrived passenger presses an up or down button to generate a call for service. For each car, determine a first waiting time for all existing passengers if the car is assigned to service the call, based on future states of the elevator system. For each car, determine a second waiting time of future passengers if the car is assigned to service the call, based on a landing pattern of the cars. For each car, combine the first and second waiting times to produce an adjusted waiting time, The method ends by assigning a particular car having a lowest adjusted waiting time to service the call and minimize an average waiting time of all passengers.

Patent Agency Ranking