CN112598447B - Order information processing method and device, electronic equipment and processor - Google Patents

Order information processing method and device, electronic equipment and processor Download PDF

Info

Publication number
CN112598447B
CN112598447B CN202011589303.3A CN202011589303A CN112598447B CN 112598447 B CN112598447 B CN 112598447B CN 202011589303 A CN202011589303 A CN 202011589303A CN 112598447 B CN112598447 B CN 112598447B
Authority
CN
China
Prior art keywords
order
target
budget
amount
information
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.)
Active
Application number
CN202011589303.3A
Other languages
Chinese (zh)
Other versions
CN112598447A (en
Inventor
杨康
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Addnewer Corp
Original Assignee
Addnewer Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Addnewer Corp filed Critical Addnewer Corp
Priority to CN202011589303.3A priority Critical patent/CN112598447B/en
Publication of CN112598447A publication Critical patent/CN112598447A/en
Application granted granted Critical
Publication of CN112598447B publication Critical patent/CN112598447B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0249Advertisements based upon budgets or funds
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0251Targeted advertisements
    • G06Q30/0269Targeted advertisements based on user profile or attribute
    • G06Q30/0271Personalized advertisement
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0277Online advertisement
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635Processing of requisition or of purchase orders

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Engineering & Computer Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application discloses a method and a device for processing order information, a nonvolatile storage medium and a processor. Wherein the method comprises the following steps: receiving a push request sent by a media side, wherein the push request comprises: an order set of self-media information to be pushed; sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; and adjusting the arrangement period of the target order based on the order amount floating value of the target order. The application solves the technical problems of inaccurate scheduling of the advertisement putting orders and lower order processing efficiency in the prior art.

Description

Order information processing method and device, electronic equipment and processor
Technical Field
The present application relates to the field of information processing, and in particular, to a method and apparatus for processing order information, a nonvolatile storage medium, and a processor.
Background
In the related art, each self-media is generally a fixed budget preset by knowing the media flow and the customer purchasing population in advance and according to the result of the knowing, before advertising.
Because the budget is fixed, sometimes, the exposure target cannot be completed frequently due to the pushing amount of part of the media advertisement positions, and some media advertisement positions with more proper flow are not continuously received after reaching the upper limit of the arrangement period. Resulting in situations where the completion rate of the whole wave activity is not high, or where the budget is not spent at a given time.
In view of the above problems, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the application provides a processing method and device of order information, a nonvolatile storage medium and a processor, which are used for at least solving the technical problems of inaccurate order arrangement period and lower order processing efficiency of advertisement delivery in the prior art.
According to an aspect of the embodiment of the present application, there is provided a method for processing order information, including: receiving a push request sent by a media side, wherein the push request comprises: an order set of self-media information to be pushed; sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; and adjusting the arrangement period of the target order based on the order amount floating value of the target order.
Optionally, screening the target order with the highest priority from the order set includes: acquiring a first group of orders in which the order budget exceeds a lower limit interval in the order set, and a second group of orders in which the order budget does not exceed the lower limit interval; acquiring a first residual amount of the order budget of the first group of orders and a second residual amount of the order budget of the second group of orders; and if the total residual quantity of the first residual quantity and the second residual quantity exceeds a threshold value, acquiring an order with the highest order priority in the order set as the target order.
Optionally, if the total remaining amount of the first remaining amount and the second remaining amount does not exceed a threshold value, the push request is returned.
Optionally, adjusting the scheduling of the target order based on the order amount float value of the target order includes: acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order; if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the arrangement period of the target order is regulated to be high; otherwise, the scheduling of the target order is regulated down.
Optionally, after adjusting the scheduling of the target order based on the order amount float value of the target order, the method further includes: removing the target orders with the arrangement adjusted from the order set to generate a residual order set; wherein the target order is a first order in the order set; returning to continuously and sequentially reading order information of each order in the rest order sets; and acquiring an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of which needs to be adjusted.
According to another aspect of the embodiment of the present application, there is also provided an apparatus for processing order information, including: the receiving module is configured to receive a push request sent by a media side, where the push request includes: an order set of self-media information to be pushed; the reading module is used for sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; the screening module is used for screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; and the adjustment module is used for adjusting the arrangement period of the target order based on the order amount floating value of the target order.
Optionally, the screening module includes: the first sub-acquisition module is used for acquiring a first group of orders with the order budget exceeding a lower limit interval in the order set and a second group of orders with the order budget not exceeding the lower limit interval; a second sub-acquiring module, configured to acquire a first remaining amount of an order budget of the first group of orders and a second remaining amount of the order budget of the second group of orders; and the third sub-acquisition module is used for acquiring an order with the highest order priority in the order set as the target order if the total residual quantity of the first residual quantity and the second residual quantity exceeds a threshold value.
Optionally, the screening module further includes: and the returning module is used for returning the push request if the total residual quantity of the first residual quantity and the second residual quantity does not exceed a threshold value.
Optionally, the adjusting module includes: a third sub-acquiring module, configured to acquire the order payment status of the target order and an upper limit difference value of the target order, where an order amount floating value of the target order determines the upper limit difference value; the heightening module is used for heightening the arrangement period of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value; and the lowering module is used for lowering the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference value.
Optionally, the apparatus further includes: the generation module is used for removing the target orders with the arrangement periods adjusted from the order set and generating a residual order set; wherein the target order is a first order in the order set; the return module is used for returning to continuously and sequentially read the order information of each order in the rest order set; the obtaining module is used for obtaining an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of the order needs to be adjusted.
According to another aspect of the embodiments of the present application, there is also provided a nonvolatile storage medium storing a plurality of instructions adapted to be loaded by a processor and to perform the method of processing order information of any one of the above.
According to another aspect of the embodiment of the present application, there is also provided a processor for running a program, where the program is configured to execute any one of the order information processing methods when running.
According to another aspect of the embodiment of the present application, there is also provided an electronic device including a memory, in which a computer program is stored, and a processor configured to run the computer program to perform the method of processing order information described in any one of the above.
In the embodiment of the application, a push request sent by a media side is received, wherein the push request comprises: an order set of self-media information to be pushed; sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; based on the order amount floating value of the target order, the arrangement period of the target order is adjusted, so that the aim of improving the arrangement period accuracy of the advertisement putting order is fulfilled, the technical effect of improving the order processing efficiency is achieved, and the technical problems of inaccurate arrangement period and lower order processing efficiency of the advertisement putting order in the prior art are solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:
FIG. 1 is a flow chart of a method of processing order information according to an embodiment of the present application;
FIG. 2 is a flow chart of an alternative method of processing order information according to an embodiment of the application;
fig. 3 is a schematic diagram of an order information processing apparatus according to an embodiment of the present application.
Detailed Description
In order that those skilled in the art will better understand the present application, a technical solution in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, shall fall within the scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the application described herein may be implemented in sequences other than those illustrated or otherwise described herein. 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
According to an embodiment of the present application, there is provided an embodiment of a method of processing order information, it being noted that the steps shown in the flowcharts of the figures may be performed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowcharts, in some cases the steps shown or described may be performed in an order different from that herein.
Fig. 1 is a flowchart of a method for processing order information according to an embodiment of the present application, as shown in fig. 1, the method includes the steps of:
step S102, receiving a push request sent by a media side, wherein the push request comprises: an order set of self-media information to be pushed;
step S104, sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount;
step S106, screening out the target orders with highest priority from the order set, wherein the target orders represent self-media information with highest scheduling priority;
step S108, adjusting the arrangement period of the target order based on the order amount floating value of the target order.
In the embodiment of the application, a push request sent by a media side is received, wherein the push request comprises: an order set of self-media information to be pushed; sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; based on the order amount floating value of the target order, the arrangement period of the target order is adjusted, so that the aim of improving the arrangement period accuracy of the advertisement putting order is fulfilled, the technical effect of improving the order processing efficiency is achieved, and the technical problems of inaccurate arrangement period and lower order processing efficiency of the advertisement putting order in the prior art are solved.
In the embodiment of the application, the floating value of the order amount means that budget allocation automatically floats between media according to percentages, more pushing flow is met, budget can be allocated to multiple agents, floating is calculated until the preset floating value is reached, and only the floating value of the budget can be received due to less flow, namely, the budget allocation automatically floats between the media according to percentages, and the total budget is unchanged.
Optionally, in the embodiment of the present application, the total budget is obtained by relying on the CPM amount purchased by each media CPM price from the media client, and after controlling the total budget, the automatic float value of each media budget=the CPM amount of each media CPM price (1 +/-setting the float percentage).
In the embodiment of the application, the cost of each media is calculated according to the following algorithm by setting CPM of each self-media, setting price and floating percentage for 5 minutes, and the amount of more proper media is removed by a 1+ floating value, and the amount of less media is removed by a 1-lower floating value until the budget is spent.
According to the embodiment of the application, the budget allocation automatically floats among media according to the percentage, so that the budget is better and reasonably allocated, and the problem that the fixed budget does not take place in the appointed time can be solved; budget allocation automatically floats between media by percentage, floating itself without exceeding the total budget.
As an alternative embodiment, assume that a certain impression campaign contains orders as shown in Table 1 below:
TABLE 1
Order form Current state of Advertisement space monovalent ordering (from high to low) Original scheduling budget Upper float value Lower float value Current cost
Order 1 Spending has reached an upper limit 1 A1 B1 C1 D1
Order 2 Spending has exceeded the lower limit 2 A2 B2 C2 D2
Order 3 Spending has exceeded the lower limit 3 A3 B3 C3 D3
Order 4 The cost does not exceed the lower limit 4 A4 B4 C4 D4
Order 5 The cost does not exceed the lower limit 5 A5 B5 C5 D5
Wherein, the advertisement space unit price: refers to the unit price of a certain ad spot of a certain media in a certain billing way.
Original scheduling budget: refers to the initial budget spending that a certain impression campaign sets for each order contained when initially created.
Upper float value: refers to the proportion of spending that is allowed to exceed the original scheduling budget for each order that is included when a delivery campaign is initially created.
Lower float value: refers to the proportion of spending that is allowed to be below the original scheduling budget for each order that is included when a delivery campaign is initially created.
Current cost: meaning that each order contained in a impression is spent in real-time for a particular impression campaign.
Current state: refers to the magnitude relationship between the difference between the current cost and the original scheduling budget and the floating up and down values.
In an alternative embodiment, screening the target order with the highest priority from the order set includes:
step S202, a first group of orders with the order budget exceeding a lower limit interval in the order set and a second group of orders with the order budget not exceeding the lower limit interval are obtained;
step S204, obtaining a first residual amount of the order budget of the first group of orders and a second residual amount of the order budget of the second group of orders;
in step S206, if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold, the order with the highest order priority in the order set is obtained as the target order.
In an alternative embodiment, the push request is retracted if the total of the first and second residuals does not exceed a threshold.
In the embodiment of the present application, as shown in fig. 2, first, it is determined whether all the order spending exceeds the lower limit, and if the lower limit has been exceeded, the remaining allocable budget and X of the order whose budget exceeds the lower limit are calculated in the following manner: remaining allocable budgets of orders that have exceeded the lower limit and = original scheduling budgets of orders-current cost, i.e. x= (A1-D1) + (A2-D2) + (A3-D3); if the lower limit is not exceeded, calculating the residual allocable budget and Y of the order with the budget not exceeding the lower limit in the following calculation mode: the remaining allocable budgets of orders that do not exceed the lower limit and = the original scheduling budgets of each order float value, i.e. y= (a4×c4) + (a5×c5).
In an alternative embodiment, adjusting the scheduling of the target order based on the order amount float value of the target order includes:
step S302, obtaining the order payment state of the target order and an upper limit value of the target order, wherein the order amount floating value of the target order determines the upper limit value;
step S304, if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the arrangement period of the target order is regulated to be high;
step S306, otherwise, the arrangement period of the target order is regulated down.
In the embodiment of the present application, as shown in fig. 2, by determining whether the sum of the remaining allocatable budgets of the orders exceeding the lower limit and the sum of the remaining allocatable budgets of the orders not exceeding the lower limit is equal to or greater than the upper limit of the order taking amount, i.e. Z < = x+y. If so, the new order schedule is set to A (1+B) and the value of X+Y is refreshed to X+Y-Z. Judging whether the next order exists according to the unit price ordering of the advertising positions, if so, returning to execute the first order selected in the previous step, and judging whether the cost of the first order reaches the lower limit, otherwise, ending; if not, the order new schedule is set to D+X+Y, and the remaining order new schedules are set to A (1-C), ending.
In an alternative embodiment, after adjusting the scheduling of the target order based on the order amount float value of the target order, the method further comprises:
step S402, removing the target orders with the arrangement periods adjusted from the order set to generate a residual order set; wherein the target order is a first order in the order set;
step S404, returning to continue to sequentially read the order information of each order in the rest order set;
step S406, obtaining an order with the highest order priority from the rest order set, and obtaining a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority needs to be adjusted.
In the embodiment of the application, if it is determined whether the sum of the remaining allocatable budget sum of the orders exceeding the lower limit and the remaining allocatable budget sum of the orders not exceeding the lower limit is less than or equal to 0, that is, x+y < = 0. If x+y < = 0, directly returning the traffic (i.e. when the media side sends the advertisement request, it is not received and processed, directly returned); if X+Y >0, the first order is selected according to the ad spot monovalent ranking.
As an alternative embodiment, by judging whether the cost of the first order selected in the previous step has reached the lower limit, if the cost of the first order has not reached the lower limit, setting the new order arrangement to be A (1-C), judging whether the next order exists according to the unit price ordering of the advertisement positions, if so, repeatedly executing the judgment of whether the cost of the first order selected in the previous step has reached the lower limit, otherwise, ending, and if the cost of the first order has reached the lower limit, entering the judgment of whether the order has reached the upper limit.
In the embodiment of the application, judging whether the order reaches the upper limit, if so, setting the new order arrangement period as A (1+B), judging whether the next order exists according to the unit price arrangement of the advertisement positions, if so, returning to execute the first order selected in the last step, and if not, ending; if the upper limit is not reached, calculating the upper limit value Z of the order quantity, wherein the calculation mode is as follows: upper order limit difference = order original scheduling budget × (1 + upper float) -current cost, i.e. Z = a × (1+B) -D.
As an alternative embodiment, the following is described taking a certain delivery activity setting as an example:
as shown in Table 2 below, the present impression campaign contains 5 orders, D1, D2, D3, D4, D5, with original scheduling budgets (i.e., budgets in the upper graph) of 1000, 4000, 9000, 16000, 25000, upper float values of 0.05, 0.04, 0.03, 0.02, 0.01, lower float values of 0.01, 0.02, 0.03, 0.04, and current costs (i.e., actual costs in the upper graph) of 1010, 4000, 9000, 15000, 25000, respectively.
TABLE 2
Order form Scheduling (Unit cpm) Monovalent unit price Budget for a vehicle Upward floating value Float-down value Exposure (Unit number) Budget completion Practical cost
D1 100 10 1000 0.05 0.01 101000 1.01 1010
D2 200 20 4000 0.04 0.02 200000 1 4000
D3 300 30 9000 0.03 0.03 300000 1 9000
D4 400 40 16000 0.02 0.04 375000 0.9375 15000
D5 500 50 25000 0.01 0.04 500000 1 25000
And respectively calculating the upper limit and the lower limit of the five orders, judging whether the upper limit and the lower limit are exceeded or not, and calculating the conditions of the assignable values of the lower limits of the orders to obtain the results shown in the following table 3:
TABLE 3 Table 3
Order form Lower limit of Upper limit of Whether or not the upper limit is reached Whether or not the lower limit is reached Budget surplus value Lower order limit assignable value
D1 990 1050 0 1 -10 10
D2 3920 4160 0 1 0 80
D3 8730 9270 0 1 0 270
D4 15360 16320 0 0 1000 640
D5 24000 25250 0 1 0 1000
From the above table 3, it can be calculated that the orders D1, D2, D3, D5 have exceeded the lower limit and the order D4 has not exceeded the lower limit, so the budget has exceeded the remaining allocable budgets of the lower limit order and x= -10+0+0+0, i.e. x= -10; the remaining allocable budgets of the order that do not exceed the lower limit and y=16000 x 0.04, i.e. y=640; further, x+y= -10+640=630.
Obviously, if x+y=630 >0, selecting the first order D1 by the unit price sorting of the advertisement space, firstly judging whether the D1 order cost reaches the lower limit, obviously judging whether the D1 order cost reaches the lower limit, and then judging whether the D1 order cost reaches the upper limit, obviously, the D1 order cost does not reach the upper limit. So calculate the D1 order taking upper limit difference z=1000X (1+0.05) -1010, i.e. z=40, obviously Z < x+y, update D1 order schedule to 1000X (1+0.05), i.e. 1050, and x+y to x+y-Z, i.e. 590. Similarly, all the calculated new order scheduling budgets are shown in Table 4 below:
TABLE 4 Table 4
Z Z<=X+Y Whether or not the lower limit is reached Whether or not the lower limit is reached New scheduling budget
D1 40 1 1 0 1050
D2 160 1 1 0 4160
D3 270 1 1 0 9270
D4 1320 0 0 0 15680
D5 250 1 1 0 25250
55410
Difference value -410
From the above, the method for processing order information provided by the embodiment of the application can dynamically and reasonably allocate each order budget according to the actual receiving condition, and control the overall budget error within a reasonable range.
Example 2
According to an embodiment of the present application, there is further provided an apparatus embodiment for implementing the method for processing order information, and fig. 3 is a schematic structural diagram of an apparatus for processing order information according to an embodiment of the present application, as shown in fig. 3, where the apparatus for processing order information includes: a receiving module 300, a reading module 302, a screening module 304, and an adjusting module 306, wherein:
a receiving module 300, configured to receive a push request sent by a media side, where the push request includes: an order set of self-media information to be pushed; the reading module 302 is configured to sequentially read order information of each order in the order set of the self-media information, where the order information of each order includes: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; the screening module 304 is configured to screen out a target order with the highest priority from the order set, where the target order represents self-media information with the highest scheduling priority; the adjustment module 306 is configured to adjust the scheduling of the target order based on the order amount floating value of the target order.
It should be noted that, the receiving module 300, the reading module 302, the filtering module 304, and the adjusting module 306 correspond to steps S102 to S108 in embodiment 1, and the modules are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to those disclosed in embodiment 1. It should be noted that the above modules may be run in a computer terminal as part of the apparatus.
In an alternative embodiment, the screening module includes: the first sub-acquisition module is used for acquiring a first group of orders with the order budget exceeding a lower limit interval in the order set and a second group of orders with the order budget not exceeding the lower limit interval; a second sub-acquiring module, configured to acquire a first remaining amount of an order budget of the first group of orders and a second remaining amount of the order budget of the second group of orders; and the third sub-acquisition module is used for acquiring an order with the highest order priority in the order set as the target order if the total residual quantity of the first residual quantity and the second residual quantity exceeds a threshold value.
In an alternative embodiment, the screening module further includes: and the returning module is used for returning the push request if the total residual quantity of the first residual quantity and the second residual quantity does not exceed a threshold value.
In an alternative embodiment, the adjusting module includes: a third sub-acquiring module, configured to acquire the order payment status of the target order and an upper limit difference value of the target order, where an order amount floating value of the target order determines the upper limit difference value; the heightening module is used for heightening the arrangement period of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value; and the lowering module is used for lowering the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference value.
In an alternative embodiment, the apparatus further comprises: the generation module is used for removing the target orders with the arrangement periods adjusted from the order set and generating a residual order set; wherein the target order is a first order in the order set; the return module is used for returning to continuously and sequentially read the order information of each order in the rest order set; the obtaining module is used for obtaining an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of the order needs to be adjusted.
It should be noted that each of the above modules may be implemented by software or hardware, for example, in the latter case, it may be implemented by: the above modules may be located in the same processor; alternatively, the various modules described above may be located in different processors in any combination.
It should be noted that, the optional or preferred implementation manner of this embodiment may be referred to the related description in embodiment 1, and will not be repeated here.
The processing device of order information may further include a processor and a memory, where the receiving module 300, the reading module 302, the filtering module 304, the adjusting module 306, and the like are stored as program units, and the processor executes the program units stored in the memory to implement corresponding functions.
The processor comprises a kernel, the kernel fetches corresponding program units from the memory, and one or more of the kernels can be arranged. The memory may include volatile memory, random Access Memory (RAM), and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM), among other forms in computer readable media, the memory including at least one memory chip.
According to an embodiment of the present application, there is also provided an embodiment of a nonvolatile storage medium. Optionally, in this embodiment, the nonvolatile storage medium includes a stored program, where when the program runs, the device in which the nonvolatile storage medium is controlled to execute the processing method of any one of the order information.
Alternatively, in this embodiment, the above-mentioned nonvolatile storage medium may be located in any one of the computer terminals in the computer terminal group in the computer network or in any one of the mobile terminals in the mobile terminal group, and the above-mentioned nonvolatile storage medium includes a stored program.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: receiving a push request sent by a media side, wherein the push request comprises: an order set of self-media information to be pushed; sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount; screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority; and adjusting the arrangement period of the target order based on the order amount floating value of the target order.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: acquiring a first group of orders in which the order budget exceeds a lower limit interval in the order set, and a second group of orders in which the order budget does not exceed the lower limit interval; acquiring a first residual amount of the order budget of the first group of orders and a second residual amount of the order budget of the second group of orders; and if the total residual quantity of the first residual quantity and the second residual quantity exceeds a threshold value, acquiring an order with the highest order priority in the order set as the target order.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: and if the total residual quantity of the first residual quantity and the second residual quantity does not exceed a threshold value, returning the push request.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order; if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the arrangement period of the target order is regulated to be high; otherwise, the scheduling of the target order is regulated down.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: removing the target orders with the arrangement adjusted from the order set to generate a residual order set; wherein the target order is a first order in the order set; returning to continuously and sequentially reading order information of each order in the rest order sets; and acquiring an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of which needs to be adjusted.
According to an embodiment of the present application, there is also provided an embodiment of a processor. Optionally, in this embodiment, the processor is configured to run a program, where the program runs to execute any one of the order information processing methods.
According to an embodiment of the present application, there is also provided an embodiment of an electronic device, including a memory, in which a computer program is stored, and a processor configured to run the computer program to execute the method of processing order information of any one of the above.
According to an embodiment of the present application, there is also provided an embodiment of a computer program product adapted to perform a program of steps of a processing method of initializing order information with any of the above, when the program is executed on a data processing device.
The foregoing embodiment numbers of the present application are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present application, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed technology may be implemented in other manners. The above-described embodiments of the apparatus are merely exemplary, and the division of the units, for example, may be a logic function division, and may be implemented in another manner, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
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 may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
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 non-volatile storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a non-volatile storage medium, including instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned nonvolatile storage medium includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a preferred embodiment of the present application and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present application, which are intended to be comprehended within the scope of the present application.

