CN110634046A - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN110634046A CN110634046A CN201910810726.4A CN201910810726A CN110634046A CN 110634046 A CN110634046 A CN 110634046A CN 201910810726 A CN201910810726 A CN 201910810726A CN 110634046 A CN110634046 A CN 110634046A
- Authority
- CN
- China
- Prior art keywords
- task
- target task
- object type
- determining
- target
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 23
- 238000012545 processing Methods 0.000 claims description 13
- 238000001514 detection method Methods 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005034 decoration Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000000605 extraction Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011176 pooling Methods 0.000 description 1
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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0605—Supply or demand aggregation
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0621—Item configuration or customization
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Tourism & Hospitality (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a data processing method and device. Wherein, the method comprises the following steps: determining a target task from tasks in a task pool, wherein the tasks in the task pool are to-be-distributed tasks, and the target task is a task with waiting time exceeding preset time; matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task; and determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task. The invention solves the technical problem of higher pressure of the order dispatching system for taxi taking application in the related technology.
Description
Technical Field
The present invention relates to the field of data processing, and in particular, to a method and an apparatus for processing data.
Background
Taxi taking or taxi appointment through application software becomes a common taxi calling mode for people. Fig. 1 is a schematic diagram of a prior art taxi taking application system for dispatching a taxi taking order. Referring to fig. 1, a user inputs a starting point and an ending point to inquire price, selects a vehicle type from vehicle types recommended by a system to place an order, and then the user's order enters an order pool to wait for order dispatching. And after the appointed time is up, if no drivers meeting the conditions exist, canceling the order, if drivers meeting the conditions are found in the appointed time, adding the drivers meeting the conditions into a driver pool for screening, and finally dispatching the order to one driver screened in the driver pool, thereby finishing the order dispatching process.
However, in the peak time of using the vehicle, the situation that no available driver can cancel the order often occurs, so that the user needs to make an order again to call the vehicle continuously, that is, the processes of inquiring price, recommending the vehicle type and making an order are repeated, further inconvenience is brought to the user, and the repeated order cancellation and order placement also bring more burden to the system.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the invention provides a data processing method and device, which at least solve the technical problem that the pressure of a dispatching system for taxi taking application in the related technology is high.
According to an aspect of an embodiment of the present invention, there is provided a data processing method, including: determining a target task from tasks in a task pool, wherein the tasks in the task pool are to-be-distributed tasks, and the target task is a task with waiting time exceeding preset time; matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task; and determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task.
Further, detecting the waiting time of the tasks in the data pool; and determining the task with the waiting time exceeding the preset time as a target task.
Further, task parameters corresponding to the target task are obtained, wherein the task parameters comprise virtual resource values corresponding to the target task obtained through prediction; acquiring push parameters, wherein the push parameters comprise push quantity and variation coefficients of virtual resources; a first object type is determined based on the task parameters and the push parameters.
Further, determining a virtual resource range according to the virtual resource value and the variation coefficient of the virtual resource; predicting a virtual resource value required by the object type allowed to be pushed in executing the target task; determining an object type of which the virtual resource value required by the execution of the target task falls in a virtual resource range as a candidate object type; and extracting a specified number of object types from the candidate object types as a first object type, wherein the specified number is the pushing number.
Further, a first object type is pushed to a target terminal, and selection information returned by the terminal is received; the first object type and the second object type selected based on the selection information are to-be-dispatched objects of the target task.
According to an aspect of an embodiment of the present invention, there is provided a data processing apparatus including: the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining a target task from tasks in a task pool, the tasks in the task pool are to-be-allocated tasks, and the target task is a task with waiting time exceeding preset time; the matching module is used for matching a first object type of an object allowing the target task to be executed for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task; and the second module is used for determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task.
Further, the first determining module includes: the detection submodule is used for detecting the waiting time of the tasks in the data pool; and the first determining submodule is used for determining the task with the waiting time exceeding the preset time as the target task.
Further, the matching module comprises: the first obtaining submodule is used for obtaining task parameters corresponding to the target task, wherein the task parameters comprise virtual resource values corresponding to the target task obtained through prediction; the second obtaining submodule is used for obtaining pushing parameters, wherein the pushing parameters comprise pushing quantity and variation coefficients of virtual resources; and the second determining submodule is used for determining the first object type according to the task parameters and the pushing parameters.
According to an aspect of the embodiments of the present invention, there is provided a storage medium including a stored program, wherein, when the program runs, a device on which the storage medium is located is controlled to execute the above-mentioned data processing method.
According to an aspect of the embodiments of the present invention, there is provided a processor, configured to execute a program, where the program executes a processing method of the data.
In the embodiment of the invention, a target task is determined from tasks in a task pool, wherein the tasks in the task pool are to-be-distributed tasks, and the target task is a task with waiting time exceeding preset time; matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task; and determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task. When the scheme is applied to taxi taking, orders which are in the state of no driver taking order and meet a certain time condition can be pushed in the generated orders to be selected by a user according with the expected supplier vehicle type, after the user selects a newly-added vehicle type, more vehicle types can be added on the basis of the orders, and a vehicle dispatching polling pool is added, so that under the condition that the user does not cancel the original order, other supplier vehicle types are added, the taxi taking rate of the user is greatly improved, the waiting time is reduced, the user experience is improved, and the technical problem that the pressure of a dispatching system for taxi taking application in the related technology is high is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
FIG. 1 is a schematic diagram of a prior art taxi-taking application system dispatching a taxi-taking order;
FIG. 2 is a flow chart of a method of processing data according to an embodiment of the invention;
FIG. 3 is a schematic diagram of a first process of a user order according to an embodiment of the invention; and
fig. 4 is a schematic diagram of a data processing apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, 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 invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
In accordance with an embodiment of the present invention, there is provided an embodiment of a method for processing data, it being noted that the steps illustrated in the flowchart of the figure may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowchart, in some cases, the steps illustrated or described may be performed in an order different than that presented herein.
Fig. 2 is a flowchart of a data processing method according to an embodiment of the present invention, and as shown in fig. 2, the method includes the following steps:
step S202, determining a target task from tasks in a task pool, wherein the tasks in the task pool are to-be-distributed tasks, and the target task is a task with waiting time exceeding preset time.
Specifically, the task pool may be a storage queue for storing tasks to be allocated, or a database. The target task determined in the above steps is the task for which the first object type needs to be matched. After the task enters the task pool, the task waits for the distribution of the system according to the sequence, timing is started when the task enters the task pool, and after the preset time, if the task is not distributed yet, the task is determined to be the target task.
The task carries the condition of the task execution object, and the reason why the task is still not allocated after the preset time can be that the system does not find the object which meets the task execution condition within the preset time.
In an alternative embodiment, taking the taxi taking system as an example, the user inquires the price through the terminal, and completes the order placing process after selecting the vehicle type in the vehicle types recommended by the system. The order enters the order pool of the system. The system may traverse the tasks in the order pool in a 5s period to determine the target task therefrom.
The vehicle model in the above embodiment may be a brand of the vehicle, a price zone to which a price of the vehicle belongs, a service type of the vehicle (car pooling, car renting, individual car placing, etc.), or the like.
And step S204, matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task.
Specifically, the object type is a condition of the object for executing the target task. The target task has a preset second object type, and the object type can be an object type carried by the task issuing process.
In an optional embodiment, still taking the taxi taking system as an example, for an order which is not dispatched at the preset time, the system can provide a function of recommending a new vehicle type for the order which is not dispatched at the preset time by matching the first object type with the target task, that is, a vehicle type different from the vehicle type selected by the user when the user places a taxi is recommended for the user, so as to improve the taxi application rate.
Step S206, determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task.
Specifically, the object to be dispatched of the target task is an object of a first object type or an object of a second object type. After the system determines the objects to be dispatched, the system dispatches the target task to one of the objects to be dispatched according to preset dispatching logic.
After the system matches the first object type corresponding to the task for the task, the object to be served is determined based on the second object type and the first object type.
In the embodiment of the application, a target task is determined from tasks in a task pool, wherein the tasks in the task pool are to-be-allocated tasks, and the target task is a task with waiting time exceeding preset time; matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task; and determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task. When the scheme is applied to taxi taking, orders which are in the state of no driver taking order and meet a certain time condition can be pushed in the generated orders to be selected by a user according with the expected supplier vehicle type, after the user selects a newly-added vehicle type, more vehicle types can be added on the basis of the orders, and a vehicle dispatching polling pool is added, so that under the condition that the user does not cancel the original order, other supplier vehicle types are added, the taxi taking rate of the user is greatly improved, the waiting time is reduced, the user experience is improved, and the technical problem that the pressure of a dispatching system for taxi taking application in the related technology is high is solved.
As an alternative embodiment, the determining the target task from the tasks in the task pool includes: detecting the waiting time of tasks in the data pool; and determining the task with the waiting time exceeding the preset time as a target task.
In an optional embodiment, the preset time may be a preset waiting time, for example, the waiting time morevendrorecomamendedwaitime configured in the Qconfig may be read first, the task 5s is timed to perform polling once, after it is found that a time difference from placing an order to the current time is greater than the morevendrorecomamendedwaitime, the task corresponding to the order is determined to be a target task, and the function of the recommended vehicle type is started, that is, the steps corresponding to the steps 104 to 106 are performed.
As an alternative embodiment, matching a first object type of an object allowed to execute the target task for the target task includes: acquiring task parameters corresponding to a target task, wherein the task parameters comprise virtual resource values corresponding to the target task which are obtained through prediction; acquiring push parameters, wherein the push parameters comprise push quantity and variation coefficients of virtual resources; a first object type is determined based on the task parameters and the push parameters.
Specifically, the virtual resource value corresponding to the target task is used to indicate the cost that needs to be paid by the user for completing the order, the variation coefficient of the virtual resource is used to indicate the fluctuation of the price that the user is willing to accept when recommending a new object type to the user, and the value may be set by the user or may be a default value.
After the virtual resource corresponding to the target task is obtained, the range of the virtual resource can be obtained together with the variation coefficient of the virtual resource, so that the range of the virtual resource can be used for determining the first object type recommended by the user.
As an alternative embodiment, determining the first object type according to the task parameter and the push parameter includes: determining a virtual resource range according to the virtual resource value and the variation coefficient of the virtual resource; predicting a virtual resource value required by the object type allowed to be pushed in executing the target task; determining an object type of which the virtual resource value required by the execution of the target task falls in a virtual resource range as a candidate object type; and extracting a specified number of object types from the candidate object types as a first object type, wherein the specified number is the pushing number.
Specifically, the variation coefficient of the virtual resource may be a range, for example (0.8 to 1.2), and the first object type may be obtained by obtaining a virtual resource range from the variation coefficient and a virtual resource value corresponding to the task itself, and determining N object types capable of falling within the virtual resource range, where N is used to indicate the number of pushes in the push parameter.
In an alternative embodiment, still taking the taxi taking system as an example, if the amount predicted when the user initially places the order is 35 yuan, the variation coefficient of the virtual resource is (0.8-1.2), and the range of the virtual resource is (28, 45.6), in the above step, when the destination set by the user is reached, the vehicle type with the estimated cost between (28, 45.6) is searched, and N is selected as the first object type, where N still represents the push quantity in the push parameters.
As an alternative embodiment, determining the object to be served of the target task based on the first object type and the second object type includes: pushing a first object type to a target terminal, and receiving selection information returned by the terminal; and determining the object to be served of the target task based on the first object type and the second object type selected by the selection information.
The target terminal can be a mobile terminal used when a user places an order, the system returns information of the first object type to the target terminal of the user after the first object type is determined, the user can select one or more of the first object types, and the system determines the object to be dispatched according to the selection of the user and the second object type when the user initially places the order.
In an alternative embodiment, still taking the taxi taking system as an example, the mobile terminal of the user displays the vehicle type (the first object type) pushed by the system, and after the user selects one of the vehicle types, the system searches for a matched vehicle according to the vehicle type selected when the user initially places an order and the selected new vehicle type.
Fig. 3 is a schematic diagram of processing a user order according to an embodiment of the present invention, and in conjunction with fig. 3, after price inquiry, vehicle type recommendation, placing an order, and waiting, if no driver takes an order, the following steps are performed:
s31, reading the waiting time moreVendorRecommendadWaitTime configured in the Qconfig, and starting the function of the recommended vehicle model after the timing task 5S polls for one time and finds that the time difference from order placing to current time is greater than the moreVendorRecommendadWaitTime.
And S32, reading the pre-evaluation of the order in the database by the function of the recommended vehicle type, and acquiring the price range coefficient priceDiffRatio and the recommended vehicle type number recommendVendorNum of the recommended vehicle type from Qconfig.
Specifically, the pre-evaluation of the order in the database is a virtual resource value corresponding to the target task, the price range coefficient priceDiffRatio is a variation coefficient of the virtual resource, and the recommended vehicle model number recommendVendorNum is a push quantity.
And S33, after the price range is calculated, vehicle types meeting the conditions are screened from the currently accessed suppliers and are added into the inquiry pool to be recommended to the user for selection.
And S34, after the user selects the vehicle type to be added, adding the selected vehicle type into the vehicle type pool where the current order is located, waiting for the system to pull the latest driver capacity and screening.
After step S34, the order is continued and waiting for available drivers, and if there is no available driver after a preset time, the order is cancelled, and if there is an available driver, the available driver is added to the driver screening pool and assigned based on preset logic, so that the order process ends.
Example 2
According to an embodiment of the present invention, there is provided an embodiment of a data processing apparatus, and fig. 4 is a schematic diagram of a data processing apparatus according to an embodiment of the present invention, as shown in fig. 4, the apparatus includes:
the first determining module 42 is configured to determine a target task from tasks in a task pool, where the tasks in the task pool are to-be-allocated tasks, and the target task is a task whose waiting time exceeds a preset time.
And the matching module 44 is used for matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task.
A second determining module 46, configured to determine an object to be served of the target task based on the first object type and the second object type, where the object to be served is used for receiving the target task.
As an alternative embodiment, the first determining module includes: the detection submodule is used for detecting the waiting time of the tasks in the data pool; and the first determining submodule is used for determining the task with the waiting time exceeding the preset time as the target task.
As an alternative embodiment, the matching module comprises: the first obtaining submodule is used for obtaining task parameters corresponding to the target task, wherein the task parameters comprise virtual resource values corresponding to the target task obtained through prediction; the second obtaining submodule is used for obtaining pushing parameters, wherein the pushing parameters comprise pushing quantity and variation coefficients of virtual resources; and the second determining submodule is used for determining the first object type according to the task parameters and the pushing parameters.
As an alternative embodiment, the second determination submodule includes: a first determining unit, configured to determine a virtual resource range according to the virtual resource value and the variation coefficient of the virtual resource; the prediction unit is used for predicting a virtual resource value required by the object type allowed to be pushed in the target task execution process; the second determining unit is used for determining the object type of which the virtual resource value required by the execution of the target task falls in the virtual resource range as a candidate object type; and the extraction unit is used for extracting a specified number of object types from the candidate object types as a first object type, wherein the specified number is a push number.
As an alternative embodiment, the second determining module includes: the receiving submodule is used for pushing the first object type to the target terminal and receiving the selection information returned by the terminal; and the third determining submodule is used for determining the object to be served of the target task based on the first object type and the second object type selected by the selection information.
Example 3
According to an embodiment of the present invention, there is provided a storage medium including a stored program, wherein, when the program runs, a device in which the storage medium is located is controlled to execute the data processing method described in embodiment 1.
Example 4
According to an embodiment of the present invention, there is provided a processor configured to run a program, where the program executes the data processing method according to embodiment 1 when running.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
In the above embodiments of the present invention, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units may be a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
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 units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.
Claims (10)
1. A method for processing data, comprising:
determining a target task from tasks in a task pool, wherein the tasks in the task pool are to-be-distributed tasks, and the target task is a task with waiting time exceeding preset time;
matching a first object type of an object which is allowed to execute the target task for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task;
determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task.
2. The method of claim 1, wherein determining a target task from the tasks of the task pool comprises:
detecting the waiting time of tasks in the data pool;
and determining the task with the waiting time exceeding the preset time as the target task.
3. The method of claim 1, wherein matching the target task with a first object type of an object allowed to perform the target task comprises:
acquiring task parameters corresponding to the target task, wherein the task parameters comprise a virtual resource value corresponding to the target task, which is obtained through prediction;
acquiring push parameters, wherein the push parameters comprise push quantity and variation coefficients of virtual resources;
and determining the first object type according to the task parameters and the pushing parameters.
4. The method of claim 3, wherein determining the first object type from the task parameters and the push parameters comprises:
determining a virtual resource range according to the virtual resource value and the variation coefficient of the virtual resource;
predicting a virtual resource value required by the object type allowed to be pushed in executing the target task;
determining the object type of which the virtual resource value required by the target task is in the virtual resource range as a candidate object type;
and extracting a specified number of object types from the candidate object types as the first object type, wherein the specified number is the pushing number.
5. The method of claim 3, wherein determining the object to be served for the target task based on the first object type and the second object type comprises:
pushing the first object type to a target terminal, and receiving selection information returned by the terminal;
determining an object to be served of the target task based on the first object type and the second object type selected by the selection information.
6. An apparatus for processing data, comprising:
the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining a target task from tasks in a task pool, the tasks in the task pool are to-be-allocated tasks, and the target task is a task with waiting time exceeding preset time;
the matching module is used for matching a first object type of an object which allows the target task to be executed for the target task, wherein the first object type is different from a second object type of a task execution object preset by the target task;
and the second determining module is used for determining an object to be served of the target task based on the first object type and the second object type, wherein the object to be served is used for receiving the target task.
7. The apparatus of claim 6, wherein the first determining module comprises:
the detection submodule is used for detecting the waiting time of the tasks in the data pool;
and the first determining submodule is used for determining the task with the waiting time exceeding the preset time as the target task.
8. The apparatus of claim 6, wherein the matching module comprises:
the first obtaining submodule is used for obtaining task parameters corresponding to the target task, wherein the task parameters comprise virtual resource values corresponding to the target task, which are obtained through prediction;
the second obtaining submodule is used for obtaining push parameters, wherein the push parameters comprise push quantity and variation coefficients of virtual resources;
and the second determining submodule is used for determining the first object type according to the task parameters and the pushing parameters.
9. A storage medium, characterized in that the storage medium comprises a stored program, wherein when the program runs, a device where the storage medium is located is controlled to execute the data processing method of any one of claims 1 to 5.
10. A processor, characterized in that the processor is configured to run a program, wherein the program is configured to execute a method for processing data according to any one of claims 1 to 5 when the program is run.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910810726.4A CN110634046A (en) | 2019-08-29 | 2019-08-29 | Data processing method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910810726.4A CN110634046A (en) | 2019-08-29 | 2019-08-29 | Data processing method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110634046A true CN110634046A (en) | 2019-12-31 |
Family
ID=68969426
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910810726.4A Pending CN110634046A (en) | 2019-08-29 | 2019-08-29 | Data processing method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110634046A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111860930A (en) * | 2020-03-30 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Data processing method and device, electronic equipment and computer readable storage medium |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150213512A1 (en) * | 2008-09-08 | 2015-07-30 | Invoca, Inc. | Methods and systems for routing calls in a marketing campaign |
US20160012368A1 (en) * | 2014-07-14 | 2016-01-14 | Rocket Lawyer Incorporated | Real-Time User Interface for Prioritized Professional Work Queue |
CN105761482A (en) * | 2016-05-10 | 2016-07-13 | 北京交通大学 | Taxi real-time appointing method and system based on fairness |
CN108009657A (en) * | 2017-08-16 | 2018-05-08 | 北京嘀嘀无限科技发展有限公司 | Net about car order processing method, system, terminal and server |
CN109034455A (en) * | 2018-06-28 | 2018-12-18 | 清华大学 | With vehicle dispatching method, system, server and computer readable storage medium |
CN110163456A (en) * | 2018-02-13 | 2019-08-23 | 北京嘀嘀无限科技发展有限公司 | Divide single method, apparatus, server and medium |
CN110175869A (en) * | 2019-05-08 | 2019-08-27 | 北京三快在线科技有限公司 | Vehicle allocation method and device, electronic equipment and computer readable storage medium |
-
2019
- 2019-08-29 CN CN201910810726.4A patent/CN110634046A/en active Pending
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150213512A1 (en) * | 2008-09-08 | 2015-07-30 | Invoca, Inc. | Methods and systems for routing calls in a marketing campaign |
US20160012368A1 (en) * | 2014-07-14 | 2016-01-14 | Rocket Lawyer Incorporated | Real-Time User Interface for Prioritized Professional Work Queue |
CN105761482A (en) * | 2016-05-10 | 2016-07-13 | 北京交通大学 | Taxi real-time appointing method and system based on fairness |
CN108009657A (en) * | 2017-08-16 | 2018-05-08 | 北京嘀嘀无限科技发展有限公司 | Net about car order processing method, system, terminal and server |
CN110163456A (en) * | 2018-02-13 | 2019-08-23 | 北京嘀嘀无限科技发展有限公司 | Divide single method, apparatus, server and medium |
CN109034455A (en) * | 2018-06-28 | 2018-12-18 | 清华大学 | With vehicle dispatching method, system, server and computer readable storage medium |
CN110175869A (en) * | 2019-05-08 | 2019-08-27 | 北京三快在线科技有限公司 | Vehicle allocation method and device, electronic equipment and computer readable storage medium |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111860930A (en) * | 2020-03-30 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Data processing method and device, electronic equipment and computer readable storage medium |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108416649A (en) | Search result ordering method, device, electronic equipment and storage medium | |
CN107180371A (en) | The method and system of commodity is bought using reward voucher | |
CN108399460B (en) | Network taxi booking order distribution processing method and server | |
CN110471963B (en) | Data processing method, device and storage medium | |
CN108090645A (en) | For the method and device of coordination service resource | |
JP2023508172A (en) | Resource allocation method, device, facility, storage medium and computer program | |
CN113450002A (en) | Task allocation method and device, electronic equipment and storage medium | |
CN109829098A (en) | Search result optimization method, device and server | |
CN112637024A (en) | Control method, control device, electronic equipment and storage medium | |
KR20230018993A (en) | Method for providing information and electric device using the same | |
CN110634046A (en) | Data processing method and device | |
CN114581174A (en) | Recommendation method and device, electronic equipment and storage medium | |
CN113888229A (en) | Store data processing and order processing method and device | |
US11556883B2 (en) | Cached data representations for service schedule availability | |
CN110389817A (en) | Dispatching method, device and the computer program product of cloudy system | |
CN111753386B (en) | Data processing method and device | |
CN110473016A (en) | Data processing method, device and storage medium | |
CN116432924A (en) | Shopping guide scheduling method and device | |
CN114677198A (en) | Sheet splitting method and device, storage medium and electronic equipment | |
CN114386708A (en) | Method and system for predicting door store passenger flow | |
Çavdar et al. | Capacity allocation in a service system with preferred service completion times | |
CN113762819A (en) | Channel scheduling method and device | |
CN112149978A (en) | Order distribution method and device, electronic equipment and storage medium | |
CN112053087A (en) | Complaint work order processing method, device, equipment and storage medium | |
CN113705850A (en) | Order distribution method and device, readable storage medium and electronic equipment |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191231 |
|
RJ01 | Rejection of invention patent application after publication |