CN116109431A

CN116109431A - Patch detail generation method and device and electronic equipment

Info

Publication number: CN116109431A
Application number: CN202310094997.0A
Authority: CN
Inventors: 张婷婷
Original assignee: Shanghai Shen Xue Supply Chain Management Co ltd
Current assignee: Shanghai Shen Xue Supply Chain Management Co ltd
Priority date: 2023-02-01
Filing date: 2023-02-01
Publication date: 2023-05-12

Abstract

The application relates to a subsidy detail generation method, a subsidy detail generation device and electronic equipment, and relates to the technical field of salary detail generation, wherein the method comprises the following steps: acquiring a plurality of subsidy calculation rules corresponding to each task list according to the task list data corresponding to each task list and the related data generated by a driver in the transportation process of each task list; taking the patch calculation rule with the highest priority as a final patch calculation rule according to the priorities of the patch calculation rules; calculating related data generated by a driver in each task sheet transportation process by utilizing a final subsidy calculation rule to obtain a first calculation result; and generating a plurality of task sheet patch details according to the first calculation results of the plurality of task sheets. The patch detail calculation method has the effect of improving patch detail calculation efficiency.

Description

Patch detail generation method and device and electronic equipment

Technical Field

The application relates to the technical field of generating payroll details, in particular to a subsidy detail generation method, a subsidy detail generation device and electronic equipment.

Background

On the premise of rapid development of the current express industry, the express business is rapidly increased, meanwhile, the number of transport driver practitioners is rapidly increased, and driver subsidy is also increasingly popularized, so that on-line treatment of the driver subsidy detail line has become a necessary trend. In general, in the on-line processing process of the driver compensation patch details, an algorithm is required to calculate the driver compensation patch details, wherein the driver compensation patch details comprise two calculation scenes of road patches and oil patches, the road patches comprise path patches and difficult path patches, and the oil patches comprise oil consumption patches. The calculation codes in the existing calculation driver compensation subsidy detail algorithm are generally integral, the matching rules are numerous, each time of matching is performed only through one matching condition, the matching process is nested layer by layer, and each time of matching needs to traverse the matching conditions of all layers to obtain the target calculation rules.

Because the target calculation rule is obtained through a plurality of matching processes each time, a large number of matching processes are needed in operation to obtain the target calculation rule, the matching process is too long in the process, the calculation time is prolonged, and the algorithm calculation efficiency is low.

Therefore, the existing calculation method for calculating the compensation and subsidy details of the driver has the problem of low calculation efficiency.

Disclosure of Invention

In order to improve the calculation efficiency, the application provides a patch detail generation method, a patch detail generation device and electronic equipment, wherein the specific scheme is as follows:

in a first aspect, the present application provides a patch detail generating method, which adopts the following technical scheme:

a patch detail generation method comprises the following steps:

acquiring task sheet data corresponding to each of a plurality of task sheets and related data generated by a driver in the transportation process of each task sheet; the task data at least comprises: specific type data, driver information and vehicle information, wherein the specific type data comprises a number of license plates, trailer numbers, vehicle types, lines and stations;

aiming at each task list, acquiring a plurality of subsidy calculation rules according to the specific type data, the driver information and the vehicle information through a unique thread corresponding to each task list, wherein each subsidy calculation rule at least comprises a rate for calculating oil compensation and road compensation;

Aiming at each task order, taking the patch calculation rule with the highest priority as a final patch calculation rule according to the priorities of a plurality of patch calculation rules;

calculating related data generated by a driver in the transportation process of each task sheet based on the final subsidy calculation rule aiming at each task sheet to obtain a first calculation result;

and generating patch details corresponding to the task lists according to the first calculation results corresponding to the task lists.

By adopting the technical scheme, the task list data corresponding to each of the plurality of task lists and the related data generated by a driver in the transportation process of each task list are acquired, and the matching rule is dropped on the dimension of the task list, so that a data foundation is laid for acquiring the patch detail taking the task list as a unit; in each thread, according to specific type data, driver information and vehicle information in the task sheet data, a plurality of subsidy calculation rules are obtained through matching, so that the matching efficiency can be greatly improved; in order to ensure the uniqueness of the calculation result, only one final patch calculation rule is needed for final calculation, so that according to the priority of a plurality of patch calculation rules, one most suitable patch calculation rule is selected from a plurality of patch calculation rules obtained by matching to serve as the final patch calculation rule; according to the obtained final subsidy calculation rule, calculating the first calculation result of each task sheet based on the related data generated by the driver in the transportation process of each task sheet by the final subsidy calculation rule; and finally, generating patch details of all the task sheets according to the first calculation results of the plurality of task sheets, directly acquiring the patch details with the task sheets as units, wherein the acquired patch detail information is clear and easy to see, and saving time for subsequent work. Therefore, the technical scheme can improve the calculation efficiency.

The present application may be further configured in a preferred example to:

before acquiring a plurality of subsidy calculation rules according to the specific type data, the driver information and the vehicle information, the method further comprises the following steps:

aiming at each task list, acquiring a plurality of large-range subsidy calculation rules corresponding to each task list according to driver information and vehicle information;

correspondingly, for each task sheet, obtaining further configuration of a plurality of subsidy calculation rules according to specific type data, driver information and vehicle information through a unique thread corresponding to each task sheet, wherein the further configuration comprises the following steps:

and aiming at each task sheet, acquiring a plurality of subsidy calculation rules according to the specific type data, the driver information, the vehicle information and the plurality of large-range subsidy calculation rules through a unique thread corresponding to each task sheet.

By adopting the technical scheme, the large-range subsidy calculation rule is screened from the rule information in the database, and then a plurality of subsidy calculation rules suitable for the current task list are screened from the large-range subsidy calculation rule, so that the final subsidy calculation rule is prevented from being directly obtained from thousands of rule information in the database, and the long time is consumed in the matching process.

The present application may be further configured in a preferred example to: the relevant data generated by the driver during each job ticket transportation process comprises: task actual mileage or task actual times or task actual use, task actual oil consumption data, OA application oil supplement data, driver number,

the calculating the related data generated by the driver in each task sheet transportation process based on the final subsidy calculation rule to obtain a first calculation result comprises the following steps:

and calculating the actual mileage of the task or the actual times of the task or the actual time of the task based on the final subsidy calculation rule to obtain a first calculation result.

Accordingly, the present application may be further configured in a preferred example to:

generating a plurality of task sheet patch details according to a first calculation result of the plurality of task sheets, including:

obtaining a second calculation result of each task sheet according to the data of the line, the first calculation result of each task sheet, the actual oil consumption data of the task and the OA application oil compensation data, wherein the data of the line comprises a line name and a line compensation amount corresponding to the line name;

obtaining a final calculation result of each task list according to the second calculation result of each task list and the corresponding number of drivers;

And obtaining the patch details of the plurality of task sheets according to the final calculation results of the plurality of task sheets.

By adopting the technical scheme, after the road patch and the oil patch of the basis are determined by the first calculation result, the final calculation result of each task sheet can be finally determined by combining the actual oil consumption data of the task, the OA application oil patch data and the number of drivers, so that the obtained task sheet patch detail is more in line with the actual situation, and the accuracy of the finally generated task sheet patch detail is improved.

The present application may be further configured in a preferred example to:

before the plurality of subsidy calculation rules are acquired according to the specific type data, the driver information and the vehicle information by the unique thread corresponding to each task sheet aiming at each task sheet, the method further comprises the following steps:

distributing a plurality of idle threads to a plurality of task sheets in a plurality of task sheets by using a thread pool, wherein each task sheet corresponds to a unique thread;

if the task list of the unallocated thread exists, the task list of the unallocated thread is put into a buffer queue to wait for an idle thread.

