Method for controlling an elevator system

Patent metadata

Field	Value
Publication number	US-10071879-B2
Application number	US-201514634173-A
Country	US
Kind code	B2
Filing date	Feb 27, 2015
Priority date	Sep 11, 2012
Publication date	Sep 11, 2018
Grant date	Sep 11, 2018

Abstract

A method for controlling an elevator where an elevator is allocated for the use of a passenger in a first optimization phase in such a way that a first cost function is minimized, a second optimization phase is performed, in which the route of the allocated elevator is optimized in such a way that a second cost function is minimized.

First claim

The invention claimed is:

1. A method for controlling an elevator system, which elevator system comprises: at least one elevator; call-giving devices for giving calls to the elevator system; and a control system that is responsive to the calls, wherein the method comprises the steps of:
registering a call given by a passenger;
allocating an elevator serving the registered call in a first optimization phase in such a way that a desired first cost function is minimized;
optimizing the route of the allocated elevator in a second optimization phase in such a way that a desired second cost function is minimized; and
controlling the allocated elevator according to the optimized route.

2. The method according to claim 1 , further comprising the step of updating the optimized route of an elevator by repeating the second optimization phase during the elevator service.

3. The method according to claim 1 , further comprising the step of utilizing genetic algorithms in the first and/or in the second optimization phase.

4. The method according to claim 1 , further comprising the step of using the collective control principle in the first optimization phase.

5. The method according to claim 1 , wherein the first cost function and/or the second cost function comprises at least one magnitude related to the operation of the elevator system, which magnitudes are: call time, waiting time, travel time, run time, traffic intensity, and energy consumption.

6. The method according to claim 1 , wherein the first cost function and/or the second cost function is minimized for at least one desired magnitude with a set boundary condition.

7. The method according to claim 1 , wherein the method further comprises the phase: further comprising the step of making an assumption about the destination floor of a passenger if the call is given with up/down call pushbuttons.

8. The method according to claim 2 , further comprising the step of utilizing genetic algorithms in the first and/or in the second optimization phase.

9. The method according to claim 2 , further comprising the step of using the collective control principle in the first optimization phase.

10. The method according to claim 3 , further comprising the step of using the collective control principle in the first optimization phase.

11. The method according to claim 2 , wherein the first cost function and/or the second cost function comprises at least one magnitude related to the operation of the elevator system, which magnitudes are: call time, waiting time, travel time, run time, and traffic intensity, energy consumption.

12. The method according to claim 3 , wherein the first cost function and/or the second cost function comprises at least one magnitude related to the operation of the elevator system, which magnitudes are: call time, waiting time, travel time, run time, and traffic intensity, energy consumption.

13. The method according to claim 4 , wherein the first cost function and/or the second cost function comprises at least one magnitude related to the operation of the elevator system, which magnitudes are: call time, waiting time, travel time, run time, and traffic intensity, energy consumption.

14. The method according to claim 2 , wherein the first cost function and/or the second cost function is minimized for at least one desired magnitude with a set boundary condition.

15. The method according to claim 3 , wherein the first cost function and/or the second cost function is minimized for at least one desired magnitude with a set boundary condition.

16. The method according to claim 4 , wherein the first cost function and/or the second cost function is minimized for at least one desired magnitude with a set boundary condition.

17. The method according to claim 5 , wherein the first cost function and/or the second cost function is minimized for at least one desired magnitude with a set boundary condition.

18. The method according to claim 2 , further comprising the step of making an assumption about the destination floor of a passenger if the call is given with up/down call pushbuttons.

19. The method according to claim 3 , further comprising the step of making an assumption about the destination floor of a passenger if the call is given with up/down call pushbuttons.

20. The method according to claim 4 , further comprising the step of making an assumption about the destination floor of a passenger if the call is given with up/down call pushbuttons.

Assignees

• Kone Corp

Inventors

• Sorsa Janne
• Kuusinen Juha-Matti
• Ruokokoski Mirko

Classifications

• B66B2201/214

  Total time, i.e. arrival time · CPC title

• B66B1/2408 Primary

  where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller · CPC title

• B66B2201/231

  Sequential evaluation of plurality of criteria · CPC title

• B66B2201/103

  Destination call input before entering the elevator car · CPC title

• B66B2201/211

  Waiting time, i.e. response time · CPC title