CN116902712A - Elevator dispatching method, elevator dispatching device and electronic equipment - Google Patents
Elevator dispatching method, elevator dispatching device and electronic equipment Download PDFInfo
- Publication number
- CN116902712A CN116902712A CN202211713490.0A CN202211713490A CN116902712A CN 116902712 A CN116902712 A CN 116902712A CN 202211713490 A CN202211713490 A CN 202211713490A CN 116902712 A CN116902712 A CN 116902712A
- Authority
- CN
- China
- Prior art keywords
- elevator
- floor
- waiting
- weight
- weights
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 230000000694 effects Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000003190 augmentative effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
- B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- 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
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- 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/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/222—Taking into account the number of passengers present in the elevator car to be allocated
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/40—Details of the change of control mode
- B66B2201/402—Details of the change of control mode by historical, statistical or predicted traffic data, e.g. by learning
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B50/00—Energy efficient technologies in elevators, escalators and moving walkways, e.g. energy saving or recuperation technologies
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Automation & Control Theory (AREA)
- Human Resources & Organizations (AREA)
- Computer Networks & Wireless Communication (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Educational Administration (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Medical Informatics (AREA)
- General Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- Marketing (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Elevator Control (AREA)
Abstract
The application discloses an elevator dispatching method, an elevator dispatching device and electronic equipment, and belongs to the technical field of Internet of things. The method comprises the following steps: receiving a dispatching request sent by an elevator terminal, wherein the dispatching request comprises historical elevator taking weights and operation state information of the elevator terminal, the operation state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weights are used for indicating priorities of stopping orders of each floor when the elevator is dispatched last time; determining target elevator riding weights of all floors based on the running state information and the historical elevator riding weights, wherein the target elevator riding weights are used for indicating the priority of the stop sequence of the elevator terminal on all floors; scheduling information corresponding to the scheduling request is generated based on the target riding weight. And comprehensively processing according to the running condition of the elevator terminal at the current moment and the priority of each floor when the elevator is scheduled last time to obtain final scheduling information, thereby realizing the dynamic adjustment of the scheduling information.
Description
Technical Field
The application belongs to the technical field of the Internet of things, and particularly relates to an elevator dispatching method, an elevator dispatching device and electronic equipment.
Background
As high-rise buildings in cities become more and more, elevators have become an integral part of everyday life.
In the prior art, there are two most common elevator scheduling methods, one is first come first served (First Come First Serve, FCFS) and one is shortest seek time (Shortest Seek Time First, FCFS). FCFS is a scheduling method for random service. Specifically, the SSTF sets a request signal of a floor where an elevator can reach first in a request signal queue as a service target of the elevator. However, the existing scheduling method still has the problem of poor scheduling effect.
Disclosure of Invention
The embodiment of the application aims to provide an elevator dispatching method, an elevator dispatching device and electronic equipment, which can solve the problem that the existing elevator dispatching mode is poor in dispatching effect.
In a first aspect, an embodiment of the present application provides an elevator dispatching method, applied to a server, where the method includes:
receiving a dispatching request sent by an elevator terminal, wherein the dispatching request comprises historical elevator taking weights and running state information of the elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weights are used for indicating priorities of stopping orders of each floor when the elevator is dispatched last time;
determining target elevator riding weights of all floors based on the running state information and the historical elevator riding weights, wherein the target elevator riding weights are used for indicating the priority of the stop sequence of the elevator terminal on all floors;
and generating scheduling information corresponding to the scheduling request based on the target elevator taking weight.
Optionally, the running state information further includes first state information corresponding to the elevator end, where the first state information includes at least one of the following: the running direction of the elevator, the bearing information of the elevator and the floor where the elevator is located;
the generating scheduling information corresponding to the scheduling request based on the target riding weight includes:
the scheduling information is generated based on the target landing weight and the first status information.
Optionally, the user waiting information includes the number of waiting people on each floor and the waiting time of the users on each floor; the running state information also comprises second state information, wherein the second state information comprises the number of people in the elevator end;
the determining the target elevator taking weight of each floor based on the running state information and the historical elevator taking weight comprises the following steps:
determining the current elevator taking weight of each floor based on the number of waiting people, the second state information and the historical elevator taking weight;
determining the waiting weight of each floor based on the number of waiting persons and the waiting time;
and determining the target elevator taking weight based on the current elevator taking weight and the waiting weight.
Optionally, the determining the waiting weight of each floor based on the number of waiting persons and the waiting time includes:
determining a first parameter based on the number of people waiting at each floor, the first parameter comprising a sum of the number of people waiting at each floor;
determining a second parameter based on the waiting time of each floor, wherein the second parameter comprises the sum of the waiting time of each floor;
determining a first additional weight for each floor based on the first parameter and the number of people waiting for each floor;
determining a second additional weight for each floor based on the second parameter and the waiting time for each floor;
the waiting weights for the respective floors are determined based on the first additional weights and the second additional weights.
Optionally, the second state information further includes a target time difference, where the target time difference is a time difference between a time when the elevator terminal sends the scheduling request and a time when the elevator terminal is put into use;
determining a current boarding weight for each floor based on the number of waiting people, the second status information, and the historical boarding weight, comprising:
determining a first sub-weight of each floor based on the number of people located in the elevator terminal and the number of waiting people;
determining the current boarding weights for each floor based on the first sub-weights, the target time difference, and the historical boarding weights.
In a second aspect, an embodiment of the present application provides an elevator dispatching method, applied to an elevator end, where the method includes:
acquiring a dispatching request, wherein the dispatching request comprises historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating priority of a stopping sequence of each floor when the elevator is dispatched last time;
and sending the scheduling request to a server.
In a third aspect, an embodiment of the present application provides an elevator dispatching apparatus, which is applied to a service end, and the elevator dispatching apparatus includes:
the system comprises a receiving module, a scheduling module and a scheduling module, wherein the receiving module is used for receiving a scheduling request sent by an elevator terminal, the scheduling request comprises a historical elevator taking weight and running state information of the elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating the priority of a stopping sequence of each floor when the elevator is scheduled last time;
the determining module is used for determining target elevator taking weights of all floors based on the running state information and the historical elevator taking weights, wherein the target elevator taking weights are used for indicating the priority of the stop sequence of all floors;
and the generation module is used for generating scheduling information corresponding to the scheduling request based on the target elevator taking weight.
In a fourth aspect, an embodiment of the present application provides an elevator dispatching apparatus, applied to an elevator terminal, including:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the scheduling module is used for acquiring a scheduling request, the scheduling request comprises a historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating the priority of a stopping sequence of each floor when the elevator is scheduled last time;
and the sending module is used for sending the scheduling request to a server.
In a fifth aspect, an embodiment of the application provides an electronic device comprising a processor and a memory storing a program or instructions executable on the processor, which program or instructions when executed by the processor implement the steps of the elevator dispatching method according to the first and second aspects.
In a sixth aspect, embodiments of the present application provide a readable storage medium having stored thereon a program or instructions which when executed by a processor implement the steps of the elevator dispatching method according to the first and second aspects.
In the embodiment of the application, the final dispatching information is obtained by comprehensively processing the running condition of the elevator terminal at the current moment and the priority of each floor when the elevator is dispatched last time, and the dynamic adjustment of the dispatching information is realized, so that the dispatching information can meet the actual demands of users, and the dispatching effect is better.
Drawings
Fig. 1 is a schematic flow chart of an elevator dispatching method according to an embodiment of the present application;
fig. 2 is a second flow chart of an elevator dispatching method according to an embodiment of the present application;
fig. 3 is a flow diagram of an elevator dispatch process;
fig. 4 is a schematic flow chart of determining target elevator-taking weights of all floors based on the running state information and the historical elevator-taking weights in the elevator dispatching method according to the embodiment of the application;
fig. 5 is a schematic structural diagram of an elevator dispatching device applied to a service end according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions of the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which are obtained by a person skilled in the art based on the embodiments of the present application, fall within the scope of protection of the present application.
The terms first, second and the like in the description and in the claims, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged, as appropriate, such that embodiments of the present application may be implemented in sequences other than those illustrated or described herein, and that the objects identified by "first," "second," etc. are generally of a type, and are not limited to the number of objects, such as the first object may be one or more. Furthermore, in the description and claims, "and/or" means at least one of the connected objects, and the character "/", generally means that the associated object is an "or" relationship.
The elevator dispatching method provided by the embodiment of the application is described in detail through specific embodiments and application scenes thereof with reference to the accompanying drawings.
As shown in fig. 1, the elevator dispatching method applied to the service end provided by the embodiment of the application comprises the following steps:
step S1, receiving a dispatching request sent by an elevator terminal, wherein the dispatching request comprises historical elevator taking weight and running state information of the elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating priority of a stopping sequence of each floor when the elevator is dispatched last time.
The elevator dispatching method provided by the application can be applied to elevator systems of buildings such as residential buildings, office buildings and malls, a user presses an up button or a down button of an elevator on any floor to send a elevator using demand to an elevator terminal, and the elevator terminal sends a dispatching request to a service terminal after receiving the elevator using demand sent by the user. The dispatching request comprises a historical elevator taking weight, wherein the historical elevator taking weight comprises sub-weights corresponding to each floor in the elevator system when the elevator is dispatched last time, and the priority of dispatching the elevator to each floor when the elevator is dispatched last time is determined according to the sorting of the sub-weight values.
The dispatching request also comprises operation state information of the elevator end, which is obtained when the elevator section receives the elevator using requirement sent by the user, wherein the operation state information comprises user waiting information of each floor, the number of people in each elevator, the operation direction of each elevator, the position of each elevator and the like.
And S2, determining target elevator taking weights of all floors based on the running state information and the historical elevator taking weights, wherein the target elevator taking weights are used for indicating the priority of the stop sequence of the elevator terminal at all floors.
After receiving the dispatching request sent by the elevator terminal, the service terminal processes the running state information and the historical elevator taking weight information contained in the dispatching request, and respectively generates the target elevator taking weight corresponding to each floor. The larger the value of the target elevator taking weight corresponding to the floor is, the higher the priority of the stopping sequence of the floor is, namely, the elevator is dispatched to the corresponding floor according to the sequence from the larger value of the corresponding target elevator taking weight to the lower value.
Optionally, when calculating the target elevator taking weight for each floor of the elevator use peak period (7-9 points, 17-19 points), the operation state information of the elevator end is acquired every one minute apart from the operation state of the elevator end acquired at the moment when the user sends the elevator use demand, so that when the user sends an elevator use command, the operation state information can be timely scheduled to calculate the target elevator taking weight, and the operation state information of the elevator end can be acquired every 5 minutes apart in the non-peak period. The interval time and the frequency of information acquisition are adjustable.
Alternatively, the target time of day for a target elevator system, such as the general peak elevator use 8. And calculating the target elevator system by taking the target elevator taking weight of each floor at 8 points yesterday as the historical elevator taking weight and combining the elevator running state information at 8 points today to obtain the target elevator taking weight of each floor at 8 points today. As the destination elevator system operates, the destination landing weights of each floor of 8 points per day iterate continuously, and the destination landing weights of each floor of 8 points formed per day are increasingly close to the actual landing habits of users.
And step S3, generating scheduling information corresponding to the scheduling request based on the target riding weight.
The elevator end can be a plurality of elevators or a single elevator. After the service side generates the target elevator taking weight of each floor, each elevator is limited by the actual running state, such as whether the elevator is overloaded or not, whether the running direction of the elevator meets the direction required by a user or not, and the floor where each elevator is located, therefore, the scheduling information is formed by combining the target elevator taking weight of each floor, the elevator dispatching priority, whether the elevator is overweight, the information comprehensive judgment of the floor where the elevator is located and the like.
As an alternative implementation manner, as shown in fig. 2, after receiving the elevator requirement of the user, the elevator end starts data acquisition, and obtains the running state information and the historical elevator taking weight of the elevator end. Further, the data is sent to the server, and the server generates elevator dispatching information based on the data, and the specific process is seen in the steps S1 to S3. Further, the elevator terminal judges whether the user sending the elevator using requirement is received, if the user is not received, the processes of data acquisition, data transmission to the service terminal and elevator dispatching information generation are repeated. If the user receives the elevator using demand of other users, judging whether the elevator using demand of other users exists, if the elevator using demand of other users does not exist, ending the elevator dispatching process, and if the elevator using demand of other users exists, repeating the processes of data acquisition, data transmission to a server, elevator dispatching information generation and judging whether the user who sends the elevator using demand receives the elevator.
In the elevator dispatching and dispatching method provided by the embodiment of the application, the final dispatching information is obtained by comprehensively processing the running condition of the elevator terminal at the current moment and the priority of each floor when the elevator dispatching is carried out last time, and the dynamic adjustment of the dispatching information is realized, so that the dispatching information can meet the actual demands of users, and the better dispatching effect is achieved.
Optionally, the running state information further includes first state information corresponding to the elevator end, where the first state information includes at least one of the following: elevator running direction, elevator bearing information and elevator floor.
The elevator end comprises a single elevator or a plurality of elevators. The elevator running direction comprises an upper direction and a lower direction, whether the elevator is overweight or not is judged through the elevator bearing information and the maximum bearing weight of the elevator, and the distance between the elevator and each floor is judged through the floor where the elevator is located.
Optionally, step S3, generating scheduling information corresponding to the scheduling request based on the target riding weight includes:
the scheduling information is generated based on the target landing weight and the first status information.
As shown in fig. 3, in the elevator dispatching process, the server generates a target elevator taking weight of each floor, acquires first state information of all current elevators, generates dispatching information according to a self-defined algorithm, and sends the dispatching information to the corresponding elevators to finish dispatching. The process of generating the scheduling information according to the self-defined algorithm is as follows, and the optimal solution is obtained by comprehensively calculating according to the value of the target elevator taking weight of each floor and combining the elevator running direction, elevator bearing information and the floor where the elevator is located. It will be appreciated that under equivalent conditions, the elevator through efficiency is higher than halfway stops, the higher the operating efficiency when the elevator stops as little as possible. For the target floor with the largest target elevator taking weight, a first elevator consistent with the user demand direction is found according to the user's elevator demand of the target floor, the target elevator closest to the target floor is selected from the first elevators, the target elevator stops at the target floor, and after the user enters the target elevator, the target elevator cannot be overloaded.
The target elevator taking weight of each floor is combined with the information of the elevator running direction, elevator bearing information, the floor where the elevator is located and the like to generate scheduling information, so that the running efficiency of the elevator can be improved, and the use experience of a user is improved.
Optionally, the user waiting information includes the number of waiting people on each floor and the waiting time of the users on each floor; the operating status information also includes second status information including the number of people located within the elevator end.
The image information of each floor is obtained through the cameras of each floor, the number of people waiting for each floor can be obtained through the image processing technology, the image information also comprises time information, the waiting time of each user can be obtained according to the current time and the waiting time of each user, and the sum of the waiting time of all users of one floor is the waiting time of the user of the floor. Likewise, the number of people in the elevator end can be obtained through a camera and an image processing technology.
Optionally, as shown in fig. 4, step S2, determining a target boarding weight of each floor based on the running state information and the historical boarding weights includes:
and step S21, determining the current elevator taking weight of each floor based on the number of waiting people, the second state information and the historical elevator taking weight.
According to the waiting number of the floors, the current elevator taking weight of the floors is obtained by combining the real-time information acquired at the current moment such as the number of people in the elevator terminal and the historical elevator taking weight of the floors, which is the data representing the elevator stopping priority of the floors in the last dispatching process. The number of people waiting for the elevator is compared with the number of people in the elevator terminal, and the more the number of people waiting for the elevator is, the more users are required to be satisfied, and the elevator taking weight of the floor is required to be increased.
Step S22, determining the waiting weight of each floor based on the number of people waiting and the waiting time.
The number of waiting persons on the floors is large, and in order to meet the demands of users, the elevator taking weight of the floors needs to be increased, the waiting time of the same floors is long, and users are not full, so the elevator taking weight of the floors needs to be increased. Therefore, the number of people waiting for the elevator and the waiting time are required to be included in the determination process of the target elevator taking weight, so that the target elevator taking weight can meet the elevator using requirements of different users to the greatest extent.
Step S23, determining the target riding weight based on the current riding weight and the waiting weight.
The target riding weight is the sum of the current riding weight and the waiting weight. The target elevator taking weight is determined based on the number of waiting people, the number of people in the elevator terminal, the historical elevator taking weight and the waiting time, so that the target elevator taking weight is further ensured to meet the elevator taking requirement of a user to the greatest extent.
Optionally, step S22, determining a waiting weight of each floor based on the number of waiting persons and the waiting time, includes:
a first parameter is determined based on the number of people waiting at each floor, the first parameter comprising a sum of the number of people waiting at each floor.
And obtaining the number of waiting people on each floor at the current moment, and summing the number of waiting people on each floor to obtain a first parameter.
A second parameter is determined based on the waiting times of the respective floors, the second parameter comprising a sum of the waiting times of the respective floors.
The waiting time of the floor comprises the sum of the waiting time corresponding to all users of the floor, and the waiting time of each floor is summed to obtain the second parameter.
Determining a first additional weight for each floor based on said first parameter and said number of waiting persons for each floor,
the first additional weight:
wherein i represents the level of the floor, P i The number of waiting persons on the i-th floor is represented, and h represents the highest level of the floors.
Determining a second additional weight for each floor based on said second parameter and said waiting time for each floor,
the second additional weight:
wherein i represents the level of the floor, T i The waiting time of the i-th floor is represented, and h represents the highest level of the floors.
The waiting weights for the respective floors are determined based on the first additional weights and the second additional weights.
The waiting weight:
comparing the number of waiting people and waiting time of each floor with the total number of waiting people and waiting time, calculating a ratio, and taking the sum of the two ratios as the waiting weight. The waiting weight fully considers the influence of the waiting behavior of the user on the urgency of the use of the ladder of the user, and the current ladder taking weight obtained based on the waiting weight can be more in line with the needs of the use of the ladder of the user.
Optionally, the second state information further includes a target time difference, where the target time difference is a time difference between a time when the elevator terminal sends the scheduling request and a time when the elevator terminal is put into use;
the unit of the target time difference can be seconds, minutes, hours, days and years, but in the elevator dispatching method provided by the embodiment of the application, the unit of the day is generally adopted, and the unit is rounded upwards.
Optionally, step S21, determining the current boarding weight of each floor based on the number of waiting people, the second status information and the historical boarding weight, includes:
based on the number of people in the elevator terminal and the number of waiting people, a first sub-weight of each floor is determined,
the first sub-weight:
W i ＝P i /F i
wherein i represents the level of the floor, W i Representing the first sub-weight, P i Representing the number of waiting persons on the ith floor, F i Indicating the number of people in the elevator end.
Determining the current boarding weights for each floor based on the first sub-weights, the target time difference, and the historical boarding weights.
The current riding weight:
W n ＝(W n-1 ×(n-1)+W i )/n
where n represents a target time difference, i.e., a time difference between a time when the elevator terminal transmits the scheduling request and a time when the elevator terminal is put into use, and n is a unit of day. W (W) i Representing the first sub-weight, W n Representing the current boarding weight. The weight of (n-1) day plus the weight of the current moment, i.e. the first sub-weight, is divided by n days to obtain the average value, and the average value is the current elevator taking weight. Along with the continuous updating of the current elevator taking weight, the current elevator taking weight is more and more close to the actual elevator using habit of the user.
The embodiment of the application provides an elevator dispatching method applied to an elevator terminal, which comprises the following steps:
acquiring a dispatching request, wherein the dispatching request comprises historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating priority of a stopping sequence of each floor when the elevator is dispatched last time;
and sending the scheduling request to a server.
The elevator dispatching method applied to the elevator terminal can be applied to elevator systems of buildings such as residential buildings, office buildings and malls, a user presses an elevator up-link button or a down-link button on any floor, after the elevator terminal receives the elevator using requirement of the user, dispatching request information is collected and sent to the service terminal, so that the service terminal can generate an elevator dispatching strategy as soon as possible, and the elevator using requirement of the user is met. It should be noted that, the principle of the elevator dispatching method applied to the elevator end is the same as that of the elevator dispatching method applied to the service end, and will not be described herein.
The elevator dispatching method applied to the service end provided by the embodiment of the application can be implemented by the execution main body as an elevator dispatching device. In the embodiment of the present application, an elevator dispatching device executes an elevator dispatching method applied to a service end, and an elevator dispatching device end 500 provided by the embodiment of the present application is described with reference to fig. 5. The elevator dispatching device comprises:
a receiving module 501, configured to receive a scheduling request sent by an elevator terminal, where the scheduling request includes a historical elevator taking weight and operation state information of the elevator terminal, where the operation state information includes user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used to indicate a priority of a stop sequence of each floor when an elevator is scheduled last time;
a determining module 502, configured to determine a target boarding weight of each floor based on the running state information and the historical boarding weight, where the target boarding weight is used to indicate a priority of a parking sequence of each floor;
a generating module 503, configured to generate scheduling information corresponding to the scheduling request based on the target riding weight. Optionally, the running state information further includes first state information corresponding to the elevator end, where the first state information includes at least one of the following: the running direction of the elevator, the bearing information of the elevator and the floor where the elevator is located;
the generation module is further configured to generate the scheduling information based on the target landing weight and the first status information.
Optionally, the user waiting information includes the number of waiting people on each floor and the waiting time of the users on each floor; the running state information also comprises second state information, wherein the second state information comprises the number of people in the elevator end;
the determining module is further configured to:
determining the current elevator taking weight of each floor based on the number of waiting people, the second state information and the historical elevator taking weight;
determining the waiting weight of each floor based on the number of waiting persons and the waiting time;
and determining the target elevator taking weight based on the current elevator taking weight and the waiting weight.
Optionally, the determining module is further configured to:
determining a first parameter based on the number of people waiting at each floor, the first parameter comprising a sum of the number of people waiting at each floor;
determining a second parameter based on the waiting time of each floor, wherein the second parameter comprises the sum of the waiting time of each floor;
determining a first additional weight for each floor based on the first parameter and the number of people waiting for each floor;
determining a second additional weight for each floor based on the second parameter and the waiting time for each floor;
the waiting weights for the respective floors are determined based on the first additional weights and the second additional weights.
Optionally, the second state information further includes a target time difference, where the target time difference is a time difference between a time when the elevator terminal sends the scheduling request and a time when the elevator terminal is put into use;
the determining module is further configured to:
determining a first sub-weight of each floor based on the number of people located in the elevator terminal and the number of waiting people;
determining the current boarding weights for each floor based on the first sub-weights, the target time difference, and the historical boarding weights.
After receiving a dispatching request sent by an elevator terminal, the elevator dispatching device applied to the service terminal can process historical elevator taking weight and running state information of the elevator terminal in the dispatching request to generate dispatching information corresponding to the dispatching request.
It should be noted that, the elevator dispatching device provided by the embodiment of the present application can implement all the technical processes of the elevator dispatching method applied to the service end, and can achieve the same technical effects, so that repetition is avoided, and no further description is provided here.
The embodiment of the application also provides an elevator dispatching device applied to an elevator terminal, which can execute the elevator dispatching method applied to the elevator terminal, and comprises the following steps:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the scheduling module is used for acquiring a scheduling request, the scheduling request comprises a historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating the priority of a stopping sequence of each floor when the elevator is scheduled last time;
and the sending module is used for sending the scheduling request to a server.
After receiving the elevator using requirement of a user, the elevator scheduling device applied to the elevator terminal acquires a scheduling request through an acquisition module, wherein the scheduling request comprises historical elevator taking weight and elevator terminal running state information at the current moment, and then the scheduling request is sent to a server through a sending module, so that the server generates elevator scheduling information corresponding to the scheduling request, and the elevator using requirement of the user is met.
The device in the embodiment of the application can be an electronic device or a component in the electronic device, such as an integrated circuit or a chip. The electronic device may be a terminal, or may be other devices than a terminal. By way of example, the electronic device may be a mobile phone, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted electronic device, a mobile internet appliance (Mobile Internet Device, MID), an augmented reality (augmented reality, AR)/Virtual Reality (VR) device, a robot, a wearable device, an ultra-mobile personal computer (UMPC), a netbook or a personal digital assistant (personal digital assistant, PDA), etc., and the non-mobile electronic device may also be a server, a network attached storage (Network Attached Storage, NAS), a personal computer (personal computer, PC), a Television (TV), a teller machine, a self-service machine, etc., without limitation in the embodiments of the present application.
Optionally, as shown in fig. 6, the embodiment of the present application further provides an electronic device 600, including a processor 601 and a memory 602, where the memory 602 stores a program or an instruction that can be executed on the processor 601, and the program or the instruction implements each step of the above-mentioned embodiment of the elevator dispatching method when executed by the processor 601, and can achieve the same technical effect, so that repetition is avoided, and no further description is given here.
The electronic device in the embodiment of the application includes the mobile electronic device and the non-mobile electronic device.
The embodiment of the application also provides a readable storage medium, and the readable storage medium stores a program or an instruction, which when executed by a processor, realizes each process of the above elevator dispatching method embodiment, and can achieve the same technical effect, and is not repeated here.
Wherein the processor is a processor in the electronic device described in the above embodiment. The readable storage medium includes a computer readable storage medium such as a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. Furthermore, it should be noted that the scope of the methods and apparatus in the embodiments of the present application is not limited to performing the functions in the order shown or discussed, but may also include performing the functions in a substantially simultaneous manner or in an opposite order depending on the functions involved, e.g., the described methods may be performed in an order different from that described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a computer software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method according to the embodiments of the present application.
The foregoing is merely illustrative embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about variations or substitutions within the technical scope of the present application, and the application should be covered. Therefore, the protection scope of the application is subject to the protection scope of the claims.
Claims (10)
1. An elevator dispatching method applied to a server side, the method comprising:
receiving a dispatching request sent by an elevator terminal, wherein the dispatching request comprises historical elevator taking weights and running state information of the elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weights are used for indicating priorities of stopping orders of each floor when the elevator is dispatched last time;
determining target elevator riding weights of all floors based on the running state information and the historical elevator riding weights, wherein the target elevator riding weights are used for indicating the priority of the stop sequence of the elevator terminal on all floors;
and generating scheduling information corresponding to the scheduling request based on the target elevator taking weight.
2. The elevator scheduling method of claim 1, wherein the operating status information further comprises first status information corresponding to the elevator end, the first status information comprising at least one of: the running direction of the elevator, the bearing information of the elevator and the floor where the elevator is located;
the generating scheduling information corresponding to the scheduling request based on the target riding weight includes:
the scheduling information is generated based on the target landing weight and the first status information.
3. The elevator dispatching method according to claim 1, wherein the user waiting information includes a number of waiting persons on each floor and a waiting time of users on each floor; the running state information also comprises second state information, wherein the second state information comprises the number of people in the elevator end;
the determining the target elevator taking weight of each floor based on the running state information and the historical elevator taking weight comprises the following steps:
determining the current elevator taking weight of each floor based on the number of waiting people, the second state information and the historical elevator taking weight;
determining the waiting weight of each floor based on the number of waiting persons and the waiting time;
and determining the target elevator taking weight based on the current elevator taking weight and the waiting weight.
4. The elevator scheduling method of claim 3, wherein the determining the waiting weights of the respective floors based on the number of waiting persons and the waiting time comprises:
determining a first parameter based on the number of people waiting at each floor, the first parameter comprising a sum of the number of people waiting at each floor;
determining a second parameter based on the waiting time of each floor, wherein the second parameter comprises the sum of the waiting time of each floor;
determining a first additional weight for each floor based on the first parameter and the number of people waiting for each floor;
determining a second additional weight for each floor based on the second parameter and the waiting time for each floor;
the waiting weights for the respective floors are determined based on the first additional weights and the second additional weights.
5. The elevator scheduling method of claim 3, wherein the second status information further includes a target time difference between a time when the elevator end sends the scheduling request and a time when the elevator end is put into use;
determining a current boarding weight for each floor based on the number of waiting people, the second status information, and the historical boarding weight, comprising:
determining a first sub-weight of each floor based on the number of people located in the elevator terminal and the number of waiting people;
determining the current boarding weights for each floor based on the first sub-weights, the target time difference, and the historical boarding weights.
6. An elevator dispatching method applied to an elevator terminal, the method comprising:
acquiring a dispatching request, wherein the dispatching request comprises historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating priority of a stopping sequence of each floor when the elevator is dispatched last time;
and sending the scheduling request to a server.
7. An elevator dispatching device applied to a service end, characterized in that the elevator dispatching device comprises:
the system comprises a receiving module, a scheduling module and a scheduling module, wherein the receiving module is used for receiving a scheduling request sent by an elevator terminal, the scheduling request comprises a historical elevator taking weight and running state information of the elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating the priority of a stopping sequence of each floor when the elevator is scheduled last time;
the determining module is used for determining target elevator taking weights of all floors based on the running state information and the historical elevator taking weights, wherein the target elevator taking weights are used for indicating the priority of the stop sequence of all floors;
and the generation module is used for generating scheduling information corresponding to the scheduling request based on the target elevator taking weight.
8. An elevator dispatching device applied to an elevator terminal, characterized in that the elevator dispatching device comprises:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the scheduling module is used for acquiring a scheduling request, the scheduling request comprises a historical elevator taking weight and running state information of an elevator terminal, the running state information comprises user waiting information of each floor corresponding to the elevator terminal, and the historical elevator taking weight is used for indicating the priority of a stopping sequence of each floor when the elevator is scheduled last time;
and the sending module is used for sending the scheduling request to a server.
9. An electronic device, characterized in that it comprises a processor and a memory storing a program or instructions executable on the processor, which program or instructions, when executed by the processor, implement the steps of the elevator dispatching method according to any one of claims 1 to 6.
10. A readable storage medium, characterized in that it has stored thereon a program or instructions which, when executed by a processor, realizes the steps of the elevator dispatching method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211713490.0A CN116902712A (en) | 2022-12-29 | 2022-12-29 | Elevator dispatching method, elevator dispatching device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211713490.0A CN116902712A (en) | 2022-12-29 | 2022-12-29 | Elevator dispatching method, elevator dispatching device and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116902712A true CN116902712A (en) | 2023-10-20 |
Family
ID=88358923
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211713490.0A Pending CN116902712A (en) | 2022-12-29 | 2022-12-29 | Elevator dispatching method, elevator dispatching device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116902712A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117185063A (en) * | 2023-11-08 | 2023-12-08 | 海纳云物联科技有限公司 | Elevator dispatching method, device, equipment and computer storage medium |
-
2022
- 2022-12-29 CN CN202211713490.0A patent/CN116902712A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117185063A (en) * | 2023-11-08 | 2023-12-08 | 海纳云物联科技有限公司 | Elevator dispatching method, device, equipment and computer storage medium |
| CN117185063B (en) * | 2023-11-08 | 2024-02-13 | 海纳云物联科技有限公司 | Elevator dispatching method, device, equipment and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Marianov et al. | Probabilistic, maximal covering location—allocation models forcongested systems | |
| CN105584910B (en) | The method and system of scheduling elevator cars in group elevator system | |
| CN111427679A (en) | Computing task scheduling method, system and device facing edge computing | |
| CN104760851B (en) | For managing the method and device of elevator | |
| CN110654946B (en) | Community elevator dispatching method and system based on artificial intelligence | |
| CN107831903A (en) | The man-machine interaction method and device that more people participate in | |
| CN113938816B (en) | Computing power resource scheduling method and device | |
| CN112333556B (en) | Control method for monitoring video transmission bandwidth, terminal equipment and readable storage medium | |
| EP1656621A2 (en) | Method and system for regulating the dispatching of messages for requestors | |
| CN108394769A (en) | elevator control method, server and computer readable storage medium | |
| CN116902712A (en) | Elevator dispatching method, elevator dispatching device and electronic equipment | |
| CN110342354A (en) | A kind of elevator scheduling method, device, elevator device and storage medium | |
| CN109005211B (en) | Micro-cloud deployment and user task scheduling method in wireless metropolitan area network environment | |
| CN107103388B (en) | Robot scheduling system and method based on demand prediction | |
| CN105084140A (en) | Optimization method and device for elevator calling and waiting time distributed at intervals in circulating manner | |
| CN109179101A (en) | Elevator control method, device, computer equipment and computer readable storage medium | |
| CN114724694B (en) | Medical resource processing method and device and readable storage medium | |
| CN112508423B (en) | Guide route generation method and device | |
| CN112148449B (en) | Scheduling algorithm and system based on edge calculation for local area network | |
| CN116354199A (en) | Elevator calling device based on voice interaction and calling control method | |
| CN109205414B (en) | High-rise building elevator calling ladder scheduling method and device | |
| CN109783236B (en) | Method and apparatus for outputting information | |
| CN111798283A (en) | Order distribution method and device, electronic equipment and computer readable storage medium | |
| CN110065855A (en) | Elevator with multiple compartments control method and control system | |
| CN111924673B (en) | Linkage elevator scheduling method, system, computer 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 |