By adopting the technical scheme, the task list can be calculated and allocated by using the set thread pool, and a plurality of task lists waiting for processing are placed by using the set buffer queue, so that the blocking condition caused by the fact that all task lists enter the thread pool for processing is effectively prevented.

The present application may be further configured in a preferred example to:

the patch detail generation method further comprises the following steps:

judging whether the idle time of the idle thread in the thread pool is longer than the idle time allowed by the thread pool maintenance thread;

if yes, closing the idle thread with the idle time longer than the idle time allowed by the thread pool maintenance thread,

wherein the idle time allowed by the thread pool maintenance thread is set based on a preset use frequency of the thread pool.

By adopting the technical scheme, after the idle time of the idle thread in the thread pool is longer than the idle time allowed by the thread pool maintenance thread, the idle thread with the idle time longer than the idle time allowed by the thread pool maintenance thread can be closed, so that the thread energy consumption is reduced.

The present application may be further configured in a preferred example to:

the patch detail generation method under multithreading further comprises the following steps:

and setting the maximum number of thread pool maintenance threads according to the reference calculation time of all the task sheets, the magnitude of data to be calculated, the CPU performance and the acceptable calculation time, wherein the data to be calculated comprises the task sheet data corresponding to each of a plurality of task sheets and the related data generated by a driver in the transportation process of each task sheet, and the reference calculation time of each task sheet represents the time spent by running the task sheets with the same magnitude in the past.

By adopting the technical scheme, the maximum number of maintenance threads of the thread pool can be comprehensively determined by combining the reference calculation time of all task sheets, the magnitude of data to be calculated, the CPU performance and the acceptable calculation time, and the set maximum number of maintenance threads is more accurate.

The present application may be further configured in a preferred example to:

aiming at each task list, a plurality of subsidy calculation rules are obtained according to specific type data, driver information and vehicle information through a unique thread corresponding to each task list, and the method comprises the following steps:

transmitting the task list data corresponding to each of the plurality of task lists and the related data generated by a driver in the transportation process of each task list to each thread by utilizing the Synchronized and the thread;

and aiming at each task list, acquiring a plurality of subsidy calculation rules corresponding to each task list through a unique thread corresponding to each task list according to the specific type data, the driver information and the vehicle information transmitted to each thread.

By adopting the technical scheme, the synchronous and thread mechanisms can be utilized, so that only one thread can operate the data in the variable at the same time; meanwhile, the data in the variable of the thread pool is copied independently in each thread, so that data confusion caused by cross-layer transfer is avoided.

The present application may be further configured in a preferred example to:

the patch detail generation method further includes, when dealing with the newly added specific type data,:

acquiring newly-added specific type data request information, wherein the newly-added specific type data request information comprises newly-added specific type data and rules corresponding to the newly-added specific type data, and the rules corresponding to the newly-added specific type data comprise subsidy calculation rules and priorities corresponding to the subsidy calculation rules;

updating the subsidy calculation rule set corresponding to the specific type data according to the newly added specific type data request information; wherein the patch calculation rule set is used for determining a corresponding patch calculation rule based on a certain specific type of data.

By adopting the technical scheme, the corresponding subsidy calculation rule set can be updated based on the newly added specific type data request information, so that the algorithm has expansibility and high flexibility.

In a second aspect, the present application provides a patch detail generating device, which adopts the following technical scheme:

a patch detail generation device comprising:

the data acquisition module is used for acquiring task sheet data corresponding to each of the plurality of task sheets and related data generated by a driver in the transportation process of each task sheet; the task data at least comprises: specific type data, driver information and vehicle information, wherein the specific type data comprises a number of license plates, trailer numbers, vehicle types, lines and stations;

The calculation rule matching module is used for obtaining a plurality of subsidy calculation rules according to the specific type data, the driver information and the vehicle information by a unique thread corresponding to each task list aiming at each task list, wherein each subsidy calculation rule at least comprises a rate for calculating oil compensation and road compensation;

the calculation rule determining module is used for taking the patch calculation rule with the highest priority as a final patch calculation rule according to the priorities of the patch calculation rules for each task order;

the first calculation result acquisition module is used for calculating related data generated by a driver in the transportation process of each task sheet based on the final subsidy calculation rule aiming at each task sheet to obtain a first calculation result;

the task list patch detail generation module is used for generating patch details corresponding to the task lists according to the first calculation results corresponding to the task lists.

In a third aspect, the present application provides an intelligent terminal or patch detail generating device, which adopts the following technical scheme:

at least one processor;

a memory;

at least one application program, wherein the at least one application program is stored in the memory and configured to be executed by the at least one processor, the at least one application program configured to: the patch detail generation method of any one of the above is performed.

In a fourth aspect, the present application provides a computer readable storage medium, which adopts the following technical scheme:

a computer readable storage medium having stored thereon a computer program which, when executed in a computer, causes the computer to perform the method of any of the first aspects.

In summary, the present application includes at least one of the following beneficial technical effects:

1. acquiring task sheet data corresponding to each of a plurality of task sheets and related data generated by a driver in the transportation process of each task sheet, and setting a matching rule on the dimension of the task sheet to lay a data foundation for acquiring patch details with the task sheet as a unit; in each thread, according to specific type data, driver information and vehicle information in the task sheet data, a plurality of subsidy calculation rules are obtained through matching, so that the matching efficiency can be greatly improved; in order to ensure the uniqueness of the calculation result, only one final patch calculation rule is needed for final calculation, so that according to the priority of a plurality of patch calculation rules, one most suitable patch calculation rule is selected from a plurality of patch calculation rules obtained by matching to serve as the final patch calculation rule; according to the obtained final subsidy calculation rule, calculating the first calculation result of each task sheet based on the related data generated by the driver in the transportation process of each task sheet by the final subsidy calculation rule; and finally, generating patch details of all the task sheets according to the first calculation results of the plurality of task sheets, directly acquiring the patch details with the task sheets as units, wherein the acquired patch detail information is clear and easy to see, and saving time for subsequent work. Therefore, the technical scheme can improve the calculation efficiency.

2. After the road patch and the oil patch of the foundation are determined by the first calculation result, the final calculation result of each task sheet is finally determined by combining the actual oil consumption data of the task, the OA application oil patch data and the number of drivers, so that the obtained task sheet patch details are more in line with the actual situation, and the accuracy of the finally generated task sheet patch details is improved.

3. And calculating and distributing task sheets by using the set thread pool, and placing a plurality of task sheets waiting for processing by using the set buffer queue, thereby effectively preventing the blocking condition caused by the fact that all the task sheets enter the thread pool for processing.

Drawings

Fig. 1 is a flow chart of a patch detail generation method according to an embodiment of the present application.

Fig. 2 is a schematic structural diagram of a patch detail generation device according to an embodiment of the present application.

Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

The present application is described in further detail below in conjunction with fig. 1-3 of the drawings.

The present embodiment is merely illustrative of the present application and is not intended to be limiting, and those skilled in the art, after having read the present specification, may make modifications to the present embodiment without creative contribution as required, but is protected by patent laws within the scope of the present application.

For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely 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 can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.

In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In this context, unless otherwise specified, the term "/" generally indicates that the associated object is an "or" relationship.

Specifically, the embodiment of the application provides a patch detail generation method, which is executed by electronic equipment, wherein the electronic equipment can be a server or terminal equipment, and the server can be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server for providing cloud computing service. The terminal device may be a smart phone, a tablet computer, a notebook computer, a desktop computer, or the like, but is not limited thereto, and the terminal device and the server may be directly or indirectly connected through a wired or wireless communication manner, which is not limited herein, and as shown in fig. 1, the method includes steps S101, S102, S103, S104, and S105, where:

Step S101: acquiring task sheet data corresponding to each of a plurality of task sheets and related data generated by a driver in the transportation process of each task sheet; the task data at least comprises: specific type data, driver information and vehicle information, wherein the specific type data at least comprises a number of license plates, train numbers, vehicle types, lines and stations.

