CN117657906B - Elevator group control scheduling method, device and storage medium - Google Patents
Elevator group control scheduling method, device and storage medium Download PDFInfo
- Publication number
- CN117657906B CN117657906B CN202410146353.6A CN202410146353A CN117657906B CN 117657906 B CN117657906 B CN 117657906B CN 202410146353 A CN202410146353 A CN 202410146353A CN 117657906 B CN117657906 B CN 117657906B
- Authority
- CN
- China
- Prior art keywords
- elevator
- day
- floor
- time period
- total number
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004590 computer program Methods 0.000 claims abstract description 5
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000012935 Averaging Methods 0.000 claims description 3
- 230000003203 everyday effect Effects 0.000 abstract 1
- 230000003442 weekly effect Effects 0.000 description 7
- 230000001133 acceleration Effects 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V20/00—Scenes; Scene-specific elements
- G06V20/50—Context or environment of the image
-
- 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
-
- 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
- B66B2201/402—Details of the change of control mode by historical, statistical or predicted traffic data, e.g. by learning
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Elevator Control (AREA)
Abstract
The invention discloses a group control scheduling method, a group control scheduling device and a storage medium for elevators, which relate to the technical field of elevator control, wherein the method comprises the following steps: counting the total number of outbound calls in each time period of the elevator in the past day D, and calculating the average outbound call number of each floor of the elevator in each time period corresponding to the current day; step S2: according to the average outbound times of each floor of the elevators in each time period every day and the total number M of the elevators, configuring the initial floor of each elevator in each time period corresponding to the day; and updating outbound times of the time periods corresponding to the current day, and turning to the step S1 again to execute elevator dispatching of the next day. The device comprises a first image acquisition module, a second image acquisition module, an instruction generation module, a processor, a memory and a control terminal. The storage medium stores a computer program. The invention can carry out the initial floor allocation of each elevator in each time period of each week and day according to the historical passenger flow law, and can effectively improve the carrying efficiency and the dispatching efficiency.
Description
Technical Field
The invention relates to the technical field of elevator control, in particular to an elevator group control scheduling method, an elevator group control scheduling device and a storage medium.
Background
With the acceleration of the urban process and the increase of high-rise buildings, elevators play an increasingly important role as vertical vehicles in people's lives. In order to improve the operation efficiency and service quality of elevators, elevator group control dispatching methods based on passenger flow modes are receiving a great deal of attention gradually.
The elevator passenger flow mode refers to an elevator operation mode divided according to the flow of people in a building. Common elevator traffic flow modes include up peak traffic mode, down peak traffic mode, two-way traffic mode, four-way traffic mode, balanced inter-floor traffic mode, and the like. The main people flow direction in the up-peak traffic mode is up-going, such as company elevator in early peak; the main passenger flow direction in the down peak traffic mode is down, such as a company elevator at a late peak; in the two-way traffic mode, the main passenger flow direction is to or from a certain layer, for example, the passenger flow flows into 3 layers when meeting in 3 layers of a whole meeting room, and the passenger flow of 3 layers flows into each layer when meeting; the main passenger flow direction in the four-way traffic mode is to go to or leave from a certain two floors, for example, the passenger flow flows to restaurants on a first floor and a second floor in lunch; in balanced traffic patterns, the number of passengers ascending and descending is equivalent, and the traffic between the layers is equivalent.
The current elevator passenger flow mode mainly focuses on passenger flow direction, for example, when in an up peak, most passenger flows are in a negative first floor or a first floor, and the corresponding group control dispatching method is to place the elevator in the negative first floor or the first floor in advance, however, the method is not friendly to the upward users from a second floor, a third floor and the like, especially when the elevator carrying capacity is idle. Similarly, when the elevator is in a down peak, most of passengers flow to one floor or go to the next floor, but the starting points are different, and the elevator is uniformly placed on the topmost floor, so that the elevator is not the optimal choice, and the waste phenomenon exists. As for balanced inter-floor traffic patterns, the starting position of the elevator dispatch is more difficult to determine, and a good starting position of the elevator has a very important effect on improving the dispatch efficiency of the whole elevator.
Disclosure of Invention
The invention provides an elevator group control scheduling method, an elevator group control scheduling device and a storage medium aiming at the problems existing in the prior art.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
an elevator group control dispatching method comprises the following steps:
Step S1: counting total number of outbound calls in each time period of elevator per day in D days Calculating the average calling number/>, of each layer of the elevator in each period corresponding to the current dayNamely, a period corresponding to a weekly day, wherein the weekly day refers to monday, tuesday, wednesday, thursday, friday, sunday, and sunday of each week; d represents the D day of the past D days, t is a specific time period in a certain day, and f represents the floor where the outbound occurs;
step S2: according to the average number of calls per floor of the elevator in each time period of each day And the total number M of elevators, configuring the initial floor/>, of each elevator in each time period corresponding to the current dayWherein t is a specific time period in a certain day, M is an elevator number, and the values are m=1, 2, … … and M; can be understood as a ladder 1, a ladder 2, … …;
Step S3: and updating outbound times of the time periods corresponding to the current day, and turning to the step S1 again to execute elevator dispatching of the next day.
Based on the above technical solution, in step S1, the calculation process is as follows:
Step S11: dividing each day into T time periods, and counting total number of outbound calls of each floor in each time period of each day in D days ；
Step S12: for total number of outbound calls corresponding to the same day of D daysAveraging to obtain average outbound times/>, corresponding to the current day, of each layer；/>. The interpretation of this formula is: if the day is Tuesday, 14 days have passed, the data of Tuesday and Tuesday should be taken as reference/average, i.e., on days 1 and 8 of the 14 days passed. If the day is friday, 14 days have passed, the data of friday and friday should be taken as reference/average, i.e. again on days 1 and 8 of the 14 days passed.
Based on the technical scheme, the total number of outbound callsAnd counting through the elevator outbound button, and accumulating outbound times in a certain time period.
Based on the above technical solution, still further, the intervals of the T periods include, but are not limited to, 30 minutes, 20 minutes, 10 minutes, 5 minutes, and 1 minute.
Based on the above technical solution, further, the D days are set to be integer multiples of 7.
Based on the above technical solution, in step S2, the configuration process is as follows:
Step S21: average number of outbound calls per floor for each elevator period corresponding to the traversal day Taking the ratio of the maximum value to the total carrying capacity of the elevator/>Wherein c is the maximum passenger capacity of each elevator at each time;
Step S22: if Q >1, the initial floors of all elevators are taken Are all configured as/>Floor corresponding to maximum valueWherein m=1, 2, …, M, step S3; if Q is less than or equal to 1, the floor departure/>Initial floor/>, of nearest elevator mConfigured as/>A step S23;
step S23: the total number of elevators M is subtracted by 1, if it is not 0, step S22 is operated, otherwise step S3 is operated.
An elevator group control dispatching device performs an elevator group control dispatching method, and at least comprises a first image acquisition module, a second image acquisition module, an instruction generation module, a processor, a memory and a control terminal; the first image acquisition module is used for acquiring images in the elevator car; the second image acquisition module is used for acquiring images outside the elevator car; the instruction generation module is used for generating an elevator dispatching instruction according to the image information acquired by the first image acquisition module and the second image acquisition module; the first image acquisition module and the second image acquisition module transmit acquired image information to the memory for storage, the instruction generation module generates an instruction according to the stored information, and the control terminal is used for controlling the processor to execute the corresponding instruction.
Based on the above technical solution, further, the executing the corresponding instruction at least includes total number of outbound callsAverage number of outbound calls per floor of elevator in each period of time/>Configuration of initial floor/>And updating outbound times.
A computer readable storage medium storing a computer program which when executed by a processor implements a group control scheduling method for elevators.
Compared with the prior art, the invention has the following beneficial effects:
The invention provides an elevator group control dispatching method, which is used for carrying out initial floor allocation of each elevator in each time period in each week and day according to a historical passenger flow rule, so that the carrying efficiency and the dispatching efficiency can be effectively improved.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
The invention is further illustrated and described below with reference to the drawings and detailed description. The technical features of the embodiments of the invention can be combined correspondingly on the premise of no mutual conflict.
In order that the above objects, features and advantages of the invention will be readily understood, a more particular description of the invention will be rendered by reference to the appended drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. The present invention may be embodied in many other forms than described herein and similarly modified by those skilled in the art without departing from the spirit of the invention, whereby the invention is not limited to the specific embodiments disclosed below. The technical features of the embodiments of the invention can be combined correspondingly on the premise of no mutual conflict.
Example 1
The present embodiment provides an elevator group control dispatching method, wherein the elevator group control refers to all elevators in a building, in the elevator field, all elevators controlled by an Elevator Group Control System (EGCS) are used, and different buildings should contain different elevator group control systems, the method controls all elevators in the same building, and in combination with the illustration of fig. 1, the specific method comprises the following steps:
Step S1: counting total number of outbound calls in each time period of elevator per day in D days Calculating the average calling number/>, of each layer of the elevator in each period corresponding to the current dayNamely, a period corresponding to a weekly day, wherein the weekly day refers to monday, tuesday, wednesday, thursday, friday, sunday, and sunday of each week; d represents the D day of the past D days, t is a specific time period in a certain day, and f represents the floor where the outbound occurs;
specifically, in step S1, the calculation process is as follows:
Step S11: dividing each day into T time periods, and counting total number of outbound calls of each floor in each time period of each day in D days ；
Step S12: for total number of outbound calls corresponding to the same day of D daysAveraging to obtain average outbound times/>, corresponding to the current day, of each layer；/>. The interpretation of this formula is: if the day is Tuesday, 14 days have passed, the data of Tuesday and Tuesday should be taken as reference/average, i.e., on days 1 and 8 of the 14 days passed. If the day is friday, 14 days have passed, the data of friday and friday should be taken as reference/average, i.e. again on days 1 and 8 of the 14 days passed.
Specifically, the total number of outbound callsAnd counting through the elevator outbound button, and accumulating outbound times in a certain time period. The D days are set to integer multiples of 7. The method can be used for carrying out targeted scheduling aiming at the outbound frequency of different floors of different buildings, and reducing the influence of flow in different places. Wherein the intervals of the T periods include, but are not limited to, 30 minutes, 20 minutes, 10 minutes, 5 minutes, and 1 minute. T is preferably 48, i.e. divided into 48 time periods starting from 0:00 each day, each time period being half an hour long. Examples: if T is taken 48, the specific time period divided is 0:00-0:29,0:30-0:59,1:00-1:29, etc. If T is 144, the specific time period divided is 0:00-0:09,0:10-0:19,0:20-0:29, etc. If D gets 7,d gets 2, T gets 48, t gets 2, f gets 1, then/>Represents the total number of outbound calls for layer 1 over a period of 0:30-0:59 on day 2 over 7 days.
Step S2: according to the average number of calls per floor of the elevator in each time period of each dayAnd the total number M of elevators, configuring the initial floor/>, of each elevator in each time period corresponding to the current dayWherein t is a specific time period in a certain day, M is an elevator number, and the values are m=1, 2, … … and M; can be understood as a ladder 1, a ladder 2, a ladder … … M;
specifically, in step S2, the configuration process is as follows:
Step S21: average number of outbound calls per floor for each elevator period corresponding to the traversal day Taking the ratio of the maximum value to the total carrying capacity of the elevator/>Where c is the maximum passenger capacity per elevator, which varies from elevator type to elevator type, and is generally preferably 11.
Step S22: if Q >1, the initial floors of all elevators are takenAre all configured as/>Floor corresponding to maximum valueWherein m=1, 2, …, M, step S3; if Q is less than or equal to 1, the floor departure/>Initial floor/>, of nearest elevator mConfigured as/>A step S23; for example, assuming a building to have 7 floors (1-7 floors), the day of the week is monday, and the average number of outbound calls per floor (based on historical data) is 70, 5, 3, 25, 28, 10, 40, respectively, during the 9:00-9:29 time period. If there are 3 elevators with maximum value of 70, the current position is 1 floor, 3 floors and 6 floors, the passenger capacity of each elevator is 11, the total carrying capacity of the elevator is 33, Q is 70/33>1, and all the elevators (i.e. three elevators) are configured as floors corresponding to the maximum value of 70, i.e. 1 floor.
Wherein,The average calculation refers to the average of the total number of outbound times of each elevator layer in each time period corresponding to the current day. For example, day is monday, D takes 14, then two monday of the past 14 days are 1 st and 8 th of the past 14 days, respectively, i.e., n 1,t,f and n 8,t,f if T takes 48, T takes 2, f takes 1, then n 1,2,1 and n 8,2,1 represent 0 of 1 st and 8 th of the past 14 days, respectively: 30-0: total number of outbound calls for layer 1 in time period 59. Assuming that it is 30 and 32, respectively, then day 0:30-0: the average total number of outbound calls for layer 1 in the 59 time period is (30+32)/2=31. If the other parameters are unchanged, f is taken to be 2, then the calculation is the current day 0:30-0: average total number of outbound calls for layer 2 over a period of 59. Assuming n 1,2,2 and n 8,2,2 (which represent the total number of outbound calls for layer 2 over a period of 0:30-0:59 on days 1 and 8 of 14 days) are 40 and 44, respectively, then day 0:30-0: the average total number of outbound calls for layer 2 in the 59 time period is (40+44)/2=42. t and f may take different values so that the average number of outgoing calls for different floors at different times can be calculated.
For another example, the average number of outbound calls per layer (based on historical data) is 10, 3, 2, 1, 5, 0, 20, respectively, over a period of 23:00-23:29. If there are 3 elevators whose current positions are 1 floor, 3 floor and 6 floor, and the passenger capacity of each elevator is 11, the total capacity of the elevators is 33, Q is 30/33<1, the initial floor of the 3 rd elevator whose current position is 6 floor, which is the elevator nearest to the maximum 20, is configured as 7 floors, the total number of elevators (originally 3) is reduced by 1 to 2, S22 is performed, the maximum value of 7 floors is removed at this time to 10, 10/22<1, the initial floor of the 1 st elevator whose current position is 1 floor, which is nearest to the maximum 10, is configured as 1 floor, the total number of elevators (currently 2) is reduced by 1 again to 1, S22 is performed again, the maximum value of 7 floors and 1 floor is removed at this time to 5,5/11<1, the initial floor of the 2 nd elevator whose current position is 3 floors, which is nearest to the maximum 5, is configured as 5 floors, the total number of elevators (currently 1) is reduced by 1 to 0, and the total number of elevators is completed. In the time period of 23:00-23:29, the initial floors of the three elevators are respectively configured into 1 floor, 5 floors and 7 floors, namely, after each time of completing the transportation task, the three elevators are respectively stopped at 1 floor, 5 floors and 7 floors.
Step S23: the total number of elevators M is subtracted by 1, if it is not 0, step S22 is operated, otherwise step S3 is operated.
Step S3: and updating outbound times of the time periods corresponding to the current day, and turning to the step S1 again to execute elevator dispatching of the next day. The process of updating the outbound times is as follows: the data of each time period of the day is stored in a storage medium such as a computer hard disk, and the time is called out. Of course, given the upper storage limit of the storage medium, data needs to be cleaned up periodically, such as automatic deletion of data for more than 30 days. The jump process is as follows: for example, d=7, i.e. 7 days taken forever, e.g. day 1.11, thursday, i.e. 7 days 1.4-1.10, including one thursday; and the next day is 1.12, then 1.5-1.11 days 7 still contain only one friday.
Specifically, step S1 and step S2 are both statistics of outbound conditions of D days or weekly days, and step S3 is updating data of the same day, for example: assuming that the day is tuesday, according to the method, the average scheduling of the traffic data of each tuesday should be performed by the method of the last tuesday, etc., and when the day is finished, the number of outbound calls in each time slot of the day (tuesday) should be updated (e.g. added into a database), so that the traffic data of the day (tuesday) can be referred to when the next tuesday is scheduled, that is, the traffic data of the next tuesday is reserved for the scheduling reference of the next tuesday, but the data of each day needs to be saved because 7 days are available for a week. Wherein, the day is the actual day needing to be scheduled now, the previous day D needs to be referred to, only the previous week is referred to in practice, the week is the same as the previous week of the day, for example, the current day is Tuesday, and the method refers to the passenger flow of each Tuesday such as Tuesday, tuesday and Tuesday. In summary, D days comprise several weekly days (e.g., bikes), such as d=14, which is 14 days before, and 2 weekly days (e.g., bikes), which refers to the day of actual scheduling.
Example 2
Based on the elevator group control scheduling device of embodiment 1, an elevator group control scheduling method is executed, and at least comprises a first image acquisition module, a second image acquisition module, an instruction generation module, a processor, a memory and a control terminal; the first image acquisition module is used for acquiring images in the elevator car; the second image acquisition module is used for acquiring images outside the elevator car; the instruction generation module is used for generating an elevator dispatching instruction according to the image information acquired by the first image acquisition module and the second image acquisition module; the first image acquisition module and the second image acquisition module transmit acquired image information to the memory for storage, the instruction generation module generates an instruction according to the stored information, and the control terminal is used for controlling the processor to execute the corresponding instruction. Wherein the execution of the corresponding instruction at least includes the total number of outbound callsAverage number of outbound calls per floor of elevator in each period of time/>Configuration of initial floor/>And updating outbound times.
Example 3
A computer readable storage medium is implemented, storing a computer program which, when executed by a processor, implements an elevator group control scheduling method of embodiment 1.
Finally, it should be noted that the above description is only for illustrating the technical solution of the present invention, and not for limiting the scope of the present invention, and that the simple modification and equivalent substitution of the technical solution of the present invention can be made by those skilled in the art without departing from the spirit and scope of the technical solution of the present invention.
Claims (6)
1. An elevator group control dispatching method is characterized by comprising the following steps:
Step S1: counting total number of outbound calls in each time period of elevator per day in D days Calculating the average calling number/>, of each layer of the elevator in each period corresponding to the current dayWherein D represents the D day of the past D days, t is a specific time period in a certain day, and f represents the floor where the outbound occurs;
The calculation process comprises the following steps:
Step S11: dividing each day into T time periods, and counting total number of outbound calls of each floor in each time period of each day in D days ; The total number of outbound calls/>Counting through an elevator outbound button, and accumulating outbound times in a certain time period to obtain;
step S12: for total number of outbound calls corresponding to the same day of D days Averaging to obtain average outbound times/>, corresponding to the current day, of each layer of the elevator in each period：
；
Step S2: according to the average calling number of each floor of the elevator corresponding to a certain period of the dayAnd the total number M of elevators, configuring the initial floor/>, of each elevator in each time period corresponding to the current dayWherein t is a specific time period in a day; m is the number of the elevator, and the value of m=1, 2, … … and M;
the configuration process comprises the following steps:
step S21: average number of outbound calls per floor of the elevator corresponding to a certain period of time of the day to be acquired Comparing with each other, and taking the comparison/>Ratio of maximum value to total capacity of elevator/>Wherein c is the maximum passenger capacity of each elevator at each time;
Step S22: if Q >1, the initial floors of all elevators are taken Are all configured as/>Floor/>, corresponding to maximum valueWherein m=1, 2, …, M, step S3; if Q is less than or equal to 1, the floor departure/>Initial floor/>, of nearest elevator mIs configured asA step S23;
step S23: subtracting 1 from the total number M of elevators, and if it is not 0, removing the allocated floors Corresponding/>Maximum value, selecting new/>, from the remaining unconfigured floorsMaximum value, using selected new/>The ratio Q is recalculated by the maximum value, the total number M of elevators after subtracting 1 and c, the recalculated Q value is compared with 1, and when Q is less than or equal to 1, the new value is newly selectedThe maximum corresponds to the initial floor/>, of the elevator m with the nearest floorConfigured as the new/>The floor corresponding to the maximum value;
Subtracting 1 from the total number M of elevators, if the total number M of elevators is not 0, continuing to repeat the step S23 until the total number M of elevators is 0, and operating the step S3;
step S3: updating the outbound times of each time period corresponding to the current day, and turning to the step S1 to execute elevator dispatching of the next day;
the process of updating the number of outbound calls is as follows: the data of each time period of the day is stored in a certain storage medium and called out by time.
2. The elevator group control dispatch method of claim 1, wherein in step S11, the intervals of T time periods include, but are not limited to, 30 minutes, 20 minutes, 10 minutes, and 5 minutes.
3. The elevator group control dispatch method of claim 1, wherein D days are set to integer multiples of 7.
4. An elevator group control dispatching device, which uses an elevator group control dispatching method as claimed in any one of claims 1-3, and is characterized by comprising at least a first image acquisition module, a second image acquisition module, an instruction generation module, a processor, a memory and a control terminal;
the first image acquisition module is used for acquiring images in the elevator car;
the second image acquisition module is used for acquiring images outside the elevator car;
The instruction generation module is used for generating an elevator dispatching instruction according to the image information acquired by the first image acquisition module and the second image acquisition module;
The first image acquisition module and the second image acquisition module transmit acquired image information to the memory for storage, the instruction generation module generates an instruction according to the stored information, and the control terminal is used for controlling the processor to execute the corresponding instruction.
5. The elevator group control dispatch device of claim 4, wherein said executing the corresponding instruction includes at least a total number of outgoing callsAverage number of outbound calls per floor of elevator in each period of time/>Configuration of initial floor/>And updating the number of outbound calls.
6. A computer readable storage medium, characterized in that a computer program is stored, which computer program, when executed, implements an elevator group control scheduling method as defined in any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410146353.6A CN117657906B (en) | 2024-02-02 | 2024-02-02 | Elevator group control scheduling method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410146353.6A CN117657906B (en) | 2024-02-02 | 2024-02-02 | Elevator group control scheduling method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117657906A CN117657906A (en) | 2024-03-08 |
| CN117657906B true CN117657906B (en) | 2024-05-03 |
Family
ID=90073541
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410146353.6A Active CN117657906B (en) | 2024-02-02 | 2024-02-02 | Elevator group control scheduling method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117657906B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0656360A (en) * | 1992-08-06 | 1994-03-01 | Mitsubishi Electric Corp | Operating device of elevator |
| JP3215426B2 (en) * | 1994-05-17 | 2001-10-09 | 三菱電機株式会社 | Elevator group management system |
| JP2002302346A (en) * | 2001-04-05 | 2002-10-18 | Mitsubishi Electric Corp | Group control device for elevator |
| JP2004137044A (en) * | 2002-10-18 | 2004-05-13 | Mitsubishi Electric Corp | Elevator group supervisory operation control device |
| CN102421689A (en) * | 2009-05-26 | 2012-04-18 | 三菱电机株式会社 | Elevator group management device |
| JP2016160079A (en) * | 2015-03-04 | 2016-09-05 | 株式会社日立製作所 | Elevator management system and elevator management method |
| CN109720947A (en) * | 2017-10-30 | 2019-05-07 | 株式会社日立制作所 | External system co-simulation modeling system and method |
-
2024
- 2024-02-02 CN CN202410146353.6A patent/CN117657906B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0656360A (en) * | 1992-08-06 | 1994-03-01 | Mitsubishi Electric Corp | Operating device of elevator |
| JP3215426B2 (en) * | 1994-05-17 | 2001-10-09 | 三菱電機株式会社 | Elevator group management system |
| JP2002302346A (en) * | 2001-04-05 | 2002-10-18 | Mitsubishi Electric Corp | Group control device for elevator |
| JP2004137044A (en) * | 2002-10-18 | 2004-05-13 | Mitsubishi Electric Corp | Elevator group supervisory operation control device |
| CN102421689A (en) * | 2009-05-26 | 2012-04-18 | 三菱电机株式会社 | Elevator group management device |
| JP2016160079A (en) * | 2015-03-04 | 2016-09-05 | 株式会社日立製作所 | Elevator management system and elevator management method |
| CN109720947A (en) * | 2017-10-30 | 2019-05-07 | 株式会社日立制作所 | External system co-simulation modeling system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117657906A (en) | 2024-03-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7603285B2 (en) | Enterprise scheduling system for scheduling mobile service representatives | |
| US8960374B2 (en) | Elevator group control method and device for performing control based on a waiting time expectation value of all passengers on all floors | |
| JPH02110088A (en) | Group control unit for elevator | |
| CN110654946A (en) | Community elevator dispatching method and system based on artificial intelligence | |
| JP2019081622A (en) | Vehicle allocation system of external system cooperation and method | |
| CN113435968A (en) | Network appointment vehicle dispatching method, device, electronic equipment and storage medium | |
| CN109636105A (en) | Method, apparatus, computer equipment and the storage medium of elevator dispatching | |
| CN111160720A (en) | Automatic bus scheduling event handling method and device | |
| CN117657906B (en) | Elevator group control scheduling method, device and storage medium | |
| CN114180423B (en) | Elevator dispatching method, device, equipment and storage medium | |
| Brand et al. | Optimal parking in group elevator control | |
| JP2018520075A (en) | Call assignment method for elevator group | |
| CN111807172B (en) | Scanning type elevator group control dispatching method and system and elevator system | |
| CN111931128B (en) | Bernoulli model-based elevator configuration method, system, equipment and storage medium | |
| CN115730781A (en) | Bus route optimization system based on big data analysis | |
| JP2601500B2 (en) | Elevator control device | |
| JPH0649552B2 (en) | Group management control method for elevators | |
| CN111924673A (en) | Linkage elevator scheduling method, system, computer equipment and storage medium | |
| JP2002167129A (en) | Elevator control device and method | |
| CN112258051A (en) | Bus driver and passenger scheduling method | |
| JP5875923B2 (en) | Elevator group management operation rate control device | |
| JP2728396B2 (en) | Elevator control device | |
| JP2507433B2 (en) | Elevator group management control device | |
| CN117550451B (en) | Elevator energy-saving group control dispatching method based on passenger flow estimation | |
| JP3524167B2 (en) | Side-by-side elevator control system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |