CN111924673B - Linkage elevator scheduling method, system, computer equipment and storage medium - Google Patents
Linkage elevator scheduling method, system, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111924673B CN111924673B CN202010678727.0A CN202010678727A CN111924673B CN 111924673 B CN111924673 B CN 111924673B CN 202010678727 A CN202010678727 A CN 202010678727A CN 111924673 B CN111924673 B CN 111924673B
- Authority
- CN
- China
- Prior art keywords
- elevator
- target
- dispatching
- floor
- information
- 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
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/28—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration electrical
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
- B66B1/3415—Control system configuration and the data transmission or communication within the control system
- B66B1/3446—Data transmission or communication within the control system
- B66B1/3461—Data transmission or communication within the control system between the elevator control system and remote or mobile stations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- 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/103—Destination call input before entering the elevator car
-
- 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/214—Total time, i.e. arrival time
-
- 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/46—Switches or switchgear
- B66B2201/4607—Call registering systems
- B66B2201/4615—Wherein the destination is registered before boarding
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B50/00—Energy efficient technologies in elevators, escalators and moving walkways, e.g. energy saving or recuperation technologies
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Mathematical Optimization (AREA)
- Probability & Statistics with Applications (AREA)
- Life Sciences & Earth Sciences (AREA)
- Operations Research (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Networks & Wireless Communication (AREA)
- Algebra (AREA)
- Evolutionary Biology (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Elevator Control (AREA)
Abstract
The invention provides a scheduling method, a system, computer equipment and a storage medium of a linkage elevator, which are used for scheduling an elevator according to basic information of a target area and a scheduling instruction of a user and according to the fact whether an idle elevator exists or not, and selecting an elevator with shorter expected time as a target elevator to be scheduled, thereby realizing the most appropriate elevator scheduling method based on the actual situation of the target area, reducing the waiting time of the user and improving the user experience and the elevator operation efficiency.
Description
Technical Field
The invention relates to the technical field of computer communication, in particular to a linkage elevator scheduling method, a linkage elevator scheduling system, linkage elevator scheduling computer equipment and a storage medium.
Background
In the conventional elevator dispatching, most elevators are always dispatched according to the original elevator mode, so that one elevator which is not in the running process and is closest to the running process is called to serve when a plurality of elevators are dispatched alternately. The dispatching method does not consider the speed of the elevator, the number of floors and the distance between floors, even after people in the elevator change the elevator path, the use probability cannot be estimated, the experience of the user in using the elevator is seriously influenced, the operation efficiency of the elevator is reduced, and the dispatching threshold of the elevator is reduced.
Disclosure of Invention
In view of the above, it is necessary to provide a dispatching method, a dispatching system, a computer device and a storage medium for a linked elevator.
A method of dispatching a linked elevator, the method comprising: acquiring basic information of a target area, wherein the basic information comprises elevator configuration information and building attribute information; receiving a dispatching instruction of a user, wherein the dispatching instruction comprises target floor information and target running direction information of the user; judging whether an idle elevator exists or not; if the target running direction information exists, judging whether a co-running elevator exists according to the target running direction information, if the co-running elevator exists, respectively calculating expected time values of an idle elevator and the co-running elevator reaching a target floor, selecting the elevator with a smaller expected time value as a target elevator dispatching direction, and if the co-running elevator does not exist, directly selecting the elevator with a smallest expected time value as a target elevator dispatching direction; and if no idle elevator exists, respectively calculating expected time values of all elevators reaching the target floor, and selecting the elevator with the minimum expected time value as the target elevator to dispatch to.
In one embodiment, before receiving a scheduling instruction of a user, where the scheduling instruction includes information of a target floor where the user is located and information of a target running direction, the method further includes: and dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information.
In one embodiment, after receiving a dispatching instruction of a user, where the dispatching instruction includes information of a target floor where the user is located and information of a target running direction, the method further includes: when the elevator use time period is in a peak period, the elevator needs to be dispatched to the highest floor or the lowest floor with dispatching instructions.
In one embodiment, the expected time value to reach the target floor is specifically: and obtaining the running time and the estimated residence time of the elevator according to the basic information, and obtaining the expected time value of the elevator reaching the target floor according to the running time and the estimated residence time of the elevator.
In one embodiment, if there is no co-current elevator, directly selecting the elevator with the minimum expected time value as a target elevator to dispatch to specifically: and if no elevator in the same row exists, respectively calculating expected time values of the idle elevator and the different elevator reaching the target floor, and selecting the elevator with the smaller expected time value as the target elevator to dispatch to go.
A linkage elevator dispatching system comprises an information acquisition module, an instruction receiving module, a first judgment module, a positive dispatching module and a negative dispatching module, wherein: the information acquisition module is used for acquiring basic information of a target area, wherein the basic information comprises elevator configuration information and building attribute information; the instruction receiving module is used for receiving a dispatching instruction of a user, wherein the dispatching instruction comprises target floor information and target running direction information of the user; the first judgment module is used for judging whether an idle elevator exists or not; the positive dispatching module is used for judging whether a co-traveling elevator exists according to the target running direction information if the co-traveling elevator exists, respectively calculating expected time values of an idle elevator and the co-traveling elevator reaching a target floor if the co-traveling elevator exists, selecting the elevator with a smaller expected time value as a target elevator dispatching direction, and directly selecting the elevator with the smallest expected time value as the target elevator dispatching direction if the co-traveling elevator does not exist; and the negative dispatching module is used for respectively calculating expected time values of all elevators reaching the target floor if no idle elevator exists, and selecting the elevator with the minimum expected time value as the target elevator dispatching direction.
In one embodiment, the system further comprises a time segmentation module: the time segmentation module is used for dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information.
In one embodiment, the system further comprises a peak scheduling module: and the peak dispatching module is used for dispatching the elevator to the highest floor or the lowest floor with dispatching instructions when the elevator is in a peak time period.
A computer apparatus comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the coordinated elevator scheduling method described in the above embodiments when executing the program.
A storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of dispatching a linked elevator described in the above-mentioned embodiments.
According to the scheduling method, the system, the computer equipment and the storage medium of the linked elevator, the elevator scheduling is carried out according to basic information of a target area and a scheduling instruction of a user and according to the fact whether an idle elevator exists or not, the elevator with shorter expected time is selected as the target elevator to be scheduled to go, the elevator is in a low valley period, a common period and a peak period according to basic service conditions, and the elevator is scheduled to the highest layer or the lowest layer with the scheduling instruction aiming at the peak period, so that the most appropriate elevator scheduling method based on the actual condition of the target area is realized, the waiting time of the user is reduced, and the user experience degree and the elevator operation efficiency are improved.
Drawings
Fig. 1 is a schematic flow chart of a scheduling method of a linked elevator in one embodiment;
fig. 2 is a block diagram of a dispatching system of a linked elevator in one embodiment;
FIG. 3 is a block diagram of an acknowledgment scheduling module in one embodiment;
FIG. 4 is a diagram of the internal structure of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings by way of specific embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
In one embodiment, as shown in fig. 1, there is provided a dispatching method of a linked elevator, comprising the steps of:
s110, basic information of the target area is obtained, and the basic information comprises elevator configuration information and building attribute information.
Specifically, basic information of a target area is obtained, wherein the target area refers to an area needing to adjust an elevator dispatching method, including but not limited to residential districts and commercial buildings, the basic information comprises elevator configuration information and building attribute information, wherein the elevator configuration information specifically comprises the number N of elevators and the maximum constant speed V of elevator operation max The number of people with the maximum load of the elevator P max Elevator starting acceleration a start The static acceleration a of the elevator stop Elevator maximum load M max Elevator mass M and elevator real load mass M (M is less than or equal to M) max ) And residence response time T stay And the like, and the building attribute information refers to other situations of the building besides the elevator, such as building resident situations, building buildings of the building and the like, wherein the building resident situations comprise: average number of stories per floor Q e Average person of each familyNumber P e The total number of people P ═ Q e *P e (ii) a Building conditions include: minimum floor distance S and maximum floor number n f The number n of target floors n The number n of floor intervals is equal to n 1 -n 2 (n 1 <n f ) Maximum floor distance S max ＝S*n f And an elevator path L n ＝n*S。
S120, receiving a dispatching instruction of a user, wherein the dispatching instruction comprises target floor information and target running direction information of the user.
Specifically, when a user floor sends a dispatching instruction, namely a user presses an elevator, the dispatching instruction of the user is received, wherein the dispatching instruction comprises a floor pressed by the user, namely target floor information to which the elevator needs to arrive, and the selected uplink or downlink is the target running direction information of the elevator.
In one embodiment, before step S120, the method further includes: and dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information. Specifically, the use probability of the elevator is not evenly distributed, and the use time of the elevator is divided into a low valley period, a common period and a peak period according to the actual situation; the valley period is generally set as: 22: 00-6: 00; the data can be formulated according to night patrol time of community security, the elevator scheduling problem is not considered in the time period, and the use experience cannot be influenced when the data is the same as the scheduling mode of other two periods. While peak settings are typically: 7: 00-9: 00, 16: 00-20: 00; the data is formulated according to national subway and highway peak periods published by the traffic bureau. For the normal period setting then: the time periods other than the valley period and the peak period are normal periods.
In one embodiment, after step S120, the method further includes: when the elevator use time period is in a peak period, the elevator needs to be dispatched to the highest floor or the lowest floor with dispatching instructions. Specifically, according to a traditional peak scheduling mode, the uplink and the downlink are not distinguished, and if the bearing weight reaches the upper limit, the elevator only moves to a target area reached by a user in the current elevator; therefore, when the peak scheduling mode is to ensure that all floors can be seated to the elevator, all elevators need to be issued to the uppermost layer or the lowermost layer with scheduling requirements; and the rest can be scheduled according to the ordinary trip.
S130 judges whether there is an empty elevator.
Specifically, based on the information obtained in step S120, it is first determined whether there is an empty elevator, and that is, an elevator that is not running.
And S140, if so, judging whether a co-current elevator exists according to the target running direction information:
S140A, if the elevator in the same row exists, respectively calculating expected time values of the idle elevator and the elevator in the same row reaching the target floor, and selecting the elevator with smaller expected time value as the target elevator to dispatch to;
and S140B, if no elevator in the same row exists, directly selecting the elevator with the minimum expected time value as the target elevator for dispatching.
Specifically, the average probability is used for presetting the use frequency of the elevator as g, the g represents that the average probability of the average use times of the elevator per day of each person is used for presetting the number of users per floor to be equal, and then the elevator daily non-common use single path is as follows:
L n ＝n*S*Q e *P e *g
the elevator operation algorithm is as follows:
the running time of the elevator is as follows:
T＝t 1 +t 2 +t
probability of elevator being operated:
the probability of waiting for the elevator simultaneously then turns into traditional probability, and two people wait to an elevator probability simultaneously promptly:
p (n) ═ P (two classes equal shift) n
Because the number of people in different shifts reaches the mutual exclusion event, the probability can be calculated by using the Bernoulli formula
According to bernoulli profile formula:
the probability of several people, i.e. a certain person, counting the same shift can be calculated, and the actual application must be such that n < P because the elevator load capacity is fixed.
When the elevator runs, the buttons in the same direction block again, and due to the property of the elevator, the elevator can be intercepted in the ascending process, generally in the descending process with a very small probability.
The probability algorithm is the same as the average probability of use, then:
p (n1) ═ P (probability of interception) n
But as the lower the floor is, the lower the probability of a downlink collision is, so that:
therefore, if there is an idle elevator, it is judged whether there is a co-traveling elevator, and if there is a co-traveling elevator, a co-traveling elevator path L is calculated n N × S, the expected downlink time is:
i.e., the down stream expectation time is equal to the run time plus the intercept hold time, where T is the run time,
calculating the idle elevator down time T 2 ：
If T 2 ＜T In fact Calling out an idle elevator for going; if T 2 ＞T Practice of And waiting for the elevator in the same row to go forward.
If there are no co-traveling elevators, then a non-co-traveling elevator path is calculated:
L n ＝(n 2 -n 1 )*S+n*S
the downlink expected time is as follows:
T in fact ＝T+T stay
Calculating the idle elevator down time T 2 ：
If T is 2 ＜T In fact Then the idle elevator is called out for going; if T 2 ＞T Practice of And waiting for the non-co-traveling elevator to go forward.
In one embodiment, the desired time to reach the target floor is specifically: and obtaining the running time and the estimated residence time of the elevator according to the basic information, and obtaining the expected time value of the elevator reaching the target floor according to the running time and the estimated residence time of the elevator. Specifically, the expected time value is based on the sum of the running time of the elevator and the residence time in the dispatching way, and the running time of the elevator can be directly obtained according to basic information, but the residence time in the dispatching way is estimated through a Bernoulli model, which is specifically described in the steps S140, S140A and S140B.
In one embodiment, if there is no co-current elevator, the step S140 directly selects the elevator with the minimum expected time value as the target elevator to dispatch to specifically: and if no elevator in the same row exists, respectively calculating expected time values of the idle elevator and the elevator in the different row reaching the target floor, and selecting the elevator with the smaller expected time value as the target elevator to dispatch to the destination. Specifically, when the elevator in the same row does not exist, the calculation of reaching the target floor is directly carried out on the elevator in the different row and the idle elevator respectively, so that the expected time of reaching the target floor can be obtained, and the elevator with shorter expected time is selected as the target elevator and is transferred to the target floor.
And S150, if no idle elevator exists, respectively calculating expected time values of all elevators reaching the target floor, and selecting the elevator with the minimum expected time value as the target elevator to dispatch to.
Specifically, all elevator paths are calculated: l is n N × S, the expected downlink time is:
when no idle elevator exists, the expected time value of each elevator reaching the target floor needs to be directly calculated, and then the elevator corresponding to the minimum expected time value is selected as the target elevator and dispatched to the target floor.
In the embodiment, the elevator dispatching is carried out according to the basic information of the target area and the dispatching instruction of the user and according to the fact whether the idle elevator exists or not, the elevator with shorter expected time is selected as the dispatching destination of the target elevator during the dispatching, the elevator is in the valley period, the ordinary period and the peak period according to the basic use condition, and the elevator is dispatched to the highest layer or the lowest layer with the dispatching instruction according to the peak period, so that the most appropriate elevator dispatching method based on the actual condition of the target area is realized, the waiting time of the user is reduced, and the user experience and the elevator operation efficiency are improved.
In one embodiment, as shown in fig. 2, there is provided a dispatching system 200 of a linked elevator, the system comprising an information obtaining module 210, a command receiving module 220, a first judging module 230, a positive dispatching module 240 and a negative dispatching module 250, wherein:
the information acquisition module 210 is used for acquiring basic information of a target area, wherein the basic information comprises elevator configuration information and building attribute information;
the instruction receiving module 220 is configured to receive a scheduling instruction of a user, where the scheduling instruction includes information of a target floor where the user is located and information of a target operation direction;
the first judging module 230 is configured to judge whether an idle elevator exists;
the positive dispatching module 240 is used for judging whether a co-traveling elevator exists according to the target running direction information if the co-traveling elevator exists, respectively calculating expected time values of the idle elevator and the co-traveling elevator reaching a target floor if the co-traveling elevator exists, and selecting the elevator with a smaller expected time value as the target elevator to dispatch to go;
and the negative dispatching module 250 is used for respectively calculating expected time values of all elevators reaching the target floor if no idle elevator exists, and selecting the elevator with smaller expected time value as the target elevator to dispatch to go.
In one embodiment, the system further comprises a time segmentation module, wherein: the time segmentation module is used for dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information.
In one embodiment, the system further comprises a peak scheduling module, wherein: the peak dispatching module is used for dispatching the elevator to the highest floor or the lowest floor with dispatching instructions when the elevator use time period is in a peak period.
In one embodiment, the positive dispatch module 240 is further configured to obtain the elevator running time and the estimated residence time according to the basic information, and obtain the expected time value for the elevator to reach the target floor according to the elevator running time and the estimated residence time.
In one embodiment, as shown in fig. 3, the positive scheduling module 240 further includes a peer determining unit 241, a presence scheduling unit 242, and a negative scheduling unit 243, wherein: the peer judgment unit 241 is used for judging whether a peer elevator exists according to the target running direction information; the presence dispatching unit 242 is configured to, if there is a co-traveling elevator, calculate expected time values of the idle elevator and the co-traveling elevator reaching the target floor, respectively, and select an elevator with a smaller expected time value as a target elevator to dispatch to; the negative dispatch unit 243 is configured to, if there is no co-current elevator, calculate expected time values for the idle elevator and the non-co-current elevator to reach the target floor, and select an elevator with a smaller expected time value as the target elevator to dispatch to the destination.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing the configuration template and also used for storing target webpage data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of dispatching a linked elevator.
It will be appreciated by those skilled in the art that the configuration shown in fig. 4 is a block diagram of only a portion of the configuration associated with the present application, and is not intended to limit the computing device to which the present application may be applied, and that a particular computing device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, there is also provided a storage medium storing a computer program comprising program instructions which, when executed by a computer, cause the computer to perform the method according to the preceding embodiment, the computer may be part of the aforementioned ganged elevator dispatching system.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above may be implemented by a computer program, which may be stored in a computer readable storage medium and executed by a computer to implement the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
It will be apparent to those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be centralized on a single computing device or distributed across a network of computing devices, and optionally they may be implemented in program code executable by a computing device, such that they may be stored on a computer storage medium (ROM/RAM, magnetic disks, optical disks) and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The foregoing is a more detailed description of the present invention with reference to specific embodiments thereof, and it is not intended to limit the invention to the specific embodiments thereof. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.
Claims (6)
1. A coordinated elevator dispatching method, comprising:
obtaining basic information of a target area, wherein the basic information comprises elevator configuration information and building attribute information;
the elevator configuration information specifically comprises the number N of elevators and the maximum constant speed V of elevator operation max The number of people with the maximum load of the elevator P max Elevator starting acceleration a start The static acceleration a of the elevator stop Elevator maximum load M max Mass M of elevator and real-load mass M of elevator (M is less than or equal to M) max ) And a residence response time T stay Information, and building attribute information refers to other situations of the building besides elevators: building resident conditions and floor building conditions, wherein the building resident conditions comprise: average number of stories Q per floor e Average number of people per household P e The total number of people P ═ Q e *P e (ii) a Building conditions include: minimum floor distance S and maximum floor number n f The number n of target floors n The number n of floor intervals is equal to n 1 -n 2 (n 1 <n f ) And the maximum floor distance Smax ═ S × n f And an elevator path L n ＝n*S；
Receiving a dispatching instruction of a user, wherein the dispatching instruction comprises target floor information and target running direction information of the user;
judging whether an idle elevator exists or not;
if the destination elevator does not exist, directly selecting the elevator with the minimum expected time value as the destination elevator to dispatch to;
wherein, predetermine the elevator frequency of use by average probability and be g, g expresses that every person average use elevator number of times average probability of every day predetermines every floor user number equal, then the elevator is not jointly used a path every day and is:
L n ＝n*S*Q e *P e *g
the elevator operation algorithm is as follows:
the running time of the elevator is as follows:
T＝t 1 +t 2 +t
probability of elevator being operated:
the probability of waiting for the elevator simultaneously then turns into traditional probability, and two people wait to elevator probability of a shift simultaneously promptly:
p (n) ═ P (two shifts equal) n
As the number of people in different shifts reaches the exclusive event, the probability can be calculated by applying Bernoulli formula
According to the bernoulli profile formula:
the probability of a plurality of persons, namely a person with the same number of shifts can be calculated, and n is less than P in practical application due to the fixed bearing capacity of the elevator;
when the elevator runs, the buttons in the same direction block again, and due to the property of the elevator, the elevator can be intercepted only with very small probability when going upwards, generally when going downwards;
the interception probability is the same as the average use probability, then:
p (n1) ═ P (probability of interception) n
But as the lower the floor is, the lower the probability of a downlink collision is, so that:
therefore, if an idle elevator exists, judgment is made as to whether a co-traveling elevator exists, and if a co-traveling elevator exists, a co-traveling elevator path L is calculated n N × S, the expected downlink time is:
namely, the expected descending time is equal to the running time plus the interception detention time, T is the running time in the above formula, and the descending time T of the idle elevator is calculated 2 ：
If T 2 ＜T In fact Calling out an idle elevator for going; if T 2 ＞T In fact Waiting for the elevator in the same row to go ahead;
if there are no co-traveling elevators, then a non-co-traveling elevator path is calculated:
L n ＝(n 2 -n 1 )*S+n*S
the downlink expected time is as follows:
T practice of ＝T+T stay
Calculating idle elevator down time T 2 ：
If T 2 ＜T Practice of Then the idle elevator is called out for going; if T 2 ＞T Practice of Waiting for the non-co-traveling elevator to go ahead;
if no idle elevator exists, respectively calculating expected time values of all elevators reaching a target floor, and selecting the elevator with the minimum expected time value as a target elevator to be dispatched to;
calculate all elevator paths: l is n N × S, the expected downlink time is:
when no idle elevator exists, the expected time value of each elevator reaching the target floor needs to be directly calculated, then the elevator corresponding to the minimum expected time value is selected as the target elevator, and the target elevator is dispatched to the target floor;
the method comprises the following steps that before receiving a dispatching instruction of a user, the dispatching instruction comprises target floor information and target running direction information of the user, the method further comprises the following steps: dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information; wherein, the setting of the low valley period is as follows: 22: 00-6: 00; the low valley period data is formulated according to the night patrol time of the community security guard, the time period does not consider the elevator dispatching problem, and the peak period data is set as: 7: 00-9: 00, 16: 00-20: 00; the peak period data is formulated according to national subway and highway peak periods published by the traffic bureau; for the normal period setting then: the time periods except the valley period and the peak period are common periods;
the method comprises the following steps that after the dispatching instruction of the user is received and comprises the target floor information and the target running direction information of the user, the method further comprises the following steps: when the elevator is used in a peak period, the elevator needs to be dispatched to the highest floor or the lowest floor with a dispatching instruction;
the expected time value to reach the target floor is specifically: obtaining elevator running time and estimated detention time according to the basic information, and obtaining an expected time value of the elevator reaching a target floor according to the elevator running time and the estimated detention time;
if no elevator in the same row exists, the elevator with the minimum expected time value is directly selected as a target elevator to be dispatched to the destination specifically: and if no elevator in the same row exists, respectively calculating expected time values of the idle elevator and the different elevator reaching the target floor, and selecting the elevator with the smaller expected time value as the target elevator to dispatch to go.
2. The linkage elevator dispatching system is characterized by comprising an information acquisition module, an instruction receiving module, a first judgment module, a positive dispatching module and a negative dispatching module, wherein: the information acquisition module is used for acquiring basic information of a target area, wherein the basic information comprises elevator configuration information and building attribute information; the instruction receiving module is used for receiving a dispatching instruction of a user, wherein the dispatching instruction comprises target floor information and target running direction information of the user; the first judgment module is used for judging whether an idle elevator exists or not; the positive dispatching module is used for judging whether a co-traveling elevator exists according to the target running direction information if the co-traveling elevator exists, respectively calculating expected time values of an idle elevator and the co-traveling elevator reaching a target floor if the co-traveling elevator exists, selecting the elevator with a smaller expected time value as a target elevator dispatching head, and directly selecting the elevator with a smallest expected time value as the target elevator dispatching head if the co-traveling elevator does not exist; and the negative dispatching module is used for respectively calculating expected time values of all elevators reaching the target floor if no idle elevator exists, and selecting the elevator with the minimum expected time value as the target elevator dispatching direction.
3. The system of claim 2, further comprising a time segmentation module to: the time segmentation module is used for dividing the elevator use time period into a low valley period, a common period and a peak period according to preset information.
4. The system of claim 3, further comprising a peak scheduling module: and the peak dispatching module is used for dispatching the elevator to the highest floor or the lowest floor with dispatching instructions when the elevator is in a peak time period.
5. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the steps of the method of claim 1 are implemented when the computer program is executed by the processor.
6. A storage medium having a computer program stored thereon, the computer program, when being executed by a processor, realizing the steps of the method as claimed in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010678727.0A CN111924673B (en) | 2020-07-15 | 2020-07-15 | Linkage elevator scheduling method, system, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010678727.0A CN111924673B (en) | 2020-07-15 | 2020-07-15 | Linkage elevator scheduling method, system, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111924673A CN111924673A (en) | 2020-11-13 |
| CN111924673B true CN111924673B (en) | 2022-08-19 |
Family
ID=73312432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010678727.0A Active CN111924673B (en) | 2020-07-15 | 2020-07-15 | Linkage elevator scheduling method, system, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111924673B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101734528A (en) * | 2010-01-30 | 2010-06-16 | 宁波宏大电梯有限公司 | Elevator parallel operation scheduling method |
| CN109205407A (en) * | 2018-11-09 | 2019-01-15 | 京东方科技集团股份有限公司 | Elevator riding implementation method, terminal and storage medium |
| CN109636105A (en) * | 2018-11-06 | 2019-04-16 | 日立楼宇技术（广州）有限公司 | Method, apparatus, computer equipment and the storage medium of elevator dispatching |
| CN110104511A (en) * | 2019-04-02 | 2019-08-09 | 日立楼宇技术（广州）有限公司 | Elevator operation control method, device, system and storage medium |
| CN110342354A (en) * | 2019-07-09 | 2019-10-18 | 日立楼宇技术（广州）有限公司 | A kind of elevator scheduling method, device, elevator device and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6808049B2 (en) * | 2002-11-13 | 2004-10-26 | Mitsubishi Electric Research Laboratories, Inc. | Optimal parking of free cars in elevator group control |
| CN102738789B (en) * | 2012-03-28 | 2014-09-10 | 国家电网公司 | Economical dispatch control system for cascade power station |
| CN106056319A (en) * | 2016-07-13 | 2016-10-26 | 吴志铭 | Evaluation method based on BIM and case-based reasoning for improving building safety design |
| US9988237B1 (en) * | 2016-11-29 | 2018-06-05 | International Business Machines Corporation | Elevator management according to probabilistic destination determination |
| GB2563891B (en) * | 2017-06-28 | 2022-02-23 | Avire Ltd | An elevator control system and an elevator system |
| CN109693981B (en) * | 2019-02-28 | 2021-10-01 | 百度在线网络技术（北京）有限公司 | Method and apparatus for transmitting information |
-
2020
- 2020-07-15 CN CN202010678727.0A patent/CN111924673B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101734528A (en) * | 2010-01-30 | 2010-06-16 | 宁波宏大电梯有限公司 | Elevator parallel operation scheduling method |
| CN109636105A (en) * | 2018-11-06 | 2019-04-16 | 日立楼宇技术（广州）有限公司 | Method, apparatus, computer equipment and the storage medium of elevator dispatching |
| CN109205407A (en) * | 2018-11-09 | 2019-01-15 | 京东方科技集团股份有限公司 | Elevator riding implementation method, terminal and storage medium |
| CN110104511A (en) * | 2019-04-02 | 2019-08-09 | 日立楼宇技术（广州）有限公司 | Elevator operation control method, device, system and storage medium |
| CN110342354A (en) * | 2019-07-09 | 2019-10-18 | 日立楼宇技术（广州）有限公司 | A kind of elevator scheduling method, device, elevator device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111924673A (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8276715B2 (en) | Method and apparatus for assigning elevator hall calls based on time metrics | |
| KR101088283B1 (en) | Elevator group control apparatus and method | |
| CN109205415B (en) | Elevator group control method and device, computer equipment and storage medium | |
| CN109693980B (en) | Elevator dispatching method, device and system | |
| CN110654946B (en) | Community elevator dispatching method and system based on artificial intelligence | |
| US6328134B1 (en) | Group management and control system for elevators | |
| CN109720947B (en) | External system cooperative distribution system and method | |
| EP1560778B1 (en) | Method for controlling an elevator system and controller for an elevator system | |
| US20110284329A1 (en) | Elevator group control method and device thereof | |
| CN113682908B (en) | Intelligent scheduling method based on deep learning | |
| US8800723B2 (en) | Elevator system having floors locked from receiving service | |
| CN105084140A (en) | Optimization method and device for elevator calling and waiting time distributed at intervals in circulating manner | |
| CN111931128B (en) | Bernoulli model-based elevator configuration method, system, equipment and storage medium | |
| CN109693978B (en) | Intelligent elevator dispatching method and device, computer equipment and storage medium | |
| CN111924673B (en) | Linkage elevator scheduling method, system, computer equipment and storage medium | |
| CN113526272B (en) | Elevator group control system and elevator group control equipment | |
| CN111201191A (en) | Congestion avoidance operation system and method | |
| CN113716407B (en) | Self-adaptive elevator dispatching method and elevator dispatching system | |
| CN113086789B (en) | Intelligent building control system and control method | |
| CN210854833U (en) | Multi-car elevator control system | |
| CN115924663B (en) | Intelligent elevator equipment control method based on Internet of things | |
| KR100295880B1 (en) | Elevator group management control apparatus and method | |
| CN112456257A (en) | Intelligent carrying device scheduling method oriented to data and information right value exchange | |
| CN117246856A (en) | Multi-target group control optimization algorithm based on zoning | |
| CN114644268A (en) | Elevator group management control method |
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 |