Claims (7)

1. A method for processing order information, comprising:
receiving a push request sent by a media side, wherein the push request comprises: an order set of self-media information to be pushed;
sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount;
screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority;
adjusting a scheduling of the target order based on an order amount float value of the target order, the order amount float value being that budget allocation automatically floats between media by a percentage;
screening out the target order with highest priority from the order set, wherein the screening comprises the following steps: acquiring a first group of orders in which the order budget exceeds a lower limit interval in the order set, and a second group of orders in which the order budget does not exceed the lower limit interval; acquiring a first residual amount of the order budget of the first group of orders and a second residual amount of the order budget of the second group of orders; if the total residual quantity of the first residual quantity and the second residual quantity exceeds a threshold value, acquiring an order with the highest order priority in the order set as the target order;
if the total residual quantity of the first residual quantity and the second residual quantity does not exceed the threshold value, returning the push request;
adjusting the arrangement of the target order based on the order amount float value of the target order includes: acquiring the order payment state of the target order and an upper limit difference value of the target order, wherein the upper limit difference value is determined by an order amount floating value of the target order; if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value, the scheduling of the target order is regulated up; otherwise, the scheduling of the target order is regulated down.
2. The method of claim 1, wherein after adjusting the scheduling of the target order based on the order amount float value for the target order, the method further comprises:
removing the target orders with the arrangement adjusted from the order set to generate a residual order set; wherein the target order is a first order in the order set;
returning to continue to sequentially read order information of each order in the rest order set;
and acquiring an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of which needs to be adjusted.
3. An order information processing apparatus, comprising:
the receiving module is configured to receive a push request sent by a media side, where the push request includes: an order set of self-media information to be pushed;
the reading module is used for sequentially reading order information of each order in the order set of the self-media information, wherein the order information of each order comprises: order identification, order payment status, order priority, order budget, order amount, and float values for the order amount;
the screening module is used for screening out a target order with highest priority from the order set, wherein the target order represents self-media information with highest scheduling priority;
the adjustment module is used for adjusting the arrangement period of the target order based on the order amount floating value of the target order, wherein the order amount floating value refers to that budget allocation automatically floats among media according to percentages;
the screening module comprises: the first sub-acquisition module is used for acquiring a first group of orders with the order budget exceeding a lower limit interval in the order set and a second group of orders with the order budget not exceeding the lower limit interval; a second sub-acquisition module, configured to acquire a first remaining amount of an order budget for the first set of orders and a second remaining amount of the order budget for the second set of orders; a third sub-acquisition module, configured to acquire, as the target order, an order with the highest order priority in the order set if the total remaining amount of the first remaining amount and the second remaining amount exceeds a threshold value;
the screening module further comprises: a retraction module, configured to retract the push request if a total remaining amount of the first remaining amount and the second remaining amount does not exceed a threshold value;
the adjustment module includes: a third sub-acquisition module, configured to acquire the order payment status of the target order and an upper limit difference value of the target order, where an order amount floating value of the target order determines the upper limit difference value; the heightening module is used for heightening the arrangement period of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity exceeds the upper limit difference value; and the lowering module is used for lowering the scheduling of the target order if the order payment state is that the total residual quantity of the first residual quantity and the second residual quantity does not exceed the upper limit difference value.
4. A device according to claim 3, characterized in that the device further comprises:
the generation module is used for removing the target orders with the arrangement adjusted from the order set and generating a residual order set; wherein the target order is a first order in the order set;
the return module is used for returning to continuously and sequentially read the order information of each order in the rest order set;
the obtaining module is used for obtaining an order with the highest order priority from the rest order set to obtain a second order, wherein the second order is the order with the highest priority in the rest order set, and the priority of the order needs to be adjusted.
5. A non-volatile storage medium, characterized in that it stores a plurality of instructions adapted to be loaded by a processor and to perform the method of processing order information according to any of claims 1 to 2.
6. A processor, characterized in that the processor is arranged to run a program, wherein the program is arranged to execute the method of processing order information according to any of claims 1 to 2 at run time.
7. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to run the computer program to perform the method of processing order information according to any of claims 1-2.
CN202011589303.3A 2020-12-28 2020-12-28 Order information processing method and device, electronic equipment and processor Active CN112598447B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011589303.3A CN112598447B (en) 2020-12-28 2020-12-28 Order information processing method and device, electronic equipment and processor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011589303.3A CN112598447B (en) 2020-12-28 2020-12-28 Order information processing method and device, electronic equipment and processor

