CN109693978A - Elevator intelligent dispatching method, device, computer equipment and storage medium - Google Patents
Elevator intelligent dispatching method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN109693978A CN109693978A CN201910046998.1A CN201910046998A CN109693978A CN 109693978 A CN109693978 A CN 109693978A CN 201910046998 A CN201910046998 A CN 201910046998A CN 109693978 A CN109693978 A CN 109693978A
- Authority
- CN
- China
- Prior art keywords
- elevator
- schedulable
- floor
- uplink
- ride
- 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.)
- Granted
Links
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
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
- B66B1/3415—Control system configuration and the data transmission or communication within the control system
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- 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/3476—Load weighing or car passenger counting devices
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B50/00—Energy efficient technologies in elevators, escalators and moving walkways, e.g. energy saving or recuperation technologies
Abstract
The invention discloses a kind of elevator intelligent dispatching method, device, computer equipment and storage mediums.This method includes the corresponding request number of times of real-time statistics ride-share request, if request number of times meets peak scheduling thresholds, according to peak schedule sequences, using first in peak debugging sequence to elevator dispatching as schedulable elevator；If taking mode is uplink mode, minimum current floor is determined as uplink initial rest floor, schedulable elevator is rested in into uplink initial rest floor, determines that uplink stops list based on the corresponding current floor of uplink mode and destination；The live load of each schedulable elevator is obtained by gravity sensor；If live load reaches the maximum capacity of schedulable elevator, schedulable elevator is then controlled to run up according to uplink stop list, and peak is debugged second in sequence and is updated to schedulable elevator to elevator dispatching, so that elevator resources are fully utilized, sufficiently meet user demand, improves user experience.
Description
Technical field
The present invention relates to intelligent scheduling field more particularly to a kind of elevator intelligent dispatching method, device, computer equipment and
Storage medium.
Background technique
In the peak period on and off duty of commercial office complex, since employee compares concentration the commuter time, in seating electricity on and off duty
When terraced, it often will appear an elevator overload operation, other elevators do not have carrying, so that elevator resources are not efficiently used.
In addition, comparing concentration due to taking elevator number in peak period on and off duty, it may appear that wait elevator door time is too long to cause working slow
Arrive or come off duty the case where postponing, and makes troubles, wastes time to the daily trip of employee, while making the Experience Degree of employee not
It is high.
Summary of the invention
The embodiment of the present invention provides a kind of elevator intelligent dispatching method, device, computer equipment and storage medium, to solve
The problem of elevator resources are not fully utilized.
A kind of elevator intelligent dispatching method, comprising:
The ride-share request that client is sent is obtained, the ride-share request includes taking mode, current floor and destination；
The corresponding request number of times of ride-share request described in real-time statistics, if the request number of times meets the peak pre-set
Scheduling thresholds, then according to peak schedule sequences, using first in peak debugging sequence to elevator dispatching as schedulable
Elevator；
If the mode of taking is uplink mode, minimum current floor is determined as uplink initial rest floor, it will
The schedulable elevator rests in the uplink initial rest floor, is based on the corresponding current floor of uplink mode and destination
Determine that uplink stops list；
The live load of each schedulable elevator is obtained by gravity sensor；
If the live load reaches the maximum capacity of the schedulable elevator, the schedulable elevator is controlled according to upper
Row is stopped list and is run up, and the peak is debugged second in sequence and is updated to schedulable elevator to elevator dispatching.
A kind of elevator intelligent dispatching device, comprising:
Ride-share request obtains module, and for obtaining the ride-share request of client transmission, the ride-share request includes the side of taking
Formula, current floor and destination；
Peak scheduling method judgment module, for the corresponding request number of times of ride-share request described in real-time statistics, if described ask
It asks number to meet the peak scheduling thresholds pre-set, then according to peak schedule sequences, the peak is debugged in sequence
First to elevator dispatching as schedulable elevator；
Uplink mode processing module determines minimum current floor if being uplink mode for the mode of taking
For uplink initial rest floor, the schedulable elevator is rested in into the uplink initial rest floor, is based on uplink mode pair
The current floor and destination answered determine that uplink stops list；
Uplink live load obtains module, works as front bearing for obtain each schedulable elevator by gravity sensor
Weight；
Uplink operation processing module is controlled if reaching the maximum capacity of the schedulable elevator for the live load
It makes the schedulable elevator to run up according to uplink stop list, and by second in peak debugging sequence wait dispatch
Elevator renewal is schedulable elevator.
A kind of computer equipment, including memory, processor and storage are in the memory and can be in the processing
The computer program run on device, the processor realize above-mentioned elevator intelligent dispatching method when executing the computer program.
A kind of computer readable storage medium, the computer-readable recording medium storage have computer program, the meter
Calculation machine program realizes above-mentioned elevator intelligent dispatching method when being executed by processor.
Above-mentioned elevator intelligent dispatching method, device, computer equipment and storage medium, pass through real-time statistics ride-share request pair
The request number of times answered, if request number of times meets the peak scheduling thresholds pre-set, according to peak schedule sequences, by peak
First in sequence is debugged to elevator dispatching as schedulable elevator.It then is the ride-share request of uplink mode by the mode of taking
In minimum current floor be determined as uplink initial rest floor, schedulable elevator is rested in into uplink initial rest floor, it is full
All users' takes condition in sufficient ride-share request.By obtaining the live load of schedulable elevator, the schedulable elevator is judged
Whether maximum capacity is had reached, if having reached maximum capacity, which does not receive it in uplink initial rest floor
He carries user, continues up operation, ensure that the operational safety of elevator.During uplink, stopped in list according to uplink
Current floor and destination successively stop, meet carry user the needs of.When schedulable elevator is run up, server
Second for peak being debugged in sequence updates schedulable elevator to elevator dispatching, provides needs for subsequent carrying user, makes
It obtains elevator resources to be fully utilized, sufficiently meets user demand, improve user experience.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below by institute in the description to the embodiment of the present invention
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the invention
Example, for those of ordinary skill in the art, without any creative labor, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is an application scenario diagram of elevator intelligent dispatching method in one embodiment of the invention；
Fig. 2 is a flow chart of elevator intelligent dispatching method in one embodiment of the invention；
Fig. 3 is the specific flow chart in Fig. 2 before step S10；
Fig. 4 is the specific flow chart in Fig. 2 after step S50；
Fig. 5 is the specific flow chart in Fig. 2 after step S80；
Fig. 6 is another flow chart of elevator intelligent dispatching method in one embodiment of the invention；
Fig. 7 is a schematic diagram of elevator intelligent dispatching device in one embodiment of the invention；
Fig. 8 is a schematic diagram of computer equipment in one embodiment of the invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall within the protection scope of the present invention.
Elevator intelligent dispatching method provided in an embodiment of the present invention, can be applicable in the application environment such as Fig. 1, wherein eventually
End equipment is communicated by network with server.Wherein, terminal device can be, but not limited to various personal computers, notebook
Computer, smart phone, tablet computer and portable wearable device.Server can use independent server either multiple clothes
The server cluster of business device composition is realized.
In one embodiment, it as shown in Fig. 2, providing a kind of elevator intelligent dispatching method, applies in Fig. 1 in this way
It is illustrated, includes the following steps: for server
S10: obtaining the ride-share request that client is sent, and ride-share request includes taking mode, current floor and destination.
Wherein, ride-share request refers to the request for needing to take elevator that user is sent by client.Specifically, user needs
When taking elevator, mode, the current floor at place and the destination to be gone to are taken what client inputted oneself needs.This
The mode of taking in embodiment refers to the method for operation of elevator when user takes elevator, including (i.e. elevator is run up uplink mode
Mode) and lower line mode (i.e. elevator run down mode).Current floor refers to the floor where user takes elevator.Target
Floor refers to that user takes the floor that elevator needs to reach.
S20: the corresponding request number of times of real-time statistics ride-share request, if request number of times meets the peak scheduling pre-set
Threshold value, then according to peak schedule sequences, using first in peak debugging sequence to elevator dispatching as schedulable elevator.
Wherein, peak scheduling thresholds refer to that is pre-set is used to judge whether the request number of times of ride-share request peaks
The value of scheduling.Peak scheduling refers to when taking after person-time reaching certain amount of elevator, for adaptation take peak requirements to elevator into
The mode of row scheduling.Peak schedule sequences refer to for storing elevator under the scheduling mode of peak, the sequence of elevator dispatching sequence.
Specifically, server is after the ride-share request for getting client transmission, the request of meeting real-time statistics ride-share request
Number, will according to the peak schedule sequences being stored in advance if request number of times meets the peak scheduling thresholds pre-set
Peak debug sequence in first to elevator dispatching as schedulable elevator.Wherein, refer to elevator dispatching and be stored in peak tune
Scheduled elevator is waited in degree series.Schedulable elevator refers to the qualified elevator that can be scheduled, the schedulable elevator
It is used as being supplied to the elevator that user takes when reply peak dispatch situation.
Server can make what feelings server independently judges in by the comparison to request number of times and peak scheduling thresholds
Under condition using peak scheduling by the way of elevator dispatching, be not necessarily to manual intervention.It is each when being dispatched using peak schedule sequences management peak
The operation order of elevator can make server successively obtain schedulable elevator in sequence according to actual needs, to schedulable
Elevator has carried out effective management, improves dispatching efficiency.
S30: if taking mode is uplink mode, being determined as uplink initial rest floor for minimum current floor, will
Schedulable elevator rests in uplink initial rest floor, determines uplink based on the corresponding current floor of uplink mode and destination
Stop list.
Specifically, after the completion of judging request number of times and peak scheduling thresholds, when request number of times satisfaction is set in advance
When the peak scheduling thresholds set, server judge acquisition each ride-share request it is corresponding reach mode, if taking mode
For uplink mode, then current floor minimum in ride-share request is obtained, it is initial that minimum current floor is then determined as uplink
Dock floor.It is to be appreciated that uplink initial rest floor refers to the floor that schedulable elevator is finally stopped in uplink mode.Such as
Current floor in the corresponding ride-share request of uplink mode includes 1 layer, 3 layers, 4 layers and 6 layers, in order to meet the institute in ride-share request
There is user's to take condition, it is necessary to by 1 layer of current floor minimum in ride-share request, as the floor finally stopped i.e. uplink
Initial rest floor.
After determining uplink initial rest floor, server can be according to the current floor in each ride-share request received
A uplink, which is formed, with destination stops list.Wherein, uplink stop list refers to all uplink modes inputted according to user
What corresponding current floor and destination were formed, for recording the column for the floor that schedulable elevator needs to stop in uplink
Table.If the user of uplink mode includes user 1, user 2 and user 3, the current floor that user 1 inputs is 1 layer, destination
It is 7 layers；The current floor that user 2 inputs is 3 layers, and destination is 7 layers；The current floor that user 3 inputs is 1 layer, target building
Layer is 13 layers, then stopping list according to the uplink that the corresponding current floor of uplink mode and destination determine is 1 layer, 3 layers, 7
Layer and 13 layers.Determine that uplink stops list by the corresponding current floor of uplink mode and destination, so that uplink mode
Elevator stops list according to uplink and successively rests in corresponding floor, meets the actual demand of user.
S40: the live load of each schedulable elevator is obtained by gravity sensor.
Wherein, live load refers to the load-carrying at the current time that schedulable elevator is obtained by gravity sensor measurement.Specifically
Ground is fitted with gravity sensor in each schedulable elevator, for obtaining to determine the whether overweight carrying of schedulable elevator
Take the live load of schedulable elevator.Gravity sensor can rest in each floor in uplink stop list in schedulable elevator
When, the live load of schedulable elevator is obtained, and live load is sent to corresponding server, facilitates server according to current
Load-carrying judges whether the schedulable elevator is fully loaded with, and needs to be implemented step S50.
S50: if live load reaches the maximum capacity of schedulable elevator, schedulable elevator is controlled according to uplink and stops column
Table is run up, and peak is debugged second in sequence and is updated to schedulable elevator to elevator dispatching.
Wherein, maximum load point out in schedulable elevator using security consideration, the maximum load-bearing value of setting.Specifically
Ground, if live load reaches the maximum capacity of schedulable elevator, then it represents that the schedulable elevator cannot carry again other and take this
The user of schedulable elevator.Server can control schedulable elevator and stop list controls according to the corresponding uplink of the schedulable elevator
It runs up, during it runs up, is not stopped in other floors that uplink is stopped other than the corresponding dock floor of list,
To improve operational efficiency, and second in peak debugging sequence is updated into schedulable elevator to elevator dispatching, repeats step
Rapid S20- step S50, until the ride-share request for completing user sufficiently meets user so that elevator resources are fully utilized
Demand improves user experience.
To step S10-S50, by the corresponding request number of times of real-time statistics ride-share request, if request number of times satisfaction is set in advance
The peak scheduling thresholds set, then according to peak schedule sequences, using peak debug first in sequence to elevator dispatching as
Schedulable elevator.Then the mode of taking is determined as uplink for current floor minimum in the ride-share request of uplink mode initially to stop
By floor, schedulable elevator is rested in into uplink initial rest floor, meet all users in ride-share request takes condition.It is logical
The live load for obtaining schedulable elevator is crossed, judges whether the schedulable elevator has reached maximum capacity, is held if having reached maximum
Weight, then the schedulable elevator does not receive other in uplink initial rest floor and carries user, continues up operation, ensure that elevator
Operational safety.During uplink, according to uplink stop list in current floor and destination successively stop, satisfaction is taken
Carry the demand of user.When schedulable elevator is run up, peak can be debugged second electricity to be dispatched in sequence by server
Ladder updates schedulable elevator, provides needs for subsequent carrying user, so that elevator resources are fully utilized, sufficiently meet and uses
Family demand improves user experience.
In one embodiment, it needs to obtain peak in advance before obtaining the ride-share request that client is sent in step S10
Schedule sequences provide data source for the subsequent schedulable elevator of acquisition.As shown in figure 3, elevator intelligent dispatching method further include as
Lower step:
S101: it is based on numbering of elevator, obtains the corresponding elevator historical data of each numbering of elevator.
Specifically, each elevator is distinguished for convenience, each elevator is numbered, so that each elevator carries
Corresponding numbering of elevator.Server can obtain the corresponding elevator historical data of each numbering of elevator according to numbering of elevator.The elevator
Historical data refers to that the elevator historical data of each elevator operating condition of storage in the database, including numbering of elevator, history are stopped
The data such as floor and the corresponding stop number of each history dock floor.In the database by elevator history data store, facilitate root
The corresponding elevator historical data of the numbering of elevator is obtained according to numbering of elevator, realizes the management to elevator historical data.
S102: it by elevator historical data, counts the corresponding floor of each numbering of elevator and stops number.
Wherein, floor stop number refers to the corresponding stop number of elevator dock floor.Specifically, numbering of elevator is being determined
Afterwards, the corresponding elevator historical data of each numbering of elevator is obtained from database by numbering of elevator, by elevator history number
The corresponding floor of each numbering of elevator stops the statistics of number in, obtains the corresponding floor of each numbering of elevator and stops number.
The frequency that floor stop number more multilist shows that the corresponding elevator of the numbering of elevator uses is higher, and floor stops the fewer expression of number should
The frequency that the corresponding elevator of numbering of elevator uses is lower.Obtaining the corresponding floor of each numbering of elevator and stopping number is to be subsequently generated
Peak schedule sequences provide data source.
S103: numbering of elevator is stopped into number according to floor and is arranged successively from more to less, the most elevator of number will be stopped
Number is used as first elevator, stops the least numbering of elevator of number as the last one elevator, forms peak schedule sequences.
Specifically, after obtaining the corresponding floor of each numbering of elevator and stopping number, numbering of elevator is stopped according to floor
Number is arranged successively from more to less, will be stopped the most numbering of elevator of number as first elevator, is stopped the least electricity of number
Ladder number is used as the last one elevator, forms peak schedule sequences.A certain elevator is taken according to user when the peak schedule sequences
What the elevator historical data that number is formed obtained, be more in line with the user for taking elevator takes habit.
It is corresponding to count each numbering of elevator according to the corresponding elevator historical data of numbering of elevator by step S101- step S103
Floor stop number, the sequence of how much determining peak schedule sequences of number is stopped according to floor, so that peak schedule sequences
It is more in line with the habit that user takes elevator.
In one embodiment, in order to maximize the use of schedulable elevator, extend schedulable elevator uses the time, this
The method of operation of schedulable elevator is set as in embodiment to work as schedulable elevator in the process of running, building where not reaching
Most value (top or the bottom) floor when, pay the utmost attention to run in the same direction according to the current method of operation.I.e.
Schedulable elevator where schedulable elevator does not reach when the top of building, pays the utmost attention to uplink mode during uplink.
When the lowermost layer that schedulable elevator is during downlink, and schedulable elevator is built where not reaching, downlink side is paid the utmost attention to
Formula.As shown in figure 4, in step S50, controls schedulable elevator and stopped after list runs up according to uplink, elevator intelligent electricity
Degree method further includes following steps:
S511: stopping list according to uplink, the live load that uplink stops each floor in list is obtained, when schedulable elevator
Arrived uplink stop list highest goal floor, and live load be 0 when, judgement whether receive within a preset period of time
New ride-share request.
Specifically, each when being recorded in the arrival uplink stop list of schedulable elevator after schedulable elevator is run up
When floor, gravity sensor can obtain the schedulable elevator in the live load of the floor, and be uploaded to server.When schedulable
Elevator arrived uplink stop list highest goal floor, and the live load of the schedulable elevator be 0 when, then it represents that it is adjustable
It spends elevator and stops list arrival highest goal floor according to uplink, and the user of highest goal floor all goes out at this time
Elevator, the schedulable elevator complete this time running up for task, server are allowed to understand schedulable elevator in time
Operating condition.
After all users for taking the schedulable elevator are all sent to by the schedulable elevator according to uplink stop list,
Server judges whether receive new ride-share request within a preset period of time, determines whether the schedulable elevator continues up
Operation.Preset time period in the present embodiment refers to that is pre-set is used to determine whether the schedulable elevator continues up operation
Period.
S512: if new ride-share request is received, and the mode of taking in new ride-share request is uplink mode, and newly
Current floor in ride-share request is higher than highest goal floor, then by new ride-share request current floor and destination more
It is new to stop list to uplink, it re-executes the schedulable elevator of control and is run up according to uplink stop list.
Specifically, if receiving new ride-share request in preset time period, it is also necessary to further judge that new the taking is asked
Take whether mode is uplink mode in asking, if uplink mode, it is also necessary to further determine that in the new ride-share request
Whether current floor is higher than highest goal floor, will if the current floor in new ride-share request is higher than highest goal floor
Current floor and destination in new ride-share request, which are updated to uplink, to be stopped in list, and the schedulable elevator of control is re-executed
The step of list is run up is stopped according to uplink.
For example, schedulable elevator, which stops the highest goal floor in list according to uplink, rests in 7 layers, in preset time period
In 3S, server gets a new ride-share request, and the mode of taking in the ride-share request is uplink mode, what user filled in
Current floor is 9 layers, and 12 layers of destination, 9 layers of current floor in the new ride-share request are higher than 7 layers of highest goal floor,
Then 9 layers of current floor in the new ride-share request is updated with 12 layers of destination to the corresponding uplink of the schedulable elevator and is stopped
In list, run up so that the schedulable elevator is re-executed according to uplink stop list.
S513: if being not received by new ride-share request, the mode of taking in new ride-share request is lower line mode, or
Current floor in new ride-share request is lower than highest goal floor, then is based on schedulable elevator renewal peak schedule sequences.
Specifically, after schedulable elevator completes the stop of each floor according to uplink stop list, within a preset period of time
It is not received by new ride-share request；Or new ride-share request is received within a preset period of time, but in new ride-share request
Mode of taking be current floor in lower line mode or new ride-share request lower than highest goal floor, then this is schedulable
Elevator does not execute corresponding new ride-share request.Last in the schedule sequences of peak can be added in the schedulable elevator by server
Position, more new height schedule sequences so that the schedulable elevator become again in new peak schedule sequences to elevator dispatching.Together
When, which is delegated to the schedulable elevator in new peak schedule sequences by server, by the new peak tune
Schedulable elevator in degree series completes new ride-share request.Both the ride-share request for having completed user is brought preferably to user
Experience effect, and elevator is protected not lead to reduced service life by frequent call up and down.
It is rested in 7 buildings for example, schedulable elevator stops the highest goal floor in list according to uplink, server does not exist
New ride-share request is received in preset time period 3S；Or in preset time period 3S, two new ride-share requests are got, the
Mode of taking in one new ride-share request is lower line mode, and the current floor that user fills in is 12 layers, 9 layers of destination；
Mode uplink mode is taken in another new ride-share request, current floor is 6 layers lower than highest goal floor, target building
9 layers of layer.It is current in second new ride-share request since the mode of taking in first new ride-share request is lower line mode
Floor in most original text destination, then the schedulable elevator does not execute corresponding new ride-share request, and server is schedulable by this
Elevator rejoins in the schedule sequences of peak, last position in referred to as new peak schedule sequences.Meanwhile server can should
New ride-share request is delegated to the schedulable elevator in new peak schedule sequences, by adjustable in the new peak schedule sequences
Degree elevator completes new ride-share request.
Step S511- step S513, by allowing schedulable elevator to run up and stop according to uplink stop list, so that
Schedulable elevator completely completes the ride-share request of user.By judging that schedulable elevator arrived the highest that uplink stops list
Destination, and live load is 0, determines that schedulable elevator has been completed this time running up for task, so that server
The operating condition of schedulable elevator can be understood in time.It is asked by the way that whether judgement receives new taking within a preset period of time
It asks, takes whether mode is uplink mode in new ride-share request, whether the current floor in new ride-share request is higher than most
High destination, determines whether the schedulable elevator needs to continue uplink, only meets these three conditions simultaneously, the schedulable electricity
Ladder can just continue uplink, can damage the usability of schedulable elevator to avoid schedulable elevator frequently upwards to downward driving,
Extend the service life of schedulable elevator.
In one embodiment, as shown in Fig. 2, in step S20, first peak debugged in sequence makees to elevator dispatching
After schedulable elevator, elevator intelligent dispatching method further includes following steps:
S60: if taking mode is lower line mode, being determined as down initial dock floor for highest current floor, will
Schedulable elevator rests in down initial dock floor, determines downlink based on the corresponding current floor of lower line mode and destination
Stop list.
Wherein, down initial dock floor refers to the floor that schedulable elevator is finally stopped in lower line mode.Downlink is stopped
List refers to what the current floor inputted according to user and destination were formed, needs to stop in downlink for recording schedulable elevator
The list of the floor leaned on.
Specifically, after using first in peak debugging sequence to elevator dispatching as schedulable elevator, if taking
Mode is lower line mode, then highest current floor is determined as down initial dock floor, schedulable elevator is rested in down
Row initial rest floor determines that downlink stops list based on the corresponding current floor of lower line mode and destination.Such as downlink side
Current floor in the corresponding ride-share request of formula includes 17 layers, 12 layers, 8 layers and 3 layers, all in ride-share request in order to meet
User's takes condition, it is necessary to by 17 layers of current floor highest in ride-share request, as the floor finally stopped i.e. downlink
Initial rest floor.
S70: the live load of each schedulable elevator is obtained by gravity sensor.
Specifically, in order to determine the whether overweight carrying of schedulable elevator, gravity is fitted in each schedulable elevator
Sensor, for obtaining the live load of schedulable elevator.Gravity sensor can rest in downlink in schedulable elevator and stop column
When each floor in table, the live load of schedulable elevator is obtained, and live load is sent to corresponding server, facilitate clothes
Business device judges whether the schedulable elevator is fully loaded with according to live load, needs to be implemented step S80.
S80: if live load reaches the maximum capacity of schedulable elevator, schedulable elevator is controlled according to downlink and stops column
Table is run down, and second in peak debugging sequence is updated schedulable elevator to elevator dispatching.
Specifically, if live load reaches the maximum capacity of schedulable elevator, then it represents that the schedulable elevator cannot connect again
Carry other users for taking the schedulable elevator.Server can control schedulable elevator according to the corresponding downlink of the schedulable elevator
It stops list controls to run down, during it runs down, stops its other than the corresponding dock floor of list in downlink
He does not stop at floor, to improve operational efficiency, and second in peak debugging sequence is updated schedulable electricity to elevator dispatching
Ladder repeats step S20, step S60- step S80, until the ride-share request of user is completed, so that elevator resources are filled
The utilization divided sufficiently meets user demand, improves user experience.
The mode of taking is determined as by step S60- step S80 for highest current floor in the ride-share request of lower line mode
Schedulable elevator is rested in down initial dock floor by down initial dock floor, meets all users in ride-share request
Take condition.By obtaining the live load of schedulable elevator, judge whether the schedulable elevator has reached maximum capacity, if
Reaching maximum capacity, then the schedulable elevator does not receive other in down initial dock floor and carries user, continue to run down,
It ensure that the operational safety of elevator.During downlink, according to downlink stop list in current floor and destination successively
It stops, meets the needs of carrying user.When schedulable elevator is run down, peak can be debugged second in sequence by server
It is a to update schedulable elevator to elevator dispatching, needs are provided for subsequent carrying user.
In one embodiment, it as shown in figure 5, in step S80, controls schedulable elevator and is transported downwards according to downlink stop list
After row, elevator intelligent dispatching method further includes following steps:
S81: stopping list according to downlink, the live load that institute's downlink stops each floor in list is obtained, when schedulable electricity
Ladder arrived downlink stop list minimum destination, and live load be 0 when, judgement whether receive within a preset period of time
To new ride-share request.
Specifically, each when being recorded in the arrival downlink stop list of schedulable elevator after schedulable elevator is run down
When floor, gravity sensor can obtain the schedulable elevator in the live load of the floor, and be uploaded to server.When schedulable
Elevator arrived downlink stop list minimum destination, and the live load of the schedulable elevator be 0 when, then it represents that it is adjustable
It spends elevator and stops the minimum destination of list arrival according to downlink, and the user of minimum destination all goes out at this time
Elevator, the schedulable elevator complete this time running down for task, server are allowed to understand schedulable elevator in time
Operating condition, and the step of whether judgement receives new ride-share request within a preset period of time executed.
S82: if new ride-share request is received, and the mode of taking in new ride-share request is lower line mode, and newly
Current floor in ride-share request is lower than minimum destination, then by new ride-share request current floor and destination more
It is new to stop list to downlink, it re-executes the schedulable elevator of control and is run down according to downlink stop list.
Specifically, if receiving new ride-share request in preset time period, it is also necessary to further judge that new the taking is asked
Take whether mode is lower line mode in asking, if lower line mode, it is also necessary to further determine that in the new ride-share request
Whether current floor is lower than minimum destination, will if the current floor in new ride-share request is lower than minimum destination
Current floor and destination in new ride-share request, which are updated to downlink, to be stopped in list, and the schedulable elevator of control is re-executed
The step of list is run down is stopped according to downlink.
For example, schedulable elevator, which stops the minimum destination in list according to downlink, rests in 12 layers, in preset time
In section 3S, server gets a new ride-share request, and the mode of taking in the ride-share request is lower line mode, and user fills in
Current floor be 7 layers, 1 layer of destination, 7 layers of current floor in the new ride-share request are lower than minimum destination 12
Layer, then by the new ride-share request 7 layers of current floor and 1 layer of destination update and arrive the corresponding downlink of the schedulable elevator
It stops in list, is run down so that the schedulable elevator is re-executed according to downlink stop list.
S83: if being not received by new ride-share request, the mode of taking in new ride-share request is uplink mode, or
Current floor in new ride-share request is higher than minimum destination, then is based on schedulable elevator renewal peak schedule sequences.
Specifically, after schedulable elevator completes the stop of each floor according to downlink stop list, within a preset period of time
It is not received by new ride-share request；Or new ride-share request is received within a preset period of time, but in new ride-share request
Mode of taking be that the current floor in uplink mode or new ride-share request is higher than minimum destination, then this is schedulable
Elevator does not execute corresponding new ride-share request.Last in the schedule sequences of peak can be added in the schedulable elevator by server
Position, more new height schedule sequences so that the schedulable elevator become again in new peak schedule sequences to elevator dispatching.Together
When, which is delegated to the schedulable elevator in new peak schedule sequences by server, by the new peak tune
Schedulable elevator in degree series completes new ride-share request.Both the ride-share request for having completed user is brought preferably to user
Experience effect, and elevator is protected not lead to reduced service life by frequent call up and down.
It is rested in 7 buildings for example, schedulable elevator stops the minimum destination in list according to downlink, server does not exist
New ride-share request is received in preset time period 3S；Or in preset time period 3S, two new ride-share requests are got, the
Mode of taking in one new ride-share request is uplink mode, and the current floor that user fills in is 9 layers, 12 layers of destination；
Line mode under mode is taken in another new ride-share request, it is 8 layers that current floor, which is higher than minimum destination, target building
2 layers of layer.It is current in second new ride-share request since the mode of taking in first new ride-share request is uplink mode
Floor is higher than minimum destination, then the schedulable elevator does not execute corresponding new ride-share request, and server is schedulable by this
Elevator rejoins in the schedule sequences of peak, last position in referred to as new peak schedule sequences.Meanwhile server can should
New ride-share request is delegated to the schedulable elevator in new peak schedule sequences, by adjustable in the new peak schedule sequences
Degree elevator completes new ride-share request.
In one embodiment, in order to prevent user due to waiting elevator door time is too long to cause user's working late or next
The case where delay, occurs, as shown in fig. 6, elevator intelligent dispatching method further includes following steps:
S91: statistics stop list in the corresponding request number of times of stop floor, stop list include uplink stop list or
Person's downlink stops list.
Wherein, it stops list and refers to what the current floor inputted according to user and destination were formed, it is schedulable for recording
The list for the floor that elevator needs to stop at runtime.Stop list in the present embodiment includes that uplink stops list or downlink
Stop list.It stops floor and refers to schedulable elevator during uplink or downlink, except the current floor and destination of user
The outer floor for needing to stop.As user A, B and C ride-share request in current floor be respectively 1 layer, 3 layers and 4 layers, it is corresponding
Destination is 5 layers, 7 layers and 12 layers, then the stop floor of user A is 3 layers and 4 layers, and the stop floor of user B is 4 layers and 5
Layer, the stop floor of user C are 5 layers and 7 layers.
Specifically, server is after getting ride-share request, can in ride-share request current floor and destination into
Row analysis, determines the corresponding stop floor of each ride-share request, and counts and stop the corresponding request number of times of floor.Statistics stops
The request number of times of floor facilitates subsequent step to calculate the residence time for stopping floor according to the request number of times for stopping floor.
S92: based on the corresponding request number of times of floor and unit residence time is stopped, the residence time is obtained.
Wherein, the unit residence time refer to be set according to actual conditions everyone into elevator or out used in elevator when
Between.Specifically, after obtaining the corresponding request number of times of stop floor, server can be by the stop floor of each ride-share request determination
It is multiplied with the corresponding request number of times of floor is stopped, obtains each ride-share request corresponding residence time.When being stopped such as unit
Between be set as 1S, the current floor in the ride-share request of user A, B and C is respectively 1 layer, 3 layers and 4 layers, corresponding destination
It is 5 layers, 7 layers and 12 layers, then the stop floor of user A is 3 layers and 4 layers, and the stop floor of user B is 4 layers and 5 layers, user C
Stop floor be 5 layers and 7 layers.1 layer of the request number of times that server obtains is 3 times, and 3 layers of request number of times is 1 time, 4 layers
Request number of times is 2 times, and 5 layers of request number of times 4 times, 7 layers of request number of times are 1 time, and 12 layers of request number of times is 2 times, then user A
Residence time be 2S, residence time of user B is 0, and the residence time of user C is 2S, and the residence time of user D is 3S, is used
The residence time of family E is 3S.It is as shown in the table in order to facilitate understanding:
S93: be based on the corresponding current floor of ride-share request and destination, determine interval floor, according to interval floor and
Unit runing time obtains runing time.
Wherein, interval floor refers to the floor being separated by between current floor and destination in ride-share request.Such as current floor
It is 1 layer, destination is 7 layers, then the interval floor in the ride-share request is 6 layers.Unit runing time refer to elevator rise or
Time used in one layer of decline.Specifically, after obtaining ride-share request, server can be based on the corresponding current floor of ride-share request
And destination, it determines interval floor, according to interval floor and unit runing time, obtains runing time.When such as unit operation
Between be 0.2S, when be spaced floor be 6 layers when, corresponding runing time be 1.2S.
S94: according to residence time and runing time, E.T.A is obtained, E.T.A will be sent to client
End.
Specifically, after obtaining residence time and runing time, the residence time is added with runing time be can be obtained by
E.T.A, it is contemplated that arrival time refer to server user be sent to client remind user it is estimated reach destination when
Between.If the current floor of user A is 1 layer, destination is 5 layers, and intermediate stop floor is 3 layers and 4 layers, stops 3 layers of floor
Be 1 with 1 layer of corresponding request number of times of layer is stopped, the interval floor of user A is 4 layers, then the E.T.A of user A be
2.8S, concrete operation are (1 × 1+1 × 1+4 × 0.2=2.8S).After obtaining E.T.A, this is expected to reach by server
Time is sent to the corresponding client of the ride-share request, so that user is anticipated that the time for waiting elevator and elevator to reach, more preferably
Plan the travel time of oneself in ground.
To step S91-S94, when stopping the corresponding request number of times of stop floor and unit stop in list by statistics
Between, the residence time is obtained, then by determining interval floor and unit runing time, runing time is obtained, keeps user pre-
Know the time for waiting elevator and elevator to reach, preferably plans the travel time of oneself.
In elevator intelligent dispatching method provided by the present embodiment, pass through the corresponding request time of real-time statistics ride-share request
Number, according to peak schedule sequences, peak is debugged in sequence if request number of times meets the peak scheduling thresholds pre-set
First to elevator dispatching as schedulable elevator.Then according to minimum in the ride-share request that mode of taking is uplink mode
Current floor is determined as uplink initial rest floor, and schedulable elevator is rested in uplink initial rest floor.Or according to taking
Multiply highest current floor in the ride-share request that mode is lower line mode and be determined as down initial dock floor, by schedulable elevator
Down initial dock floor is rested in, meet all users in ride-share request takes condition.By obtaining schedulable elevator
Live load, judges whether the schedulable elevator has reached maximum capacity, if having reached maximum capacity, the schedulable elevator is not
Uplink initial rest floor perhaps down initial dock floor receive other carry users continue up or run down,
It ensure that the operational safety of elevator.During uplink, according to uplink stop list in current floor and destination successively
It stops；During downlink, according to downlink stop list in current floor and destination successively stop, meet carry user
Demand.When schedulable elevator is upwardly or downwardly run, server can be by second in peak debugging sequence wait dispatch
The schedulable elevator of elevator renewal provides needs for subsequent carrying user, so that elevator resources are fully utilized, sufficiently meets
User demand improves user experience.
In order to solve the problems, such as that user, should due to waiting elevator door time is too long to cause user's working late or delay of coming off duty
Elevator intelligent dispatching method also passes through the corresponding request number of times of stop floor and unit residence time in statistics stop list, obtains
The residence time is taken, then by determining interval floor and unit runing time, runing time is obtained, user is made to anticipated that waiting
The time that elevator and elevator reach, preferably plan the travel time of oneself.
It should be understood that the size of the serial number of each step is not meant that the order of the execution order in above-described embodiment, each process
Execution sequence should be determined by its function and internal logic, the implementation process without coping with the embodiment of the present invention constitutes any limit
It is fixed.
In one embodiment, a kind of elevator intelligent dispatching device is provided, the elevator intelligent dispatching device and above-described embodiment
Middle elevator intelligent dispatching method corresponds.As shown in fig. 7, the elevator intelligent dispatching device includes that ride-share request obtains module
10, peak scheduling method judgment module 20, uplink mode processing module 30, uplink live load obtain module 40, uplink operation
Processing module 50, lower line mode processing module 60, downlink live load obtain module 70 and downlink runs processing module 80.Each function
Detailed description are as follows for energy module:
Ride-share request obtain module 10, for obtain client transmission ride-share request, ride-share request include take mode,
Current floor and destination.
Peak scheduling method judgment module 20 is used for the corresponding request number of times of real-time statistics ride-share request, if request number of times
Meet the peak scheduling thresholds pre-set, then according to peak schedule sequences, by first in peak debugging sequence wait adjust
Elevator is spent as schedulable elevator.
Minimum current floor is determined as by uplink mode processing module 30 if being uplink mode for the mode of taking
Schedulable elevator is rested in uplink initial rest floor by uplink initial rest floor, is based on the corresponding current building of uplink mode
Layer and destination determine that uplink stops list.
Uplink live load obtains module 40, works as front bearing for obtain each schedulable elevator by gravity sensor
Weight.
Uplink operation processing module 50 controls adjustable if reaching the maximum capacity of schedulable elevator for live load
Degree elevator is stopped list according to uplink and is run up, and peak debugged second in sequence be updated to elevator dispatching it is adjustable
Spend elevator.
Further, before ride-share request obtains module 10, elevator intelligent dispatching device further includes elevator historical data
Acquiring unit, floor stop number statistic unit and peak schedule sequences acquiring unit.
Elevator historical data acquiring unit obtains the corresponding elevator history of each numbering of elevator for being based on numbering of elevator
Data.
Floor stops number statistic unit, for counting the corresponding floor of each numbering of elevator by elevator historical data
Stop number.
Peak schedule sequences acquiring unit is arranged successively from more to less for numbering of elevator to be stopped number according to floor,
The most numbering of elevator of number will be stopped as first elevator, stop the least numbering of elevator of number as the last one electricity
Ladder forms peak schedule sequences.
Further, after uplink runs processing module 50, elevator intelligent dispatching device further includes that new ride-share request obtains
Take the new ride-share request first processing units of unit, uplink and the new ride-share request the second processing unit of uplink.
The new ride-share request acquiring unit of uplink obtains uplink and stops each floor in list for stopping list according to uplink
Live load, when schedulable elevator arrived uplink stop list highest goal floor, and live load be 0 when, judgement
New ride-share request whether is received within a preset period of time.
The new ride-share request first processing units of uplink, if for receiving new ride-share request, and in new ride-share request
Take mode be uplink mode and new ride-share request in current floor be higher than highest goal floor, then new is taken
Current floor and destination in request, which are updated to uplink, stops list, re-executes the schedulable elevator of control and stops according to uplink
It is run up by list.
New ride-share request the second processing unit of uplink, if for being not received by new ride-share request, new ride-share request
In mode of taking be current floor in lower line mode or new ride-share request lower than highest goal floor, then based on can
Elevator dispatching more new height schedule sequences.
Further, after uplink runs processing module 50, elevator intelligent dispatching device further includes lower line mode processing
Module 60, downlink live load obtain module 70 and downlink runs processing module 80.
Highest current floor is determined as by lower line mode processing module 60 if being lower line mode for the mode of taking
Schedulable elevator is rested in down initial dock floor by down initial dock floor, is based on the corresponding current building of lower line mode
Layer and destination determine that downlink stops list.
Downlink live load obtains module 70, works as front bearing for obtain each schedulable elevator by gravity sensor
Weight.
Downlink operation processing module 80 controls adjustable if reaching the maximum capacity of schedulable elevator for live load
Degree elevator is stopped list according to downlink and is run down, and second that peak is debugged in sequence is schedulable to elevator dispatching update
Elevator.
Further, after downlink runs processing module 80, elevator intelligent dispatching device further includes that downlink is newly taken and asked
Ask the new ride-share request first processing units of acquiring unit, downlink and the new ride-share request the second processing unit of downlink.
The new ride-share request acquiring unit of downlink obtains institute's downlink and stops the building list Zhong Ge for stopping list according to downlink
The live load of layer is sentenced when schedulable elevator arrived the minimum destination that downlink stops list, and live load is 0
It is disconnected whether to receive new ride-share request within a preset period of time.
The new ride-share request first processing units of downlink, if for receiving new ride-share request, and in new ride-share request
Mode of taking be current floor in lower line mode and new ride-share request lower than minimum destination, then new is taken
Current floor and destination in request, which are updated to downlink, stops list, re-executes the schedulable elevator of control and stops according to downlink
It is run down by list.
New ride-share request the second processing unit of downlink, if for being not received by new ride-share request, new ride-share request
In mode of taking be that the current floor in uplink mode or new ride-share request is higher than minimum destination, then based on can
Elevator dispatching more new height schedule sequences.
Further, elevator intelligent dispatching device further includes request number of times acquiring unit, residence time acquiring unit, operation
Time acquisition unit and E.T.A acquiring unit.
Request number of times acquiring unit stops list for counting the corresponding request number of times of stop floor stopped in list
List is stopped including uplink or downlink stops list.
Residence time acquiring unit, for based on the corresponding request number of times of floor and unit residence time is stopped, acquisition to stop
Stay the time.
Runing time acquiring unit determines interval building for being based on the corresponding current floor of ride-share request and destination
Layer obtains runing time according to interval floor and unit runing time.
E.T.A acquiring unit will be pre- for obtaining E.T.A according to residence time and runing time
Meter arrival time is sent to client.
Specific about elevator intelligent dispatching device limits the limit that may refer to above for elevator intelligent dispatching method
Fixed, details are not described herein.Modules in above-mentioned elevator intelligent dispatching device can fully or partially through software, hardware and its
Combination is to realize.Above-mentioned each module can be embedded in the form of hardware or independently of in the processor in computer equipment, can also be with
It is stored in the memory in computer equipment in a software form, in order to which processor calls the above modules of execution corresponding
Operation.
In one embodiment, a kind of computer equipment is provided, which can be server, internal junction
Composition can be as shown in Figure 8.The computer equipment include by system bus connect processor, memory, network interface and
Database.Wherein, the processor of the computer equipment is for providing calculating and control ability.The memory packet of the computer equipment
Include non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system, computer program and data
Library.The built-in storage provides environment for the operation of operating system and computer program in non-volatile memory medium.The calculating
The database of machine equipment is for storing the data being related in elevator intelligent dispatching method.The network interface of the computer equipment is used
It is communicated in passing through network connection with external terminal.To realize a kind of elevator intelligent tune when the computer program is executed by processor
Degree method.
In one embodiment, a kind of computer equipment is provided, including memory, processor and storage are on a memory
And the computer program that can be run on a processor, processor realize step S10- as shown in Figure 2 when executing computer program
Step S80 or Fig. 3 is to step shown in fig. 6.Alternatively, processor realizes above-mentioned elevator intelligent tune when executing computer program
The step of spending device, ride-share request as shown in Figure 7 obtain module 10, peak scheduling method judgment module 20, at uplink mode
Manage module 30, uplink live load obtains module 40, uplink runs processing module 50, lower line mode processing module 60, the lower trade
Front bearing recaptures modulus block 70 and downlink operation processing module 80.To avoid repeating, repeat no more.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program realizes step S10- step S80 or Fig. 3 as shown in Figure 2 to step shown in fig. 6 when being executed by processor.Or
Person, realization when computer program is executed by processor, the ride-share request as shown in Fig. 7 obtains module 10, peak scheduling method is sentenced
Disconnected module 20, uplink mode processing module 30, uplink live load obtain module 40, uplink runs processing module 50, downlink side
Formula processing module 60, downlink live load obtain module 70 and downlink runs processing module 80.To avoid repeating, repeat no more.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
It is apparent to those skilled in the art that for convenience of description and succinctly, only with above-mentioned each function
Can unit, module division progress for example, in practical application, can according to need and by above-mentioned function distribution by different
Functional unit, module are completed, i.e., the internal structure of described device is divided into different functional unit or module, more than completing
The all or part of function of description.
Embodiment described above is merely illustrative of the technical solution of the present invention, rather than its limitations；Although referring to aforementioned reality
Applying example, invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each
Technical solution documented by embodiment is modified or equivalent replacement of some of the technical features；And these are modified
Or replacement, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution should all
It is included within protection scope of the present invention.
Claims (10)
1. a kind of elevator intelligent dispatching method characterized by comprising
The ride-share request that client is sent is obtained, the ride-share request includes taking mode, current floor and destination；
The corresponding request number of times of ride-share request described in real-time statistics, if the request number of times meets the peak scheduling pre-set
Threshold value, then according to peak schedule sequences, using first in peak debugging sequence to elevator dispatching as schedulable elevator；
If the mode of taking is uplink mode, minimum current floor is determined as uplink initial rest floor, it will be described
Schedulable elevator rests in the uplink initial rest floor, is determined based on the corresponding current floor of uplink mode and destination
Uplink stops list；
The live load of each schedulable elevator is obtained by gravity sensor；
If the live load reaches the maximum capacity of the schedulable elevator, controls the schedulable elevator and stop according to uplink
It is run up by list, and the peak is debugged second in sequence and is updated to schedulable elevator to elevator dispatching.
2. elevator intelligent dispatching method as described in claim 1, which is characterized in that taken what the acquisition client was sent
Before request, the elevator intelligent dispatching method further include:
Based on the numbering of elevator, the corresponding elevator historical data of each numbering of elevator is obtained；
By the elevator historical data, counts the corresponding floor of each numbering of elevator and stop number；
The numbering of elevator is stopped number according to the floor to be arranged successively from more to less, the most elevator of number will be stopped and compiled
Number it is used as first elevator, stops the least numbering of elevator of number as the last one elevator, form peak schedule sequences.
3. elevator intelligent dispatching method as described in claim 1, which is characterized in that the control schedulable elevator according to
After being run up according to uplink stop list, the elevator intelligent dispatching method further include:
List is stopped according to the uplink, the live load that the uplink stops each floor in list is obtained, when described schedulable
Elevator arrived the highest goal floor that the uplink stops list, and when live load is 0, judgement is within a preset period of time
It is no to receive new ride-share request；
If receiving the new ride-share request, and the mode of taking in the new ride-share request is uplink mode and described
Current floor in new ride-share request is higher than the highest goal floor, then by the current floor in the new ride-share request
It updates with destination to the uplink and stops list, re-execute the control schedulable elevator according to uplink and stop column
Table is run up；
If being not received by the new ride-share request, the mode of taking in the new ride-share request is lower line mode, or
Current floor in the new ride-share request is lower than the highest goal floor, then based on described in the schedulable elevator renewal
Peak schedule sequences.
4. elevator intelligent dispatching method as described in claim 1, which is characterized in that debug on the peak in sequence described
First to elevator dispatching as schedulable elevator after, the elevator intelligent dispatching method further include:
If the mode of taking is lower line mode, highest current floor is determined as down initial dock floor, it will be described
Schedulable elevator rests in the down initial dock floor, is determined based on the corresponding current floor of lower line mode and destination
Downlink stops list；
The live load of each schedulable elevator is obtained by gravity sensor；
If the live load reaches the maximum capacity of the schedulable elevator, controls the schedulable elevator and stop according to downlink
It is run down by list, and second in peak debugging sequence is updated into schedulable elevator to elevator dispatching.
5. elevator intelligent dispatching method as claimed in claim 4, which is characterized in that the control schedulable elevator according to
After being run down according to downlink stop list, further includes:
List is stopped according to the downlink, the live load that institute's downlink stops each floor in list is obtained, when the schedulable electricity
Ladder arrived the minimum destination that the downlink stops list, and when live load is 0, judgement within a preset period of time whether
Receive new ride-share request；
If receiving the new ride-share request, and the mode of taking in the new ride-share request is lower line mode and described
Current floor in new ride-share request is lower than the minimum destination, then by the current floor in the new ride-share request
It updates with destination to the downlink and stops list, re-execute the control schedulable elevator according to downlink and stop column
Table is run down；
If being not received by the new ride-share request, the mode of taking in the new ride-share request is uplink mode, or
Current floor in the new ride-share request is higher than the minimum destination, then based on described in the schedulable elevator renewal
Peak schedule sequences.
6. elevator intelligent dispatching method as described in claim 1 or 4, which is characterized in that the elevator intelligent dispatching method is also
Include:
Statistics stop list in the corresponding request number of times of stop floor, the stops list include uplink stop list or under
Row stops list；
Based on the corresponding request number of times of the stop floor and unit residence time, the residence time is obtained；
Based on the corresponding current floor of the ride-share request and the destination, interval floor is determined, between described
Every floor and unit runing time, runing time is obtained；
According to the residence time and the runing time, E.T.A is obtained, the E.T.A is sent to
The client.
7. a kind of elevator intelligent dispatching device characterized by comprising
Ride-share request obtain module, for obtain client transmission ride-share request, the ride-share request include take mode, when
Preceding floor and destination；
Peak scheduling method judgment module, for the corresponding request number of times of ride-share request described in real-time statistics, if the request time
Number meets the peak scheduling thresholds pre-set, then according to peak schedule sequences, first in sequence is debugged on the peak
It is a to elevator dispatching as schedulable elevator；
Uplink mode processing module, if being uplink mode for the mode of taking, minimum current floor is determined as on
The schedulable elevator is rested in the uplink initial rest floor by row initial rest floor, corresponding based on uplink mode
Current floor and destination determine that uplink stops list；
Uplink live load obtains module, for obtaining the live load of each schedulable elevator by gravity sensor；
Uplink runs processing module and controls institute if reaching the maximum capacity of the schedulable elevator for the live load
It states schedulable elevator to run up according to uplink stop list, and by second in peak debugging sequence to elevator dispatching
It is updated to schedulable elevator.
8. elevator intelligent dispatching device as claimed in claim 6, which is characterized in that the elevator intelligent dispatching device also wraps
It includes:
Lower line mode processing module, if being lower line mode for the mode of taking, under highest current floor is determined as
The schedulable elevator is rested in the down initial dock floor by row initial rest floor, corresponding based on lower line mode
Current floor and destination determine that downlink stops list；
Downlink live load obtains module, for obtaining the live load of each schedulable elevator by gravity sensor；
Downlink runs processing module and controls institute if reaching the maximum capacity of the schedulable elevator for the live load
It states schedulable elevator to run down according to downlink stop list, and by second in peak debugging sequence to elevator dispatching
Update schedulable elevator.
9. a kind of computer equipment, including memory, processor and storage are in the memory and can be in the processor
The computer program of upper operation, which is characterized in that the processor realized when executing the computer program as claim 1 to
The step of any one of 6 elevator intelligent dispatching method.
10. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In realizing the elevator intelligent dispatching method as described in any one of claim 1 to 6 when the computer program is executed by processor
Step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910046998.1A CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910046998.1A CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109693978A true CN109693978A (en) | 2019-04-30 |
| CN109693978B CN109693978B (en) | 2023-04-18 |
Family
ID=66234049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910046998.1A Active CN109693978B (en) | 2019-01-18 | 2019-01-18 | Intelligent elevator dispatching method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109693978B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110817621A (en) * | 2019-11-14 | 2020-02-21 | 深圳市万物云科技有限公司 | Building passenger lift peak dispatching method, device, computer equipment and storage medium |
| CN112537704A (en) * | 2020-03-31 | 2021-03-23 | 深圳优地科技有限公司 | Robot elevator taking scheduling method, terminal and computer readable storage medium |
| CN113307112A (en) * | 2021-05-26 | 2021-08-27 | 菱王电梯有限公司 | Intelligent building management method, system and computer readable storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4782921A (en) * | 1988-03-16 | 1988-11-08 | Westinghouse Electric Corp. | Coincident call optimization in an elevator dispatching system |
| CN1032648A (en) * | 1987-10-20 | 1989-05-03 | 英万蒂奥股份公司 | Elevator multiple control device with relevant control with the gondola load |
| JPH08119545A (en) * | 1994-10-28 | 1996-05-14 | Hitachi Ltd | Group supervisory operation control system for elevator |
| CN1136528A (en) * | 1995-03-09 | 1996-11-27 | 奥蒂斯电梯公司 | Remote control combined device for lift system |
| JPH0912239A (en) * | 1995-06-28 | 1997-01-14 | Hitachi Ltd | Group control device of elevator |
| JP3251595B2 (en) * | 1996-10-29 | 2002-01-28 | 三菱電機株式会社 | Elevator control device |
| JP2008150208A (en) * | 2006-10-16 | 2008-07-03 | Hitoshi Aoki | Controller of elevator, group control device of elevator, and elevator system |
| CN106167205A (en) * | 2016-04-05 | 2016-11-30 | 北京小米移动软件有限公司 | The control method of intelligent elevator, control device, operation method and intelligent elevator |
| CN108483152A (en) * | 2018-04-10 | 2018-09-04 | 深圳市零度智控科技有限公司 | Preengage boarding system, implementation method and background server, storage medium |
| CN109205407A (en) * | 2018-11-09 | 2019-01-15 | 京东方科技集团股份有限公司 | Elevator riding implementation method, terminal and storage medium |
-
2019
- 2019-01-18 CN CN201910046998.1A patent/CN109693978B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1032648A (en) * | 1987-10-20 | 1989-05-03 | 英万蒂奥股份公司 | Elevator multiple control device with relevant control with the gondola load |
| US4782921A (en) * | 1988-03-16 | 1988-11-08 | Westinghouse Electric Corp. | Coincident call optimization in an elevator dispatching system |
| JPH08119545A (en) * | 1994-10-28 | 1996-05-14 | Hitachi Ltd | Group supervisory operation control system for elevator |
| CN1136528A (en) * | 1995-03-09 | 1996-11-27 | 奥蒂斯电梯公司 | Remote control combined device for lift system |
| JPH0912239A (en) * | 1995-06-28 | 1997-01-14 | Hitachi Ltd | Group control device of elevator |
| JP3251595B2 (en) * | 1996-10-29 | 2002-01-28 | 三菱電機株式会社 | Elevator control device |
| JP2008150208A (en) * | 2006-10-16 | 2008-07-03 | Hitoshi Aoki | Controller of elevator, group control device of elevator, and elevator system |
| CN106167205A (en) * | 2016-04-05 | 2016-11-30 | 北京小米移动软件有限公司 | The control method of intelligent elevator, control device, operation method and intelligent elevator |
| CN108483152A (en) * | 2018-04-10 | 2018-09-04 | 深圳市零度智控科技有限公司 | Preengage boarding system, implementation method and background server, storage medium |
| CN109205407A (en) * | 2018-11-09 | 2019-01-15 | 京东方科技集团股份有限公司 | Elevator riding implementation method, terminal and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110817621A (en) * | 2019-11-14 | 2020-02-21 | 深圳市万物云科技有限公司 | Building passenger lift peak dispatching method, device, computer equipment and storage medium |
| CN112537704A (en) * | 2020-03-31 | 2021-03-23 | 深圳优地科技有限公司 | Robot elevator taking scheduling method, terminal and computer readable storage medium |
| CN113307112A (en) * | 2021-05-26 | 2021-08-27 | 菱王电梯有限公司 | Intelligent building management method, system and computer readable storage medium |
| CN113307112B (en) * | 2021-05-26 | 2022-07-12 | 菱王电梯有限公司 | Intelligent building management method, system and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109693978B (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109693978A (en) | Elevator intelligent dispatching method, device, computer equipment and storage medium | |
| CN104040486B (en) | Decouple PAAS resources, operation and scheduling | |
| CN108139940A (en) | Management for the periodic request of computing capability | |
| CN108921470B (en) | Order distribution management method and device, computer equipment and storage medium | |
| CN104217320B (en) | The processing system and processing method of warehouse inventory circulation | |
| KR100352668B1 (en) | System and method for scheduling system resources | |
| US8276143B2 (en) | Dynamic scheduling of application tasks in a distributed task based system | |
| CN103761147B (en) | The management method and system of calculated examples in a kind of cloud platform | |
| US20100218005A1 (en) | Energy-aware server management | |
| CN104102544A (en) | Multi QoS (quality of service)-constrained parallel task scheduling cost optimizing method under mixed cloud environment | |
| CN101821997A (en) | Hierarchical reservation resource scheduling infrastructure | |
| US9374314B2 (en) | QoS aware balancing in data centers | |
| JP2008519322A (en) | Method for managing resources in a platform for telecommunications services and / or network management, supported platforms, and computer program products thereof | |
| CN101013386A (en) | Grid task scheduling method based on feedback mechanism | |
| CN106892307A (en) | The method and elevator device of information alert | |
| EP2672781A1 (en) | Method and mobile terminal for predicting user operation | |
| CN109703396B (en) | Charging control method, device, equipment and storage medium for wireless charging parking place | |
| CN109636105A (en) | Method, apparatus, computer equipment and the storage medium of elevator dispatching | |
| CN110196773B (en) | Multi-time-scale security check system and method for unified scheduling computing resources | |
| CN112591568A (en) | Device sharing method for fusion of data and information facing intention calculation and reasoning | |
| CN108920524A (en) | Toilet querying method, device, computer equipment and storage medium | |
| CN110609747A (en) | Information processing method and electronic equipment | |
| JP5670290B2 (en) | Method, system and computer program for managing resources for execution of processes for communication services | |
| CN113902177A (en) | Task allocation method and system | |
| Bagga et al. | Moldable load scheduling using demand adjustable policies |
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 |