CN115402890A - Elevator dispatching method, device, electronic equipment and medium - Google Patents
Elevator dispatching method, device, electronic equipment and medium Download PDFInfo
- Publication number
- CN115402890A CN115402890A CN202211223935.7A CN202211223935A CN115402890A CN 115402890 A CN115402890 A CN 115402890A CN 202211223935 A CN202211223935 A CN 202211223935A CN 115402890 A CN115402890 A CN 115402890A
- Authority
- CN
- China
- Prior art keywords
- elevator
- target
- users
- floor
- 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.)
- Pending
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/02—Control systems without regulation, i.e. without retroactive action
- B66B1/06—Control systems without regulation, i.e. without retroactive action electric
- B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
- B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages
-
- 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
-
- 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/222—Taking into account the number of passengers present in the elevator car to be allocated
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Computer Networks & Wireless Communication (AREA)
- Elevator Control (AREA)
Abstract
The disclosure provides an elevator dispatching method, device, equipment, storage medium and program product, relates to the technical field of artificial intelligence service, and can be applied to the technical field of financial service. The method comprises the following steps: in response to receiving an elevator dispatching command from a first client, determining a target elevator in a plurality of elevators according to the current stopping floor information and the preset departure floor information of each elevator car in the plurality of elevators; aiming at N users waiting for taking the elevator corresponding to the preset departure floor information, determining a plurality of target floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users corresponding to each target floor information respectively; determining at least one target floor according to the information of the plurality of target floors and the number of pre-arrived users; and sending an operation instruction to the target elevator, wherein the operation instruction is used for indicating the target elevator to operate to a preset departure floor after receiving the operation instruction, and operate to at least one target floor after the preset departure floor stays for a preset time.
Description
Technical Field
The present disclosure relates to the technical field of artificial intelligence services, which may be applied to the technical field of financial services, and more particularly, to an elevator scheduling method, apparatus, device, medium, and program product.
Background
People often encounter elevator situations, particularly commercial CBDs of high-rise ratio, whether at work or in life, and the time for people to wait for elevators during rush hours is beyond imagination. The main reason for the problem is that the elevator carrying energy cannot be fully utilized due to the fact that the warp stop floors of the elevator are manually set; on the other hand, the elevator dispatching algorithm is not optimized aiming at the specific situation of the peak working hours, so that the waiting time and the elevator taking time are too long.
Disclosure of Invention
In view of the above problems, the present disclosure provides an elevator dispatching method, apparatus, device, medium, and program product, which can dispatch and allocate a plurality of elevators, perform integrated analysis on data for N users waiting to take an elevator corresponding to predetermined departure floor information, determine a plurality of target floor information corresponding to the N users waiting to take an elevator and a number of pre-arrival users corresponding to each target floor information, and determine at least one target floor according to the plurality of target floor information and the number of pre-arrival users, and then send an operation instruction to the target elevator, without setting a stop floor for the user waiting to take an elevator, fully mobilize the capacity of each elevator, reduce the number of times of stopping in a single-trip operation process as much as possible, shorten the waiting time of the user, and improve the user taking experience.
According to a first aspect of the present disclosure, there is provided an elevator dispatching method comprising: in response to receiving an elevator dispatching command from a first client, the elevator dispatching command comprising predetermined departure floor information, determining a destination elevator of the plurality of elevators based on current stopping floor information of each elevator car of the plurality of elevators and the predetermined departure floor information; for N users waiting to take the elevator corresponding to the preset departure floor information, determining a plurality of target floor information corresponding to the N users waiting to take the elevator and the number of pre-arrived users corresponding to each target floor information respectively, wherein N is an integer greater than or equal to 1; determining at least one target floor according to the plurality of target floor information and the number of the pre-arrived users; and sending an operation instruction to the target elevator, wherein the operation instruction is used for indicating the target elevator to operate to the preset departure floor after receiving the operation instruction, and operate to the at least one target floor after the preset departure floor stays for a preset time.
According to an embodiment of the present disclosure, the elevator dispatching method further includes: in response to receiving an elevator waiting instruction from a second client, the elevator waiting instruction comprising user information corresponding to a user waiting to take an elevator, determining predetermined target floor information corresponding to the user information; determining the number of pre-arrived users currently matched with the preset target floor information in a preset queue; the predetermined queue comprises a plurality of floor information and the number of pre-arrived users corresponding to each floor information respectively; and adding one to the number of pre-arrived users in the predetermined queue.
According to an embodiment of the present disclosure, the determining, for N users waiting to take an elevator corresponding to the predetermined departure floor information, a plurality of destination floor information corresponding to the N users waiting to take an elevator and the number of pre-arrived users respectively corresponding to each destination floor information includes: acquiring the preset queue; and determining a plurality of destination floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users corresponding to each destination floor information respectively according to the preset queue.
According to an embodiment of the present disclosure, the elevator dispatching method further includes: and sending prompt information corresponding to the at least one target floor and the target elevator.
According to an embodiment of the present disclosure, the determining at least one target floor according to the plurality of target floor information and the number of pre-arrived users comprises: and under the condition that the number of the pre-arrived users corresponding to each target floor information is smaller than a preset threshold value, determining at least one target floor according to the plurality of target floor information, the number of the pre-arrived users and the preset threshold value.
A second aspect of the present disclosure provides an elevator dispatching device, including: a first determining module, which is used for responding to the elevator dispatching command received from the first client, wherein the elevator dispatching command comprises the information of a scheduled departure floor, and determining a target elevator in a plurality of elevators according to the current stop floor information of each elevator car in the plurality of elevators and the information of the scheduled departure floor; a second determining module, configured to determine, for N users waiting to take an elevator corresponding to the predetermined departure floor information, a plurality of pieces of destination floor information corresponding to the N users waiting to take an elevator and a number of pre-arrived users corresponding to each piece of destination floor information, where N is an integer greater than or equal to 1; a third determining module, configured to determine at least one target floor according to the information of the target floors and the number of pre-arrived users; and the sending instruction module is used for sending an operation instruction to the target elevator, wherein the operation instruction is used for indicating the target elevator to operate to the preset departure floor after receiving the operation instruction, and operate to the at least one target floor after the preset departure floor stays for a preset time.
A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the above-described elevator dispatching method.
A fourth aspect of the present disclosure also provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-described elevator dispatching method.
A fifth aspect of the disclosure also provides a computer program product comprising a computer program which, when executed by a processor, implements the above-described elevator dispatching method.
The elevator dispatching method provided by the embodiment can dispatch and allocate a plurality of elevators, integrate and analyze data for N users waiting to take the elevator corresponding to preset departure floor information, determine a plurality of target floor information corresponding to the N users waiting to take the elevator and the number of pre-arrival users corresponding to each target floor information respectively, determine at least one target floor according to the plurality of target floor information and the number of the pre-arrival users, and send an operation instruction to the target elevator.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, taken in conjunction with the accompanying drawings of which:
fig. 1 schematically illustrates an application scenario diagram of an elevator dispatching method, apparatus, device, medium, and program product according to embodiments of the disclosure;
fig. 2 schematically illustrates a flow chart of an elevator dispatching method according to an embodiment of the present disclosure;
fig. 3 schematically illustrates a flow chart of an elevator dispatching method according to another embodiment of the present disclosure;
fig. 4 schematically shows a block diagram of an elevator dispatching device according to an embodiment of the present disclosure; and
fig. 5 schematically shows a block diagram of an electronic device suitable for implementing an elevator dispatching method according to an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure. In the technical scheme of the disclosure, the data acquisition, collection, storage, use, processing, transmission, provision, disclosure, application and other processing are all in accordance with the regulations of relevant laws and regulations, necessary security measures are taken, and the public order and good custom are not violated.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B, and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B, and C" would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.).
The embodiment of the disclosure provides an elevator dispatching method and device, wherein in response to receiving an elevator dispatching command from a first client, the elevator dispatching command comprises preset departure floor information, and a target elevator in a plurality of elevators is determined according to the current stopping floor information and the preset departure floor information of each elevator car in the plurality of elevators; aiming at N users waiting for taking the elevator corresponding to the preset departure floor information, determining a plurality of target floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users corresponding to each target floor information respectively, wherein N is an integer greater than or equal to 1; determining at least one target floor according to the information of the plurality of target floors and the number of pre-arrived users; and sending an operation instruction to the target elevator, wherein the operation instruction is used for indicating the target elevator to operate to a preset departure floor after receiving the operation instruction, and operate to at least one target floor after the preset departure floor stays for a preset time.
Fig. 1 schematically illustrates an application scenario diagram of an elevator dispatching method, apparatus, device, medium, and program product according to an embodiment of the disclosure.
As shown in fig. 1, the application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
It should be noted that the elevator dispatching method provided by the embodiment of the present disclosure can be generally executed by the server 105. Accordingly, the elevator dispatching device provided by the embodiment of the disclosure can be generally arranged in the server 105. The elevator dispatching method provided by the embodiment of the disclosure can also be executed by a server or a server cluster which is different from the server 105 and can communicate with the terminal devices 101, 102, 103 and/or the server 105. Correspondingly, the elevator dispatching device provided by the embodiment of the disclosure can also be arranged in a server or a server cluster which is different from the server 105 and can communicate with the terminal devices 101, 102 and 103 and/or the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The elevator dispatching method of the disclosed embodiment will be described in detail below with reference to fig. 2 based on the scenario described in fig. 1.
Fig. 2 schematically illustrates a flow chart of an elevator dispatching method according to an embodiment of the disclosure.
As shown in fig. 2, the embodiment includes operations S210 to S240, and the elevator dispatching method may be performed by a server.
In the technical scheme of the disclosure, the data acquisition, collection, storage, use, processing, transmission, provision, disclosure, application and other processing are all in accordance with the regulations of relevant laws and regulations, necessary security measures are taken, and the public order and good custom are not violated.
In operation S210, in response to receiving an elevator dispatching order from a first client, the elevator dispatching order including scheduled departure floor information, a destination elevator of the plurality of elevators is determined based on current landing floor information and the scheduled departure floor information of each elevator car of the plurality of elevators.
In operation S220, for N users waiting to take an elevator corresponding to the scheduled departure floor information, a plurality of destination floor information corresponding to the N users waiting to take an elevator and the number of pre-arrived users respectively corresponding to each of the destination floor information are determined, where N is an integer greater than or equal to 1.
In operation S230, at least one target floor is determined according to the plurality of target floor information and the number of pre-arrived users.
In operation S240, a travel command is transmitted to the target elevator, and the travel command is used to instruct the target elevator to travel to a predetermined departure floor after receiving the travel command, and to travel to at least one target floor after staying at the predetermined departure floor for a predetermined time.
It will be appreciated that existing elevators are typically provided with up and down key buttons on the outside to allow a user riding the elevator to select a floor after entering the elevator car. However, operating the elevator based on the generated command generated by the elevator-taking user selecting the floor may result in a large number of passengers waiting too long. Especially, during the peak period of work, the problem that the time for taking the elevator is too long cannot be solved aiming at the habit of the user during the peak period of work.
According to the elevator dispatching method provided by the embodiment, the user who waits for taking the elevator does not need to set the stop floor, and the user can select the target floor when waiting for the elevator by binding the relationship between the user and the target floor in advance, for example, the user can bind the target floor through the work card or bind the face information and the target floor; and elevator floor buttons can be arranged externally, so that a user can select a target floor at a waiting floor.
It can be understood that the scheduled departure floor of the elevator is generally at one floor or an underground garage floor according to the habit of the user during the peak hours of work, and the elevator is mainly used for passengers to go upwards.
For example, the eight-spot early worker sends an elevator dispatching command to a server executing the elevator dispatching method through a first client, and the information of the scheduled departure floor is 1 floor. If the current stop information of a plurality of elevators ABC is 3 (elevator A), 4 (elevator B) and 5 floors (elevator C) respectively. In order to fully enable each elevator to participate in the operation, enable the transportation capacity of the elevators to be as high as possible and simultaneously reduce the waiting time of users, the elevator with the shortest path from the preset departure floor can be dispatched to move to the departure floor, namely, the target elevator is the elevator A.
For example, currently, there are N users waiting for elevator riding on floor 1, and each user has performed operations such as face recognition or card swiping authentication, that is, a waiting signal is sent to a server executing an elevator dispatching method, and the waiting signal includes user information. According to the pre-stored binding relationship, the target floors to which the N users waiting for taking the elevator go can be directly determined; at the same time, the number of users that will reach each destination floor can also be determined. Then at least one destination floor at which the elevator a will arrive during this run is determined.
For example, of the N users waiting to ride the elevator, there are 10 people going to the fifth floor, 8 people going to the fourth floor, 2 people going to the third floor, and 3 people going to the second floor. The target floor may be set to 5 floors, indicating that this run goes to five floors. In the case where the number of persons is more than 10, the target floor may be set to 5 floors and at least one other floor (4 floors, 3 floors, 2 floors).
A run command may be sent to target elevator a after determining the at least one target floor, which may instruct the elevator to run to floor 1 first and then to the at least one target floor after staying at floor 1 for a predetermined time.
The elevator dispatching method provided by the embodiment can dispatch and allocate a plurality of elevators, integrate and analyze data for N users waiting to take the elevator corresponding to preset departure floor information, determine a plurality of target floor information corresponding to the N users waiting to take the elevator and the number of pre-arrival users corresponding to each target floor information respectively, determine at least one target floor according to the plurality of target floor information and the number of the pre-arrival users, and send an operation instruction to the target elevator.
The elevator dispatching method further comprises the following steps: in response to receiving an instruction to wait to take an elevator from the second client, the instruction to wait to take an elevator comprising user information corresponding to a user waiting to take an elevator, determining predetermined target floor information corresponding to the user information; determining the number of pre-arrived users matched with the preset target floor information currently in a preset queue; the predetermined queue comprises a plurality of floor information and the number of pre-arrived users corresponding to each floor information respectively; and adding one to the number of pre-arrived users in the predetermined queue.
It will be appreciated that information regarding the received command from the second client waiting to take an elevator may be maintained by a predetermined queue.
For example, when waiting for an elevator, a user first uploads user information by swiping a face or card for registration. The predetermined queue can be a waiting queue, each element in the waiting comprises two fields of a destination floor and a corresponding number of users, and after the user registers a waiting elevator, the destination floor corresponding to the user is inserted into the waiting queue, namely, the number of the users matched with the destination floor in the queue is determined to be increased by one.
It will be appreciated that the determination of at least one target floor is facilitated by the elements maintained by the predetermined queue (target floor information and number of pre-arrived users).
For example, based on a predetermined queue, the first element (e.g., the element with the largest number of users) at the head of the queue is extracted in descending order from the number of pre-arrived users, the elevator closest to the path of the departure floor is dispatched to the departure floor, and the user is transported to the destination floor corresponding to the first element.
For example, based on a predetermined queue, i elements (i.e., elements with a larger number of users) at the top of the queue are extracted in descending order according to the number of pre-arrived users until the maximum number of the passengers is reached, an elevator closest to the path of the departure floor is dispatched to the departure floor, and the users are transported to the target floors corresponding to the i elements.
Fig. 3 schematically shows a flow chart of an elevator dispatching method according to another embodiment of the disclosure, see fig. 3. For example, according to the habit of users during the peak working hours, the departure floor of the elevator is generally at the 1 st floor or the underground garage floor, and the elevator mainly carries passengers to go upwards. Assuming that the departure floor of a user is 1 floor, the floor number is a, the number of people carried by each elevator is b, the number of elevators is c, elements i, i ∈ (0, 1,2,3 \8230; a-1) extracted from a preset queue L are included, and the L (i) comprises two fields of the number of pre-arrived users and the target floor and is respectively represented by 'L (i) number of people' and 'L (i) floor'.
In operation S301, the elements in the predetermined queue are sorted in descending order by the number of pre-arrived users.
In operation S302, a first element L0 in a predetermined queue is extracted.
In operation S303, it is determined whether the number of pre-arrived users corresponding to the element L0 is greater than or equal to the number of people loaded in the elevator core (i.e., the predetermined threshold b), and if yes, operation S304 is performed to allow the target elevator to travel to a predetermined departure floor, and then to a target floor corresponding to L0, for example, to allow the elevator closest to the path of the departure floor to travel to the departure floor, and deliver the user to the target floor corresponding to the first element (L0). Then, in operation S305, the data information of the queue element L0 is deleted; then, operation S306 determines whether the predetermined queue is an empty queue, and if so, operation S311 ends the operation. If not, operation S307 continues to traverse the elements in the predetermined queue.
And judging whether the number of the pre-arrived users corresponding to the element L0 is greater than or equal to the number of the people loaded in the elevator core (namely, a preset threshold b), if not, operating S307, and traversing the elements in the preset queue.
In operation S308, it is determined whether a predetermined element Li in a predetermined queue can be extracted, e.g., the predetermined element Li is satisfied such that
The sum of the corresponding number of users is less than b, and
the sum of the corresponding number of users is greater than or equal to b, namely the L0+ L1+. The + Li < b, and the L0+ L1+. The + Li + L (i + 1) ≥ b.
If the predetermined element Li in the predetermined queue can be extracted, operation S309 is performed, that is, the target elevator moves to the predetermined departure floor and then moves to the floor corresponding to L0, the floor corresponding to L1,. And the floor corresponding to L (i + 1).
In operation S310, the queue elements L0 to L (i + 1) are deleted; operation S306 may then be resumed.
The elevator dispatching method provided by the embodiment adds one to the number of pre-arrived users in the preset queue, so as to update the preset queue in real time; meanwhile, by maintaining the information of a plurality of floors in the preset queue and the number of the pre-arrived users corresponding to the information of each floor respectively, the target floor can be determined by combining the data information in the preset queue according to the habit of the users, so that the operation efficiency of the elevator is improved.
For N users waiting to take an elevator corresponding to preset departure floor information, determining a plurality of target floor information corresponding to the N users waiting to take the elevator and the number of pre-arrived users corresponding to each target floor information respectively, comprising: acquiring a preset queue; and determining a plurality of destination floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users corresponding to each destination floor information respectively according to the predetermined queue.
It can be understood that the latest predetermined queue can be obtained in real time, and the data information in the predetermined queue is determined, so that a plurality of destination floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users respectively corresponding to each destination floor information are determined according to the predetermined queue.
The elevator dispatching method provided by the embodiment can perform integrated analysis on the data information according to the preset queue, so that the method is beneficial to quickly determining a plurality of target floor information corresponding to N users waiting to take the elevator and the number of pre-arrived users corresponding to each target floor information.
The elevator dispatching method further comprises the following steps: and sending prompt information corresponding to at least one target floor and a target elevator.
It is understood that the user waiting for taking the elevator matching the prompt message can be guided by the prompt message to wait for the target elevator to take the elevator.
For example, a plurality of elevators 123, assuming that the target elevator is an elevator 2, and the target floor is 5 floors; the prompt message may be that elevator number 2 will arrive, elevator number 2 will travel to floor 5, and the user may be reminded to go to the elevator to wait at the scheduled departure floor through a broadcast/electronic display screen.
The elevator dispatching method provided by the embodiment can guide the user to take the elevator by sending the prompt information corresponding to at least one target floor and the target elevator.
Determining at least one target floor according to the information of the plurality of target floors and the number of pre-arrived users, comprising: and under the condition that the number of the pre-arrived users corresponding to each target floor information is smaller than the preset threshold value, determining at least one target floor according to the plurality of target floor information, the number of the pre-arrived users and the preset threshold value.
The predetermined threshold value may be, for example, the maximum number of passengers in the elevator car.
For example, the current predetermined threshold is 13, and the number of pre-arrived users at each target floor is as follows: 5-tier 10 people, 4-tier 8 people, 3-tier 2 people, and 2-tier 3 people. It is determined that the at least one target floor may be 5 floors and 2 floors based on the plurality of target floor information, the number of pre-arrived users and the predetermined threshold.
For example, the current predetermined threshold is 12, and the number of pre-arrived users at each target floor is as follows: 5-tier 10 people, 4-tier 8 people, 3-tier 2 people, and 2-tier 3 people. It is determined that the at least one target floor may be 4, 3 and 2 floors based on the plurality of target floor information, the number of pre-arrived users and the predetermined threshold.
The elevator dispatching method provided by the embodiment can determine at least one target floor according to the information of a plurality of target floors, the number of pre-arrived users and the preset threshold, is favorable for improving the transport capacity of the elevator, and avoids the time of waiting for the elevator or the time of taking the elevator for the users as far as possible.
In order to better understand the beneficial effects brought by the invention, how to effectively solve the long waiting and riding problems in the office building during the on-duty peak period is explained by comparing the time.
The following comparison data is calculated by 1 elevator, if n elevators exist, the waiting time is multiplied by 1/n.
Assuming that the elevator can stop at any floor, the door opening and closing completion time of the elevator is set to p seconds. The time for getting on and off the elevator after reaching each floor is set to q seconds. The time for the elevator to travel from standstill to the next floor is set to r seconds, while the time for the elevator to travel through the floor is s seconds, and the minimum time, the maximum time and the average time for each run of the elevator are as follows:
(1) The shortest duration:
the shortest time is that users taking the elevator all go to the same floor i, and the shortest time is basically equal to the user waiting time of the elevator dispatching method provided by the embodiment in the peak period of work. The shortest duration is t _ shortest:
t _ shortest = (p + q) + r + i + s + (p + q) =2p +2q + r + i + s.
(2) The longest time is as follows:
the user happens to go to different floors, i.e. there is no optimized elevator dispatching method, and the longest time t _ is longest:
(3) Examples of such applications
The number of floors is 21, and the time for completing the opening and closing of the elevator door is set to p =1 second. The time for the elevator to get on and off after reaching each floor is set to q =8 seconds. The time for the elevator to travel from standstill to the next floor is set to r =2 seconds, while the time for the elevator to travel through the floor is s =1 second, the number of people b =15 on the load of the elevator,
1. the shortest duration:
assume that all go to the same floor 20, i.e., i =20.
t _ shortest =2p +2q + r + i + s =2+ 8+2+20 seconds.
2. The longest time is as follows:
t _ longest ≈ b (2p +2q + r) +1/2 + s + b (b + 1) = (2 + 8+ 2) + 15+1/2 + 15 (15 + 1) =420 seconds.
Therefore, by adopting the elevator dispatching method provided by the embodiment of the invention, 21 times of time can be saved for each elevator trip, the efficiency can be greatly improved, and the waiting time of a user is greatly shortened.
Based on the elevator dispatching method, the disclosure also provides an elevator dispatching device. The apparatus will be described in detail below with reference to fig. 4.
Fig. 4 schematically shows a block diagram of the structure of an elevator dispatching device according to an embodiment of the present disclosure.
As shown in fig. 4, the elevator dispatching device 400 of this embodiment includes a first determining module 410, a second determining module 420, a third determining module 430, and a transmission instruction module 440.
A first determining module 410, configured to determine a destination elevator of a plurality of elevators according to current landing floor information of each elevator car of the plurality of elevators and predetermined departure floor information in response to receiving an elevator dispatching order from a first client, the elevator dispatching order including the predetermined departure floor information; a second determining module 420, configured to determine, for N users waiting to take an elevator corresponding to the predetermined departure floor information, a plurality of destination floor information corresponding to the N users waiting to take an elevator and a number of pre-arrived users respectively corresponding to each destination floor information, where N is an integer greater than or equal to 1; a third determining module 430, configured to determine at least one target floor according to the multiple target floor information and the number of pre-arrived users; and an instruction sending module 440, configured to send an operation instruction to the target elevator, where the operation instruction is used to instruct the target elevator to operate to the predetermined departure floor after receiving the operation instruction, and operate to the at least one target floor after the predetermined departure floor stays for a predetermined time.
In some embodiments, the elevator dispatching device further comprises: a fourth determination module, configured to determine, in response to receiving an instruction from a second client to wait to take an elevator, the instruction to wait to take an elevator including user information corresponding to a user waiting to take an elevator, predetermined target floor information corresponding to the user information; a fifth determining module, configured to determine, in a predetermined queue, the number of pre-arrived users currently matched with the predetermined target floor information; the predetermined queue comprises a plurality of floor information and the number of pre-arrived users corresponding to each floor information respectively; and the queue updating module is used for adding one to the number of the pre-arrived users in the preset queue.
In some embodiments, the second determination module is to: acquiring the preset queue; and determining a plurality of target floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users respectively corresponding to each target floor information according to the preset queue.
In some embodiments, the elevator dispatching device further comprises: and the prompt information sending module is used for sending prompt information corresponding to the at least one target floor and the target elevator.
In some embodiments, the third determining module is configured to determine at least one target floor according to the plurality of target floor information, the number of pre-arrived users, and the predetermined threshold, in case that it is determined that the number of pre-arrived users corresponding to each target floor information is less than the predetermined threshold.
According to an embodiment of the present disclosure, any plurality of the first determining module 410, the second determining module 420, the third determining module 430, and the sending instruction module 440 may be combined and implemented in one module, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first determining module 410, the second determining module 420, the third determining module 430, and the sending instruction module 440 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in any suitable combination of any of them. Alternatively, at least one of the first determining module 410, the second determining module 420, the third determining module 430 and the sending instruction module 440 may be at least partially implemented as a computer program module, which when executed, may perform a corresponding function.
Fig. 5 schematically illustrates a block diagram of an electronic device suitable for implementing an elevator dispatching method according to an embodiment of the disclosure.
As shown in fig. 5, an electronic device 500 according to an embodiment of the present disclosure includes a processor 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include on-board memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 503, various programs and data necessary for the operation of the electronic apparatus 500 are stored. The processor 501, the ROM502, and the RAM 503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM502 and/or the RAM 503. Note that the program may also be stored in one or more memories other than the ROM502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, electronic device 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The electronic device 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. A drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
The present disclosure also provides a computer-readable storage medium, which may be embodied in the device/apparatus/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM502 and/or RAM 503 and/or one or more memories other than ROM502 and RAM 503 described above.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flow chart. When the computer program product is run in a computer system, the program code is used for causing the computer system to implement the elevator dispatching method provided by the embodiment of the disclosure.
The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 501. The above described systems, devices, modules, units, etc. may be implemented by computer program modules according to embodiments of the present disclosure.
In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, downloaded and installed through the communication section 509, and/or installed from the removable medium 511. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The above described systems, devices, apparatuses, modules, units, etc. may be implemented by computer program modules according to embodiments of the present disclosure.
In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments of the present disclosure and/or the claims may be made without departing from the spirit and teachings of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.
Claims (10)
1. An elevator dispatching method, comprising:
in response to receiving an elevator dispatching command from a first client, the elevator dispatching command comprises scheduled departure floor information, and a target elevator in the plurality of elevators is determined according to the current stopping floor information and the scheduled departure floor information of each elevator car in the plurality of elevators;
aiming at N users waiting for taking the elevator corresponding to the preset departure floor information, determining a plurality of target floor information corresponding to the N users waiting for taking the elevator and the number of pre-arrived users corresponding to each target floor information respectively, wherein N is an integer greater than or equal to 1;
determining at least one target floor according to the information of the plurality of target floors and the number of pre-arrived users; and
and sending a running instruction to the target elevator, wherein the running instruction is used for indicating the target elevator to run to a preset departure floor after receiving the running instruction, and to run to at least one target floor after the target elevator stops at the preset departure floor for a preset time.
2. The method of claim 1, further comprising:
in response to receiving an elevator waiting instruction from the second client, the elevator waiting instruction including user information corresponding to a user waiting to take the elevator, determining predetermined target floor information corresponding to the user information;
determining the number of pre-arrived users currently matched with the preset target floor information in a preset queue; the predetermined queue comprises a plurality of floor information and the number of pre-arrived users corresponding to each floor information respectively; and
an addition process is performed on the number of pre-arrived users in the predetermined queue.
3. The method of claim 2, wherein determining, for N users waiting to take an elevator corresponding to predetermined departure floor information, a plurality of destination floor information corresponding to the N users waiting to take an elevator and a number of pre-arrived users respectively corresponding to each destination floor information comprises:
acquiring a preset queue; and
according to the preset queue, a plurality of destination floor information corresponding to N users waiting for taking the elevator and the number of pre-arrived users corresponding to each destination floor information are determined.
4. The method of claim 1, further comprising:
and sending prompt information corresponding to at least one target floor and a target elevator.
5. The method of claim 1, wherein the determining at least one target floor based on the plurality of target floor information and the number of pre-arrived users comprises:
and under the condition that the number of the pre-arrived users corresponding to each target floor information is smaller than the preset threshold value, determining at least one target floor according to the plurality of target floor information, the number of the pre-arrived users and the preset threshold value.
6. An elevator dispatching device, comprising:
a first determining module, which is used for responding to the elevator dispatching command received from the first client, wherein the elevator dispatching command comprises the scheduled departure floor information, and determining the target elevator in the plurality of elevators according to the current stopping floor information of each elevator car in the plurality of elevators and the scheduled departure floor information;
the second determining module is used for determining a plurality of pieces of target floor information corresponding to N users waiting for taking the elevator and the number of pre-arrived users corresponding to each piece of target floor information aiming at N users waiting for taking the elevator corresponding to the preset departure floor information, wherein N is an integer larger than or equal to 1;
the third determining module is used for determining at least one target floor according to the information of the target floors and the number of the pre-arrived users; and
and the instruction sending module is used for sending an operation instruction to the target elevator, wherein the operation instruction is used for indicating the target elevator to run to a preset departure floor after receiving the operation instruction, and run to at least one target floor after staying at the preset departure floor for a preset time.
7. The apparatus of claim 6, further comprising:
a fourth determining module, which is used for responding to the received command of waiting for taking the elevator from the second client, wherein the command of waiting for taking the elevator comprises the user information corresponding to the user waiting for taking the elevator, and determining the preset target floor information corresponding to the user information;
a fifth determining module, configured to determine, in a predetermined queue, the number of pre-arrived users currently matched with the predetermined target floor information; the predetermined queue comprises a plurality of floor information and the number of pre-arrived users corresponding to each floor information respectively; and
and the queue updating module is used for adding one to the number of the pre-arrived users in the preset queue.
8. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method according to any of claims 1-5.
9. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out a method according to any one of claims 1 to 5.
10. A computer program product comprising a computer program which, when executed by a processor, carries out the method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211223935.7A CN115402890A (en) | 2022-10-08 | 2022-10-08 | Elevator dispatching method, device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211223935.7A CN115402890A (en) | 2022-10-08 | 2022-10-08 | Elevator dispatching method, device, electronic equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115402890A true CN115402890A (en) | 2022-11-29 |
Family
ID=84167975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211223935.7A Pending CN115402890A (en) | 2022-10-08 | 2022-10-08 | Elevator dispatching method, device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115402890A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116975394A (en) * | 2023-09-22 | 2023-10-31 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102344058A (en) * | 2010-07-27 | 2012-02-08 | 株式会社日立制作所 | Elevator control method and apparatus |
| CN102583119A (en) * | 2011-01-05 | 2012-07-18 | 株式会社东芝 | Elevator Group Management And Control Device |
| WO2016142968A1 (en) * | 2015-03-12 | 2016-09-15 | 三菱電機株式会社 | Group management control device for elevators |
| CN109205412A (en) * | 2017-06-29 | 2019-01-15 | 佳能株式会社 | Elevator control aggregate, elevator control method and storage medium |
| CN110436281A (en) * | 2019-07-29 | 2019-11-12 | 恒大智慧科技有限公司 | A kind of method, system and computer storage medium that more elevators call |
| CN111517185A (en) * | 2020-04-27 | 2020-08-11 | 佛山市拓拓网络科技有限公司 | Efficient and intelligent elevator operation method and system |
| CN113511567A (en) * | 2020-12-21 | 2021-10-19 | 阿里巴巴集团控股有限公司 | Elevator dispatching method, device and system, computing device and user equipment |
| CN114834983A (en) * | 2022-07-04 | 2022-08-02 | 凯尔菱电（山东）电梯有限公司 | Intelligent control method and system in elevator operation |
-
2022
- 2022-10-08 CN CN202211223935.7A patent/CN115402890A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102344058A (en) * | 2010-07-27 | 2012-02-08 | 株式会社日立制作所 | Elevator control method and apparatus |
| CN102583119A (en) * | 2011-01-05 | 2012-07-18 | 株式会社东芝 | Elevator Group Management And Control Device |
| WO2016142968A1 (en) * | 2015-03-12 | 2016-09-15 | 三菱電機株式会社 | Group management control device for elevators |
| CN109205412A (en) * | 2017-06-29 | 2019-01-15 | 佳能株式会社 | Elevator control aggregate, elevator control method and storage medium |
| CN110436281A (en) * | 2019-07-29 | 2019-11-12 | 恒大智慧科技有限公司 | A kind of method, system and computer storage medium that more elevators call |
| CN111517185A (en) * | 2020-04-27 | 2020-08-11 | 佛山市拓拓网络科技有限公司 | Efficient and intelligent elevator operation method and system |
| CN113511567A (en) * | 2020-12-21 | 2021-10-19 | 阿里巴巴集团控股有限公司 | Elevator dispatching method, device and system, computing device and user equipment |
| CN114834983A (en) * | 2022-07-04 | 2022-08-02 | 凯尔菱电（山东）电梯有限公司 | Intelligent control method and system in elevator operation |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116975394A (en) * | 2023-09-22 | 2023-10-31 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
| CN116975394B (en) * | 2023-09-22 | 2023-12-19 | 天津鑫宝龙电梯集团有限公司 | Information query method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11097921B2 (en) | Elevator movement plan generation | |
| US20220044186A1 (en) | Arranging a transport service for multiple users | |
| CN105813969B (en) | Service request using wireless programmable device | |
| US9896305B2 (en) | Personalized elevator dispatch | |
| US20200262679A1 (en) | Elevator service request using user device | |
| US10387984B2 (en) | Method of providing call taxi service and call taxi service server | |
| CN110533353B (en) | Method and device for handling shelves | |
| EP3080025B1 (en) | Conveyance system traffic flow information | |
| CN110371548B (en) | Goods warehousing method and device | |
| CN110002292A (en) | It is requested using user apparatus using the elevator service of filtered destination floor | |
| CN106744089B (en) | Elevator control method and device | |
| CN109879126B (en) | Elevator reservation method and system | |
| US20210312359A1 (en) | Method and device for scheduling automated guided vehicle | |
| WO2019219027A1 (en) | Vehicle hybrid scheduling method | |
| KR102504273B1 (en) | DRT request information clustering method for allocating DRT cars and system thereof | |
| CN115402890A (en) | Elevator dispatching method, device, electronic equipment and medium | |
| CN110275492A (en) | A kind of method and apparatus that automated guided vehicle driving path is determined based on tunnel | |
| CN113627858A (en) | Method and device for determining cache location of warehouse | |
| US20160300163A1 (en) | Process and apparatus for matching and assigning one or more parties with a transportation service provider | |
| CN114590656B (en) | Elevator control method, device, electronic equipment and storage medium | |
| CN115402889B (en) | Elevator group control method and system and electronic equipment | |
| CN116675081A (en) | Automatic elevator access method, device, equipment and medium | |
| CN116662000A (en) | Subway service processing method based on industrial personal computer cluster | |
| CN116432917A (en) | Scheduling method, device, equipment, storage medium and program product of security check station | |
| CN113902279A (en) | Transfer route generation method, device, equipment and storage medium |
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 |