The task list comprises transport task lists, and the transport tasks of transport companies are continuous, so that the task list to be calculated is a plurality of task lists, and the task list data corresponding to each task list are independent data; the task list data corresponding to each task list at least comprises: specific type data, driver information, vehicle information; generally, during the transportation task, the transportation vehicle will not change, so the vehicle information is unique, and at least includes: in the transportation industry, the transportation route is divided into short distance and long distance, and for the driver information, the driver information may include multi-person information when the transportation route belongs to the long distance, and the driver information may include single-person information when the transportation route belongs to the short distance transportation; when the appropriate calculation rule is selected to calculate the patch in the follow-up process, if the selection is performed according to all data of the task list, the selection process is too complicated, and even the generation efficiency of the whole patch detail is reduced due to the complicated process, so that the specific type of data can be selected for selecting the appropriate calculation rule to calculate the patch detail.

The relevant data generated by the driver during each job ticket transportation includes, but is not limited to: the actual mileage of the task or the actual number of times of the task or the actual time of the task, the number of drivers, the actual oil consumption data of the task and the OA application oil supplement data.

Step S102: and aiming at each task list, acquiring a plurality of subsidy calculation rules according to specific type data, driver information and vehicle information through a unique thread corresponding to each task list, wherein each subsidy calculation rule at least comprises a subsidy amount or oil rate for calculating oil compensation and road compensation.

When the specific type data is matched with the patch calculation rule, the specific type data can not be matched with the corresponding patch calculation rule, or the specific type data is matched with a plurality of patch calculation rules, wherein when the specific type data is matched with a plurality of patch calculation rules, the screening process of the patch calculation rule can be screened according to the pre-written priority.

In the embodiment of the application, since a plurality of task lists are processed at the same time, a thread pool can be introduced to process the plurality of task lists by using multithreading, wherein each thread corresponds to a unique task list, and after the unique task list in each thread is processed, the next task list can enter an idle thread to continue processing until all task lists are processed.

In the embodiment of the application, the subsidy calculation rule may be stored in a database in the form of rule information, and each piece of rule information includes a driver information name, a vehicle information name, a specific type of information name, and a rate corresponding to the subsidy amount or the oil amount, where the driver information name, the vehicle information name, and the specific type of information name in the rule information are matching conditions for matching the subsidy calculation rule. Specifically, the driver information name, the vehicle information name and the specific type information name in the task sheet data are utilized to be matched with rule information in a database, if the driver information name, the vehicle information name and the specific type information name in the task sheet data are identical with the matching conditions in the rule information, the matching is successful, and after the matching is successful, the rule information which is successfully matched is used as a subsidy calculation rule; however, since there are one or more cases in each of the task sheets in which the driver information and the specific type information exist, the patch calculation rule obtained by each of the task sheets is also not unique, and there are one or more cases in which each of the task sheets passes through the matching process, that is, a plurality of patch calculation rules can be obtained.

For example, when the specific type of data includes: when the license plate number, the trailer number and the vehicle type are used, the correspondingly obtained subsidy calculation rules are the first subsidy calculation rule corresponding to the license plate number of the driver information of the task sheet and the vehicle information of the task sheet, the second subsidy calculation rule corresponding to the trailer number and the third subsidy calculation rule corresponding to the vehicle type; if the specific type of data further comprises: lines and sites, then the patch calculation rules should also include: the method comprises the steps of aiming at the driver information of a task sheet, the fourth subsidy calculation rule corresponding to the line of the vehicle information of the task sheet and the fifth subsidy calculation rule corresponding to the site. It can be appreciated that, because specific type data of the task sheet data may need to be uploaded by a user, the types of specific type data and the types of specific type data of different task sheet data may be different, and thus, the embodiment of the application can determine the corresponding patch calculation rule based on the actual specific type data according to the actual situation.

Compared with the related art, the method and the device for processing the target calculation rules directly screen the subsidy calculation rules by applying three types of information, namely the specific type data, the driver information and the vehicle information, the target calculation rules can be obtained only through one matching condition in each matching process, the matching time is overlong, the calculation time is prolonged, and even the calculation efficiency is low due to the fact that the target calculation rules can be obtained only through the matching condition in all layers in the whole matching process.

Notably, the embodiment of the application can provide a plurality of threads to confirm patch calculation rules for a plurality of task sheets. The number of the multiple threads can be set according to actual conditions, however, when the number of the threads is smaller than the number of the task sheets, after the threads are distributed, one or more task sheets distributed by each thread can be processed by the next task sheet only after the execution of the previous task sheet is completed, and when a certain thread distributes the multiple task sheets, the task sheet processing sequence can be determined based on the time sequence of the acquired task sheets, and the task sheet processing sequence can also be determined based on the processing priority of the preset task sheets.

Step S103: and aiming at each task order, taking the patch calculation rule with the highest priority as a final patch calculation rule according to the priorities of the patch calculation rules.

Because each task list can obtain a plurality of patch calculation rules through the matching process, but only one patch calculation rule can be used when each task list calculates patches, for each task list, one most suitable patch rule can be selected from the obtained plurality of patch calculation rules to serve as a final patch rule; the priority of each patch calculation rule is preset, and the final patch calculation rule is directly called when the final patch calculation rule is selected based on the priority of each patch calculation rule.

Specifically, for each task sheet, according to the priority of a given patch calculation rule, the obtained patch calculation rules are in one-to-one correspondence with the given priority, and the patch calculation rule with the highest priority in the patch calculation rules is selected as the final patch calculation rule.

If the priority is screened, a patch calculation rule with the highest priority still remains more than one, in an achievable mode, a warning window can be popped up to terminal equipment corresponding to a rule information maintainer to prompt the rule information maintainer, a plurality of patch calculation rules with the same priority exist in the rule information, the priority of the patch calculation rules can be rearranged, further rearrangement information sent by the terminal equipment corresponding to the maintainer can be obtained to redetermine the highest priority, and finally determined highest priority sent by the terminal equipment corresponding to the maintainer can be obtained.

According to the method and the device, the final calculation rule is screened out through the established priority, so that the situation that after a plurality of obtained subsidy calculation rules are directly used for calculation of each task order to obtain a plurality of calculation results, the most suitable calculation result is selected from a plurality of different calculation results is avoided, a plurality of unnecessary calculation processes are reduced, meanwhile, the reduction of the accuracy of the calculation result caused by confusion of the calculation result is reduced, the calculation time is saved, and the calculation efficiency of an algorithm is improved.

Step S104: and calculating related data generated by a driver in the transportation process of each task sheet based on the final subsidy calculation rule aiming at each task sheet to obtain a first calculation result.

It can be appreciated that in the embodiment of the present application, the oil patch and the road patch can be calculated as the first calculation result by using the final patch calculation rule based on the related data generated by the driver during each job ticket transportation.

Specifically, in some possible cases, the relevant data generated by the driver during each task sheet transportation includes at least: task actual mileage or task actual times or task actual use time; the first calculation result at least comprises basic oil compensation and basic road compensation; wherein, the basic oil compensation refers to the oil consumption for completing each transportation task, and the basic road compensation refers to the basic compensation amount for completing each transportation task; the calculation of the basic oil patch and the basic road patch is completed by using the rate of the final patch calculation rule, and the setting of the patch calculation rule can comprise:

determining a basic road patch and a basic oil patch based on patch calculation rules, wherein:

when calculating the basic road compensation, the unit of the rate at least can comprise the compensation amount per kilometer, or the compensation amount per transportation task, or the compensation amount per daily transportation task;

If the rate unit is the subsidy amount per kilometer, the basic road compensation=rate is the actual driving mileage of the task;

