CN111776896B - Elevator dispatching method and device - Google Patents

Elevator dispatching method and device Download PDF

Info

Publication number
CN111776896B
CN111776896B CN201911127906.9A CN201911127906A CN111776896B CN 111776896 B CN111776896 B CN 111776896B CN 201911127906 A CN201911127906 A CN 201911127906A CN 111776896 B CN111776896 B CN 111776896B
Authority
CN
China
Prior art keywords
elevator
floor
target
time period
dispatching
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
Application number
CN201911127906.9A
Other languages
Chinese (zh)
Other versions
CN111776896A (en
Inventor
王春兰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201911127906.9A priority Critical patent/CN111776896B/en
Publication of CN111776896A publication Critical patent/CN111776896A/en
Application granted granted Critical
Publication of CN111776896B publication Critical patent/CN111776896B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/211—Waiting time, i.e. response time
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/40—Details of the change of control mode
    • B66B2201/403—Details of the change of control mode by real-time traffic data

Abstract

The embodiment of the disclosure discloses an elevator dispatching method and device. One embodiment of the method comprises: receiving an elevator use request sent by a user; determining a target elevator dispatching time period in which a target moment is located in at least two preset elevator dispatching time periods, wherein the target moment is the moment when a user arrives at an elevator; determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator on each floor in the target elevator dispatching time period; and responding to the fact that the elevator distribution priority of the target floor is the highest in the target elevator dispatching time period, distributing the elevator for the user according to a preset rule, and sending elevator information of the distributed elevator to the user, wherein the elevator information comprises an elevator identifier. The embodiment realizes the allocation of the elevator for the most time-consuming elevator use request preferentially, and shortens the time for a user to wait for the elevator.

Description

Elevator dispatching method and device
Technical Field
The embodiment of the disclosure relates to the technical field of computers, in particular to an elevator dispatching method and device.
Background
Elevators are indispensable vertical transportation vehicles in high-rise buildings, and with the development of science and technology, people put higher and higher requirements on the performance of elevator systems.
Elevator dispatching is generally used for analyzing passenger requests in a unified management and coordination mode, and reasonable elevator resources are allocated to the passenger requests to complete transportation tasks. The core of elevator scheduling is the elevator resource allocation timing decision problem.
Disclosure of Invention
The embodiment of the disclosure provides an elevator dispatching method and device.
In a first aspect, an embodiment of the present disclosure provides an elevator dispatching method, including: receiving an elevator use request sent by a user, wherein the elevator use request comprises a target floor; determining a target elevator dispatching time period in which a target time is located in at least two preset elevator dispatching time periods, wherein the target time is the time when a user arrives at an elevator; determining the elevator allocation priority of each floor in a target elevator dispatching time period based on the historical running time consumption of the elevator on each floor in the target elevator dispatching time period, wherein the historical running time consumption of each floor is determined based on the total number of historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the longer the historical running time consumption, the higher the allocation priority of the elevator on the floor is; and responding to the fact that the elevator distribution priority of the target floor is the highest in the target elevator dispatching time period, distributing the elevator for the user according to a preset rule, and sending the elevator information of the distributed elevator to the user, wherein the elevator information comprises an elevator identification.
In some embodiments, the elevator use request further includes location information of the user and location information of the elevator; the method further comprises the following steps: and determining the target moment when the user arrives at the elevator based on the position information of the user and the position information of the elevator.
In some embodiments, the determining the target elevator dispatching time period of the target time in at least two preset elevator dispatching time periods comprises: obtaining an elevator use record in a historical time period, wherein the historical time period comprises a plurality of historical working days; determining a first average value of the total number of historical elevator use requests in each preset time period in a day aiming at the historical time period; dividing one day into at least two elevator dispatching time periods based on the maximum value in the determined first average value, the minimum value appearing before the preset time period corresponding to the maximum value and the minimum value appearing after the preset time period corresponding to the maximum value; and determining the elevator dispatching time period corresponding to the target time as the target elevator dispatching time period.
In some embodiments, before determining the elevator allocation priority for each floor of the target elevator dispatching time period based on the historical elapsed elevator travel times at each floor for the target elevator dispatching time period, the method further comprises: for each floor, determining a second average value of the total number of historical elevator use requests taking the floor as a target floor in a sub-historical time period corresponding to a target elevator dispatching time period in the historical time period, and determining the consumed time of an elevator for directly reaching the floor from the ground; the product of the determined second average value and the determined elapsed time is determined as the elapsed time of the historical run of the elevator at the floor.
In some embodiments, determining the elevator allocation priority for each floor in the target elevator dispatching time period based on the historical running time of the elevator at each floor in the target elevator dispatching time period comprises: grouping a plurality of floors of a target building where an elevator is located according to a preset rule to obtain a plurality of grouped floors, wherein each grouped floor comprises at least one floor; for a grouped floor in a plurality of grouped floors, accumulating the historical running time of the elevator on each floor included by the grouped floor in a target elevator dispatching time period to obtain the total historical running time of the elevator running on the grouped floor; the grouping floors are sorted according to the total historical operating time consumption of each grouping floor, and the elevator allocation priority of each grouping floor is determined according to the sorting result, wherein the higher the elevator allocation priority is, the longer the total historical operating time consumption of the elevator operation of the grouping floors is; and for each floor, determining the elevator allocation priority corresponding to the grouping floor comprising the floor as the elevator allocation priority of the floor.
In some embodiments, allocating elevators to users according to preset rules comprises: determining an elevator with the largest calibrated passenger carrying quantity from at least one elevator which is currently available; the determined elevator is allocated to the user.
In some embodiments, allocating elevators to users according to preset rules comprises: determining a target elevator dispatching round from at least one elevator dispatching round for which the highest elevator is allocated with priority in advance; and allocating the elevator with the largest calibrated passenger number to the user in at least one elevator which can be allocated in advance currently in the target elevator dispatching turn, wherein the elevator which can be allocated in advance currently is the elevator which has been allocated in advance for a number of times smaller than the calibrated passenger number in the target elevator dispatching turn.
In some embodiments, the elevator information further includes a time period of operation of the elevator assigned to the user.
In a second aspect, an embodiment of the present disclosure provides an elevator dispatching device, including: a receiving unit configured to receive an elevator use request sent by a user, wherein the elevator use request includes a target floor; the first determining unit is configured to determine a target elevator dispatching time period in which a target moment is located in at least two preset elevator dispatching time periods, wherein the target moment is the moment when a user arrives at an elevator; a second determination unit configured to determine the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator at each floor in the target elevator dispatching time period, wherein the historical running time of each floor is determined based on the total number of the historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the floor elevator with longer historical running time is allocated with higher priority; and the allocation unit is configured to respond to the determination that the elevator allocation priority of the floor of the target building is the highest in the target elevator dispatching time period, allocate the elevator for the user according to a preset rule, and send the elevator information of the allocated elevator to the user, wherein the elevator information comprises the elevator identification.
In some embodiments, the elevator use request further includes location information of the user and location information of the elevator; the device still includes: a third determination unit configured to determine a target moment at which the user arrives at the elevator based on the location information of the user and the location information of the elevator.
In some embodiments, the first determination unit is further configured to: obtaining an elevator use record in a historical time period, wherein the historical time period comprises a plurality of historical working days; determining a first average value of the total number of historical elevator use requests in each preset time period in a day aiming at the historical time periods; dividing one day into at least two elevator dispatching time periods based on the maximum value in the determined first average value, the minimum value appearing before the preset time period corresponding to the maximum value and the minimum value appearing after the preset time period corresponding to the maximum value; and determining the elevator dispatching time period corresponding to the target time as the target elevator dispatching time period.
In some embodiments, the apparatus further comprises: a fourth determination unit configured to determine, for each floor, a second average of the total number of the historical elevator use requests for the floor as a target floor within a sub-historical time period corresponding to the target elevator dispatching time period in the historical time period, and determine the elapsed time for the elevator to arrive at the floor directly from the ground; a fifth determination unit configured to determine the product of the determined second average value and the determined elapsed time as the elapsed time of the historical operation of the elevator at the floor.
In some embodiments, the second determination unit is further configured to: grouping a plurality of floors of a target building where an elevator is located according to a preset rule to obtain a plurality of grouped floors, wherein each grouped floor comprises at least one floor; for a grouped floor in a plurality of grouped floors, accumulating the historical running time of the elevator on each floor included by the grouped floor in a target elevator dispatching time period to obtain the total historical running time of the elevator running on the grouped floor; the grouping floors are sorted according to the total historical operating time consumption of each grouping floor, and the elevator allocation priority of each grouping floor is determined according to the sorting result, wherein the higher the elevator allocation priority is, the longer the total historical operating time consumption of the elevator operation of the grouping floors is; and for each floor, determining the elevator allocation priority corresponding to the grouped floor comprising the floor as the elevator allocation priority of the floor.
In some embodiments, the allocation unit is further configured to: determining an elevator with the largest calibrated passenger carrying quantity from at least one elevator which is currently available; the determined elevator is allocated to the user.
In some embodiments, the allocation unit is further configured to: determining a target elevator dispatching round from at least one elevator dispatching round for which the highest elevator is allocated with priority in advance; and allocating the elevator with the largest calibrated passenger number to the user in at least one elevator which can be allocated in advance currently in the target elevator dispatching turn, wherein the elevator which can be allocated in advance currently is the elevator which has been allocated in advance for a number of times smaller than the calibrated passenger number in the target elevator dispatching turn.
In some embodiments, the elevator information further includes a time period of operation of the elevator assigned to the user.
According to the elevator dispatching method and device provided by the embodiment of the disclosure, the elevator is preferentially allocated to the elevator using request which is the most time-consuming elevator, and the time for the user to wait for the elevator is shortened by receiving the elevator using request sent by the user, then determining the target elevator dispatching time period in which the target moment is positioned in at least two preset elevator dispatching time periods, then determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time consumption of the elevator in each floor in the target elevator dispatching time period, finally responding to the fact that the elevator allocation priority of the target floor in the target elevator dispatching time period is the highest, allocating the elevator to the user according to the preset rule, and sending the elevator information of the allocated elevator to the user.
Drawings
Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which some embodiments of the present disclosure may be applied;
fig. 2 is a flow chart of one embodiment of an elevator dispatching method according to the present disclosure;
fig. 3 is a schematic diagram of one application scenario of an elevator dispatching method according to an embodiment of the present disclosure;
fig. 4 is a flow chart of yet another embodiment of an elevator dispatching method according to the present disclosure;
fig. 5 is a schematic structural diagram of one embodiment of an elevator dispatching device according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the figures and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 shows an exemplary system architecture 100 of an elevator dispatching method or elevator dispatching device to which embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, networks 104, 106, a server 105, and elevators 107, 108, 109. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. The network 106 serves as a medium for providing communication links between the server 105 and the elevators 107,108, 109. The networks 104, 106 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
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 mobile terminal applications, such as an elevator reservation application, an instant messaging tool, a mailbox mobile terminal, etc. The server 105 can interact with the elevators 107, 108, 109 via the network 106 to receive or send messages or the like.
The terminal apparatuses 101, 102, and 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various electronic devices having a display screen and supporting information input, including but not limited to smart phones, tablet computers, laptop computers, and the like. When the terminal devices 101, 102, 103 are software, they can be installed in the electronic devices listed above. It may be implemented as multiple pieces of software or software modules (e.g., software or software modules used to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may be a server that provides various services, for example, receives an elevator use request sent by a user through the terminal devices 101, 102, 103, analyzes the elevator use request, and feeds back a processing result (e.g., information of an elevator allocated for the elevator use request) to the terminal device.
The server 105 may be hardware or software. When the server 105 is hardware, it may be implemented as a distributed server cluster composed of a plurality of servers, or may be implemented as a single server. When the server 105 is software, it may be implemented as multiple pieces of software or software modules (e.g., software or software modules used to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.
It should be noted that the elevator dispatching method provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the elevator dispatching device is generally disposed in the server 105.
It should be understood that the number of terminal devices, networks, servers and elevators in fig. 1 is only illustrative. There may be any number of terminal devices, networks, servers and elevators, depending on the implementation needs.
The technical scheme corresponding to each embodiment of the application can be applied to scenes that a user has a certain rule for elevator use, such as a commercial office building, a school teaching building and the like.
Continuing to refer to fig. 2, a flow 200 of one embodiment of an elevator dispatching method according to the present disclosure is shown. The elevator dispatching method comprises the following steps:
step 201, receiving an elevator use request sent by a user.
In this embodiment, the execution subject of the elevator dispatching method (e.g., the server shown in fig. 1) may receive an elevator use request sent by the user from the terminal device where the user is located through a wired connection manner or a wireless connection manner. The elevator use request may be for requesting use of an elevator provided in the target building. The target building may be various buildings including multi-story spaces, such as an office building, a mall, a school teaching building, and the like. The elevator use request may include, among other things, a target floor, which is a destination floor to which the user is going.
In some application scenarios, a user may enter a user's elevator usage request within a screen of a terminal device disposed within a target building. The execution main body can receive an elevator use request input by a user through the terminal equipment. In these application scenarios, the target time when the user is located in the elevator in the target building, which is determined according to the elevator use request, is the time when the user inputs the elevator use request.
In some optional implementations of this embodiment, the execution main body may further receive an elevator use request sent by a user through the mobile terminal. The user sends the elevator using request to the execution main body through the mobile terminal held by the user, so that the user can use the elevator more conveniently, and the user experience is improved.
In some optional implementations of this embodiment, the elevator use request may further include location information of the user and location information of the elevator. At this time, the user can input the current location of the user and the location of the elevator in the mobile terminal. The location information of the user may be the current location thereof manually input by the user, or the location information of the user may also be the current location of the mobile terminal and the user determined by the wireless location technology. The execution main body can estimate the time required for the user to arrive at the elevator from the position where the user is located based on the position information of the user and the position information of the elevator. Further, the execution main body can determine the time when the user arrives at the elevator based on the current time and the estimated time, and determine the time as the target time. The method can be convenient for the user to request to use the elevator in advance, and the elevator request is not required to be carried out after the user arrives at the elevator, so that the elevator waiting time of the user is further reduced.
In some optional implementations of this embodiment, the elevator use request may further include time information for a user to perform other tasks while traveling to the target building. In this case, the execution body can estimate the length of time required for the user to reach the elevator from the location of the user based on the user location information, the elevator location information, and the transaction time information. Further, the time when the user arrives at the elevator can be determined based on the current time and the estimated time length, and the time is determined as the target time.
And 202, determining a target elevator dispatching time period of the target time in at least two preset elevator dispatching time periods.
In this embodiment, the execution body may set at least two elevator dispatching time periods in advance. Here, each elevator dispatching time period may include at least a peak time period of elevator operation. Alternatively, the end-to-end connection of the elevator dispatching time periods can constitute a complete day. Based on the elevator use request obtained in step 201, the execution agent (e.g., the server shown in fig. 1) can determine the target time when the user arrives at the elevator. Then, the execution main body may determine an elevator dispatching time period in which the target time is located among the at least two elevator dispatching time periods, and determine the elevator dispatching time period in which the target time is located as the target elevator dispatching time period.
In some application scenarios, the elevator dispatching time period may be a plurality of time periods divided into a day according to a fixed time interval. That is, the time length included in each elevator dispatching time period in a plurality of elevator dispatching time periods in a day may be the same. For example, for 24 hours starting from point 0 and ending at point 24, each half hour is an elevator dispatching time period. Thus, 48 elevator dispatch periods may be included in 1 day. In other application scenarios, the time lengths included in the elevator dispatching time periods can be different. The time length included in the elevator dispatching time period corresponding to the elevator operation peak period can be smaller. The length of time included in the elevator dispatching time period corresponding to the elevator running valley period can be larger. For example, from 8 am to 9 am is half of the peak elevator operation period, and the elevator dispatching time period may include 10 minutes. The elevator operation valley period is from 10 pm to 24 am, and the time length included in the elevator dispatching time period can be 40 minutes and the like. Here, the time length included in each elevator dispatching time period may be set according to specific needs, and is not limited herein. It should be noted that the elevator dispatching time periods for different buildings may be different.
And step 203, determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator on each floor in the target elevator dispatching time period.
In this embodiment, for the target elevator dispatching time period determined in step 202, the execution subject may determine the elevator allocation priority of each floor in the target elevator dispatching time period in advance based on the historical running time of the elevator at each floor. Wherein, the execution main body can allocate different priorities to different floors according to the historical running time of each floor. The elevator allocation priority of the floor with longer history running time is higher, namely the elevator allocation priority of the floor with long history running time can be larger than the elevator allocation priority of the floor with short history running time.
Wherein the historical running time of each floor elevator can be determined based on the total number of historical elevator use requests taking the floor as a destination floor in the target elevator dispatching time period and the time taken for the elevator to directly arrive at the floor from the ground. The total number of the historical elevator use requests taking the floor as the target floor is the sum of the elevator use requests taking the floor as the target floor in the target elevator dispatching time period. As an example, if the target elevator dispatching time period is 9 to 10, the total number of the historical elevator use requests using the floor as the target floor may be the total number of the elevator use requests using the floor as the target floor within 9 to 10 points in a past day (for example, the day may be the same historical time as the day of the week of the current day).
In some optional implementations of this embodiment, the historical running time of each floor elevator may also be a product of a second average of the total number of the historical elevator use requests taking the floor as the target floor in the sub-historical time period corresponding to the target elevator dispatching time period in the historical time period and the consumption time of the elevator reaching the floor directly from the ground. Specifically, for each floor, the execution main body firstly determines the average value of the total number of the historical elevator use requests taking the floor as the target floor in the sub-historical time period corresponding to the target elevator dispatching time in the historical time period, determines the average value as a second average value, then determines the consumed time of the elevator reaching the floor directly from the ground, and finally determines the product of the determined second average value and the determined consumed time as the consumed time of the elevator in the historical operation of the floor. As an example, the target elevator dispatching time period is 9 to 10 points, the history time period is 10 days in the past, and the sub-history time period is 9 to 10 points per day in the 10 days in the past, the second average value of the total number of the history elevator use requests with the floor as the target floor may be an average value of the total number of the elevator use requests with the floor as the target floor in 10 days from 9 to 10 points per day in the 10 days in the past.
Historical run time P for kth floor k Can be calculated by the following formula:
P k ＝T k *U k (1)
k is more than or equal to 1 and less than or equal to the total floor number of the building; t is k The time it takes for the elevator to ascend directly from the ground to the kth floor; u shape k A second average of the total number of historic elevator usage requests targeting the kth floor. U shape k Can be calculated by the following formula:
Figure BDA0002277429240000101
wherein M is the number of the sub-historical time periods, and M is a positive integer greater than or equal to 1; u. of jk The number of elevator use requests using the k floor as the destination floor in the jth sub-history time period, and u jk Is a positive integer greater than or equal to zero; j is a positive integer of 1 or more and M or less.
In some optional implementations of this embodiment, determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of each floor in the target elevator dispatching time period includes: grouping a plurality of floors of a target building where the elevator is located according to a preset rule to obtain a plurality of grouped floors, wherein each grouped floor can comprise at least one floor; for a grouped floor in a plurality of grouped floors, accumulating the historical running time of the elevator on each floor included by the grouped floor in a target elevator dispatching time period to obtain the total historical running time of the elevator running on the grouped floor; sequencing the grouped floors according to the total historical operation time consumption of the grouped floors, and determining the elevator allocation priority of the grouped floors according to the sequencing result, wherein the total historical operation time consumption of the elevator operation of the grouped floors with higher elevator allocation priority is longer; and for each floor, determining the elevator allocation priority corresponding to the grouping floor comprising the floor as the elevator allocation priority of the floor. As an example, the execution body may divide a plurality of floors of the target building into three grouped floors, namely a low floor group, a middle floor group and a high floor group, and then accumulate historical operation time of the elevator in a target elevator scheduling time period for each floor included in the low floor group, the middle floor group and the high floor group, and obtain total historical operation time of the elevator in the low floor group, the middle floor group and the high floor group; then sorting the grouped floors according to the sequence of the total historical operating time consumption of the low, medium and high floor groups from large to small, determining the elevator allocation priority of the low, medium and high floor groups according to the sorting result, wherein the grouped floor elevator allocation priority with the large total historical operating time consumption is high; finally, the elevator allocation priority corresponding to the grouping floor where the target floor is located can be determined as the elevator allocation priority of the target floor.
And step 204, responding to the fact that the elevator distribution priority of the target floor is the highest in the target elevator dispatching time period, distributing the elevator for the user according to a preset rule, and sending elevator information of the distributed elevator to the user.
In this embodiment, the execution subject may determine whether the elevator allocation priority of the destination floor included in the elevator use request obtained in step 201 is the highest, based on the elevator allocation priority of each floor in the destination elevator dispatching time period determined in step 203. If the situation that the elevator allocation priority of the target floor is the highest in the target elevator scheduling time period is determined, the execution main body can allocate the elevator for the user according to the preset rule. The elevator information of the allocated elevator is then transmitted to the user. Wherein the elevator information may comprise an elevator identification. As an example, the preset rule may be to directly assign any one of currently available elevators to the user.
In some optional implementations of this embodiment, allocating elevators to users according to the preset rules may include: in response to determining that the target floor assigns a priority to the highest elevator within the target elevator dispatching time period, an elevator with the largest nominal passenger number can be determined from at least one elevator currently available; and assigns the determined elevator to the user. If the elevator of the target floor is allocated with the highest priority, the elevator with the largest calibrated passenger carrying quantity is allocated for the user, so that the situation that the elevator with large load capacity carries fewer passengers can be reduced as much as possible, and the utilization rate of the elevator is improved.
In some alternative implementations of this embodiment, a user often waits for one or more elevator dispatch rounds while waiting for an elevator. Therefore, if it is determined that the elevator allocation priority of the target elevator floor is the highest elevator allocation priority, the execution main body may determine one elevator dispatching turn that can be allocated to the elevator use request of the user from at least one elevator dispatching turn allocated to the highest elevator allocation priority in advance through various methods, and use the elevator dispatching turn as the target elevator dispatching turn. Then, the elevator with the largest number of marked passengers is allocated to the elevator use request from at least one elevator which can be pre-allocated currently in the target elevator dispatching turn. The elevator which can be pre-allocated currently can be the elevator which is pre-allocated within the target elevator dispatching turn for a number of times less than the calibrated number of passengers. Therefore, if the elevator of the target floor is the highest in the allocation priority, the method can allocate the elevator with the maximum load to the user in multiple elevator scheduling turns, so that the situation that the elevator with the large load is few in passengers can be reduced as much as possible, the user can be guaranteed to be allocated with the elevator as soon as possible, and the utilization rate of the elevator is improved.
It is to be understood that the executing agent may assign at least one elevator dispatching turn to the highest elevator assignment priority level within the target elevator dispatching time period in advance. When the target elevator dispatching time period includes only one elevator dispatching turn, the elevator dispatching turn can be allocated to the highest elevator allocation priority. When the target elevator dispatching time period includes more than one elevator dispatching turn, the executive body can allocate one elevator dispatching turn or more than one elevator dispatching turn for the highest elevator allocation priority in advance.
In practice, the execution main body can estimate the number of elevator use requests corresponding to the highest elevator allocation priority in the target elevator dispatching time period according to the elevator use records in each sub-historical time period in the historical time period. And determines the number of elevators available during the target elevator dispatch period and the nominal number of passengers for the available elevators. The nominal number of passengers of the elevator here can be the total nominal number of passengers of a plurality of elevators.
The executive body can predict the number of elevator dispatching rounds required by all users corresponding to the highest elevator distribution priority according to the number of the received elevator use requests and the calibrated passenger carrying quantity. Specifically, the received elevator usage request may be divided by the above-mentioned nominal number of passengers, the obtained quotient may be rounded up, and the obtained value may be determined as the number of elevator dispatching rounds required to transport all users of the above-mentioned corresponding highest elevator allocation priority. For example, if the quotient is 2.5, rounding up to 2.5, the number of elevator dispatching rounds required to deliver all users corresponding to the highest elevator allocation priority is 3. Here, the number of elevator dispatching turns required to deliver all users corresponding to the highest elevator allocation priority can be represented as a, and a is a natural number. The execution main body can allocate the first a elevator dispatching turns in a plurality of elevator dispatching turns corresponding to the target elevator dispatching time period to the highest elevator allocation priority.
For example, the number of elevator dispatching rounds is 2, and the 1 st round elevator dispatching and the 2 nd round elevator dispatching can be allocated to the highest elevator allocation priority. Alternatively, the number of elevator dispatching rounds is 2.5, and the 1 st round elevator dispatching, the 2 nd round elevator dispatching and the 3 rd round elevator dispatching in the target elevator dispatching time period can be allocated to the highest elevator allocation priority. For the 3 rd round elevator dispatching, at least one elevator of the elevators available in the 3 rd round elevator dispatching can be previously assigned to the highest elevator assignment priority. The at least one elevator may be assigned to the highest elevator assignment priority level in order of decreasing nominal passenger number, for example.
For example, if the number of elevator use requests with the highest elevator allocation priority is determined to be 50 according to each sub-history time period in the history time period, and the total nominal passenger carrying quantity of the available elevators for elevator scheduling in each round is 10, the 1 st round of elevator scheduling to the 5 th round of elevator scheduling in the target elevator scheduling time period can be allocated to the highest elevator scheduling priority in advance. Optionally, for different elevator use requests corresponding to the highest elevator allocation priority, elevator scheduling turns can be allocated to the elevator use requests according to the sending time of the elevator use requests. For example, an elevator dispatching turn with a smaller sequence number is allocated to the elevator use request with the previous elevator use request sending time.
In practice, after the execution body receives an elevator use request of a user, the target elevator dispatching time period corresponding to the elevator use request can be determined according to the steps 202 to 203 in the embodiment, and the elevator allocation priority corresponding to the elevator use request, such as the highest elevator allocation priority, can be determined according to the target floor in the elevator use request. The execution body determines at least one elevator dispatching turn allocated for the highest elevator allocation priority from the elevator dispatching turns allocated in advance for the priorities of the elevators. Then, the executing body can determine whether the elevators corresponding to the elevator dispatching rounds are fully loaded or not according to the sequence from small to large in the at least one elevator dispatching round for which the highest elevator is allocated with priority in advance until the elevator dispatching round with the elevator not fully loaded is determined. And determining the determined elevator dispatching turn with the elevator not fully loaded as a target elevator dispatching turn. In the determined target elevator dispatching turn, the executive body can assign the elevator with the largest number of calibrated passengers to the elevator use request from at least one elevator which can be pre-assigned currently in the target elevator dispatching turn. The elevator which can be allocated in advance at present can be an elevator which has the allocated elevator use request number in the target elevator dispatching turn less than the calibrated passenger number.
For example, the 1 st round elevator dispatching to the 5 th round elevator dispatching are allocated in advance for the highest elevator allocation priority in the target elevator dispatching time period. For the elevator use request of the user corresponding to the target elevator dispatching time period received currently, the execution main body can sequentially determine whether each round of elevator dispatching in 1 st round elevator dispatching, 2 nd round elevator dispatching, 3 rd round elevator dispatching, 4 th round elevator dispatching and 5 th round elevator dispatching is fully loaded or not from 1 st round elevator dispatching. Until an elevator dispatching turn with an elevator not fully loaded is determined. If the elevators from the 3 rd round to the 5 th round are not fully loaded. And when the execution main body determines that the 3 rd round of elevator dispatching is completed, the execution main body does not determine whether other rounds of elevator dispatching are not fully loaded. The executive body can determine the 3 rd round elevator dispatching as the target elevator dispatching round. Further, it can be determined that the elevator with the largest number of marked passengers is allocated to the elevator use request of the user in at least one elevator which can be pre-allocated currently in the 3 rd round elevator dispatching.
In some optional implementations of this embodiment, in response to determining that the elevator allocation priority of the target floor does not assign the priority to the highest elevator, an elevator that can be allocated to the user may be determined according to a preset rule from the elevators to which the elevator allocation priority corresponding to the target floor is assigned in advance. As an example, floors corresponding to elevator allocation priorities other than the highest elevator allocation priority may be individually allocated corresponding elevators, and in response to determining that the elevator allocation priority of the target floor does not allocate a priority to the highest elevator, an elevator corresponding to the elevator allocation priority of the target floor may be determined from the individually allocated elevators and allocated to the user. Optionally, if the target elevator dispatching time period includes multiple elevator dispatching rounds, in response to determining that the elevator allocation priority of the target floor is not the highest elevator allocation priority, determining a target dispatching round from at least one elevator dispatching round pre-allocated in advance for the elevator allocation priority corresponding to the target floor; in the elevator to which the priority assignment is previously assigned to the elevator corresponding to the target floor in the target scheduling turn, an elevator that can be pre-assigned to the elevator use request is determined.
Generally, each elevator dispatching round may include a process from when at least one elevator starts from an origin to when multiple elevators return to the origin. Here, the origin may be the ground or a specific floor of the target building. It should be noted that, in one elevator dispatching turn, the time of departure from the origin of each elevator may be different, and the time of return to the origin may also be different. The purpose of each round of elevator dispatching is to deliver the user to be taken to the elevator to the user's destination floor. The number of elevators dispatched by elevator dispatch for different rounds may vary with the number of users waiting for an elevator.
In some optional implementations of this embodiment, the elevator information may include a running time period of an elevator allocated to the user.
With continued reference to fig. 3, fig. 3 is a schematic view 300 of an application scenario of the elevator dispatching method according to the present embodiment. In the application scenario of fig. 3, for the elevator use request 302 issued by the user 301, the backend server 303 may receive the elevator use request sent by the user, as shown in step 304; then, the background server 303 may determine a target elevator dispatching time period in which the target time is located in at least two preset elevator dispatching time periods, as shown in step 305; then, the background server 303 may determine the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator on each floor in the target elevator dispatching time period, as shown in step 306; finally, the background server 303 assigns an elevator to the user according to a preset rule in response to determining that the elevator assignment priority of the target floor is the highest within the target elevator dispatching time period, as shown in step 307, and sends elevator information of the assigned elevator to the user so that the user can determine the elevator which the user needs to take.
The elevator dispatching method and device provided by the above embodiment of the application, by receiving the elevator use request sent by the user, then determining the target elevator dispatching time period where the target time is located in at least two preset elevator dispatching time periods, then determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator on each floor in the target elevator dispatching time period, finally responding to the fact that the elevator allocation priority of the target floor in the target elevator dispatching time period is the highest, allocating the elevator to the user according to the preset rule, and sending the elevator information of the allocated elevator to the user, the elevator is preferentially allocated to the elevator use request with the highest time consumption under the condition that the elevator use request is determined to be the elevator with the highest priority based on the historical running time consumption of the elevator on each floor, the time for the user to wait for the elevator is shortened.
With further reference to fig. 4, a flow 400 of yet another embodiment of an elevator dispatching method is shown. The process 400 of the elevator dispatching method comprises the following steps:
step 401, receiving an elevator use request sent by a user.
In this embodiment, the execution subject of the elevator dispatching method (e.g., the server shown in fig. 1) may receive an elevator use request sent by the user from the terminal device where the user is located through a wired connection manner or a wireless connection manner. The elevator use request may be for requesting use of an elevator provided in the target building.
And step 402, obtaining an elevator use record in a historical time period.
In this embodiment, the execution subject may obtain the elevator usage record in the history time period. It can be understood that the obtained elevator use record can be used for analyzing the relation between the elevator use times and the time, and then the division mode of the elevator dispatching time period is determined according to the analyzed relation. Therefore, the history period may be the same as or different from the history period for determining the second average value in the above embodiment.
Step 403, determining a first average value of the total number of the historical elevator use requests in each preset time period in the day for the historical time period.
In this embodiment, based on the elevator usage records in the history time period obtained in step 402, for the history time period, the execution subject may obtain the history elevator usage requests in each preset time period in the history time period, and then may determine an average value of the total number of the history elevator usage requests in each preset time period in the day, and determine the average value as the first average value.
In some application scenarios, the preset time period may be 1 minute, for example. The preset time period in one day may be a plurality of preset time periods that are consecutive in time, and the total time length included in the plurality of preset time periods constitutes 24 hours. If the preset time period is 1 minute, 24 × 60 preset time periods may be included in one day.
For each preset time interval, a first average value of the total number of the historical elevator use requests corresponding to the preset time interval can be counted from the number of the elevator use requests in the preset time interval in each historical working day of the D historical working days included in the historical time interval. The first average value corresponding to each preset time period may be an average value of the number of elevator use requests in the preset time period of a plurality of historical working days in the historical time period. For the ith preset time period, the first average value corresponding to the preset time period may be calculated by the following formula:
Figure BDA0002277429240000161
wherein Mi is a first average value corresponding to the ith preset time period in one day; i is a natural time period of 1 or more and 1 or lessNumber (e.g., preset period of 1 minute, i is 24 × 60 or less); d is the days of the historical working days included in the historical time period, and D is a positive integer greater than or equal to 1; r is a positive integer of 1 or more and D or less. Q ir The number of the corresponding elevator use requests in the ith preset time period in the r-th historical working day in the historical time period.
And step 404, dividing one day into at least two elevator dispatching time periods based on the maximum value in the determined first average value, the minimum value appearing before the preset time corresponding to the maximum value and the minimum value appearing after the preset time corresponding to the maximum value.
In this embodiment, the first average value corresponding to each preset time period may be determined based on step 403, and then the executing subject may determine at least two maximum values from the first average values corresponding to the preset time periods. Here, the number of the determined maximum values may be the number of elevator dispatching time periods. As an example, if the number of preset elevator dispatching time periods is 12, 12 maximum values can be determined from each first average value. Further, for each maximum value, the execution subject may determine a minimum value occurring before a preset period corresponding to the maximum value and a minimum value occurring after the preset period corresponding to the maximum value, and finally determine a time period between the preset periods corresponding to the determined two minimum values as an elevator dispatching time period corresponding to the maximum value. Optionally, the execution main body may arrange the first average values corresponding to the preset time periods into a data column according to a sequence of the preset time periods, then determine a left minimum value and a right minimum value which are respectively located at two sides of the maximum value and are closest to the maximum value in the data column, and finally determine a time period between the preset time period corresponding to the left minimum value and the preset time period corresponding to the right minimum value as an elevator scheduling time period.
And step 405, determining the elevator dispatching time period corresponding to the target time as the target elevator dispatching time period.
In this embodiment, the execution agent may determine in advance the target time when the user arrives at the elevator based on the elevator use request obtained in step 401. Then, the execution main body may determine an elevator dispatching time period in which the target time is located among the at least two elevator dispatching time periods, and determine the elevator dispatching time period in which the target time is located as the target elevator dispatching time period.
And 406, determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator on each floor in the target elevator dispatching time period.
In this embodiment, for the target elevator dispatching time period determined in step 405, the execution subject may determine the elevator allocation priority of each floor in the target elevator dispatching time period in advance based on the historical running time of the elevator on each floor. Wherein, the execution main body can allocate different priorities to different floors according to the historical running time consumption of each floor. The higher the elevator allocation priority the longer the historical movement time of the elevator for the floor with the higher the elevator allocation priority, i.e. the elevator allocation priority for the floor with the higher historical movement time can be greater than the elevator allocation priority for the floor with the lower historical movement time. Wherein the historical running time of each floor elevator can be determined based on the total number of historical elevator use requests taking the floor as a destination floor in the target elevator dispatching time period and the time taken for the elevator to directly arrive at the floor from the ground. The total number of the historical elevator use requests taking the floor as the target floor is the sum of the elevator use requests taking the floor as the target floor in the target elevator dispatching time period.
And step 407, responding to the fact that the elevator allocation priority of the target floor is the highest in the target elevator scheduling time period, allocating an elevator to the user according to a preset rule, and sending elevator information of the allocated elevator to the user.
In this embodiment, the execution subject may determine whether the elevator allocation priority of the destination floor included in the elevator use request obtained in step 401 is the highest, based on the elevator allocation priority of each floor in the destination elevator dispatching time period determined in step 406. If the elevator allocation priority of the target floor in the target elevator scheduling time period is determined to be the highest, the execution main body can allocate the elevator to the user according to the preset rule. The elevator information of the allocated elevator is then transmitted to the user. Wherein the elevator information may comprise an elevator identification. As an example, the preset rule may be to directly assign any one of currently available elevators to the user.
As can be seen from fig. 4, compared with the embodiment corresponding to fig. 2, the flow 400 of the elevator dispatching method in this embodiment highlights the step of determining the target elevator dispatching time period corresponding to the target time. Therefore, according to the scheme described in the embodiment, the plurality of elevator dispatching time periods are determined according to the historical elevator use records, so that the determined target elevator dispatching time period is more consistent with the elevator use rule of the user, the elevator load utilization rate is further improved, a better elevator dispatching strategy is realized, and better regulation and control of elevator resources are realized.
With further reference to fig. 5, as an implementation of the methods shown in the above figures, the present disclosure provides an embodiment of an elevator dispatching device, which corresponds to the embodiment of the method shown in fig. 2, and which can be applied in various electronic devices in particular.
As shown in fig. 5, the elevator dispatching device 500 of the present embodiment includes: a receiving unit 501, a first determining unit 502, a second determining unit 503 and an assigning unit 504. Wherein the receiving unit 501 is configured to receive an elevator use request sent by a user, wherein the elevator use request comprises a target floor; the first determining unit 502 is configured to determine a target elevator dispatching time period in which a target time is located among at least two preset elevator dispatching time periods, wherein the target time is the time when a user arrives at an elevator; the second determining unit 503 is configured to determine the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator at each floor in the target elevator dispatching time period, wherein the historical running time of each floor is determined based on the total number of the historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the floor with longer historical running time has higher allocation priority; the allocation unit 504 is configured to, in response to determining that the elevator allocation priority of the destination floor is highest within the destination elevator dispatching time period, allocate an elevator to the user according to a preset rule, and send elevator information of the allocated elevator to the user, wherein the elevator information includes an elevator identification.
In some optional implementations of this embodiment, the elevator use request further includes location information of the user and location information of the elevator; the apparatus 500 further comprises: a third determining unit configured to determine a target moment at which the user arrives at the elevator based on the position information of the user and the position information of the elevator.
In some optional implementations of the present embodiment, the first determining unit 502 is further configured to: obtaining an elevator use record in a historical time period, wherein the historical time period comprises a plurality of historical working days; determining a first average value of the total number of historical elevator use requests in each preset time period in a day aiming at the historical time periods; dividing one day into at least two elevator dispatching time periods based on the maximum value in the determined first average value, the minimum value appearing before the preset time period corresponding to the maximum value and the minimum value appearing after the preset time period corresponding to the maximum value; and determining the elevator dispatching time period corresponding to the target time as the target elevator dispatching time period.
In some optional implementations of this embodiment, the apparatus 500 further includes: a fourth determination unit configured to determine, for each floor, a second average of the total number of the historical elevator use requests for which the floor is a target floor within a sub-historical time period corresponding to the target elevator dispatching time period in the historical time period, and determine an elapsed time for which the elevator directly arrives at the floor from the ground; a fifth determination unit configured to determine the product of the determined second average value and the determined elapsed time as the elapsed time of the historical operation of the elevator at the floor.
In some optional implementations of this embodiment, the second determining unit 503 is further configured to: grouping a plurality of floors of a target building where an elevator is located according to a preset rule to obtain a plurality of grouped floors, wherein each grouped floor comprises at least one floor; for a grouped floor in a plurality of grouped floors, accumulating the historical running time of the elevator on each floor included by the grouped floor in a target elevator dispatching time period to obtain the total historical running time of the elevator running on the grouped floor; the grouping floors are sorted according to the total historical operating time consumption of each grouping floor, and the elevator allocation priority of each grouping floor is determined according to the sorting result, wherein the higher the elevator allocation priority is, the longer the total historical operating time consumption of the elevator operation of the grouping floors is; and for each floor, determining the elevator allocation priority corresponding to the grouping floor comprising the floor as the elevator allocation priority of the floor.
In some optional implementations of this embodiment, the allocating unit 504 is further configured to: determining an elevator with the largest nominal passenger carrying quantity from at least one elevator which is available currently; the determined elevator is allocated to the user.
In some optional implementations of this embodiment, the allocating unit 504 is further configured to: determining a target elevator dispatching turn from at least one elevator dispatching turn for which the highest elevator allocation priority is allocated in advance; and allocating the elevator with the largest calibrated passenger number to the user in at least one elevator which can be allocated in advance currently in the target elevator dispatching turn, wherein the elevator which can be allocated in advance currently is the elevator which has been allocated in advance for a number of times smaller than the calibrated passenger number in the target elevator dispatching turn.
In some optional implementations of this embodiment, the elevator information further includes a run time period for the elevator assigned to the user.
The units recited in the apparatus 500 correspond to the various steps in the method described with reference to fig. 2. Thus, the operations and features described above with respect to the method are equally applicable to the apparatus 500 and the units included therein and will not be described again here.
Referring now to FIG. 6, a schematic diagram of an electronic device (e.g., the server of FIG. 1) 600 suitable for use in implementing embodiments of the present disclosure is shown. The server shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may be alternatively implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of embodiments of the present disclosure. It should be noted that the computer readable medium of the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, 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), an optical fiber, 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 embodiments of the 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. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: receiving an elevator use request sent by a user, wherein the elevator use request comprises a target floor; determining a target elevator dispatching time period in which a target time is located in at least two preset elevator dispatching time periods, wherein the target time is the time when a user arrives at an elevator; determining the elevator allocation priority of each floor in a target elevator dispatching time period based on the historical running time consumption of the elevator on each floor in the target elevator dispatching time period, wherein the historical running time consumption of each floor is determined based on the total number of historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the longer the historical running time consumption, the higher the allocation priority of the elevator on the floor is; and responding to the fact that the elevator distribution priority of the target floor is the highest in the target elevator dispatching time period, distributing the elevator for the user according to a preset rule, and sending elevator information of the distributed elevator to the user, wherein the elevator information comprises an elevator identifier.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a receiving unit, a first determining unit, a second determining unit, and an assigning unit. Where the names of the units do not in some cases constitute a limitation of the unit itself, the receiving unit may also be described as "the unit receiving the elevator use request sent by the user", for example.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is made without departing from the inventive concept as defined above. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (10)

1. An elevator dispatching method, comprising:
receiving an elevator use request sent by a user, wherein the elevator use request comprises a target floor;
determining a target elevator dispatching time period in which a target time is located in at least two preset elevator dispatching time periods, wherein the target time is the time when the user arrives at an elevator;
determining the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time consumption of the elevator on each floor in the target elevator dispatching time period, wherein the historical running time consumption of each floor is determined based on the total number of historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the floor elevator allocation priority with longer historical running time consumption is higher;
in response to determining that the elevator assignment priority of the target floor is highest within the target elevator dispatching time period, determining an elevator with the largest nominal passenger number from at least one elevator currently available, assigning the determined elevator to the user, and sending elevator information of the assigned elevator to the user, wherein the elevator information comprises an elevator identification;
in response to determining that the elevator allocation priority for the target floor is not the highest within the target elevator dispatch time period, selecting an elevator from elevators previously allocated with priority allocations for the elevator for the target floor to allocate to the user.
2. The method of claim 1, wherein the elevator use request further includes location information of the user and location information of the elevator;
the method further comprises the following steps:
and determining the target moment when the user arrives at the elevator based on the position information of the user and the position information of the elevator.
3. The method of claim 1, wherein the determining the target elevator dispatching time period in which the target moment is located in the preset at least two elevator dispatching time periods comprises:
obtaining an elevator usage record in a historical time period, wherein the historical time period comprises a plurality of historical working days;
determining a first average value of the total number of historical elevator use requests in each preset time period in a day aiming at the historical time period;
dividing one day into the at least two elevator dispatching time periods based on a maximum value in the determined first average value, a minimum value occurring before a preset time period corresponding to the maximum value and a minimum value occurring after the preset time period corresponding to the maximum value;
and determining the elevator dispatching time period corresponding to the target moment as a target elevator dispatching time period.
4. The method of claim 1, wherein prior to determining the elevator allocation priority for each floor within the target elevator dispatching time period based on the historical elapsed elevator travel at each floor within the target elevator dispatching time period, the method further comprises:
for each floor, determining a second average value of the total number of historical elevator use requests taking the floor as a target floor in a sub-historical time period corresponding to the target elevator dispatching time period in the historical time period, and determining the consumed time of the elevator for directly reaching the floor from the ground;
the product of the determined second average value and the determined elapsed time is determined as the elapsed time of the historical movement of the elevator at the floor.
5. The method of claim 1, wherein the determining the elevator allocation priority for each floor in the target elevator dispatching time period based on the historical elapsed elevator travel time for each floor in the target elevator dispatching time period comprises:
grouping a plurality of floors of a target building where the elevator is located according to a preset rule to obtain a plurality of grouped floors, wherein each grouped floor comprises at least one floor;
for the grouped floors in the grouped floors, accumulating the historical running time of the elevator on each floor included by the grouped floors in the target elevator scheduling time period to obtain the total historical running time of the elevator running on the grouped floors;
the grouped floors are sorted according to the total historical operation time consumption of the grouped floors, and the elevator allocation priority of the grouped floors is determined according to the sorting result, wherein the total historical operation time consumption of the elevator operation of the grouped floors with higher elevator allocation priority is longer;
and for each floor, determining the elevator allocation priority corresponding to the grouped floor comprising the floor as the elevator allocation priority of the floor.
6. The method of claim 1, wherein the determining the elevator with the largest nominal passenger load from among the at least one elevator currently available, assigning the determined elevator to the user, comprises:
determining a target elevator dispatching turn from at least one elevator dispatching turn for which the highest elevator allocation priority is allocated in advance;
and allocating the elevator with the largest calibrated passenger number to the user in at least one elevator which can be pre-allocated currently in the target elevator dispatching turn, wherein the elevator which can be pre-allocated currently is the elevator which has been pre-allocated within the target elevator dispatching turn for a number of times smaller than the calibrated passenger number.
7. The method of one of claims 1-6, wherein the elevator information further comprises a run time period of an elevator assigned to the user.
8. An elevator dispatching device, comprising:
a receiving unit configured to receive an elevator use request transmitted by a user, wherein the elevator use request includes a target floor;
the first determining unit is configured to determine a target elevator dispatching time period in which a target moment is located in at least two preset elevator dispatching time periods, wherein the target moment is the moment when the user arrives at an elevator;
a second determining unit configured to determine the elevator allocation priority of each floor in the target elevator dispatching time period based on the historical running time of the elevator at each floor in the target elevator dispatching time period, wherein the historical running time of each floor is determined based on the total number of the historical elevator use requests taking the floor as the target floor and the consumption time of directly reaching the floor from the ground, and the floor with longer historical running time is allocated with higher priority;
an allocation unit configured to determine an elevator with a maximum nominal number of passengers from at least one elevator currently available in response to determining that the elevator allocation priority of the target building floor is highest within the target elevator dispatching time period, allocate the determined elevator to the user, and send elevator information of the allocated elevator to the user, wherein the elevator information includes an elevator identification;
the allocation unit is further configured to select an elevator to allocate to the user from the elevators previously allocated for the elevator allocation priority assignment of the target floor in response to determining that the elevator allocation priority of the target floor is not the highest within the target elevator dispatching time period.
9. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-7.
CN201911127906.9A 2019-11-18 2019-11-18 Elevator dispatching method and device Active CN111776896B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911127906.9A CN111776896B (en) 2019-11-18 2019-11-18 Elevator dispatching method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911127906.9A CN111776896B (en) 2019-11-18 2019-11-18 Elevator dispatching method and device

Publications (2)

Publication Number Publication Date
CN111776896A CN111776896A (en) 2020-10-16
CN111776896B true CN111776896B (en) 2022-09-06

Family

ID=72755761

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911127906.9A Active CN111776896B (en) 2019-11-18 2019-11-18 Elevator dispatching method and device

Country Status (1)

Country Link
CN (1) CN111776896B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112738895B (en) * 2020-12-25 2022-10-28 深圳市微网力合信息技术有限公司 WIFI channel allocation method and device
CN114955751B (en) * 2022-05-30 2023-12-22 深圳康佳电子科技有限公司 Elevator dispatching method, device, equipment and storage medium
CN115490102B (en) * 2022-10-19 2023-09-05 北京软通智慧科技有限公司 Elevator dispatching method and device, elevator and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5329076A (en) * 1992-07-24 1994-07-12 Otis Elevator Company Elevator car dispatcher having artificially intelligent supervisor for crowds
US6615175B1 (en) * 1999-06-10 2003-09-02 Robert F. Gazdzinski “Smart” elevator system and method
JP2013071825A (en) * 2011-09-28 2013-04-22 Hitachi Ltd Elevator apparatus
CN106167205A (en) * 2016-04-05 2016-11-30 北京小米移动软件有限公司 The control method of intelligent elevator, control device, operation method and intelligent elevator
CN107879206A (en) * 2017-11-08 2018-04-06 广东欧珀移动通信有限公司 Elevator scheduling method, device, equipment and storage medium

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4511017A (en) * 1983-09-20 1985-04-16 Westinghouse Electric Corp. Elevator system
US4838384A (en) * 1988-06-21 1989-06-13 Otis Elevator Company Queue based elevator dispatching system using peak period traffic prediction
JPH06271213A (en) * 1993-03-18 1994-09-27 Hitachi Ltd Group control device for elevator
AU2016347232A1 (en) * 2015-10-27 2018-02-08 Beijing Didi Infinity Technology And Development Co., Ltd. Systems and methods for delivering a message
US20180118511A1 (en) * 2016-10-28 2018-05-03 Otis Elevator Company Elevator service request using user device
CN109879126B (en) * 2017-12-06 2021-10-15 北京京东尚科信息技术有限公司 Elevator reservation method and system
CN109179101A (en) * 2018-09-07 2019-01-11 平安科技（深圳）有限公司 Elevator control method, device, computer equipment and computer readable storage medium
CN109626150A (en) * 2018-11-14 2019-04-16 深圳壹账通智能科技有限公司 Elevator concocting method and system
CN109761120B (en) * 2019-02-28 2020-11-24 杭州西奥电梯有限公司 Elevator control method and system based on prediction of number of arriving people on floor

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5329076A (en) * 1992-07-24 1994-07-12 Otis Elevator Company Elevator car dispatcher having artificially intelligent supervisor for crowds
US6615175B1 (en) * 1999-06-10 2003-09-02 Robert F. Gazdzinski “Smart” elevator system and method
JP2013071825A (en) * 2011-09-28 2013-04-22 Hitachi Ltd Elevator apparatus
CN106167205A (en) * 2016-04-05 2016-11-30 北京小米移动软件有限公司 The control method of intelligent elevator, control device, operation method and intelligent elevator
CN107879206A (en) * 2017-11-08 2018-04-06 广东欧珀移动通信有限公司 Elevator scheduling method, device, equipment and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
物联网与大数据相结合的电梯调度系统优化方案;李达铭等;《计算机时代》;20180515(第05期);全文 *

Also Published As

Publication number Publication date
CN111776896A (en) 2020-10-16

Similar Documents

Publication Publication Date Title
CN111776896B (en) Elevator dispatching method and device
CN110645983B (en) Path planning method, device and system for unmanned vehicle
CN113222305B (en) Order scheduling method, order scheduling device, storage medium and electronic equipment
US20120078671A1 (en) Intelligent Automated Dispatch And Mobile Resources Management System
US20140201753A1 (en) Scheduling mapreduce jobs in a cluster of dynamically available servers
CN110991808B (en) Task allocation method and device
CN110389816B (en) Method, apparatus and computer readable medium for resource scheduling
CN113448743B (en) Method, electronic device and computer program product for task processing
US20150150016A1 (en) Method and apparatus for a user-driven priority based job scheduling in a data processing platform
CN109861850B (en) SLA-based stateless cloud workflow load balancing scheduling method
CN113435968B (en) Network appointment vehicle dispatching method and device, electronic equipment and storage medium
CN111178686A (en) Distribution method and device of network appointment vehicles, electronic equipment and storage medium
CN111580974B (en) GPU instance allocation method, device, electronic equipment and computer readable medium
CN112749002A (en) Method and device for dynamically managing cluster resources
CN113722056A (en) Task scheduling method and device, electronic equipment and computer readable medium
CN116166395A (en) Task scheduling method, device, medium and electronic equipment
CN109783236B (en) Method and apparatus for outputting information
JP7367627B2 (en) Information processing device, information processing method, and program
CN106534312B (en) A kind of service request selection of facing mobile apparatus and dispatching method
CN113205235A (en) Customer service scheduling method and device
CN112232614A (en) Distribution task allocation method and device, electronic equipment and computer storage medium
CN111813541B (en) Task scheduling method, device, medium and equipment
CN114091807A (en) Method, device and system for distributing and scheduling tasks of multiple unmanned aerial vehicles and storage medium
CN115344359A (en) Computing power resource allocation method, device, computer readable storage medium and equipment
CN114489978A (en) Resource scheduling 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
GR01 Patent grant
GR01 Patent grant