Publications (2)

Publication Number Publication Date
CN112598447A CN112598447A (en) 2021-04-02
CN112598447B true CN112598447B (en) 2023-10-10

Family

ID=75203300

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011589303.3A Active CN112598447B (en) 2020-12-28 2020-12-28 Order information processing method and device, electronic equipment and processor

Country Status (1)

Country Link
CN (1) CN112598447B (en)

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104252650A (en) * 2014-09-30 2014-12-31 北京工商大学 Automated instant digital sign advertisement release method
CN105184614A (en) * 2015-09-14 2015-12-23 北京工商大学 Distributed digital signage advertisement delivery method based on Storm platform
CN106447392A (en) * 2016-09-19 2017-02-22 东莞市东信网络技术有限公司 RTB (real-time bidding) advertisement based intelligent bidding power flow tracing algorithm
CN107481029A (en) * 2017-07-13 2017-12-15 北京奇艺世纪科技有限公司 A kind of Forecasting Methodology and device of the stock of publicity orders
CN107707369A (en) * 2017-09-30 2018-02-16 广东欧珀移动通信有限公司 The method and apparatus of flow order management, computer equipment, readable storage medium storing program for executing
WO2018036307A1 (en) * 2016-08-23 2018-03-01 腾讯科技(深圳)有限公司 Information processing method utilized in pushing information order, allocation method, device, and data storage medium
WO2018145652A1 (en) * 2017-02-09 2018-08-16 腾讯科技(深圳)有限公司 Media data processing method, server and storage medium
WO2018149371A1 (en) * 2017-02-15 2018-08-23 腾讯科技(深圳)有限公司 Flow and service allocation method and apparatus for push information order, and storage medium
CN109509022A (en) * 2018-10-25 2019-03-22 北京奇虎科技有限公司 Ad traffic distribution method, advertisement transaction platform, server and storage medium
CN109688196A (en) * 2018-11-19 2019-04-26 北京三快在线科技有限公司 Method for pushing, device, electronic equipment and the readable storage medium storing program for executing of order status
JP2019111795A (en) * 2017-12-26 2019-07-11 京セラドキュメントソリューションズ株式会社 Image formation apparatus and consumable supply order placement timing notification method
CN110020894A (en) * 2019-04-03 2019-07-16 腾讯科技(深圳)有限公司 Information processing method, device and server
KR102031138B1 (en) * 2018-05-25 2019-10-11 주식회사 케이디아이덴 System for Target Advertisement Using System for Ordering Food Cooked by User-Selected of Customizing Ingredients through Internet
CN110502474A (en) * 2019-06-26 2019-11-26 中电万维信息技术有限责任公司 Order allocation method, device and storage medium based on distributed memory system
CN111192077A (en) * 2019-12-16 2020-05-22 加和(北京)信息科技有限公司 Advertisement traffic multiplexing method and device, storage medium and electronic device
CN111311310A (en) * 2020-01-20 2020-06-19 加和(北京)信息科技有限公司 Advertisement order pushing method and device, storage medium and electronic device
CN111724229A (en) * 2020-05-13 2020-09-29 时时同云科技(成都)有限责任公司 Object recommendation method and device, and object display method and device

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2004324709B2 (en) * 2004-11-10 2009-08-13 Telefonaktiebolaget Lm Ericsson (Publ) Congestion control in a wireless mobile system
JP4555145B2 (en) * 2005-04-28 2010-09-29 富士通株式会社 Batch scheduling program, batch scheduling method, and batch scheduling apparatus
US8719080B2 (en) * 2006-05-20 2014-05-06 Clear Channel Management Services, Inc. System and method for scheduling advertisements
US20080027802A1 (en) * 2006-07-31 2008-01-31 Yahoo! Inc. System and method for scheduling online keyword subject to budget constraints
US8155990B2 (en) * 2009-01-26 2012-04-10 Microsoft Corporation Linear-program formulation for optimizing inventory allocation
CN102136118A (en) * 2010-11-12 2011-07-27 华为软件技术有限公司 Advertisement order booking method, advertisement delivering method and system
US20130024286A1 (en) * 2011-07-21 2013-01-24 Microsoft Corporation Multiple slack variables for balancing ad campaign risks
WO2016086076A1 (en) * 2014-11-24 2016-06-02 The Nielsen Company (Us), Llc Methods and apparatus to project ratings for future broadcasts of media
KR20170110367A (en) * 2016-03-23 2017-10-11 에스케이플래닛 주식회사 Apparatus, method and recoding medium for providing advertisement