if the rate unit is the subsidy amount of each transportation task, the basic road compensation=rate is the actual running times of the task;

if the rate unit is the amount of the daily transportation task subsidy, the basic road subsidy=rate is the actual running time of the task;

when calculating the basic oil compensation, the unit of the rate comprises the oil compensation amount per kilometer, or the oil compensation amount per transportation task, or the oil compensation amount per daily transportation task;

if the rate unit is the oil quantity of the patch per kilometer, the basic oil patch=rate is the actual driving mileage of the task;

if the rate unit is the oil amount of the patch of each transportation task, the basic oil patch=rate is the actual running times of the task;

if the rate unit is the amount of the oil patch for the daily transportation task, the basic oil patch=rate is the actual running time of the task;

the actual driving mileage unit of the transportation task is kilometers, the actual driving times unit of the transportation task is time, and the actual driving time unit of the transportation task is days.

In general, the actual number of runs of a transportation mission may be equal to 1, i.e., if the rate unit is the amount of oil subsidized per transportation mission, then the base oil subsidized = rate 1.

In the embodiment of the application, if the rate unit is related to the actual running time of the task;

as for the basic oil make-up,

the basic oil compensation can be obtained by utilizing a corresponding calculation formula aiming at the task list;

the total basic oil compensation obtained in the plurality of transportation processes can be classified into any transportation process in the plurality of transportation processes for the transportation driver, and the basic oil compensation in the rest transportation processes is 0, at this time, the total basic oil compensation in any transportation process in the plurality of transportation processes is used as a rate corresponding to the actual running time of the unit task;

for the basic road complement,

the basic road compensation can be obtained by utilizing a corresponding calculation formula aiming at the task list;

or, for a transportation driver, a plurality of transportation processes can be included in the actual running time of a unit task, for the plurality of transportation processes, the basic road obtained by the plurality of transportation processes can be supplemented, the method is characterized in that the method belongs to any one of the transportation processes, the basic road compensation in the other transportation processes is 0, and at the moment, the total basic road compensation in any one of the transportation processes is used as the rate corresponding to the actual running time of a unit task.

Specifically, for each task order, according to the actual mileage of the task or the actual times of the task or the actual use time of the task, the first calculation result is obtained by calculating the corresponding rate in the final calculation rule through the formulas of the basic road compensation and the basic oil compensation.

Step S105: and generating a plurality of task sheet patch details according to the first calculation results of the plurality of task sheets.

The method comprises the steps that the task list data corresponding to a plurality of task lists and related data generated by a driver in the transportation process of each task list are obtained, and for the whole thread pool, the final subsidy calculation rule is obtained, and the first calculation result is obtained, and for each task list in each thread, the final purpose of the embodiment of the method is to generate the subsidy details with the task list as a unit.

Furthermore, in order to reduce the deviation between the actual situation and the theoretical situation, the oil patch and the road patch of each task sheet can be calculated according to the basic oil patch and the basic road patch in the first calculation result of the plurality of task sheets and by combining the task actual oil data and the OA application oil patch data of the related data generated by a driver in the transportation process of each task sheet, wherein the oil patch and the road patch of each task sheet comprise the deviation in the aspects of basic patches and patches generated by the actual situation; and calling the oil patch and the road patch of each task list in batches through warehousing operation, and dropping the oil patch and the road patch into a warehouse to generate a plurality of task list patch details.

Compared with patch details stacked in a listed form in the related art, the patch details with the task list as a unit can be directly generated, so that the problem that in the process of manually screening the patch details of each task list after the patch details are generated in the related art is avoided, and the workload of post patch detail processing is reduced on the premise of improving the working efficiency of the whole patch process.

As can be seen, in the embodiment of the present application, task sheet data corresponding to each of a plurality of task sheets and relevant data generated by a driver in each task sheet transportation process are obtained, and a matching rule is dropped on a dimension of the task sheet, so as to lay a data foundation for obtaining patch details with the task sheet as a unit; in each thread, according to specific type data, driver information and vehicle information in the task sheet data, a plurality of subsidy calculation rules are obtained through matching, so that the matching efficiency can be greatly improved; in order to ensure the uniqueness of the calculation result, only one final patch calculation rule is needed for final calculation, so that according to the priority of a plurality of patch calculation rules, one most suitable patch calculation rule is selected from a plurality of patch calculation rules obtained by matching to serve as the final patch calculation rule; according to the obtained final subsidy calculation rule, calculating the first calculation result of each task sheet based on the related data generated by the driver in the transportation process of each task sheet by the final subsidy calculation rule; and finally, generating patch details of all the task sheets according to the first calculation results of the plurality of task sheets, directly acquiring the patch details with the task sheets as units, wherein the acquired patch detail information is clear and easy to see, and saving time for subsequent work.

Therefore, the technical scheme directly obtains the patch details with the task list as a unit on the basis of solving the problem of low calculation efficiency caused by excessive matching conditions, saves a large amount of arrangement time for subsequent work, improves the calculation efficiency, and further accelerates the working process of the whole patch work.

Furthermore, the calculation modes for obtaining the patch details are multiple according to different task orders, so that a proper patch calculation rule can be determined to obtain the patch details. For obtaining the patch calculation rule, it is now widely used to directly obtain the patch calculation rule by matching according to information, which results in too long matching time. Therefore, the embodiment of the application improves the original matching mode to obtain the subsidy calculation rule according to the information layer-by-layer matching so as to reduce the matching time.

Thus, in one possible implementation manner of the embodiment of the present application, before step S102, the method may further include:

and aiming at each task list, acquiring a plurality of large-range patch calculation rules corresponding to each task list according to the driver information and the vehicle information.

Because the generated patch details are in the unit of the task sheet, when the patch calculation rules are matched, the patch calculation rules are matched in the unit of the task sheet; the driver information and the vehicle information are two kinds of information which are not changed along with the change of the transportation task in the transportation process, and the specific type of information can be correspondingly changed according to the different transportation tasks, so that the first-round screening of the subsidy calculation rule is carried out by selecting the driver information and the vehicle information. The method comprises the steps of obtaining a plurality of large-range subsidy calculation rules corresponding to each task list, and screening out calculation rules applicable to the current task list by matching a plurality of subsidy calculation rules in a database.

The driver information includes the driver's job number, the driver's attributes, the fleet to which the driver belongs, and the carrier to which the driver belongs.

The vehicle information includes license plate number, vehicle type, number of axles, and vehicle gear, wherein the vehicle gear may include an automatic gear or a manual gear.

Specifically, matching is performed according to the driver information and the vehicle information, and a large-range subsidy computing rule which is successfully matched is stored in the Context to obtain the large-range subsidy computing rule.

In the embodiment of the application, a large-range patch calculation rule is obtained first, but an available patch calculation rule is not obtained directly, so that a one-time matching process is increased, but in actual operation, because the rule information is overlarge in magnitude, the patch calculation rule is obtained directly by matching according to information, the patch calculation rule can be matched from a plurality of patch calculation rules one by one, the time consumption is long, the efficiency is low, the patch calculation rule which can be used by the current task list is put into Context in a screening mode in a step-by-step matching mode, then the specific patch calculation rule is matched from the Context, and compared with one-time matching, a large amount of time can be saved, so that the working efficiency of the algorithm is improved.

Correspondingly, aiming at each task sheet, a plurality of subsidy calculation rules are acquired according to specific type data, driver information and vehicle information through a unique thread corresponding to each task sheet, wherein the method comprises the following steps: and aiming at each task sheet, acquiring a plurality of subsidy calculation rules according to the specific type data, the driver information, the vehicle information and the plurality of large-range subsidy calculation rules through a unique thread corresponding to each task sheet.

