CN112801516A - Policy matching method, computer device, and storage medium - Google Patents
Policy matching method, computer device, and storage medium Download PDFInfo
- Publication number
- CN112801516A CN112801516A CN202110139120.XA CN202110139120A CN112801516A CN 112801516 A CN112801516 A CN 112801516A CN 202110139120 A CN202110139120 A CN 202110139120A CN 112801516 A CN112801516 A CN 112801516A
- Authority
- CN
- China
- Prior art keywords
- attribute
- execution
- subtask
- subtasks
- execution result
- 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
Images
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/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Educational Administration (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a strategy matching method, computer equipment and a storage medium. The strategy matching method comprises the following steps: acquiring a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type; pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results; respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies; respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask. According to the technical scheme, the strategy matching efficiency and the task execution rate are improved.
Description
Technical Field
The present application relates to the field of communications, and in particular, to a policy matching method, a computer device, and a storage medium.
Background
Assuming that a task type comprises a plurality of subtasks, at present, when an execution strategy is configured for the plurality of subtasks included in the task type, a uniform execution strategy is set, or a fixed one-to-one execution strategy is set for the plurality of subtasks, and when the execution strategy is operated online or the execution strategy of the subtasks needs to be switched, a worker needs to manually switch, which consumes a long time and a large amount of manpower; and a fixed execution strategy is set for a plurality of subtasks, so that the task execution rate is not high.
Disclosure of Invention
In order to solve or improve the problems in the prior art, embodiments of the present application provide a policy matching method, a computer device, and a storage medium.
In an embodiment of the present application, a policy matching method is provided. The method comprises the following steps:
acquiring a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type; pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results; respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; the execution strategy adopted by the attribute subtask in the execution is the execution strategy matched with the attribute subtask in the first group of matching results; changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies; respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the second group matching result; and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask.
Further, the policy matching method further comprises: determining whether the pairing scheme is an inferior scheme or not based on the first execution result of each attribute subtask; when the determination result is yes, triggering the step of changing the pairing scheme; and when the determination result is negative, continuously executing a plurality of attribute subtasks according to the first group of matching results respectively, and triggering the step of changing the matching scheme when the duration reaches the preset duration.
Further, determining whether the pairing scheme is a poor scheme or not based on the first execution result of each attribute subtask includes: and when the first execution result of each attribute subtask is smaller than a threshold value, determining that the pairing scheme is a poor scheme.
Further, the policy matching method further comprises: determining the change times of the pairing scheme according to the corresponding quantity of the attribute subtasks and the execution strategy; when the change times are more than two times, continuously changing the pairing scheme until the change times are reached so as to obtain at least one third execution result;
correspondingly, according to the first execution result and the second execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks, including: and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result, the second execution result and at least one third execution result.
Further, determining a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result, including: comparing the first execution result with the second execution result; if the first execution result is better than the second execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first group of matching results; and if the second execution result is better than the first execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the second group pairing result.
Further, the task type is a dispatching type; the plurality of attribute subtasks include: and the various types of users correspond to the order dispatching task of the order.
Further, the policy matching method further comprises: sending the first execution result of each attribute subtask and the second execution result of each attribute subtask to a client for displaying at the client; and receiving modification information fed back by the client, wherein the modification information comprises modification contents aiming at least part of the plurality of execution strategies.
Further, the policy matching method further comprises: acquiring a corresponding expected result of each attribute subtask; respectively calculating the difference between the first execution result and the expected result of each attribute subtask; generating prompt information based on the expected result corresponding to each attribute subtask, the first execution result of each attribute subtask and the difference value corresponding to each attribute subtask; and sending the prompt information to the client.
In another embodiment of the present application, a computer device is provided. The computer device includes: a memory and a processor; wherein the memory is used for storing the computer program; the processor is coupled to the memory for executing a computer program for performing the steps in the policy matching method described above.
In yet another embodiment of the present application, a computer-readable storage medium is provided that stores computer instructions, which when executed by one or more processors, cause the one or more processors to perform the steps in the policy matching method described above.
According to the technical scheme provided by each embodiment of the application, a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type are obtained; pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results; respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies; respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask. Different matching schemes are adopted to automatically match the plurality of attribute subtasks and the plurality of execution strategies, so that the manual task matching execution strategy is replaced, the strategy matching efficiency is improved, and the strategy matching time is saved; by comparing the execution results of different execution strategy matching schemes, the execution strategies corresponding to the multiple attribute subtasks are determined, so that the execution strategies with higher matching degree can be matched for the multiple attribute subtasks, and the task execution rate can be improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flowchart of a policy matching method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a policy matching apparatus according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in 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.
In some of the flows described in the specification, claims, and above-described figures of the present application, a number of operations are included that occur in a particular order, which operations may be performed out of order or in parallel as they occur herein. The sequence numbers of the operations, e.g., 101, 102, etc., are used merely to distinguish between the various operations, and do not represent any order of execution per se. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first", "second", etc. in this document are used for distinguishing different messages, devices, modules, etc., and do not represent a sequential order, nor limit the types of "first" and "second" to be different. In addition, the embodiments described below are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 shows a schematic flow chart of an information processing method according to an embodiment of the present application. As shown in fig. 1, the information processing method includes:
101. acquiring a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type;
102. pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results;
103. respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; the execution strategy adopted by the attribute subtask in the execution is the execution strategy matched with the attribute subtask in the first group of matching results;
104. changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies;
105. respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the second group matching result;
106. and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask.
In the step 101, the attribute subtasks are the order dispatching tasks of orders corresponding to multiple types of users. Taking the dispatching task as an example, the dispatching task is different for different customer groups. Such as: price sensitive customers correspond to price sensitive type dispatching tasks, service sensitive customers correspond to service sensitive type dispatching tasks and the like. In this example, the task type is a dispatch task, and the plurality of attribute subtasks includes: price sensitive type order tasks, service sensitive type order tasks, and the like. Accordingly, the plurality of execution policies are task execution policies for price sensitive type order tasks, service sensitive type order tasks, and the like. Here, the number of attribute subtasks and the number of execution policies are not necessarily the same.
In the step 102, assuming that the plurality of attribute subtasks are A, B, C respectively and the plurality of execution policies are a, b, and c, the first set of pairing results obtained by using the pairing scheme may be: a, the task corresponds to a strategy; the task B corresponds to the policy B; the C task corresponds to the C policy. It should be noted here that the first group pairing result is not limited to the above pairing case.
In step 104, after the matching scheme is changed, the second group matching result may be: the task A corresponds to the policy b; the task B corresponds to the strategy c; the C task corresponds to the a strategy. It should be noted here that the second group pairing result is not limited to the above pairing case.
In the above steps 103 and 105, the first execution result and the second execution result are specifically task conversion rates. Still taking the dispatching task as an example, when the price sensitive type execution strategy executes the price sensitive type task, the completion condition of the task is the conversion rate of the task.
In the step 106, when the execution policy is finally determined, the execution results of the pairing schemes are compared, and the execution policy corresponding to the optimal execution result is used as the execution policy of the corresponding pairing scheme.
In this embodiment of the present application, the policy matching method further includes:
107. determining whether the pairing scheme is an inferior scheme or not based on the first execution result of each attribute subtask;
108. when the determination result is yes, triggering the step of changing the pairing scheme;
109. and when the determination result is negative, continuously executing a plurality of attribute subtasks according to the first group of matching results respectively, and triggering the step of changing the matching scheme when the duration reaches the preset duration.
In step 107, determining whether the pairing scheme is the poor scheme based on the first execution result of each attribute subtask may specifically include the following steps: and when the first execution result of each attribute subtask is smaller than a threshold value, determining that the pairing scheme is a poor scheme.
In this embodiment, the policy matching method further includes:
110. determining the change times of the pairing scheme according to the corresponding quantity of the attribute subtasks and the execution strategy;
111. and when the change times are more than two times, continuing to change the pairing scheme until the change times are reached so as to obtain at least one third execution result.
In the above steps 110 and 111, the number of times of changing the pairing scheme is related to the number of the attribute subtasks and the number of the execution strategies. For example: when the number of the attribute subtasks and the number of the execution strategies are both 3, the number of the pairing scheme groups is as follows: c3 3Group 3. At this time, there is a set of third pairing schemes and a third execution result. When there are 4 sets of pairing schemes, there are two sets of third pairing schemes and two third execution results.
Correspondingly, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result may specifically include the following steps: and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result, the second execution result and at least one third execution result.
In an implementation scheme, determining a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result may specifically include the following steps: comparing the first execution result with the second execution result; if the first execution result is better than the second execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first group of matching results; and if the second execution result is better than the first execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the second group pairing result.
Further, the policy matching method further comprises: sending the first execution result of each attribute subtask and the second execution result of each attribute subtask to a client for displaying at the client; receiving modification information fed back by a client, wherein the modification information comprises modification contents aiming at least part of the multiple execution strategies; after the modification is finished, the task can be continuously executed according to the steps, so that the execution strategy of the task is continuously optimized, and the conversion rate of the task is improved.
In this embodiment of the present application, the policy matching method further includes: acquiring a corresponding expected result of each attribute subtask; respectively calculating the difference between the first execution result and the expected result of each attribute subtask; generating prompt information based on the expected result corresponding to each attribute subtask, the first execution result of each attribute subtask and the difference value corresponding to each attribute subtask; and sending the prompt information to the client.
Where the desired result is set by the worker according to a specific task type. The execution result, the expected result and the difference between the execution result and the expected result are sent to the client, so that the working personnel can know the conversion rate of the task and the difference between the conversion rate of the task and the expected result in time, and corresponding improvement is made according to the difference so as to improve the conversion rate of the task.
According to the technical scheme provided by each embodiment of the application, a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type are obtained; pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results; respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies; respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask. Different matching schemes are adopted to automatically match the plurality of attribute subtasks and the plurality of execution strategies, so that the manual task matching execution strategy is replaced, the strategy matching efficiency is improved, and the strategy matching time is saved; by comparing the execution results of different execution strategy matching schemes, the execution strategies corresponding to the multiple attribute subtasks are determined, so that the execution strategies with higher matching degree can be matched for the multiple attribute subtasks, and the task execution rate can be improved.
Fig. 2 shows a schematic structural diagram of a policy matching apparatus according to an embodiment of the present application. As shown in fig. 2, the apparatus includes:
an obtaining module 201, configured to obtain a plurality of attribute subtasks of a task type and a plurality of execution policies corresponding to the task type;
the matching module 202 is configured to pair the plurality of attribute subtasks and the plurality of execution policies in pairs by using a pairing scheme to obtain a first group of pairing results;
the execution module 203 is configured to execute the multiple attribute subtasks according to the first group of matching results, so as to obtain a first execution result of each attribute subtask; the execution strategy adopted by the attribute subtask in the execution is the execution strategy matched with the attribute subtask in the first group of matching results;
the matching module 202 is further configured to change a pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution policies;
the execution module 203 is further configured to execute the multiple attribute subtasks respectively based on the second group pairing result to obtain a second execution result of each attribute subtask; the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the second group matching result;
the determining module 204 is configured to determine a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask.
Further, the determining module 204 is further configured to determine whether the pairing scheme is a poor scheme based on the first execution result of each attribute subtask; correspondingly, the device also comprises: a triggering module 205, configured to trigger a step of changing the pairing scheme when the determination result is yes; correspondingly, when the determination result is negative, the executing module 203 is further configured to continuously execute the plurality of attribute subtasks according to the first group of matching results, and trigger a step of changing the matching scheme when the duration reaches the preset duration.
Further, the determining module 204, when configured to determine whether the pairing scheme is a poor scheme based on the first execution result of each attribute subtask, is specifically configured to: and when the first execution result of each attribute subtask is smaller than a threshold value, determining that the pairing scheme is a poor scheme.
Further, the determining module 204 is further configured to determine the number of times of changing the pairing scheme according to the number of the attribute subtasks and the number of times of changing the execution policy; correspondingly, the matching module 202 is further configured to, when the change times are greater than two times, continue to change the pairing scheme until the change times are reached, so as to obtain at least one third execution result;
correspondingly, in an implementation scheme, the determining module 204, when configured to determine a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result, is specifically configured to: and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result, the second execution result and at least one third execution result.
Further, in another implementation scheme, the determining module 204, when configured to determine a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result, is specifically configured to: comparing the first execution result with the second execution result; if the first execution result is better than the second execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first group of matching results; and if the second execution result is better than the first execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the second group pairing result.
Further, the task type is a dispatching type; the plurality of attribute subtasks include: and the various types of users correspond to the order dispatching task of the order.
Further, the apparatus further comprises: a sending module 205, configured to send the first execution result of each attribute subtask and the second execution result of each attribute subtask to the client for displaying at the client; correspondingly, the device also comprises: a receiving module 206, configured to receive modification information fed back by the client, where the modification information includes modification content of at least part of the multiple execution policies.
Further, the obtaining module 201 is further configured to obtain a corresponding expected result of each attribute subtask; correspondingly, the device also comprises: a calculating module 207, configured to calculate a difference between the first execution result and the expected result of each attribute subtask, respectively; correspondingly, the device also comprises: a generating module 208, configured to generate a prompt message based on an expected result corresponding to each attribute subtask, a first execution result of each attribute subtask, and a difference value corresponding to each attribute subtask; correspondingly, the sending module 205 is further configured to send the prompt message to the client.
Here, it should be noted that: the policy matching device provided in the above embodiment may implement the technical solutions described in the above method embodiments, and the specific implementation principle of each module or unit may refer to the corresponding content in the above method embodiments, which is not described herein again.
Fig. 3 is a schematic structural diagram of a computer device according to still another embodiment of the present application. As shown in fig. 3, the computer apparatus includes: a memory 30a and a processor 30 b; the memory 30a is used for storing computer programs.
The processor 30b is coupled to the memory 30a for executing a computer program for: acquiring a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type; pairing the plurality of attribute subtasks and the plurality of execution strategies pairwise by adopting a pairing scheme to obtain a first group of pairing results; respectively executing a plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; the execution strategy adopted by the attribute subtask in the execution is the execution strategy matched with the attribute subtask in the first group of matching results; changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies; respectively executing a plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the second group matching result; and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask.
In some optional embodiments, as shown in fig. 3, the computer device may further include: display component 30c, communication component 30d, power component 30e, audio component 30f, and the like. Only some of the components shown in fig. 3 are schematically depicted, and it is not meant that the computer device must include all of the components shown in fig. 3, nor that the computer device only includes the components shown in fig. 3.
Here, it should be noted that: the computer device provided in this embodiment may implement the technical solution described in the method embodiment described in fig. 1, and details are not described here.
Yet another embodiment of the present application provides a computer-readable storage medium storing computer instructions, which, when executed by one or more processors, cause the one or more processors to execute the policy matching method described in the embodiment of the method in fig. 1, and thus, the details are not repeated herein.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by adding a necessary general hardware platform, and of course, can also be implemented by a combination of hardware and software. With this understanding in mind, the above-described technical solutions and/or portions thereof that contribute to the prior art may be embodied in the form of a computer program product, which may be embodied on one or more computer-usable storage media having computer-usable program code embodied therein (including but not limited to disk storage, CD-ROM, optical storage, etc.).
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable coordinate determination device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable coordinate determination device, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable coordinate determination apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable coordinate determination device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer implemented process such that the instructions which execute on the computer or other programmable device provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.
Claims (10)
1. A policy matching method, comprising:
acquiring a plurality of attribute subtasks of a task type and a plurality of execution strategies corresponding to the task type;
pairwise pairing the plurality of attribute subtasks and the plurality of execution strategies by adopting a pairing scheme to obtain a first group of pairing results;
respectively executing the plurality of attribute subtasks according to the first group of matching results to obtain a first execution result of each attribute subtask; wherein, the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the first group of matching results;
changing the pairing scheme to obtain a second group of pairing results of the plurality of attribute subtasks and the plurality of execution strategies;
respectively executing the plurality of attribute subtasks based on the second group of matching results to obtain a second execution result of each attribute subtask; wherein, the execution strategy adopted when the attribute subtask is executed is the execution strategy matched with the attribute subtask in the second group matching result;
and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result of each attribute subtask and the second execution result of each attribute subtask.
2. The policy matching method according to claim 1, further comprising:
determining whether the pairing scheme is an inferior scheme or not based on a first execution result of each attribute subtask;
triggering a step of changing the pairing scheme when the determination result is yes;
and when the determination result is negative, continuously executing the plurality of attribute subtasks according to the first group of matching results respectively, and triggering the step of changing the matching scheme when the duration reaches the preset duration.
3. The policy matching method according to claim 1, wherein determining whether the pairing scheme is a poor scheme based on the first execution result of each attribute subtask comprises:
and when the first execution result of each attribute subtask is smaller than a threshold value, determining that the pairing scheme is a poor scheme.
4. The policy matching method according to claim 1, wherein said policy matching method further comprises:
determining the change times of the pairing scheme according to the corresponding quantity of the attribute subtasks and the execution strategy;
when the change times are more than two times, continuously changing the pairing scheme until the change times are reached to obtain at least one third execution result;
correspondingly, determining a corresponding execution policy for each attribute subtask of the plurality of attribute subtasks according to the first execution result and the second execution result, including:
and determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first execution result, the second execution result and at least one third execution result.
5. The policy matching method according to claim 4, wherein determining a corresponding execution policy for each of the plurality of attribute subtasks according to the first execution result and the second execution result comprises:
comparing the first execution result and the second execution result;
if the first execution result is better than the second execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the first group of matching results;
and if the second execution result is better than the first execution result, determining a corresponding execution strategy for each attribute subtask of the plurality of attribute subtasks according to the second group pairing result.
6. The policy matching method according to claim 1, wherein the task type is a dispatch type; the plurality of attribute subtasks include: and the various types of users correspond to the order dispatching task of the order.
7. The policy matching method according to claim 1, further comprising:
sending the first execution result of each attribute subtask and the second execution result of each attribute subtask to a client for displaying at the client;
and receiving modification information fed back by the client, wherein the modification information comprises modification contents aiming at least part of the execution strategies.
8. The policy matching method according to claim 1, further comprising:
acquiring a corresponding expected result of each attribute subtask;
respectively calculating the difference between the first execution result and the expected result of each attribute subtask;
generating prompt information based on expected results corresponding to the attribute subtasks, first execution results of the attribute subtasks and difference values corresponding to the attribute subtasks;
and sending the prompt information to a client.
9. A computer device, comprising: a memory and a processor; wherein the memory is used for storing a computer program; the processor is coupled to the memory for executing the computer program for performing the steps in the policy matching method of any one of claims 1-8.
10. A computer-readable storage medium storing computer instructions, which when executed by one or more processors, cause the one or more processors to perform the steps in the policy matching method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110139120.XA CN112801516A (en) | 2021-02-01 | 2021-02-01 | Policy matching method, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110139120.XA CN112801516A (en) | 2021-02-01 | 2021-02-01 | Policy matching method, computer device, and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112801516A true CN112801516A (en) | 2021-05-14 |
Family
ID=75813473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110139120.XA Pending CN112801516A (en) | 2021-02-01 | 2021-02-01 | Policy matching method, computer device, and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112801516A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101017537A (en) * | 2006-02-10 | 2007-08-15 | 刘明晶 | Method for evaluating and continuously improving executive power of team |
| CN102012911A (en) * | 2010-11-19 | 2011-04-13 | 清华大学 | Constrained optimization-based expert matching method and system |
| CN102724220A (en) * | 2011-03-29 | 2012-10-10 | 无锡物联网产业研究院 | Method and apparatus for task cooperation, and system for internet of things |
| CN107707415A (en) * | 2017-11-23 | 2018-02-16 | 成都知道创宇信息技术有限公司 | A kind of automatic monitoring of server configuration and alarm method based on SaltStack |
| CN110023969A (en) * | 2017-11-08 | 2019-07-16 | 欧洲阿菲尼帝科技有限责任公司 | For the technology of benchmark to be carried out to pairing strategy in task distribution system |
| CN110688213A (en) * | 2018-07-05 | 2020-01-14 | 深圳先进技术研究院 | Resource management method and system based on edge calculation and electronic equipment |
| CN111917818A (en) * | 2020-06-09 | 2020-11-10 | 东南大学 | Dynamic matching method for personalized service requirements |
| CN111967838A (en) * | 2020-07-16 | 2020-11-20 | 译筑信息科技（上海）有限公司 | Intelligent 4D plan management and control method based on BIM |
-
2021
- 2021-02-01 CN CN202110139120.XA patent/CN112801516A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101017537A (en) * | 2006-02-10 | 2007-08-15 | 刘明晶 | Method for evaluating and continuously improving executive power of team |
| CN102012911A (en) * | 2010-11-19 | 2011-04-13 | 清华大学 | Constrained optimization-based expert matching method and system |
| CN102724220A (en) * | 2011-03-29 | 2012-10-10 | 无锡物联网产业研究院 | Method and apparatus for task cooperation, and system for internet of things |
| CN110023969A (en) * | 2017-11-08 | 2019-07-16 | 欧洲阿菲尼帝科技有限责任公司 | For the technology of benchmark to be carried out to pairing strategy in task distribution system |
| CN107707415A (en) * | 2017-11-23 | 2018-02-16 | 成都知道创宇信息技术有限公司 | A kind of automatic monitoring of server configuration and alarm method based on SaltStack |
| CN110688213A (en) * | 2018-07-05 | 2020-01-14 | 深圳先进技术研究院 | Resource management method and system based on edge calculation and electronic equipment |
| CN111917818A (en) * | 2020-06-09 | 2020-11-10 | 东南大学 | Dynamic matching method for personalized service requirements |
| CN111967838A (en) * | 2020-07-16 | 2020-11-20 | 译筑信息科技（上海）有限公司 | Intelligent 4D plan management and control method based on BIM |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9319343B2 (en) | Modifying an assignment of nodes to roles in a computing environment | |
| EP3312787A1 (en) | Method and device for obtaining payment threshold | |
| CN107656825A (en) | Message treatment method, apparatus and system | |
| CN107196900A (en) | A kind of method and device for verification of knowing together | |
| CN107908680A (en) | Management method, electronic device and the computer-readable recording medium of wechat public platform | |
| CN109901987B (en) | Method and device for generating test data | |
| CN107276970B (en) | Unbinding and binding method and device | |
| CN111507674B (en) | Task information processing method, device and system | |
| US10579915B2 (en) | Method and device for initializing two-dimensional code | |
| CN111832883A (en) | Performance assessment system, equipment and medium | |
| CN111443894A (en) | Random number generation method, device and medium based on block chain | |
| US10552188B2 (en) | Virtual private cloud services with physical machine servers and virtual machines | |
| CN110083512A (en) | The method and device of cluster monitoring | |
| CN107295052A (en) | A kind of method for processing business and device | |
| CN112801516A (en) | Policy matching method, computer device, and storage medium | |
| CN107391541A (en) | A kind of real time data merging method and device | |
| Tiwari et al. | A Broking Structure Originated on Service accommodative Using MROSP Algorithm | |
| CN109639672A (en) | The method and system for preventing Replay Attack based on JWT data | |
| CN113342526B (en) | Dynamic management and control method, system, terminal and medium for cloud computing mobile network resources | |
| CN112416488B (en) | User portrait implementing method, device, computer equipment and computer readable storage medium | |
| CN107122303B (en) | Test method and device | |
| CN112953993A (en) | Resource scheduling method, device, network system and storage medium | |
| CN111861047A (en) | Data processing control method and computing device | |
| CN111198846A (en) | Data exchange method and device based on block chain | |
| CN109461088A (en) | A kind of point single method, apparatus, medium and electronic equipment for saving work order from damage |
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 |