Patent Citations (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104252650A (en) * 2014-09-30 2014-12-31 北京工商大学 Automated instant digital sign advertisement release method
CN105184614A (en) * 2015-09-14 2015-12-23 北京工商大学 Distributed digital signage advertisement delivery method based on Storm platform
WO2018036307A1 (en) * 2016-08-23 2018-03-01 腾讯科技(深圳)有限公司 Information processing method utilized in pushing information order, allocation method, device, and data storage medium
CN106447392A (en) * 2016-09-19 2017-02-22 东莞市东信网络技术有限公司 RTB (real-time bidding) advertisement based intelligent bidding power flow tracing algorithm
WO2018145652A1 (en) * 2017-02-09 2018-08-16 腾讯科技(深圳)有限公司 Media data processing method, server and storage medium
CN108415908A (en) * 2017-02-09 2018-08-17 腾讯科技(北京)有限公司 A kind of processing method and server of multi-medium data
WO2018149371A1 (en) * 2017-02-15 2018-08-23 腾讯科技(深圳)有限公司 Flow and service allocation method and apparatus for push information order, and storage medium
CN107481029A (en) * 2017-07-13 2017-12-15 北京奇艺世纪科技有限公司 A kind of Forecasting Methodology and device of the stock of publicity orders
CN107707369A (en) * 2017-09-30 2018-02-16 广东欧珀移动通信有限公司 The method and apparatus of flow order management, computer equipment, readable storage medium storing program for executing
JP2019111795A (en) * 2017-12-26 2019-07-11 京セラドキュメントソリューションズ株式会社 Image formation apparatus and consumable supply order placement timing notification method
KR102031138B1 (en) * 2018-05-25 2019-10-11 주식회사 케이디아이덴 System for Target Advertisement Using System for Ordering Food Cooked by User-Selected of Customizing Ingredients through Internet
CN109509022A (en) * 2018-10-25 2019-03-22 北京奇虎科技有限公司 Ad traffic distribution method, advertisement transaction platform, server and storage medium
CN109688196A (en) * 2018-11-19 2019-04-26 北京三快在线科技有限公司 Method for pushing, device, electronic equipment and the readable storage medium storing program for executing of order status
CN110020894A (en) * 2019-04-03 2019-07-16 腾讯科技(深圳)有限公司 Information processing method, device and server
CN110502474A (en) * 2019-06-26 2019-11-26 中电万维信息技术有限责任公司 Order allocation method, device and storage medium based on distributed memory system
CN111192077A (en) * 2019-12-16 2020-05-22 加和(北京)信息科技有限公司 Advertisement traffic multiplexing method and device, storage medium and electronic device
CN111311310A (en) * 2020-01-20 2020-06-19 加和(北京)信息科技有限公司 Advertisement order pushing method and device, storage medium and electronic device
CN111724229A (en) * 2020-05-13 2020-09-29 时时同云科技(成都)有限责任公司 Object recommendation method and device, and object display method and device

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
The Research of Oxygen Measurement by TDLAS Based on Levenberg-Marquardt Nonlinear Fitting;Jie Yan,等;Guang Pu Xue Yu Guang Pu Fen Xi;第35卷(第06期);第1497-500页 *
分布式电源配电网造价风险评估仿真研究;南开辉,等;计算机仿真;第34卷(第03期);第96-99、220页 *
基于Agent的招投标系统的研究;康婧,等;哈尔滨商业大学学报(自然科学版);第23卷(第03期);第359-362、366页 *
王亚娟,等.网络广告制作.北京理工大学出版社,2020,第148-149页. *

Also Published As

Publication number Publication date
CN112598447A (en) 2021-04-02

Similar Documents

Publication Publication Date Title
CN109325825B (en) Flow data regulation and control method and device
CN108280930B (en) Replenishment method and device for self-service vending machine, storage medium and computer equipment
US8880676B1 (en) Resource planning for computing
CN112598447B (en) Order information processing method and device, electronic equipment and processor
CN111553740A (en) Flow distribution method and device, electronic equipment and computer storage medium
US20200175462A1 (en) Method and system for two-echelon balanced inventory allocation
CN107846614B (en) Video traffic scheduling method and device and electronic equipment
CN111988388B (en) Flow distribution method, device, electronic equipment and storage medium
CN103348370A (en) Reservation management device, reservation management method, reservation management program, and computer-readable recording medium storing program for same
CN110070392B (en) User loss early warning method and device
CN112001563A (en) Method and device for managing phone bill amount, electronic equipment and storage medium
CN113780625B (en) User electricity charge prediction method, system, terminal and storage medium
CN107979478B (en) Method and device for determining customer experience index
CN114493756A (en) Resource management method, device, equipment and storage medium
CN111160991B (en) PDB advertisement flow optimization method and device, storage medium and electronic equipment
CN110493808B (en) Cloud SIM card resource adjustment method, management platform and medium
CN112925650A (en) Resource cost calculation method and resource cost calculation system for calculation task
CN112101857A (en) Vehicle transfer method and device
CN111047152A (en) Work order processing method and device
CN114254841A (en) Resource limit processing method, computing device, user device and server
CN111882359A (en) Advertisement putting method and device
CN111966688A (en) Form processing method and device based on big data and storage medium
CN111124665B (en) Method and device for distributing computing resources
CN116820699A (en) Task random scheduling method, device and storage medium
CN109919470B (en) Method and device for distributing customer information

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
GR01 Patent grant
GR01 Patent grant