Specifically, in each thread, according to specific type data in the task sheet data, a large-scale patch calculation rule in Context is matched with a patch calculation rule corresponding to the specific type data in the task sheet through an interface, so that a plurality of patch calculation rules are obtained.

The interface is a matching rule total interface constructed by using a policy mode. The interface comprises a matching calculation rule manager and a specific matching module. The matching calculation rule manager inherits the matching interfaces of the road patch corresponding specific type and the matching interfaces of the oil patch corresponding specific type, and after the specific type data to be matched enter the interfaces, obtains the patch calculation rule matched with the corresponding specific type according to the inherited matching interfaces of the road patch and the oil patch corresponding specific type, wherein after the specific type data enter the matching interfaces of the road patch or the oil patch corresponding specific type, the license plate number, the trailer number, the vehicle type, the line, the site and the unmatched specific type are sequentially matched through a match function, after the matching calculation rule is matched with the corresponding patch calculation rule, a plurality of patch calculation rules corresponding to the specific type data in the task list are obtained according to the gettype function, and the unmatched specific type comprises the data type which cannot be matched with the written specific type data.

Therefore, the embodiment of the application provides a new configuration entry, namely an interface, for the patch calculation rule matching mode newly provided in the application through the policy mode, and a plurality of patch calculation rules corresponding to a plurality of specific types of data of each task list can be obtained through the interface, so that the matching efficiency is improved, and the working efficiency of the whole patch detail generation process is improved.

Furthermore, if the specific type data has newly added specific type data, the newly added specific type data matching interface is directly added to the road patch and oil patch corresponding specific type data matching rule interface of the interface, and the newly added specific type data matching interface is added to the implementation class to correspond to the implementation content, so that the situation of changing the specific type of the data along with the change of the transportation task is solved, and the algorithm has expansibility.

In addition, since the related art uses if sentences to match patch calculation rules, the patch calculation rule matching process is to select the most suitable one calculation rule from thousands of patch calculation rules, which means that thousands of patch calculation rules are matched one by one, which is not different from increasing a large amount of matching time, so that 4 hours are required for each calculation on the premise of 6000 drivers and 20000 rules, and the matching time is shortened by improving the patch calculation rule matching process, and the original calculation process which requires four times and four hours is changed into only 20 minutes, so that the calculation efficiency is obviously improved.

As can be seen, in the embodiment of the present application, a large-range patch calculation rule can be screened from rule information in a database, and then a plurality of patch calculation rules applicable to a current task sheet are screened from the large-range patch calculation rules, so that the situation that the final patch calculation rule is directly obtained from thousands of rule information in the database is avoided, and too long time is consumed in the matching process.

Further, in order to accurately determine the patch details, in a possible implementation manner of the embodiment of the present application, step S104 includes: and calculating the actual mileage of the task or the actual times of the task or the actual time of the task based on the final subsidy calculation rule to obtain a first calculation result.

In general, in the patch calculation process, past patch data are used as reference data, so that theoretical values of related data generated in the transportation process of each task sheet by a driver, namely base oil patch and base road patch, can be obtained, but a certain deviation exists between the actual situation and the theoretical situation; therefore, the patch calculation process in the embodiment of the application can calculate by combining with the actual situation, and data which are not generated on the task list before transportation, namely, related data which are generated in the transportation process of each task list by the driver, are generated in the transportation process of each task list, wherein the data comprise at least the number of drivers, the actual mileage of the task or the actual times of the task or the actual time of the task, the actual oil consumption data of the task and the OA application oil compensation data, and the data of the task list before the patch calculation process after the transportation task is finished can comprise the data which are not generated on the task list before transportation, namely, the related data which are generated in the transportation process of each task list by the driver; specifically, the task list data corresponding to each task list and the related data generated in the transportation process of each task list are processed on line so as to put the data into a database, the data can be obtained from the database at any time when the data are used later, and then all the task lists in the database and all the related data generated in the transportation process of the driver are directly put into a thread pool, so that the situation that all the threads cannot obtain the data to be obtained in the operation process is avoided.

Specifically, according to the rate in the final patch calculation rule, the basic oil patch and the basic road patch corresponding to each task sheet are calculated, and only the patch calculation result is obtained at this time, but the patch calculation result is not output, and after all threads are executed, a plurality of task sheet patch calculation results are output uniformly as patch detail sheets with the task sheet as a unit.

And calculating the actual mileage of the task based on the final patch calculation rule to obtain a first calculation result so as to obtain a basic road patch and a basic oil patch.

Accordingly, step S105 may specifically include steps S1051 (not shown in the figure), S1052 (not shown in the figure), and S1053 (not shown in the figure), where:

step S1051: and obtaining a second calculation result of each task sheet according to the data of the line, the first calculation result of each task sheet, the actual oil consumption data of the task and the OA application oil compensation data, wherein the data of the line comprises a line name and a line compensation amount corresponding to the line name.

The second calculation includes a final road patch and an oil patch. Wherein, the final road complement = basic road complement + line complement in the first calculation result; the line patch characterizes the corresponding patch amount of the line, and the larger the amount is, the more difficult the line is. Final oil make-up= (base oil make-up in first calculation-mission actual oil+oa application make-up oil) ×monthly oil price.

Specifically, aiming at the road patch of each task sheet, according to the line data and the matching of the task sheet names in the task sheet data and the line names in the line data, obtaining the corresponding road patch amount of each task sheet; according to the basic road patch and the line patch amount, the road patch corresponding to each task order is obtained through calculation by a road patch calculation formula, it can be understood that the line may be a difficult line or a conventional line, when the line is a conventional line, the corresponding line patch amount may be 0, when the line is a difficult line, the corresponding patch amount is a fixed amount in one possible case, and in the other possible case, the patch amount corresponds to the difficulty level of the difficult line, and the specific difficulty level user can be preset according to the actual situation.

Further, the road complement and the oil complement can be calculated simultaneously through the template mode. The template mode optimizes the matching process by templating the algorithm, and sets up a computation manager, a road complement calculator, an oil complement calculator, an abstract class calculator, and other computation scene calculators. The computation manager is used for managing computation of each computation scene, but does not limit a computation specific method; the road patch calculator is used for managing the road patch calculation process, and does not limit the calculation specific mode; the oil compensation calculator is used for managing the oil compensation calculation process, and the calculation specific mode is not limited; the abstract class calculator is used for managing the calculation process of different calculation scenes, limiting the sequence of calculation steps, specifically calculating different calculation scenes to start calculating subsidies according to task list numbers, wherein the calculating subsidies are sequentially matched with subsidies calculation rules, calculating subsidies and apportioning calculation subsidies, and data sequentially transmitted in each thread according to the matching, calculating and apportioning sequence are fact data, fact data and corresponding realization class methods of each calculation scene, and the fact data and corresponding realization class methods of each calculation scene; and the other computing scene calculators are used for adding computing scenes except road compensation and oil compensation. Moreover, each element in the template mode keeps the independence and expansibility, so that on one hand, the template mode can be matched with the calculation patch of the calculation scene at the current stage, and on the other hand, when a new calculation scene is generated in the future, the rapid iteration can be realized under the condition that the existing function is not influenced, and the requirement of sustainable expansion is met. That is, after the calculation scene is increased, the algorithm cannot be expanded, so that manual downlink calculation is required, but in the embodiment of the application, a template mode is used for providing a position for the newly increased calculation scene, the newly increased calculation scene can be directly added, the subsequent process is still performed in the algorithm, the manual workload is reduced, and meanwhile, the accuracy of the patch detail obtained through the algorithm calculation is higher than that obtained through manual calculation.

