CN116934010A - Order sending method, apparatus, computer device and storage medium - Google Patents
Order sending method, apparatus, computer device and storage medium Download PDFInfo
- Publication number
- CN116934010A CN116934010A CN202310827327.5A CN202310827327A CN116934010A CN 116934010 A CN116934010 A CN 116934010A CN 202310827327 A CN202310827327 A CN 202310827327A CN 116934010 A CN116934010 A CN 116934010A
- Authority
- CN
- China
- Prior art keywords
- work order
- time
- traffic
- determining
- dispatch
- 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 59
- 238000012423 maintenance Methods 0.000 claims abstract description 100
- 238000012937 correction Methods 0.000 claims abstract description 34
- 238000004590 computer program Methods 0.000 claims description 30
- 238000013507 mapping Methods 0.000 claims description 21
- 238000012545 processing Methods 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 7
- 238000009434 installation Methods 0.000 description 8
- 238000010276 construction Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 4
- 238000003066 decision tree Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000007306 turnover Effects 0.000 description 1
Classifications
-
- 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/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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/20—Administration of product repair or maintenance
Abstract
The application relates to a dispatch method, a dispatch device, a computer device and a storage medium, wherein the dispatch method comprises the following steps: predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task; the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained; acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position; and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time. By adopting the method, the accuracy of the estimated assembly and maintenance time can be improved, so that whether the time between the first work order and the second work order is overlapped or not can be judged, and the second work order can be effectively distributed.
Description
Technical Field
The present application relates to the field of computer technology, and in particular, to a method, an apparatus, a computer device, a storage medium, and a computer program product for dispatching.
Background
The existing work order system predicts the required maintenance time according to the work order type (such as installation or maintenance) and work order task (such as intelligent business/kilomega broadband, etc.), directly predicts the required traffic time on a map according to the previous single address to the next single address, and determines whether to send the maintenance work order to the maintenance personnel of the grid based on the predicted maintenance time and traffic time.
However, this predictive method is too much cured, taking into account only the time normally required for the assembly of the dimension itself, while the actual assembly time is affected by other factors. Therefore, the deviation of the estimated assembly and maintenance time of the current dispatch method can influence the rationality and effectiveness of dispatch.
Disclosure of Invention
Accordingly, there is a need for a dispatch method, apparatus, computer device, computer readable storage medium and computer program product for solving the technical problem that the estimated assembly time of the dispatch method has deviation, which affects the rationality and effectiveness of dispatch.
In a first aspect, the present application provides a dispatch method. The method comprises the following steps:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
The address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In one embodiment, the correcting the initial assembly time according to the address type to obtain the corrected assembly time of the first work order includes:
inquiring a mapping relation table between a preset address type and time according to the address type to obtain additional time required by the address type of the first position; the mapping relation table comprises mapping relations between a plurality of preset address types and additional time corresponding to each preset address type;
and adding the initial assembly time and the additional time to obtain the correction assembly time of the first work order.
In one embodiment, the determining the traffic time required from the first location to the second location comprises:
Querying a historical track database; the history track database stores the history traffic time among a plurality of positions in the process of processing work orders by the maintenance personnel;
if there is a historical traffic time from the first location to the second location in the historical track database, determining the historical traffic time as the traffic time required from the first location to the second location.
In one embodiment, after querying the historical track database, the method further includes:
if the historical traffic time from the first position to the second position does not exist in the historical track database, path planning is carried out according to the first position and the second position, and a target path is obtained;
and adding estimated road condition information from the first position to the second position in the target path, and predicting the traffic time required from the first position to the second position.
In one embodiment, the method further comprises:
if a plurality of historical traffic time from the first position to the second position exists in the historical track database, acquiring the average value of each historical traffic time;
And determining the average value of the historical traffic time as the traffic time required from the first position to the second position.
In one embodiment, the determining the dispatch strategy for the second work order according to the corrected maintenance time and the traffic time includes:
determining an arrival time point of a second position corresponding to the second work order after the first work order is processed according to the correction maintenance time and the traffic time;
acquiring a starting time point of the second work order, and determining an order sending policy for the second work order based on the starting time point and the arrival time point.
In one embodiment, the determining the dispatch strategy for the second work order based on the start time point and the arrival time point includes:
if the arrival time point is earlier than the starting time point, the second work order is distributed to the maintenance personnel of the first work order;
and if the arrival time point is later than the starting time point, the second work order is distributed to other maintenance personnel.
In a second aspect, the application further provides a dispatch device. The device comprises:
The prediction module is used for predicting the initial assembly time of the first work order according to the work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the correction module is used for acquiring the address type of the first position corresponding to the first work order, correcting the initial assembly time according to the address type, and obtaining the corrected assembly time of the first work order;
the determining module is used for acquiring a second position corresponding to a second work order and determining traffic time required from the first position to the second position;
and the dispatch module is used for determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor which when executing the computer program performs the steps of:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
Acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In a fourth aspect, the present application also provides a computer-readable storage medium. The computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In a fifth aspect, the present application also provides a computer program product. The computer program product comprises a computer program which, when executed by a processor, implements the steps of:
Predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
According to the method, the device, the computer equipment, the storage medium and the computer program product for dispatching the work orders, the initial assembly time of the first work orders is predicted according to the work order type and the work order task of the first work orders, then the initial assembly time is corrected according to the address type of the first position corresponding to the first work orders, the corrected assembly time of the first work orders is obtained, and the dispatching strategy for the second work orders is further determined according to the corrected assembly time and the traffic time required from the first position to the second position. According to the method, the influence of the address type on the assembly and maintenance time is considered, when the assembly and maintenance time is determined, the initial assembly and maintenance time estimated for the first time is corrected based on the address type, so that the estimated assembly and maintenance time is more accurate, the possibility of whether the time between the first work order and the second work order is overlapped can be reasonably judged, the second work order is effectively distributed, and the problem that the second work order cannot be executed on time due to overtime of the execution time of the first work order is avoided.
Drawings
FIG. 1 is a flow chart illustrating a dispatch method according to one embodiment;
FIG. 2 is a flow chart illustrating the maintenance time correction steps in one embodiment;
FIG. 3 is a flow chart of a traffic time determination step in one embodiment;
FIG. 4 is a flowchart of a dispatch method according to another embodiment;
FIG. 5 is a block diagram illustrating an exemplary configuration of a dispatch device;
fig. 6 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the application described herein may be implemented in sequences other than those illustrated or otherwise described herein.
The dispatch mode adopted in the prior art is still that the worksheets in the grids are preferentially assigned to the corresponding dimension installing personnel of the grids. However, during busy/peak hours, the user's reservation may be very close (e.g., 16:30 for the previous order and 17:00 for the next order), and in this case, there may be a time overlap, i.e., the previous order execution time may be too much time-out to affect the next order, resulting in a longer waiting time for the user for the next order. Therefore, when ordering the list, the sum of the three-dimensional assembly time of the last list and the traffic time required for going to the next list needs to be estimated, and whether the address where the next list is located can be reached before 17:00. If it is estimated that the time is not enough at the time of order placement, then the 17:00 work order needs to be transferred to other personnel for assistance.
In the existing order arranging method, the required maintenance time is predicted by the type and task of the work order. However, since the installation time required for the new installation of the broadband for different destination types, even for the same business, such as the self-building house of the village in the city and the shops of the business district, is different, the time required for turning over different buildings and various walking and wiring in the complex environment is required for the self-building house, and the time required for turning over the various walking and wiring is more than that of the shops of the business district, the prediction deviation is large in a similar way.
Therefore, based on the problems, the application provides a dimension-assembling dispatch method based on a map and a position positioning technology, so as to solve the problems that a dimension-assembling work order time prediction mode is solidified and a prediction result has larger deviation.
Referring to fig. 1, a flowchart of a dispatch method is shown in an embodiment, where the method is applied to a terminal for illustration, it is to be understood that the method may also be applied to a server, and may also be applied to a system including the terminal and the server, and implemented through interaction between the terminal and the server. The terminal can be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, internet of things equipment and portable wearable equipment, and the internet of things equipment can be smart speakers, smart televisions, smart air conditioners, smart vehicle-mounted equipment and the like. The portable wearable device may be a smart watch, smart bracelet, headset, or the like. The server may be implemented as a stand-alone server or as a server cluster composed of a plurality of servers. In this embodiment, the method includes the steps of:
step S110, predicting the initial assembly time of the first work order according to the work order information of the first work order; the work order information includes at least work order type and work order tasks.
The work order types can specifically comprise a loading work order, a maintenance work order and the like.
The work order tasks may include networking services, home services, broadband services, and the like, among others.
The first work order is a work order to be dispatched, and the starting time point of the first work order is earlier than that of the second work order.
In the specific implementation, assuming that in the same grid W, the first work order and the second work order are required to be checked and arranged at present, if the predicted construction periods of the first work order and the second work order do not have time overlapping, the first work order and the second work order can be distributed to the dimension assembling personnel A corresponding to the grid W; otherwise, if the predicted construction periods of the first work order and the second work order have a certain time overlapping possibility, the second work order with later time can be distributed to other maintenance personnel close to the grid to rob the work order.
Specifically, for whether the first work order and the second work order overlap in time, the maintenance time of the first work order and the traffic time required from the first position where the second work order is located to the second position where the second work order is located need to be predicted, then the arrival time point when the maintenance personnel arrives at the second position where the second work order is located after the maintenance personnel completes the first work order is estimated according to the maintenance time and the traffic time, the arrival time point is compared with the starting time point of the second work order, and whether the two work orders overlap in time is determined.
The prediction of the assembly and maintenance time of the first work order can be based on the work order type and the work order task of the first work order, and it can be understood that the assembly and maintenance work order types are different, the required assembly and maintenance time is also different, and the specific assembly and maintenance task is different, so that the assembly and maintenance time is also affected. More specifically, corresponding initial setup time may be set in advance for different job ticket types and combinations of job ticket tasks, e.g., the initial setup time required to install a broadband is t 1 The initial assembly and maintenance time required by television maintenance is t 2 And after the work order type and the work order task of the first work order are determined, searching a mapping relation between the preset work order type and the combination of the work order task and the initial assembly time according to the combination of the work order type and the work order task, and obtaining the initial assembly time of the first work order.
Step S120, the address type of the first position corresponding to the first work order is obtained, and the initial assembly time is corrected according to the address type, so that the corrected assembly time of the first work order is obtained.
Address types may include, among other things, village self-building houses in cities, business district individual households, residential communities, businesses, and the like.
It can be understood that, because for different address types (such as the self-building house of the village in the city and the shops of the business district), even if the same business is newly provided with a wide band, the required installation time is different, and for the self-building house, the complex environment needs to be overcome to turn over different buildings and various wires, the consumed time is more than that of the shops of the business district, therefore, the step also adopts the address type of the first position corresponding to the first work order to correct the predicted initial maintenance time by the work order type and the work order task.
In a specific implementation, a mapping relation table between different address types and additional time required by the assembly of the dimension for correction can be preset, the additional time is obtained by inquiring the mapping relation table, and the initial assembly time is corrected based on the additional time. The decision tree model can be trained by collecting the dimension loading records of the history under different address types, taking the address types as input variables, taking the additional time required by dimension loading under different address types as output variables, taking the difference value between the actual dimension loading time and the initial dimension loading time as supervision information, obtaining a trained decision tree model, inputting the trained decision tree model after determining the address type of the first position corresponding to the first work order, obtaining additional time for correction, and correcting the initial dimension loading time based on the additional time.
Step S130, a second position corresponding to the second work order is acquired, and the traffic time required from the first position to the second position is determined.
In a specific implementation, after the maintenance time of the first work order is determined, a second position corresponding to the second work order can be further obtained, and the traffic time required from the first position to the second position is determined. More specifically, the historical track database may be queried with the first location as a starting point and the second location as a destination, and the traffic time required from the first location to the second location may be determined based on the historical traffic time in the historical track database. The traffic time required from the first location to the second location may also be determined based on the path planning on the map for the first location and the second location.
And step S140, determining a dispatch strategy for the second work order according to the corrected maintenance time and the traffic time.
In the specific implementation, after the correction maintenance time and the traffic time are obtained, the total time required from the starting time point of the first work order to the second position where the second work order is located can be obtained based on the correction maintenance time and the traffic time, the arrival time point of the second position where the second work order is located can be determined, the arrival time point is compared with the starting time point of the second work order, and whether time overlapping exists or not is determined, so that whether the second work order needs to be dispatched to maintenance personnel close to the grid or not is determined.
In the order sending method, the initial assembly time of the first work order is predicted according to the work order type and the work order task of the first work order, then the initial assembly time is corrected according to the address type of the first position corresponding to the first work order, the corrected assembly time of the first work order is obtained, and the order sending strategy aiming at the second work order is further determined according to the corrected assembly time and the traffic time required from the first position to the second position. According to the method, the influence of the address type on the assembly and maintenance time is considered, when the assembly and maintenance time is determined, the initial assembly and maintenance time estimated for the first time is corrected based on the address type, so that the estimated assembly and maintenance time is more accurate, the possibility of whether the time between the first work order and the second work order is overlapped can be reasonably judged, the second work order is effectively distributed, and the problem that the second work order cannot be executed on time due to overtime of the execution time of the first work order is avoided.
In an exemplary embodiment, as shown in fig. 2, in step S120, the correcting the initial assembly time according to the address type to obtain the corrected assembly time of the first work order includes:
step S121, inquiring a mapping relation table between a preset address type and time according to the address type to obtain additional time required by the address type of the first position; the mapping relation table comprises mapping relations between a plurality of preset address types and additional time corresponding to each preset address type;
Step S122, the initial assembly time and the additional time are added to obtain the corrected assembly time of the first work order.
In a specific implementation, the time difference between the actual assembly time and the estimated initial assembly time under different address types in the historical assembly record can be collected to obtain additional time, and a mapping relation between the different address types and the required additional time is established to form a mapping relation table. After the address type of the first position corresponding to the first work order is obtained, the mapping relation table is inquired according to the address type, extra time required by the address type of the first position is obtained, and the corrected dimension time is obtained by adding the determined extra time on the basis of the initial dimension time.
For example, if the initial maintenance time of the first work order predicted according to the work order type and the work order task is 30 minutes, if the position of the first work order is located, and the address type is determined to be the self-building house of the urban village, the time required for line detection and maintenance is long compared with other types of places in consideration of the environment and routing complexity of the urban village, the mapping relation table needs to be queried, if the obtained additional time is 10 minutes, the additional time is superimposed for 10 minutes on the basis of 30 minutes, and the corrected maintenance time is 40 minutes.
It will be appreciated that not all address types need additional time to correct the initial assembly time, in one implementation, only a predetermined number of address types need to correct the initial assembly time, in this case, after the address type of the first location corresponding to the first work order is obtained, it may be determined whether the address type belongs to the predetermined address type, if so, the initial assembly time is corrected according to the address type, and if not, the correction may not be needed.
In this embodiment, by pre-constructing the mapping relation table between the address type and the time, after determining the address type of the first work order, the extra time required by the first work order can be quickly queried, so that the correction efficiency of the initial assembly time of the first work order is improved, and the efficiency of dispatching the first work order is further improved.
It can be understood that, since the maintenance personnel are familiar with the paths in the grids of the maintenance personnel, and the vehicles are all electric vehicles, most of the vehicles travel on the familiar paths or shortcuts, in theory, larger deviation exists between the traffic time predicted on the map according to the previous single address to the next single address and the traffic time actually required, and therefore, the application also provides a method for correcting the traditional traffic time prediction method according to the historical actual track and traffic time of the maintenance personnel, so as to improve the accuracy of estimating the required traffic time. Correspondingly, in an exemplary embodiment, as shown in fig. 3, in the step S130, determining the traffic time required from the first location to the second location includes:
Step S131, inquiring a history track database; the history track database stores the history traffic time among a plurality of positions in the process of processing work orders by the maintenance personnel;
in step S132, if there is a historical traffic time from the first location to the second location in the historical track database, the historical traffic time is determined as the traffic time required from the first location to the second location.
In a specific implementation, in the process of carrying out work orders by the maintenance personnel in a historical manner, the historical track information of the maintenance personnel between the corresponding positions of the work orders can be recorded, and the historical track information can comprise historical traffic time and historical driving tracks, so that a historical track database is formed. After determining the first position corresponding to the first work order and the second position corresponding to the second work order, taking the first position as a starting point, taking the second position as a destination, inquiring a historical track database, and determining the historical traffic time as the traffic time required from the first position to the second position if the historical traffic time from the first position to the second position exists in the historical track database.
In this embodiment, the accuracy of estimating the traffic time may be improved by querying the historical track database to determine the traffic time required from the first location to the second location.
In another exemplary embodiment, after querying the historical track database in the step S131, the method further includes:
step S133, if the historical traffic time from the first position to the second position does not exist in the historical track database, path planning is carried out according to the first position and the second position, and a target path is obtained;
in step S134, the estimated road condition information from the first location to the second location is added to the target path, and the traffic time from the first location to the second location is predicted.
In the specific implementation, if no historical traffic time from the first position to the second position exists in the historical track database, which indicates that the maintenance personnel does not walk through the path between the first position and the second position, theoretical optimal path planning can be performed on the map according to the first position and the second position, and the target path with the shortest distance is obtained. Further, according to the starting time point of the first work order and the predicted correction maintenance time, determining a time interval from the first position to the second position after the maintenance personnel completes the first work order, determining estimated road condition information from the first position to the second position according to historical road condition information from the first position to the second position in the time interval, adding the estimated road condition information in a scheme of a target path with the shortest determined distance, obtaining a scheme with the shortest time through the preset running speed of the maintenance personnel, and taking the obtained shortest time as the traffic time required from the first position to the second position.
In the embodiment, under the condition that the historical traffic time from the first position to the second position does not exist in the historical track database, path planning is performed according to the first position and the second position, and a target path is obtained; and further, adding estimated road condition information from the first position to the second position in the target path, and predicting the traffic time required from the first position to the second position. On the basis of static path planning, road condition information is added, so that the accuracy of the determined traffic time can be improved.
In an exemplary embodiment, after the step S131 queries the historical track database, the method further includes: if a plurality of historical traffic time from the first position to the second position exists in the historical track database, acquiring the average value of each historical traffic time; the average of each of the historical traffic times is determined as the traffic time required from the first location to the second location.
In a specific implementation, considering that a path from a first location to a second location may be traversed by a maintenance person multiple times, and the traffic time of each time may not be identical, in this case, when the historical track database is queried with the first location as a starting point and the second location as a destination, a plurality of historical traffic times from the first location to the second location may be queried, at this time, each historical traffic time may be processed by averaging, and the obtained average value is determined as the traffic time required from the first location to the second location.
In the embodiment, the average value of the plurality of historical traffic times is determined as the traffic time required from the first position to the second position, so that the determination of the traffic time under the condition that the plurality of historical traffic times from the first position to the second position exist in the historical track database is realized, and the uniqueness of the traffic time is ensured.
In an exemplary embodiment, in the step S140, determining the dispatch strategy for the second work order according to the corrected assembly time and the traffic time includes:
step S141, determining an arrival time point of a second position corresponding to a second work order after the first work order is processed according to the correction maintenance time and the traffic time;
step S142, a starting time point of the second work order is acquired, and a dispatch strategy for the second work order is determined based on the starting time point and the arrival time point.
In the specific implementation, the correction maintenance time and the traffic time can be added to obtain the total time required from the starting time point of the first work order to the second position corresponding to the second work order, and the total time is further added on the basis of the starting time point of the first work order, so that the reaching time point of the second position corresponding to the second work order after the first work order is processed can be obtained. And further carrying out time overlapping judgment on the starting time point and the arrival time point, and determining a dispatch strategy aiming at the second work order.
Further, in an exemplary embodiment, determining the dispatch strategy for the second work order based on the start time point and the arrival time point in step S142 includes: if the arrival time point is earlier than the starting time point, the second work order is distributed to the maintenance personnel of the first work order; and if the arrival time point is later than the starting time point, the second work order is distributed to other maintenance personnel.
In a specific implementation, if the arrival time point is earlier than the start time point, for example, the start time point of the second work order is 17:00, the arrival time point is 16:50, which indicates that the problem of time overlapping between the first work order and the second work order does not exist, namely, the same maintenance personnel can process the second work order on time after completing the first work order, and in this case, the second work order can be distributed to the maintenance personnel of the first work order. Conversely, if the arrival time point is later than the start time point of the second work order, for example, the start time point of the second work order is 17:00, the arrival time point is 17:10, the arrival time point is 10 minutes later than the starting time point of the second work order, and the problem of time overlap exists between the first work order and the second work order is indicated, namely, the same maintenance personnel cannot process the second work order on time after completing the first work order, and in this case, the second work order can be distributed to other maintenance personnel adjacent to the grid to rob the order.
In the above embodiment, the arrival time point of the second position corresponding to the second work order is determined after the first work order is processed according to the correction maintenance time and the traffic time, and whether the time between the first work order and the second work order is overlapped or not is further judged by comparing the starting time point and the arrival time point, so that the second work order can be effectively distributed, and the problem that the second work order cannot be executed on time due to overtime of the execution time of the first work order is avoided.
In one embodiment, to facilitate understanding of embodiments of the present application by those skilled in the art, the inventive concept will be described below with reference to the flow chart shown in fig. 4 and a specific embodiment.
Referring to fig. 4, a complete flow chart of a dispatch method according to an embodiment includes the following steps:
step S401, predicting the initial assembly time of the first work order according to the work order type and the work order task of the first work order;
step S402, obtaining an address type of a first position corresponding to a first work order, and inquiring a mapping relation table between a preset address type and time according to the address type to obtain additional time required by the address type of the first position;
Step S403, adding the initial assembly time and the additional time to obtain the correction assembly time of the first work order;
step S404, obtaining a second position corresponding to a second work order, and inquiring a historical track database according to the first position and the second position;
step S405, if the historical traffic time from the first position to the second position exists in the historical track database, determining the historical traffic time as the traffic time required from the first position to the second position;
step S406, if the historical traffic time from the first position to the second position does not exist in the historical track database, path planning is carried out according to the first position and the second position, and a target path is obtained;
step S407, adding estimated road condition information from the first position to the second position in the target path, and predicting the traffic time required from the first position to the second position;
step S408, determining an arrival time point of a second position corresponding to the second work order after the first work order is processed according to the correction maintenance time and the traffic time;
step S409, obtaining a starting time point of the second work order, if the reaching time point is earlier than the starting time point, distributing the second work order to the maintenance personnel of the first work order;
In step S410, if the arrival time point is later than the start time point, the second work order is dispatched to other maintenance personnel.
Illustrating:
if 7 work orders are shared in the grid K of the year 2023, the month 4 and the day 23 according to the reservation of the user, the system needs to make a check and arrangement on the 7 work orders before 7 hours in the morning of the year 4, and if the predicted construction periods of the 7 work orders do not overlap, the 7 work orders in the grid K are distributed to the corresponding maintenance staff E of the grid; if the predicted construction period of a certain 2 worksheets has a certain possibility of overlapping in time, the worksheets with later time are transferred to the maintenance personnel of other adjacent grids for rescuing.
Specifically, if the a bill is 16:30, the maintenance, giga broadband, the B bill is 17:30, the new installation, the smart home business, when checking whether there is a time overlap in the construction period between the installation and maintenance bills, firstly, the installation and maintenance time required for the job bill a is estimated according to the type of the job bill (installation/maintenance) and the job bill task (smart home business/giga broadband, etc.), if it is 30 minutes. The destination of the work order A is positioned, the address type of the work order A is judged, if the work order A is a self-built house of a village in a city, the time required for line detection and maintenance is longer than that of other types of places in consideration of the environment and wiring complexity of the village in the city, and the additional time of 10 minutes is added on the basis of 30 minutes, namely, the time required for the maintenance of the work order A is 40 minutes.
Then, taking the A list address as a starting point and the B list address as a destination, searching whether a path actually travelled by the maintenance personnel from the A list position to the B list position and the actually generated traffic time exist in the past in a history track database. If the time is greater than the starting time of the form B by 17:30, the construction period time of the form A and the form B is not likely to overlap, and the form B can be distributed to the same assembler E of the form A if the time is greater than the starting time of the form B by 58 minutes, and if the time is greater than the starting time of the form B by 17:28, the time is greater than the starting time of the form A by 17:28. On the contrary, if no record is actually passed by the maintenance personnel from the position of the A list to the position of the B list in the history track database, carrying out theoretical optimal path planning and calculating for the shortest time on a map according to the position of the A list and the position of the B list, and as the system is not familiar with the positions of the maintenance personnel in the grid of the system, the maintenance personnel cannot walk a small path or a shortcut, if the calculated traffic time is 23 minutes, 40 minutes required by maintenance are added, and the total time is 63 minutes, and the arrival time point is: 17:33, which is 17:30 later than the starting time point of the B form, the user contract time is not reached, namely the possibility that the construction time of the A form and the B form are overlapped exists, and the B form can be transferred to other adjacent maintenance personnel of the grid for robbery and processing.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a dispatch device for realizing the dispatch method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in the embodiment of one or more dispatch devices provided below may be referred to the limitation of the dispatch method hereinabove, and will not be repeated herein.
In one embodiment, as shown in fig. 5, there is provided a dispatch device, including: a prediction module 510, a correction module 520, a determination module 530, and a dispatch module 540, wherein:
the prediction module 510 is configured to predict an initial assembly time of the first work order according to the work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the correction module 520 is configured to obtain an address type of a first location corresponding to the first work order, and correct the initial assembly time according to the address type to obtain a corrected assembly time of the first work order;
a determining module 530, configured to obtain a second position corresponding to the second work order, and determine a traffic time required from the first position to the second position;
and the dispatch module 540 is configured to determine a dispatch policy for the second work order according to the corrected assembly time and the corrected traffic time.
In one embodiment, the correction module 520 is further configured to query a mapping relationship table between a preset address type and time according to the address type, to obtain additional time required by the address type of the first location; the mapping relation table comprises mapping relations between a plurality of preset address types and additional time corresponding to each preset address type; and adding the initial assembly time and the additional time to obtain the correction assembly time of the first work order.
In one embodiment, the determining module 530 is further configured to query a historical track database; the history track database stores the history traffic time among a plurality of positions in the process of processing work orders by the maintenance personnel; if there is a historical traffic time from the first location to the second location in the historical track database, the historical traffic time is determined as the traffic time required from the first location to the second location.
In one embodiment, the determining module 530 is further configured to, if there is no historical traffic time from the first location to the second location in the historical track database, perform path planning according to the first location and the second location to obtain a target path; and adding estimated road condition information from the first position to the second position in the target path, and predicting the traffic time required from the first position to the second position.
In one embodiment, the determining module 530 is further configured to obtain a mean value of each of the historical traffic times if there are a plurality of historical traffic times from the first location to the second location in the historical track database; the average of each of the historical traffic times is determined as the traffic time required from the first location to the second location.
In one embodiment, the dispatch module 540 is further configured to determine, according to the corrected maintenance time and the traffic time, an arrival time point for reaching a second position corresponding to the second work order after the first work order is processed; and acquiring a starting time point of the second work order, and determining a dispatch strategy for the second work order based on the starting time point and the arrival time point.
In one embodiment, the dispatch module 540 is further configured to dispatch the second work order to the maintenance personnel of the first work order if the arrival time point is earlier than the start time point; and if the arrival time point is later than the starting time point, the second work order is distributed to other maintenance personnel.
The modules in the dispatch device may be implemented in whole or in part by software, hardware, or a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a terminal, and the internal structure of which may be as shown in fig. 6. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program when executed by a processor implements a dispatch method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in FIG. 6 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer device to which the present inventive arrangements may be applied, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a computer device is provided comprising a memory and a processor, the memory having stored therein a computer program, the processor when executing the computer program performing the steps of:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In an embodiment, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, which when executed by a processor, performs the steps of:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.
In one embodiment, a computer program product is provided comprising a computer program which, when executed by a processor, performs the steps of:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.
It should be noted that, the user information (including but not limited to user equipment information, user personal information, etc.) and the data (including but not limited to data for analysis, stored data, presented data, etc.) related to the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data need to comply with the related laws and regulations and standards of the related country and region.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, or the like, but is not limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.
Claims (11)
1. A dispatch method, the method comprising:
predicting the initial assembly time of a first work order according to work order information of the first work order; the work order information at least comprises a work order type and a work order task;
the address type of a first position corresponding to the first work order is obtained, the initial dimension loading time is corrected according to the address type, and the corrected dimension loading time of the first work order is obtained;
Acquiring a second position corresponding to a second work order, and determining traffic time required from the first position to the second position;
and determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
2. The method of claim 1, wherein correcting the initial setup time based on the address type results in a corrected setup time for the first work order, comprising:
inquiring a mapping relation table between a preset address type and time according to the address type to obtain additional time required by the address type of the first position; the mapping relation table comprises mapping relations between a plurality of preset address types and additional time corresponding to each preset address type;
and adding the initial assembly time and the additional time to obtain the correction assembly time of the first work order.
3. The method of claim 1, wherein the determining the traffic time required from the first location to the second location comprises:
querying a historical track database; the history track database stores the history traffic time among a plurality of positions in the process of processing work orders by the maintenance personnel;
If there is a historical traffic time from the first location to the second location in the historical track database, determining the historical traffic time as the traffic time required from the first location to the second location.
4. The method of claim 3, wherein after querying the historical track database, further comprising:
if the historical traffic time from the first position to the second position does not exist in the historical track database, path planning is carried out according to the first position and the second position, and a target path is obtained;
and adding estimated road condition information from the first position to the second position in the target path, and predicting the traffic time required from the first position to the second position.
5. A method according to claim 3, characterized in that the method further comprises:
if a plurality of historical traffic time from the first position to the second position exists in the historical track database, acquiring the average value of each historical traffic time;
and determining the average value of the historical traffic time as the traffic time required from the first position to the second position.
6. The method of claim 1, wherein the determining a dispatch strategy for the second work order based on the corrected assembly time and the traffic time comprises:
determining an arrival time point of a second position corresponding to the second work order after the first work order is processed according to the correction maintenance time and the traffic time;
acquiring a starting time point of the second work order, and determining an order sending policy for the second work order based on the starting time point and the arrival time point.
7. The method of claim 6, wherein the determining a dispatch strategy for the second work order based on the start time point and the arrival time point comprises:
if the arrival time point is earlier than the starting time point, the second work order is distributed to the maintenance personnel of the first work order;
and if the arrival time point is later than the starting time point, the second work order is distributed to other maintenance personnel.
8. A delivery apparatus, the apparatus comprising:
the prediction module is used for predicting the initial assembly time of the first work order according to the work order information of the first work order; the work order information at least comprises a work order type and a work order task;
The correction module is used for acquiring the address type of the first position corresponding to the first work order, correcting the initial assembly time according to the address type, and obtaining the corrected assembly time of the first work order;
the determining module is used for acquiring a second position corresponding to a second work order and determining traffic time required from the first position to the second position;
and the dispatch module is used for determining a dispatch strategy aiming at the second work order according to the correction maintenance time and the traffic time.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the dispatch method of any one of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the dispatch method of any one of claims 1 to 7.
11. A computer program product comprising a computer program, characterized in that the computer program, when executed by a processor, implements the steps of the dispatch method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310827327.5A CN116934010A (en) | 2023-07-06 | 2023-07-06 | Order sending method, apparatus, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310827327.5A CN116934010A (en) | 2023-07-06 | 2023-07-06 | Order sending method, apparatus, computer device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116934010A true CN116934010A (en) | 2023-10-24 |
Family
ID=88383583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310827327.5A Pending CN116934010A (en) | 2023-07-06 | 2023-07-06 | Order sending method, apparatus, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116934010A (en) |
-
2023
- 2023-07-06 CN CN202310827327.5A patent/CN116934010A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10769950B1 (en) | System and method for identifying available parking locations | |
| US10791419B2 (en) | Determining a significant user location for providing location-based services | |
| CN110264023B (en) | Shared vehicle management server and non-transitory storage medium storing shared vehicle management program | |
| US10473475B2 (en) | Method and apparatus for determining a location of a point of interest | |
| Wang et al. | A big data approach for smart transportation management on bus network | |
| US20180225796A1 (en) | Resource Allocation in a Network System | |
| CN107230046A (en) | The reminding method and mobile terminal of a kind of trip information | |
| CN109299194A (en) | Multi-edition data memory management method and device, electronic equipment, storage medium | |
| Alajali et al. | On-street car parking prediction in smart city: A multi-source data analysis in sensor-cloud environment | |
| CN117217380A (en) | Parking lot vacant parking space prediction method and device, electronic equipment and storage medium | |
| US20230152108A1 (en) | Emission-optimized vehicle route and charging | |
| Wang et al. | Towards accessible shared autonomous electric mobility with dynamic deadlines | |
| CN112669604B (en) | Urban traffic scheduling method and device | |
| CN116934010A (en) | Order sending method, apparatus, computer device and storage medium | |
| WO2020254418A1 (en) | System and method for populating a database with occupancy data of parking facilities | |
| CN103870562A (en) | Regulation verifying method and system in intelligent building system | |
| CN103118156A (en) | Alarm clock setting method and corresponding device | |
| CN113554198B (en) | Data processing system of receiving and sending machine based on block chain | |
| He et al. | Beyond rebalancing: Crowd-sourcing and geo-fencing for shared-mobility systems | |
| CN104517440A (en) | Traffic data processing method and apparatus | |
| CN111428928B (en) | Path planning method, device, medium and computer equipment | |
| CN114187775A (en) | Parking space recommendation method, device and equipment based on big data and storage medium | |
| CN113824590A (en) | Method for predicting problem of micro service network, computer device and storage medium | |
| CN112215523A (en) | Method and device for analyzing capability dependency relationship in complex system architecture | |
| CN117474191B (en) | GIS (geographic information system) inspection management method based on intelligent water meter, internet of things system and device |
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 |