Elevator system
AssigneeKone Corporation
InventorsTapio Tyni, Jari Ylinen
Life of this patent
Estimating the term…
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.
Claims31
Method for controlling the elevators belonging to an elevator group based on the calls given, in which the elevator comprises one or more elevator cars disposed in the same elevator shaft, and in which method a genetic algorithm is used, according to which algorithm:
- at least one allocation option i.e. chromosome is formed, which chromosome contains call data and elevator data for each active landing call or destination, which data i.e. genes together determine the elevator car serving the landing call or destination call;
- for each chromosome a value of the cost function is determined;
- at least one chromosome with respect to at least one gene is formed;
- for each chromosome formed a value of the cost function is determined;
- the forming of chromosomes is repeated, until the exit criterion is fulfilled;
- on the basis of the values of the cost function the best chromosome is selected;
- and
- the elevator cars are directed to the given calls according to the selected best genes of the chromosome,
- wherein the method further comprises the phase:
- information about the run type i.e. the run type gene is linked to the chromosome in connection with each call data and each elevator data, in which run type gene the run type determines the speed profile, according to which the elevator that owns the elevator car travels between the departure floor and the call issuing floor defined by the call gene linked to the run type gene.
Control system of an elevator group for controlling the elevators belonging to an elevator group based on the calls given, in which an elevator comprises one or more elevator cars in the same elevator shaft, and which control system comprises a GA optimizer, utilizing a genetic algorithm, in which the GA optimizer is arranged:
- to form at least one allocation option i.e. chromosome, which chromosome includes call data and elevator data for each active landing call or destination call, which data i.e. genes together determine the elevator car serving each landing call or destination call;
- to determine for each chromosome the value of the cost function;
- to formulate at least one chromosome with respect to at least one gene;
- to determine for each formulated chromosome the value of the cost function;
- to repeat the formulation of chromosomes until the exit criterion is fulfilled;
- to select the best chromosome based on the values of the cost function;
- and
- to direct the elevator cars to the given calls according to the genes of the selected best chromosome,
- wherein the GA optimizer is further arranged:
- to link information about the run type, i.e. the run type gene, in which the run type determines the speed profile, to the chromosome in connection with each call data call and each elevator data, according to which the elevator that owns the elevator car travels between the departure floor and the call issuing floor defined by the call gene, linked to the run type gene.
Computer program for controlling the elevators belonging to an elevator group based on the calls given, in which the elevator comprises one or more elevator cars disposed in the same elevator shaft, and which utilizes a genetic algorithm, and in which the computer program comprises a program code, which when running on a data processing appliance is arranged to perform the following phases of the algorithm:
- at least one allocation option i.e. chromosome is formed, which chromosome contains data and elevator data for each active landing call or destination call, which data i.e. genes together determine the elevator car serving the landing call or destination call;
- for each chromosome a value of the cost function is determined;
- at least one chromosome with respect to at least one gene is formed;
- for each chromosome formed a value of the cost function is determined;
- the forming of chromosomes is repeated, until the exit criterion is fulfilled;
- on the basis of the values of the cost function the best chromosome is selected;
- and
- the elevator cars are directed to the given calls according to the selected best genes of the chromosome,
- wherein the program code when running on a data processing appliance is further arranged to perform the phase:
- information about the run type i.e. the run type gene is linked to the chromosome in connection with each call data and each elevator data, in which run type gene the run type determines the speed profile, according to which the elevator that owns the elevator car travels between the departure floor and the call issuing floor defined by the call gene linked to the run type gene.
Dependencies are inferred from the claim text.