The method comprises the steps of optimizing the whole structure of an algorithm by using a template mode, enabling the structure of the algorithm to be clear, enabling the operation of the algorithm to be more stable, combining a strategy mode used in a matching process, obtaining patch calculation rules by matching the matching patch calculation rules one by one from all rule information in a database, improving the patch calculation rules to obtain a large-range patch calculation rules, obtaining a plurality of patch calculation rules corresponding to a plurality of specific types in each task list by matching the patch calculation rules in the large-range, and finally selecting the patch calculation rule with the highest priority in the patch calculation rules as a final patch calculation rule. The matching process is structured to save matching time, so that the computing efficiency is improved.

Step S1052: and obtaining a final calculation result of each task list according to the second calculation result of each task list and the corresponding number of drivers.

In the second calculation result obtained in each thread, although the respective subsidy details of each task sheet are already obtained, in long distance transportation, the drivers often use not only one name, but the final purpose of obtaining the subsidy details is to make a subsidy for each driver, so that the corresponding subsidy of each driver in each task sheet can be obtained.

Specifically, aiming at each task list, according to the number of drivers and the second calculation result in the task list data, the second calculation result is averagely divided under each driver name to finish subsidy sharing, and compared with the manual sharing in the related art, the system has higher accuracy, higher speed and higher overall efficiency.

Step S1053: and obtaining the patch details of the plurality of task sheets according to the final calculation results of the plurality of task sheets.

The second calculation result obtained in each thread is already obtained and distributed under each driver name, but the results are only stored in the database, if the subsidy details of each driver in each task list can be used later, the subsidy details of each driver in each task list are also required to be extracted from the database, and the method is not intuitive. According to the second calculation result of each task list stored in the database, simultaneously, carrying out batch calling on the calculation result of the unique task list in each thread by operating the multithreading, and enabling the calculation result to fall into the database to generate a plurality of patch detail lists taking the task list as a unit. The patch detail list taking the task list as a unit comprises patch detail of each task list; each task sheet patch detail comprises a patch detail of each driver; the patch details of each driver include road patch and oil patch details.

According to the method and the device for determining the road patch, after the road patch and the oil patch of the basis are determined according to the first calculation result, the final calculation result of each task sheet can be finally determined according to the actual oil consumption data of the task, the OA application oil patch data and the number of drivers, and then the obtained task sheet patch detail is more in line with the actual situation, and the accuracy of the finally generated task sheet patch detail is improved. And the whole period at present needs three days of development, production and business to be calculated, and the patch detail can be obtained only by 20 minutes by using the method in the embodiment of the application.

Further, to improve the calculation efficiency of the algorithm, a thread pool is introduced into the algorithm, and multithreading is used to process the task list simultaneously, so a possible implementation manner of the embodiment of the present application may specifically include, before step S102, step S1011 (not shown in the figure), step S1012 (not shown in the figure), and step S1013 (not shown in the figure), where:

step S1011: according to the frequency of the thread pool to be used, idle time allowed by the thread pool maintenance thread is set.

The usage of the algorithm corresponding to the patch detail generation method may be one or more times, and a certain time is required for each restarting of the thread pool, so that the idle time allowed for maintaining the thread by the thread pool is set based on the usage frequency of the thread pool in the algorithm.

Specifically, if the algorithm is used only once, the idle time allowed by the thread pool to maintain the threads is set as the first time, the first time is shorter, and the situation that the interval time from the completion of all tasks to the closing of all threads of the thread pool is too long, so that the CPU is not wasted is prevented. If the algorithm needs to be used continuously for multiple times, setting the idle time allowed by the thread pool maintenance thread as second time, wherein the second time is longer than the first time, and the idle time allowed by the thread pool maintenance thread is long enough to start the next algorithm use, so that the time waste caused by restarting the thread pool in the process of using the algorithm for multiple times is avoided.

Step S1012: setting allowCoreThreadTimeout.

When allowances thread=false, if the idle time of the thread exceeds the idle time allowed by the thread pool maintenance thread, after the idle thread exits a part, the rest part of threads exist, the minimum thread number is maintained all the time, and the thread is still in a standby state; if the thread is set to allowCoreThreadimeout=true, the core thread is ensured to be closed overtime, and the purpose of stopping the threads in the thread pool by one key is achieved.

Specifically, since there are two situations that a plurality of task list wait for idle threads and a thread cannot completely exit after executing a completed task in the running process, and in the process that a plurality of task lists wait for idle threads, the number of threads started is equal to the maximum number of thread pool maintenance threads, generally, when a thread completes a task and there is no task list waiting for processing in a buffer queue, after the waiting time of the thread exceeds the idle time allowed by the thread pool maintenance threads, the thread can exit until the number of threads in the thread pool is equal to the minimum number of thread pool maintenance threads, if the number of threads in the thread pool is totally idle and no task list to be processed still enters the thread, the thread in the thread pool can continue waiting for tasks in the minimum number of thread pool maintenance threads, and at this time, the energy consumption of the thread pool is larger, therefore, the purpose that the thread in the thread pool is allowed to stop a key can be set to be closed in a timeout mode. Therefore, the thread pool is configured one by one according to the actual application scene of the thread pool, so that the thread pool is more suitable for the use scene, and the overall working efficiency of the thread pool is improved.

Step S1013: and setting the maximum number of thread pool maintenance threads according to the reference calculation time of all the task sheets, the magnitude of data to be calculated, the CPU performance and the acceptable calculation time, wherein the data to be calculated comprises the task sheet data corresponding to each of a plurality of task sheets and the related data generated by a driver in the transportation process of each task sheet, and the reference calculation time of each task sheet represents the time spent by running the task sheets with the same magnitude in the past.

The elements to be set in the thread pool comprise the maximum number of thread pool maintenance threads, the minimum number of thread pool maintenance threads, idle time allowed by the thread pool maintenance threads, time units of the idle time allowed by the thread pool maintenance threads, a buffer queue used by the thread pool and a processing strategy of the thread pool for rejecting tasks.

Specifically, in order to ensure that tasks can be accepted at any time after the multithreading is started, and meanwhile, CPU is not excessively consumed, the minimum number of maintenance threads of a thread pool is generally set to be 2 to 3; calculating the time required by all task sheets to be processed according to the reference calculation time of each task sheet; and calculating the maximum number of thread pool maintenance threads according to the consumed time required by all the task sheets to be processed and the calculated acceptable time. And determining a thread pool basic framework by setting the minimum number of maintenance threads and the maximum number of maintenance threads of the thread pool, completing the thread pool setting, and providing threads for subsequent multithreading processing task lists.

The meaning of performing the configuration combination of step S1011, step S1012, and step S1013 is:

when the number of threads is smaller than the minimum number of threads in the thread pool, the thread pool can limit the creation of new thread processing even if the threads are idle;

when thread number > = minimum thread number of thread pool and task queue is full, the thread pool will create new thread to process task;

when the thread number=the maximum thread number and the task queue is full, the thread pool refuses to process the task and throws the exception;

when the idle time of the thread reaches the idle time allowed by the thread pool maintenance thread, the thread is exited until the number of threads is equal to the minimum number of threads in the thread pool;

if allowcorethreadtimeout=true, it will be up to thread number=0.

Further, the patch detail generation method may further include: distributing a plurality of idle threads to a plurality of task sheets in a plurality of task sheets by using a thread pool, wherein each task sheet corresponds to a unique thread; if the task list of the unallocated thread exists, the task list of the unallocated thread is put into a buffer queue to wait for an idle thread.

In the embodiment of the application, a plurality of task lists can be put into the idle threads by using the thread pool according to the idle time allowed by the thread pool to maintain the threads, the maximum thread number of the thread pool to maintain the threads and the buffer queue, wherein each thread corresponds to a unique task list. Specifically, when the number of task sheets waiting to be processed is smaller than the maximum number of threads for maintaining threads in the thread pool, the task sheets put in the thread pool through the subset are put in idle threads, and each task sheet is processed by a unique thread. If the task list of the unallocated thread exists, the task list of the unallocated thread is put into a buffer queue to wait for an idle thread.

