EP1368267B1 - Method for solving a multi-goal problem - Google Patents
Method for solving a multi-goal problem Download PDFInfo
- Publication number
- EP1368267B1 EP1368267B1 EP02700305A EP02700305A EP1368267B1 EP 1368267 B1 EP1368267 B1 EP 1368267B1 EP 02700305 A EP02700305 A EP 02700305A EP 02700305 A EP02700305 A EP 02700305A EP 1368267 B1 EP1368267 B1 EP 1368267B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- elevator
- norm
- factors
- allocation
- solutions
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
- B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
- B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/10—Details with respect to the type of call input
- B66B2201/102—Up or down call input
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/211—Waiting time, i.e. response time
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/212—Travel time
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/215—Transportation capacity
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/216—Energy consumption
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/243—Distribution of elevator cars, e.g. based on expected future need
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/40—Details of the change of control mode
Definitions
- the present invention relates to a method as defined in of claim 1.
- the traditional approach is to calculate the delays and passenger waiting times.
- coefficients it is possible to control the degree of importance assigned to the passenger's waiting time at a floor, the passenger's traveling time in an elevator car and the stops during the travel of the car proposed for the passenger.
- the goals of optimization can also be easily changed.
- the objective may be to serve the passenger having pressed a call button as soon as possible and to transport the passenger to the destination floor without delay.
- the elevator control system must take into account the calls and expectations of other elevator passengers as well.
- the elevator or elevators is/are designed to take care of all internal transportation needs within the building, so the allocation of an individual call is subject to additional conditions relating to traffic situation, traffic intensity and available capacity. If the elevator control system additionally has to take into account the minimization of energy consumption, aim at reducing the number of starts of the elevator or park any elevators that may be free in the current traffic situation at certain floors by considering overall advantages, then managing the cost function by prior-art methods is an impossible task.
- the object of the invention is to disclose a new method for optimizing a solution to a problem situation in which the solution is influenced by a plurality of factors that are not commensurable quantities.
- the method of the invention is characterized by the features presented in the characterization part of claim.
- a multi-goal optimization problem can be solved quickly and reliably so that different factors contributing to the optimization are weighted in a desired manner.
- the computation time needed in the optimization can be limited to a short time so that, in situations where the computing time is limited, alternative solutions are considered when a decision is being made.
- alternative solutions are considered when a decision is being made.
- speed and efficiency are of primary importance.
- a c of allocation solutions (reference number 1), which contains all possible solutions for serving the calls active in the elevator group.
- the allocation alternatives can be divided into two sub-spaces CT (2) and E (3) according to their relation to call times on the one hand and to energy consumption on the other hand. These spaces have statistical properties such as distribution, expectation value ⁇ and variance ⁇ 2 .
- the statistical properties of these two spaces are described in Fig. 2 .
- the unit for call time is second while the unit for energy consumption is Joule - the quantities also differ from each other in respect of statistical properties, as appears from Fig. 2 .
- the targets of optimization are also to be weighted in different ways in different situations.
- the task may be to find a solution in which energy consumption has a weight of 30 % and call times have a weight of 70 %.
- Fig. 3 presents a drawing visualizing the utilization of a sample in the definition of normalized functions. Where applicable, the designations and reference numbers used in Fig. 3 are the same as in Fig. 1 .
- each landing call is encoded as a gene of a call chromosome.
- the position of the gene in the chromosome represents an active landing call, and correspondingly the value of the gene represents the elevator car proposed to serve the landing call.
- Each chromosome represents one alternative solution to the allocation problem that is able to serve the active calls. From the chromosomes, a population typically comprising about 50 chromosomes or solution alternatives is formed. For each chromosome in the population is determined a so-called Fitness value, which consists of the sum of the cost functions of the elevators serving active calls. The cost functions are defined on the basis of selected criteria, and their values are computed using a model of each elevator.
- Fig. 5 visualizes an example embodiment of the invention in which a multi-goal problem is solved by utilizing both normalization of non-commensurable cost functions and methods of allocation based on a genetic algorithm.
- chromosomes and computation of the Fitness values, reference is made to patent specification US 5932852 .
- the chromosomes 40 of the first population are generated, on the basis of which the Fitness values of the allocation alternatives corresponding to the chromosomes are determined, considering both call time optimization CT and energy consumption E, in a computation unit 42.
- the elevator group comprises two elevators, elevator A and elevator B.
- an elevator model 44 and 46 respectively, has been formed, these models comprising the required elevator-specific information for the calculation of the cost functions.
- cost functions are determined in the computation unit for both call times CT A and CT B and energy consumption E A and E B .
- a first population is produced e.g. in the manner described in patent specification US 5932852 .
- sample averages ⁇ PF1 and ⁇ PF2 and sample variances s 2 PF1 and s 2 PF2 for a sample according to the first population are determined in the manner specified in Fig. 3 and formulas 1-3.
- sample quantities ⁇ and s 2 are used in the calculation of the Fitness value 54 of a chromosome.
- a weighting coefficient K PF1 and K PF2 (block 58) defined for the partial cost function by the operator 56, e.g. the owner of the building, is taken into account.
- the calculated results constitute the total Fitness value of the chromosome and they are stored in a table 60. On the basis of these values, the best solution alternatives of the population are evaluated. In the next populations, the sample quantities ⁇ and s 2 are utilized, which are used to normalize the partial cost functions, whereas the other factors used a basis of calculation change in a manner determined by the genes of the chromosome and the elevator models.
- the normalization of the partial cost functions and the calculation of the values of the normalized cost functions are performed in block 54, whereas the calculation of the values of the sub-functions, in this case call times and energy consumption, is performed in block 45, taking the call situations and elevator models into account.
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Elevator Control (AREA)
- Indicating And Signalling Devices For Elevators (AREA)
- Feedback Control In General (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
- The present invention relates to a method as defined in of claim 1.
- When the most advantageous alternative is to be selected in a situation where the final result depends on a plurality of factors, there often arises a conflict regarding the emphasis to be given to different factors. When the properties and ways of action of different factors are similar and commensurable, it is generally easy to develop methods in which the factors are mutually correctly weighted and the changes occurring in them are properly taken into account.
- For example, to optimize the way in which an elevator or elevator group serves a call issued by a passenger, the traditional approach is to calculate the delays and passenger waiting times. By using coefficients, it is possible to control the degree of importance assigned to the passenger's waiting time at a floor, the passenger's traveling time in an elevator car and the stops during the travel of the car proposed for the passenger. As all these factors are quantities of time, comparing and matching them to each other will not involve insuperable difficulties. The goals of optimization can also be easily changed.
- When the factors to be optimized at the same time are not commensurable, it is difficult to compare them and to take them equally into consideration. It may be possible to accurately determine the share of individual factors in a cost function. However, different factors may have different degrees of influence, their effects on the matter as a whole may appear on quite different levels, and these effects may even be conflicting. Thus, optimizing the cost function so as to reach a desired goal is a very extensive and multidimensional process.
- In the allocation of elevator calls, the objective may be to serve the passenger having pressed a call button as soon as possible and to transport the passenger to the destination floor without delay. On the other hand, the elevator control system must take into account the calls and expectations of other elevator passengers as well. Furthermore, the elevator or elevators is/are designed to take care of all internal transportation needs within the building, so the allocation of an individual call is subject to additional conditions relating to traffic situation, traffic intensity and available capacity. If the elevator control system additionally has to take into account the minimization of energy consumption, aim at reducing the number of starts of the elevator or park any elevators that may be free in the current traffic situation at certain floors by considering overall advantages, then managing the cost function by prior-art methods is an impossible task.
- The object of the invention is to disclose a new method for optimizing a solution to a problem situation in which the solution is influenced by a plurality of factors that are not commensurable quantities. To achieve this, the method of the invention is characterized by the features presented in the characterization part of claim.
- By the method of the invention, a multi-goal optimization problem can be solved quickly and reliably so that different factors contributing to the optimization are weighted in a desired manner. The computation time needed in the optimization can be limited to a short time so that, in situations where the computing time is limited, alternative solutions are considered when a decision is being made. E.g. in elevator group control applications, in which allocation decisions have to be made repeatedly and for constantly changing cost functions, speed and efficiency are of primary importance.
- By utilizing the properties of genetic algorithms, sub-functions and overall optimization can be executed advantageously and very quickly with reasonable computing capacity.
- In the following, the invention will be described in detail by the aid of an example of its embodiments with reference to the attached drawings, wherein
-
Fig. 1 visualizes a multi-goal optimization problem -
Fig. 2 represents the differences between the distributions of the goals of the multi-goal problem -
Fig. 3 illustrates an approach according to the invention -
Fig. 4 represents normalized distributions of cost functions -
Fig. 5 presents an example based on a genetic algorithm according to the invention. - In the following, a solution to a multi-goal problem is described where the objectives are, on the one hand, optimization of energy consumption and, on the other hand, optimization of passengers' call times. In mathematical terms, the optimization problem for solution alternative A of the total cost function J can be expressed by the equation
Where CI represents an individual cost function, in this example call time and energy consumption for alternative A and
WI represents a weighting coefficient assigned to the individual cost function. - In this case, the solution to the optimization problem is minimization of function J. A problematic question is how to define correct values for the weighting coefficients. If a given cost function, such as call time, gets a high weighting, then it will become dominating and the influence of the other factors will remain marginal. Also, a small cost function may have a very small influence.
- Referring to
Fig. 1 and 2 , let us consider the optimization of passengers' call times and energy consumption of the elevator in the same space A c of allocation solutions (reference number 1), which contains all possible solutions for serving the calls active in the elevator group. The allocation alternatives can be divided into two sub-spaces CT (2) and E (3) according to their relation to call times on the one hand and to energy consumption on the other hand. These spaces have statistical properties such as distribution, expectation value ξ and variance σ2. The statistical properties of these two spaces are described inFig. 2 . In addition to the difference of units of measurement - the unit for call time is second while the unit for energy consumption is Joule - the quantities also differ from each other in respect of statistical properties, as appears fromFig. 2 . - Besides being non-commensurable, the targets of optimization are also to be weighted in different ways in different situations. For example, the task may be to find a solution in which energy consumption has a weight of 30 % and call times have a weight of 70 %.
-
- In practical solutions, such a procedure is not viable because going through the entire space to be considered is a task too laborious and in most cases impossible. Instead, the expectation value and variance can be approximated by using their sample equivalents, sample average µ and sample variance s2. The normalized cost function can thus be expressed in the form
- The sample average µ is normally distributed with variance σ2/n, which can well be used to estimate the required number of samples n.
Fig. 3 presents a drawing visualizing the utilization of a sample in the definition of normalized functions. Where applicable, the designations and reference numbers used inFig. 3 are the same as inFig. 1 . -
Fig. 4 visualizes the relationship between the normalized cost functions. As the cost functions are commensurable, they can be added together and their sums can be evaluated by the same criteria. As indicated inFig. 4 , the normalized cost function obtained for call time is CTnorm = (CT - µCT)/sCT and correspondingly the normalized cost function for energy consumption is Enorm = (E - µE)/sE. The normalized total cost function, which is to be minimized, is correspondingly
where KCT and KI are drive-specific coefficients to be determined separately. - In the following embodiment example, the implementation of multi-goal optimization using a genetic algorithm is described. Below is a short summary of the application of a genetic algorithm to the allocation of elevator calls. For a more detailed description, reference is made e.g. to patent specification
US 5932852 . - When calls are allocated by means of a genetic algorithm, each landing call is encoded as a gene of a call chromosome. The position of the gene in the chromosome represents an active landing call, and correspondingly the value of the gene represents the elevator car proposed to serve the landing call. Each chromosome represents one alternative solution to the allocation problem that is able to serve the active calls. From the chromosomes, a population typically comprising about 50 chromosomes or solution alternatives is formed. For each chromosome in the population is determined a so-called Fitness value, which consists of the sum of the cost functions of the elevators serving active calls. The cost functions are defined on the basis of selected criteria, and their values are computed using a model of each elevator.
- After the Fitness values of all the chromosomes have been determined, they are listed in order of Fitness values. From the chromosomes, new generations are formed by genetic algorithm methods. After about 20 - 50 generations, the best alternative can be found, and this alternative is selected to serve the active landing calls.
-
Fig. 5 visualizes an example embodiment of the invention in which a multi-goal problem is solved by utilizing both normalization of non-commensurable cost functions and methods of allocation based on a genetic algorithm. As for the formation of chromosomes and computation of the Fitness values, reference is made to patent specificationUS 5932852 . - On the basis of the active landing calls and car calls, the
chromosomes 40 of the first population are generated, on the basis of which the Fitness values of the allocation alternatives corresponding to the chromosomes are determined, considering both call time optimization CT and energy consumption E, in acomputation unit 42. In the example presented inFig. 5 , the elevator group comprises two elevators, elevator A and elevator B. For each elevator, anelevator model - A first population is produced e.g. in the manner described in patent specification
US 5932852 . Based on the partial Fitness values of this first population, i.e. on the values of the partial cost functions, sample averages µPF1 and µPF2 and sample variances s2 PF1 and s2 PF2 for a sample according to the first population are determined in the manner specified inFig. 3 and formulas 1-3. These sample quantities µ and s2 are used in the calculation of theFitness value 54 of a chromosome. In the determination of the Fitness value, a weighting coefficient KPF1 and KPF2 (block 58) defined for the partial cost function by theoperator 56, e.g. the owner of the building, is taken into account. The calculated results constitute the total Fitness value of the chromosome and they are stored in a table 60. On the basis of these values, the best solution alternatives of the population are evaluated. In the next populations, the sample quantities µ and s2 are utilized, which are used to normalize the partial cost functions, whereas the other factors used a basis of calculation change in a manner determined by the genes of the chromosome and the elevator models. - In the embodiment example presented in
Fig. 5 , the normalization of the partial cost functions and the calculation of the values of the normalized cost functions are performed inblock 54, whereas the calculation of the values of the sub-functions, in this case call times and energy consumption, is performed inblock 45, taking the call situations and elevator models into account.
Claims (6)
- Method for optimizing the allocation of passenger calls in an elevator control system of an elevator group consisting of several elevators (A,B), which calls are signalled to the elevator control system by the passengers via call buttons, in which method factors, such as e.g. passengers' travelling times, passengers' waiting times, number of stops during the travel of the cars, the passengers' call times (CT) and the energy consumption (E) of the elevators in the elevator group are optimized, the method comprising following steps:- on the basis of active landing calls and car calls a plurality of alternative allocation solutions AC is generated in said elevator control system,
this plurality of allocation solutions AC comprises subspaces (CT, E) with the cost functions of the solution alternatives regarding two individual factors e.g. CT or E to be optimised, from which subspaces (CT, E) a number n of samples are drawn building a sample space (SPCT,SPE) with corresponding statistical values as sample average µCT,E and sample variance s2 CT,E of said two factors,- for each of the plurality of allocation solutions normalized individual cost functions (CTnorm, Enorm) of said at least two factors are established by following equation
for i=1 to n whereby Ci is the individual cost function of a factor, e.g. CT or E, µi is the sample average of
the sample space (SPCT,SPE) of the corresponding factor and s is the square root of the sample variance s2 CT,E of the corresponding factor,- the total normalised cost function (Jnorm) of an allocation solution is obtained by the sum of the normalized factor related cost functions
whereby Ki are drive-specific weighting coefficients
and- from the set of alternative allocation solutions the alternative is selected having the lowest total normalized cost function (Jnorm),- this alternative is selected for the elevators (A,B) to serve the active landing calls. - Method as defined in claim 1, characterized in that at least one of the factors is a function of the time spent by an elevator passenger on a trip in an elevator and at least one of the factors is a function of a quantity associated with elevator group control other than the time spent by an elevator passenger on a trip in an elevator.
- Method as defined in claim 1 or 2, characterized in that genetic algorithm methods are utilized in the optimization.
- Method as defined in claim 3, characterized in that, in the allocation of elevator calls, a first set of solutions is generated, by means of which a sample average and a sample variance are determined.
- Method as defined in claim 4, characterized in that the sample average (µCT,E) and sample variance (s2 CT,E) determined by means of the first set of solutions are used in the calculation of the cost functions of the sub-functions when the cost functions of the sub-functions of later sets of solutions are being determined.
- Method as defined in one of the preceding claims, characterized in that the weighting coefficients (Ki) of the factor related normalised cost functions (Ci norm) have been determined beforehand.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FI20010370A FI115421B (en) | 2001-02-23 | 2001-02-23 | A method for solving a multi-objective problem |
FI20010370 | 2001-02-23 | ||
PCT/FI2002/000136 WO2002088014A2 (en) | 2001-02-23 | 2002-02-19 | Method for solving a multi-goal problem |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1368267A2 EP1368267A2 (en) | 2003-12-10 |
EP1368267B1 true EP1368267B1 (en) | 2012-05-23 |
Family
ID=8560510
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP02700305A Expired - Lifetime EP1368267B1 (en) | 2001-02-23 | 2002-02-19 | Method for solving a multi-goal problem |
Country Status (5)
Country | Link |
---|---|
US (1) | US6889799B2 (en) |
EP (1) | EP1368267B1 (en) |
DE (1) | DE02700305T1 (en) |
FI (1) | FI115421B (en) |
WO (1) | WO2002088014A2 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2023165697A1 (en) | 2022-03-03 | 2023-09-07 | Kone Corporation | A solution for providing condition data of an elevator rope |
WO2023165696A1 (en) | 2022-03-03 | 2023-09-07 | Kone Corporation | A solution for an elevator call allocation of an elevator group |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6889383B1 (en) * | 2000-10-23 | 2005-05-03 | Clearplay, Inc. | Delivery of navigation data for playback of audio and video content |
FI111837B (en) * | 2001-07-06 | 2003-09-30 | Kone Corp | Procedure for allocating external calls |
US7032715B2 (en) * | 2003-07-07 | 2006-04-25 | Thyssen Elevator Capital Corp. | Methods and apparatus for assigning elevator hall calls to minimize energy use |
FI115130B (en) * | 2003-11-03 | 2005-03-15 | Kone Corp | Control method of lift system, involves defining set of solutions for alternate route at low energy consumption and selecting solutions satisfying desired service time from defined set so as to allocate calls to lift |
JP4139819B2 (en) * | 2005-03-23 | 2008-08-27 | 株式会社日立製作所 | Elevator group management system |
US20080234944A1 (en) * | 2005-07-21 | 2008-09-25 | Koninklijke Philips Electronics, N.V. | Method and Apparatus for Subset Selection with Preference Maximization |
FI118260B (en) * | 2006-03-03 | 2007-09-14 | Kone Corp | Lift system |
US7484597B2 (en) * | 2006-03-27 | 2009-02-03 | Mitsubishi Electric Research Laboratories, Inc. | System and method for scheduling elevator cars using branch-and-bound |
US7743890B2 (en) * | 2007-06-12 | 2010-06-29 | Mitsubishi Electric Research Laboratories, Inc. | Method and system for determining instantaneous peak power consumption in elevator banks |
US9633014B2 (en) * | 2009-04-08 | 2017-04-25 | Google Inc. | Policy based video content syndication |
WO2013040539A1 (en) * | 2011-09-16 | 2013-03-21 | Siemens Corporation | Method and system for energy control management |
US9244655B1 (en) | 2013-03-13 | 2016-01-26 | Ca, Inc. | Solution modeling and analysis toolset for enterprise software architecture and skeleton architecture |
US9189203B1 (en) * | 2013-03-13 | 2015-11-17 | Ca, Inc. | Solution modeling and analysis toolset for enterprise software architecture and architecture roadmaps |
US9400637B1 (en) | 2013-03-13 | 2016-07-26 | Ca, Inc. | Solution modeling and analysis toolset for enterprise software architecture |
WO2014198302A1 (en) * | 2013-06-11 | 2014-12-18 | Kone Corporation | Method for allocating and serving destination calls in an elevator group |
KR102153042B1 (en) * | 2013-08-29 | 2020-09-07 | 삼성전자주식회사 | Method and apparatus for performing function by combining at least one block |
EP3126274B1 (en) * | 2014-06-10 | 2022-11-30 | KONE Corporation | Method for controlling a passenger transport system |
CN110171753B (en) * | 2019-06-03 | 2021-09-21 | 日立楼宇技术(广州)有限公司 | Elevator dispatching strategy processing method, device, equipment and storage medium |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2573715B2 (en) * | 1990-03-28 | 1997-01-22 | 三菱電機株式会社 | Elevator control device |
US5529147A (en) * | 1990-06-19 | 1996-06-25 | Mitsubishi Denki Kabushiki Kaisha | Apparatus for controlling elevator cars based on car delay |
US5394509A (en) * | 1992-03-31 | 1995-02-28 | Winston; Patrick H. | Data processing system and method for searching for improved results from a process |
US5612519A (en) * | 1992-04-14 | 1997-03-18 | Inventio Ag | Method and apparatus for assigning calls entered at floors to cars of a group of elevators |
JPH06171845A (en) * | 1992-12-02 | 1994-06-21 | Hitachi Ltd | Elevator operation control device and method |
FI102268B1 (en) | 1995-04-21 | 1998-11-13 | Kone Corp | A method for allocating external calls to an elevator group |
US5780789A (en) * | 1995-07-21 | 1998-07-14 | Mitsubishi Denki Kabushiki Kaisha | Group managing system for elevator cars |
KR100202720B1 (en) * | 1996-12-30 | 1999-06-15 | 이종수 | Method of controlling multi elevator |
FI107604B (en) * | 1997-08-15 | 2001-09-14 | Kone Corp | A genetic method for allocating external calls to an elevator group |
FI107379B (en) | 1997-12-23 | 2001-07-31 | Kone Corp | A genetic method for allocating external calls to an elevator group |
US6439349B1 (en) * | 2000-12-21 | 2002-08-27 | Thyssen Elevator Capital Corp. | Method and apparatus for assigning new hall calls to one of a plurality of elevator cars |
-
2001
- 2001-02-23 FI FI20010370A patent/FI115421B/en not_active IP Right Cessation
-
2002
- 2002-02-19 WO PCT/FI2002/000136 patent/WO2002088014A2/en not_active Application Discontinuation
- 2002-02-19 EP EP02700305A patent/EP1368267B1/en not_active Expired - Lifetime
- 2002-02-19 DE DE0001368267T patent/DE02700305T1/en active Pending
-
2003
- 2003-08-19 US US10/642,623 patent/US6889799B2/en not_active Expired - Lifetime
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2023165697A1 (en) | 2022-03-03 | 2023-09-07 | Kone Corporation | A solution for providing condition data of an elevator rope |
WO2023165696A1 (en) | 2022-03-03 | 2023-09-07 | Kone Corporation | A solution for an elevator call allocation of an elevator group |
Also Published As
Publication number | Publication date |
---|---|
WO2002088014A3 (en) | 2002-12-27 |
US20040060776A1 (en) | 2004-04-01 |
FI20010370A0 (en) | 2001-02-23 |
FI115421B (en) | 2005-04-29 |
FI20010370A (en) | 2002-08-24 |
WO2002088014A2 (en) | 2002-11-07 |
EP1368267A2 (en) | 2003-12-10 |
US6889799B2 (en) | 2005-05-10 |
DE02700305T1 (en) | 2004-08-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1368267B1 (en) | Method for solving a multi-goal problem | |
Cortés et al. | Genetic algorithm for controllers in elevator groups: analysis and simulation during lunchpeak traffic | |
US5612519A (en) | Method and apparatus for assigning calls entered at floors to cars of a group of elevators | |
EP0895506B1 (en) | Procedure for control of an elevator group consisting of double-deck elevators, which optimises passenger journey time | |
US7275623B2 (en) | Allocating landing calls in an elevator group using a cost function | |
CN100374362C (en) | Method for the allocation of passengers in an elevator group | |
CN110171753B (en) | Elevator dispatching strategy processing method, device, equipment and storage medium | |
Tervonen et al. | Elevator planning with stochastic multicriteria acceptability analysis | |
EP1638878B1 (en) | Method and elevator scheduler for scheduling plurality of cars of elevator system in building | |
JP4870863B2 (en) | Elevator group optimum management method and optimum management system | |
JPH11503706A (en) | Assignment method of hall calls in elevator group | |
US10183836B2 (en) | Allocating destination calls using genetic algorithm employing chromosomes | |
US10227207B2 (en) | Routing optimization in a multi-deck elevator | |
EP1735229B1 (en) | Method for controlling an elevator system | |
EP1414729B1 (en) | Method for allocating landing calls | |
Cortés et al. | Design and analysis of a tool for planning and simulating dynamic vertical transport | |
Cortés et al. | A genetic algorithm for controlling elevator group systems | |
JP2003525187A (en) | Passenger assignment method and apparatus by genetic algorithm | |
Sorsa | Optimization models and numerical algorithms for an elevator group control system | |
Yu et al. | Multi-car elevator system using genetic network programming for high-rise building | |
WO2016070937A1 (en) | Method for controlling an elevator system | |
Sorsa | A real-time genetic algorithm for the bilevel double-deck elevator dispatching problem | |
CN110127464B (en) | Multi-objective elevator dispatching system and method based on dynamic optimization | |
US7475757B2 (en) | Elevator dispatching with balanced passenger perception of waiting | |
Al-Sharif | Enhancing the Inter-Linked Monte Carlo Simulation Method (iL MCS) to Reflect Random Passenger Inter-Arrivals |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20030828 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
DET | De: translation of patent claims | ||
17Q | First examination report despatched |
Effective date: 20041110 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 60242956 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: B66B0001180000 Ipc: B66B0001240000 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: B66B 1/24 20060101AFI20111017BHEP |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 60242956 Country of ref document: DE Effective date: 20120719 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20130226 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 60242956 Country of ref document: DE Effective date: 20130226 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 15 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20170217 Year of fee payment: 16 Ref country code: FR Payment date: 20170217 Year of fee payment: 16 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20170216 Year of fee payment: 16 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 60242956 Country of ref document: DE |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20180219 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20181031 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180901 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180219 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180228 |