In the task list processing process, the number of threads is generally the maximum number of thread pool maintenance operations, so the buffer queue can be directly set according to the maximum number of thread pool maintenance operations. The buffer queue is used for storing tasks to be executed except the tasks being executed in the threads, and the buffer queue is used for ensuring that the rest tasks which are not executed are in a waiting state when the tasks are executed in a multithreading manner, so that the blocking condition caused by the fact that all the tasks enter a thread pool is effectively prevented, the thread pool is set to be incapable of considering the tasks to be executed, the tasks to be executed are also considered, and the operation confusion caused by the fact that the tasks are discontinuous in the operation process is prevented.

According to the embodiment of the application, the plurality of task lists waiting for processing are placed through the set buffer queue, so that the blocking condition caused by the fact that all the task lists enter a thread pool for processing is effectively prevented.

It can be known that, in the embodiment of the application, the set thread pool can be utilized to perform calculation and allocation of task sheets, and a plurality of task sheets waiting for processing are placed by utilizing the set buffer queue, so that blocking caused by the fact that all task sheets enter the thread pool is effectively prevented.

Further, the patch detail generation method may further include: judging whether the idle time of the idle thread in the thread pool is longer than the idle time allowed by the thread pool maintenance thread; if the idle time of the idle thread in the thread pool is larger than the idle time allowed by the thread pool maintenance thread, closing the idle thread with the idle time larger than the idle time allowed by the thread pool maintenance thread, wherein the idle time allowed by the thread pool maintenance thread is set based on the preset use frequency of the thread pool.

Specifically, when the idle time of a thread is greater than the idle time allowed by the thread pool maintenance thread, the thread is exited until the number of threads opened in the thread pool is equal to the minimum number of threads maintained by the thread pool maintenance thread, but, because allowances corethread timeout=true, the number of threads opened in the thread pool in the embodiment of the present application does not need to be maintained at the minimum number of threads maintained by the thread pool maintenance thread, and the newly added idle thread is exited until the number of threads opened in the thread pool is equal to 0. It follows that setting allowcorethreadtimeout=true saves a lot of power for the thread pool.

As can be seen, after the idle time of the idle thread in the thread pool is longer than the idle time allowed by the thread pool maintenance thread, the idle thread with the idle time longer than the idle time allowed by the thread pool maintenance thread can be closed, so that the thread energy consumption is reduced.

In one possible implementation manner of the embodiment of the present application, step S102 may specifically include step S1021 (not shown in the figure) and step S1022 (not shown in the figure), where:

step S1021: and transmitting the task sheet data corresponding to each of the plurality of task sheets and the related data generated by a driver in the transportation process of each task sheet to each thread by utilizing the Synchronized and the threaded.

Step S1022: and aiming at each task list, acquiring a plurality of subsidy calculation rules corresponding to each task list through a unique thread corresponding to each task list according to the specific type data, the driver information and the vehicle information transmitted to each thread.

In the embodiment of the application, the data transfer between threads is divided into two modes of transferring parameters to the threads and acquiring return values from the threads, and because in the embodiment of the application, the data is stored in the database, and the data can be directly called by inquiring the database when the data is needed, the embodiment of the application does not choose to acquire the return values from the threads.

Specifically, aiming at a thread pool, using a Synchronized, firstly putting task list data corresponding to each of a plurality of task lists and related data generated by a driver in each task list transportation process into variables of the thread pool, ensuring that only one thread operates the data in the variables at the same time, and ensuring the safe access of multiple threads to the variables; for each thread, by utilizing thread, the data in the variable of the thread pool is independently copied in each thread, so that data confusion caused by cross-layer transmission is avoided, and the running stability of an algorithm is improved. It can be appreciated that by the mechanism, after the data put into the thread pool has independent copies in each thread, the patch calculation rule can be obtained by utilizing the independent copy matching of the data of each data.

It can be known that, in the embodiment of the application, only one thread can operate the data in the variable at the same time by using a Synchronized and Threadlocal mechanism; meanwhile, the data in the variable of the thread pool is copied independently in each thread, so that data confusion caused by cross-layer transfer is avoided.

Since the data types may be increased, there may be corresponding countermeasures for the case where the data types are increased. Thus, for the case of a specific type of data addition, the method further comprises:

specifically, the newly added specific type data request information is information received by an algorithm when the specific type data is added, and the newly added specific type data and rules corresponding to the newly added specific type data are included to provide data support for the subsequent interface and rewrite the implementation class method in the interface.

Updating the subsidy calculation rule set corresponding to the specific type data according to the newly added specific type data request information; wherein the patch calculation rule set is used for determining a corresponding patch calculation rule based on a particular type of data.

Specifically, after receiving the newly added specific type data request information, implementing an interface according to the newly added specific type data in the newly added specific type data request information and the rule corresponding to the newly added specific type data, and rewriting the implementation class method in the interface, wherein the implementation class method in the interface at least comprises the implementation class methods under different computing scenes.

Furthermore, when the updated patch calculation rule set is utilized to match rule design, a strategy mode is utilized to provide countermeasures for newly-added specific type data, namely, an expansion position is reserved for the newly-added specific type data, so that the algorithm has expansibility and high flexibility.

The above embodiment describes a patch detail generation method from the viewpoint of a method flow, and the following embodiment describes a patch detail generation apparatus from the viewpoint of a virtual module or a virtual unit, specifically the following embodiment.

The embodiment of the application provides a patch detail generation device, as shown in fig. 2, the patch detail generation device specifically may include:

the data acquisition module 201 is configured to acquire task sheet data corresponding to each of the plurality of task sheets and related data generated by a driver during transportation of each task sheet; the task data at least comprises: specific type data, driver information and vehicle information, wherein the specific type data comprises a number of license plates, trailer numbers, vehicle types, lines and stations;

The calculation rule matching module 202 is configured to obtain, for each task sheet, a plurality of subsidy calculation rules according to specific type data, driver information, and vehicle information through a unique thread corresponding to each task sheet, where each subsidy calculation rule at least includes a rate for calculating an oil patch and a road patch;

the calculation rule determining module 203 is configured to, for each task order, use a patch calculation rule with a highest priority as a final patch calculation rule according to priorities of a plurality of patch calculation rules;

the first calculation result obtaining module 204 is configured to calculate, for each task sheet, related data generated by the driver during transportation of each task sheet based on a final subsidy calculation rule, to obtain a first calculation result;

the task sheet patch detail generation module 205 is configured to generate patch details corresponding to each of the plurality of task sheets according to the first calculation results corresponding to each of the plurality of task sheets.

For the embodiment of the application, the data acquisition module 201 acquires the task sheet data corresponding to each of a plurality of task sheets and the related data generated by a driver in the transportation process of each task sheet, and the matching rule falls on the dimension of the task sheet, so that a data foundation is laid for acquiring the patch detail taking the task sheet as a unit; in each thread, a plurality of subsidy calculation rules are obtained through matching according to specific type data, driver information and vehicle information in the task sheet data by a calculation rule matching module 202; in order to ensure the uniqueness of the calculation result, only one final patch calculation rule is needed for final calculation, so that one most suitable patch calculation rule is selected from the plurality of patch calculation rules obtained by matching according to the priorities of the plurality of patch calculation rules in the calculation rule determining module 203 to serve as the final patch calculation rule; after the final subsidy calculation rule is obtained, a first calculation result obtaining module 204 is utilized to calculate a first calculation result of each task sheet based on the related data generated by the final subsidy calculation rule in the transportation process of each task sheet for a driver according to the obtained final subsidy calculation rule, wherein the first calculation result is a part of the final calculation result of each task sheet, and the first calculation result is calculated in advance because a calculation formula of the first calculation result is certain; the final-use task sheet patch detail generation module 205 generates patch details of all task sheets according to the first calculation results of the plurality of task sheets, directly acquires patch details in the unit of the task sheet, and the acquired patch detail information is clear and easy to see, so that time is saved for subsequent work.

Therefore, the technical scheme of the application directly obtains the patch details with the task list as a unit on the basis of solving the problem of low calculation efficiency caused by excessive matching conditions, saves a large amount of arrangement time for subsequent work, improves the calculation efficiency, and further accelerates the working process of the whole patch work. One possible implementation manner of the embodiment of the present application further includes: the large-scale subsidy calculation rule matching module is used for:

aiming at each task list, according to the driver information and the vehicle information, a plurality of corresponding large-range patch calculation rules in each task list are obtained, wherein the large-range patch calculation rules represent specific type data and specific type data except the specific type data contained in each task list data,

correspondingly, when executing each task sheet, the calculation rule matching module 202 obtains a plurality of subsidy calculation rules according to specific type data, driver information and vehicle information through a unique thread corresponding to each task sheet, and is used for:

The large-scale subsidy calculation rule matching module and the calculation rule matching module 202 may be the same module or different modules. In one possible implementation manner of the embodiment of the present application, the relevant data generated by the driver during each task sheet transportation process includes: task actual mileage or task actual times or task actual use, task actual oil consumption data, OA application oil supplement data, driver number,

the first calculation result obtaining module 204 is specifically configured to, when performing calculation on related data generated by the driver during each task sheet transportation process based on the final subsidy calculation rule to obtain a first calculation result:

Accordingly, in one possible implementation manner of the embodiment of the present application, when executing the first calculation result according to the multiple task sheets, the task sheet patch detail module 205 is configured to:

One possible implementation manner of the embodiment of the present application, the apparatus further includes:

the thread allocation module is used for allocating a plurality of idle threads to a plurality of task sheets in a plurality of task sheets by utilizing a thread pool, wherein each task sheet corresponds to a unique thread;

the thread processing module is used for judging whether the idle time of the idle thread in the thread pool is longer than the idle time allowed by the thread pool maintenance thread; if yes, closing the idle thread with the idle time longer than the idle time allowed by the thread pool maintenance thread.

the thread pool maintenance module is used for setting the maximum number of thread pool maintenance threads according to the reference calculation time of all the task sheets, the magnitude of data to be calculated, the CPU performance and the acceptable calculation time, wherein the data to be calculated comprises the task sheet data corresponding to each of a plurality of task sheets and the related data generated by a driver in the transportation process of each task sheet, and the reference calculation time of each task sheet represents the time spent by running the task sheets with the same magnitude in the past.

In one possible implementation manner of the embodiment of the present application, when executing each task sheet, the calculation rule matching module 202 obtains a plurality of subsidy calculation rules according to specific type data, driver information, and vehicle information through a unique thread corresponding to each task sheet, the calculation rule matching module is specifically configured to:

In one possible implementation manner of the embodiment of the present application, the apparatus further includes:

the new adding module is used for obtaining new adding specific type data request information, wherein the new adding specific type data request information comprises new adding specific type data and rules corresponding to the new adding specific type data, and the rules corresponding to the new adding specific type data comprise subsidy calculation rules and priorities corresponding to the subsidy calculation rules;

It will be clear to those skilled in the art that, for convenience and brevity of description, a specific working procedure of an apparatus described above may refer to a corresponding procedure in the foregoing method embodiment, which is not described herein again.

In an embodiment of the present application, as shown in fig. 3, an electronic device 30 shown in fig. 3 includes: a processor 301 and a memory 303. Wherein the processor 301 is coupled to the memory 303, such as via a bus 302. Optionally, the electronic device 30 may also include a transceiver 304. It should be noted that, in practical applications, the transceiver 304 is not limited to one, and the structure of the electronic device 30 is not limited to the embodiment of the present application.

The processor 301 may be a CPU (Central Processing Unit ), general purpose processor, DSP (Digital Signal Processor, data signal processor), ASIC (Application Specific Integrated Circuit ), FPGA (Field Programmable Gate Array, field programmable gate array) or other programmable logic device, transistor logic device, hardware components, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules, and circuits described in connection with this disclosure. Processor 301 may also be a combination that implements computing functionality, e.g., comprising one or more microprocessor combinations, a combination of a DSP and a microprocessor, etc.

Bus 302 may include a path to transfer information between the components. Bus 302 may be a PCI (Peripheral Component Interconnect, peripheral component interconnect Standard) bus or an EISA (Extended Industry Standard Architecture ) bus, or the like. Bus 302 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in fig. 3, but not only one bus or type of bus.

The Memory 303 may be, but is not limited to, a ROM (Read Only Memory) or other type of static storage device that can store static information and instructions, a RAM (Random Access Memory ) or other type of dynamic storage device that can store information and instructions, an EEPROM (Electrically Erasable Programmable Read Only Memory ), a CD-ROM (Compact Disc Read Only Memory, compact disc Read Only Memory) or other optical disk storage, optical disk storage (including compact discs, laser discs, optical discs, digital versatile discs, blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.

The memory 303 is used for storing application program codes for executing the present application and is controlled to be executed by the processor 301. The processor 301 is configured to execute the application code stored in the memory 303 to implement what is shown in the foregoing method embodiments.

Among them, electronic devices include, but are not limited to: mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. But may also be a server or the like. The electronic device shown in fig. 3 is only an example and should not be construed as limiting the functionality and scope of use of the embodiments herein.

The present application provides a computer readable storage medium having a computer program stored thereon, which when run on a computer, causes the computer to perform the corresponding method embodiments described above.

It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited in order and may be performed in other orders, unless explicitly stated herein. Moreover, at least some of the steps in the flowcharts of the figures may include a plurality of sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, the order of their execution not necessarily being sequential, but may be performed in turn or alternately with other steps or at least a portion of the other steps or stages.

The foregoing is only a partial embodiment of the present application, and it should be noted that, for a person skilled in the art, several improvements and modifications can be made without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.

Claims

1. A patch detail generation method, characterized by comprising:

2. The patch detail generation method according to claim 1, characterized by further comprising, before acquiring a plurality of patch calculation rules from the specific type data, the driver information, the vehicle information:

correspondingly, aiming at each task sheet, a plurality of subsidy calculation rules are acquired according to specific type data, driver information and vehicle information through a unique thread corresponding to each task sheet, wherein the method comprises the following steps:

3. The patch detail generation method according to claim 1, wherein the related data generated by the driver during each job ticket transportation process includes: task actual mileage or task actual times or task actual use, task actual oil consumption data, OA application oil supplement data, driver number,

calculating the actual mileage of the task or the actual times of the task or the actual time of the task based on the final subsidy calculation rule to obtain a first calculation result;

correspondingly, generating a plurality of task sheet patch details according to the first calculation results of the plurality of task sheets, including:

4. A patch detail generation method according to any one of claims 1 to 3, wherein before acquiring a plurality of patch calculation rules according to specific type data, driver information, and vehicle information by a unique thread corresponding to each task sheet for each task sheet, the patch detail generation method further comprises:

5. The patch detail generation method according to claim 4, characterized by further comprising:

6. The patch detail generation method according to claim 4, characterized by further comprising:

7. The patch detail generation method according to claim 1, wherein for each task sheet, a plurality of patch calculation rules are acquired according to specific type data, driver information, and vehicle information by a unique thread corresponding to each task sheet, including:

8. A patch detail generation method according to any one of claims 1 to 3, further comprising:

9. A patch detail generation device, comprising:

10. An electronic device, comprising:

at least one processor;

a memory;

at least one application program, wherein the at least one application program is stored in the memory and configured to be executed by the at least one processor, the at least one application program configured to: performing the method of any one of claims 1-8.