CN113393259A - Method, system, device and storage medium for advertisement scheduling - Google Patents
Method, system, device and storage medium for advertisement scheduling Download PDFInfo
- Publication number
- CN113393259A CN113393259A CN202110506337.XA CN202110506337A CN113393259A CN 113393259 A CN113393259 A CN 113393259A CN 202110506337 A CN202110506337 A CN 202110506337A CN 113393259 A CN113393259 A CN 113393259A
- Authority
- CN
- China
- Prior art keywords
- advertisement
- candidate
- scheme
- configuration
- search
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000001914 filtration Methods 0.000 claims abstract description 11
- 238000012163 sequencing technique Methods 0.000 claims abstract description 7
- 238000012216 screening Methods 0.000 claims description 14
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 239000000463 material Substances 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 238000006467 substitution reaction 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0272—Period of advertisement exposure
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0242—Determining effectiveness of advertisements
- G06Q30/0244—Optimization
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method, a system, a device and a storage medium for advertisement scheduling, wherein the method comprises the following steps: acquiring a configuration instruction, and determining a configuration condition according to the configuration instruction; filtering the first candidate advertisement space according to the configuration conditions, and sequencing the filtered results to obtain an advertisement space list; generating a candidate scheme through beam search according to a first target condition in the configuration conditions; the candidate scheme is obtained by combining a plurality of first advertisement positions; according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme; the time consumption of the first segment of the method is controllable; the second stage of search achieves the purpose of reducing search time, and time consumption can be controlled within a certain interval range; the method provides an advertisement scheduling scheme meeting various limiting conditions under the condition of extremely large data volume, and can be widely applied to the technical field of advertisement scheduling.
Description
Technical Field
The invention relates to the technical field of advertisement scheduling, in particular to a method, a system and a storage medium for advertisement scheduling.
Background
In the process of advertisement placement in the prior art, as a media side, a plurality of advertisement slots are needed to be provided for an advertiser to place advertisements. According to the cost of the advertiser and other delivery conditions, an appropriate ad spot combination scheme is selected from a plurality of ad spots, wherein the scheme comprises the selection of the ad spots and the selection of the date of each ad spot, and the scheme is hereinafter referred to as an ad scheduling scheme. The advertisement scheduling scheme is automatically generated to replace a manual scheme, so that manpower can be released, and the time for generating the scheme is shortened.
However, the prior art advertisement scheduling scheme still has the following two problems:
1. the advertisement positions are large in number and wide in selectable date range of each advertisement position, and the number of combined schemes is very large.
2. Each advertisement delivery has a plurality of limiting conditions, such as delivery amount interval limitation, date range limitation, advertisement space proportion limitation of certain attribute and the like.
Disclosure of Invention
In view of the above, to at least partially solve one of the above technical problems, embodiments of the present invention provide a method capable of performing intelligent advertisement scheduling under the conditions of large data size and complex constraint conditions, and a system, an apparatus and a computer-readable storage medium capable of correspondingly implementing the method.
In a first aspect, the technical solution of the present invention provides a method for scheduling advertisements, including the following steps:
acquiring a configuration instruction, and determining a configuration condition according to the configuration instruction;
filtering the first candidate advertisement space according to the configuration conditions, and sequencing the filtered results to obtain an advertisement space list;
generating candidate schemes through beam search according to a first target condition in the configuration conditions; the candidate scheme is obtained by combining a plurality of first advertisement positions;
and according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme.
In some optional embodiments, the method of advertisement scheduling further comprises the steps of:
determining the advertisement attribute in the target advertisement scheduling scheme according to the configuration instruction, and carrying out secondary filtering on the first candidate advertisement space according to the advertisement attribute;
the advertisement attributes include an advertisement type and an advertisement location.
In some optional embodiments, the step of generating a candidate solution by beam search according to a first target condition in the configuration conditions includes:
constructing a first search tree according to the advertisement space list, wherein leaf nodes of the first search tree are the first candidate advertisement spaces;
traversing the first search tree layer by layer, and selecting the leaf nodes;
and determining a path from the leaf node to a root node, and determining a candidate scheme according to the leaf node contained in the path.
In some optional embodiments, the step of generating a candidate solution by beam search according to a first target condition in the configuration conditions further includes:
acquiring the first target condition, and screening the candidate scheme according to the first target condition;
and selecting the candidate scheme with the minimum distance weighted sum from the screening results according to the distance weighted sum of the first target conditions of the candidate schemes.
In some optional embodiments, the step of generating a target advertisement scheduling scheme by determining a second ad slot through a depth-first search according to a second target condition in the configuration conditions and adding the second ad slot to the candidate scheme includes:
constructing a second search tree according to the candidate scheme, wherein leaf nodes of the second search tree are optional days of the advertisement space;
determining a node path from a root node of the second search tree, wherein the node path comprises a plurality of leaf nodes meeting a second target condition;
and generating the target advertisement scheduling scheme according to the node path.
In a second aspect, the present invention further provides a system for scheduling advertisements, which includes:
the configuration acquisition unit is used for acquiring a configuration instruction and determining configuration conditions according to the configuration instruction;
the primary screening unit is used for filtering the first candidate advertisement space according to the configuration conditions and sequencing the filtered result to obtain an advertisement space list;
a plan generating unit configured to generate a candidate plan through beam search according to a first target condition among the configuration conditions; the candidate scheme is obtained by combining a plurality of first advertisement positions; and according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme.
In a third aspect, a technical solution of the present invention further provides an advertisement scheduling apparatus, including:
at least one processor;
at least one memory for storing at least one program;
when the at least one program is executed by the at least one processor, causing the at least one processor to perform a method of advertisement scheduling according to the first aspect.
In a fourth aspect, the present invention also provides a storage medium, in which a processor-executable program is stored, and the processor-executable program is used for executing the method in the first aspect when being executed by a processor.
Advantages and benefits of the present invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention:
according to the technical scheme, a two-section searching mode is adopted, the first section of searching adopts beam searching, the obtained advertisement space combinations of the candidate schemes are various, and the probability of the situation that the advertisement space combinations in different schemes are identical is low; the time consumption of the first segment of beam search is controllable and is far less than the breadth-first search; and (4) selecting the optimal scheme according to the limiting conditions in each round of search of the beam search, screening a proper candidate scheme by using the limiting conditions, searching in a targeted manner, and improving the probability that the scheme obtained by searching meets the limiting conditions. The second section of search limits the depth-first search of the number of the added advertisement positions, achieves the purpose of reducing the search time, can control the consumed time within a certain range, and can provide an advertisement scheduling scheme meeting various limiting conditions under the condition of extremely large data volume.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flowchart illustrating steps of an advertisement scheduling method according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a first search tree according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a second search tree according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention. The step numbers in the following embodiments are provided only for convenience of illustration, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
Firstly, the technical terms related to the technical scheme of the application are explained as follows:
the advertisement space refers to a position on or off line for carrying advertisements in the form of pictures, character chains and the like in the technical scheme of the application.
In a first aspect, as shown in fig. 1, the technical solution of the present application provides an embodiment of a method for scheduling advertisement, where the method includes steps S100-S400:
s100, acquiring a configuration instruction, and determining a configuration condition according to the configuration instruction;
the configuration instruction refers to the configuration operation of a user on the advertisement scheduling through user interaction interfaces of various terminal devices; in the embodiment, after receiving the configuration instruction, the background analyzes the configuration instruction and extracts the configuration condition from the configuration instruction, for example, the configuration condition analyzed from a certain configuration instruction of a user is as follows: the throwing amount is 100 ten thousand, and the upper and lower floating is 1000; the date ranges from 3 and 1 days in 2021 to 3 and 31 days in 2021, and the daily dose is not given in holidays.
S200, filtering the first candidate advertisement space according to configuration conditions, and sequencing the filtered result to obtain an advertisement space list;
the first candidate advertisement space is all advertisement spaces capable of carrying out advertisement putting under the condition of not carrying out condition limitation; the ad slot list is a plurality of selectable ad slots left after condition screening according to configuration conditions. Specifically, according to the configuration condition obtained by the analysis in step S100, all advertisement spots that can be placed are primarily screened, and the screening process may be to screen according to the attribute entries of the configuration condition, and remove advertisement spots that obviously do not have the same attribute entries or have missing records corresponding to the attribute entries in the advertisement spots; for example, the configuration condition is that the release amount is 100 ten thousand yuan and the up-down floating is 1000 yuan; the date ranges from 3 months 1 days in 2021 to 3 months 31 days in 2021; if the advertisement positions with missing attribute values of the advertising dates can be removed in the preliminary screening process.
S300, generating a candidate scheme through beam search according to a first target condition in the configuration conditions;
wherein, the candidate scheme is obtained by a plurality of first advertisement space combinations; the first target condition may be one of the configuration conditions, for example: the amount of advertising placement; in the embodiment, the beam search and the similar breadth-first search are also traversed according to the layer, only all nodes of the layer are not reserved, part of the nodes and the sub nodes thereof are removed according to the rule, and the removed nodes and the sub nodes thereof are not accessed any more. Specifically, the first target condition is selected as the placement amount of the advertisement placement, and step S300 is the first search stage of this embodiment, according to the configuration condition set by the user, this embodiment sets a target amount close to the placement amount, which is the placement amount in the configuration condition, and the range of the amount is that the sum of the unit price of the advertisement placement selected in the advertisement scheduling scheme × the selected number of days must be in the floating interval of the placement amount; and obtaining N candidate schemes by adopting a beam search mode, wherein the N candidate schemes are formed by combining different advertisement positions. It should be noted that the beam search is not an improvement of the present disclosure, and therefore is not described herein.
S400, according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme;
wherein the second target condition is another restriction condition different from the first target condition in the configuration condition, for example, all contents of the configuration condition may be taken as the second target condition in the embodiment; in the embodiment, the depth-first search is to start access from a root node, then access an unaccessed child node of the child node, and reach a leaf node, so as to obtain a path from the root node to the leaf node. And then returning from the leaf node, finding the next neighbor node which is not accessed, and obtaining the path from the other root node to the leaf node again. Specifically, the second target condition is selected as the number of days of the date of advertisement delivery, the candidate scheme provided by the first search stage enters the first search stage, and advertisement slots are added to the candidate scheme in a depth-first search mode, for example, no more than 5 advertisement slots are added; and selecting proper days of the date to ensure that the scheme meets all configuration conditions to obtain a target advertisement scheduling scheme.
In some optional embodiments, the method of advertisement scheduling further includes step S500:
s500, determining the advertisement attribute in the target advertisement scheduling scheme according to the configuration instruction, and carrying out secondary filtering on the first candidate advertisement position according to the advertisement attribute;
wherein the advertisement attributes comprise advertisement type and advertisement position; the secondary filtering is to screen out the advertisement positions which can not meet the corresponding attribute requirements according to the attributes of the advertisements; in the embodiment of the present application, besides the configuration conditions set by the user, the configuration conditions may include various attributes, such as a text chain, a picture, a column, and the like; the location is for example at the first screen, the second screen, etc. of the page. The embodiment of the application comprises a complete configuration condition of the attribute, taking advertisement putting A as an example, the configuration condition is that the putting amount is 100 ten thousand yuan and the up-down floating amount is 1000 yuan. The date range is from 3 months 1 days in 2021 to 3 months 31 days in 2021, and the daily dose is not given in holidays; the advertisement attribute is that the picture type accounts for 50%, and the character chain accounts for 50%; the first screen accounts for 60%.
In some optional embodiments, the step S300 of generating a candidate solution by beam search according to a first target condition in the configuration conditions may include steps S310-S330:
s310, constructing a first search tree according to the advertisement space list;
s320, traversing the first search tree layer by layer, and selecting leaf nodes;
s330, determining a path from the leaf node to the root node, and determining a candidate scheme according to the leaf node contained in the path;
wherein, the leaf node of the first search tree is a first candidate advertisement space; the first search tree is constructed according to the ordered advertisement space list. Specifically, first, a target amount is set:
target＝final-min(maxGap,midPrice*maxDays*5)
final is the total delivery amount of the limiting conditions, midPrice is the median of the price of the advertisement space, maxMays is the maximum number of selectable days of the advertisement space, maxGap is the maximum value of the difference between the set delivery amount and the target amount, and 5 is the maximum number of advertisement spaces limited in the second search. Then, a search tree is constructed according to the sorted list of ad slots as shown in FIG. 2; the ad slots arranged behind a certain ad slot are all used as child nodes of the ad slot. And finally, executing bundle search, traversing the search tree according to layers, taking only N nodes in each layer, removing the rest nodes and child nodes in the layer, and traversing the next layer until all the nodes are completely accessed. All ad slots on the path from each leaf node to the root node remaining in the tree constitute a candidate solution, with the day of the ad slot selected as the maximum number of selectable days.
In some optional embodiments, the step S300 of generating a candidate solution by beam search according to the first target condition in the configuration conditions further includes the step S340 of:
s340, obtaining a first target condition, and screening the candidate scheme according to the first target condition; selecting a candidate scheme with the minimum distance weighted sum from the screening result according to the distance weighted sum of the first target conditions of the candidate schemes;
specifically, in the technical scheme of the application, in the process of performing bundle search and taking N nodes in each layer of the search tree, all advertisement spots on the path from each node to the root node in the layer form a candidate scheme, and the maximum selectable number of days is selected from the number of days of the date of the advertisement spots. Two values are calculated for each candidate: the number of the gap weighted sum which satisfies the limiting conditions and the gap weighted sum which does not satisfy the limiting conditions. And preferentially selecting candidate schemes with more satisfied conditions, and preferentially selecting candidate schemes with small difference weighted sum if the satisfied conditions are the same. And judging whether the total sum of each candidate scheme is greater than the target sum, and outputting the candidate schemes of which the total sum is less than the target sum.
In some possible embodiments, the step S400 of generating a target ad placement scheme by determining a second ad slot through a depth-first search and adding the second ad slot to the candidate scheme according to a second target condition in the configuration conditions may include steps S410-S430:
s410, constructing a second search tree according to the candidate scheme, wherein leaf nodes of the second search tree are the optional days of the advertisement space;
s420, starting from the root node of the second search tree, determining a node path, wherein the node path comprises a plurality of leaf nodes meeting a second target condition;
s430, generating a target advertisement scheduling scheme according to the node path;
each layer of nodes of the second search tree is the optional number of days of the advertisement space in the candidate scheme; specifically, an advertisement space in the candidate scheme is obtained according to step S300, and an advertisement space search tree is constructed, as shown in fig. 3, each layer of the tree corresponds to one advertisement space, and each layer of nodes is the number of selectable days of the advertisement space; and then, performing depth-first search, starting access from the root node, accessing an unaccessed child node of the node, and accessing an unaccessed child node of the child node until the number of the advertisement spots of which the number of days on the date is more than 1 on a leaf node or a path reaches 5, wherein the advertisement spots on the path and the days on the date form an advertisement scheduling scheme. And then backing back to find the next non-accessed neighbor node to obtain another advertisement scheduling scheme again. And judging whether each advertisement scheduling scheme meets a second target condition, and outputting the advertisement scheduling scheme meeting the second target condition as a final advertisement scheduling scheme.
In a second aspect, the present application provides a system for ad scheduling implementing the method of the first aspect, comprising:
the configuration acquisition unit is used for acquiring a configuration instruction and determining configuration conditions according to the configuration instruction;
the primary screening unit is used for filtering the first candidate advertisement space according to the configuration conditions and sequencing the filtered result to obtain an advertisement space list;
a plan generating unit configured to generate a candidate plan by a beam search according to a first target condition among the configuration conditions; the candidate scheme is obtained by combining a plurality of first advertisement positions; and according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme.
In a third aspect, the present disclosure also provides an advertisement scheduling apparatus, including at least one processor; at least one memory for storing at least one program; when the at least one program is executed by the at least one processor, the at least one program causes the at least one processor to perform a method of advertising scheduling as in the first aspect.
An embodiment of the present invention further provides a storage medium storing a program, where the program is executed by a processor to implement the method in the first aspect.
From the above specific implementation process, it can be concluded that the technical solution provided by the present invention has the following advantages or advantages compared to the prior art:
1. in the technical scheme of the application, the first stage of search adopts bundle search, the obtained advertisement site combinations of the candidate schemes are various, and the probability of the situation that the advertisement site combinations in different schemes are identical is low. The time consumption of one beam search is controllable and is far less than the breadth-first search. And each round of search of the beam search is equivalent to screening a proper candidate scheme by using the limiting conditions, so that the target search is carried out, and the probability that the scheme obtained by the search meets the limiting conditions is improved.
2. The second stage of search in the technical scheme of the application is depth-first search for limiting the number of the added advertisement spots, and limiting the number of the advertisement spots is equivalent to pruning trees, so that the aim of reducing search time is fulfilled. By setting the maximum search times to stop searching in advance, the time consumption can be controlled within a certain interval range.
In alternative embodiments, the functions/acts noted in the block diagrams may occur out of the order noted in the operational illustrations. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Furthermore, the embodiments presented and described in the flow charts of the present invention are provided by way of example in order to provide a more thorough understanding of the technology. The disclosed methods are not limited to the operations and logic flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are performed independently.
Furthermore, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the functions and/or features may be integrated in a single physical device and/or software module, or one or more of the functions and/or features may be implemented in a separate physical device or software module. It will also be appreciated that a detailed discussion of the actual implementation of each module is not necessary for an understanding of the present invention. Rather, the actual implementation of the various functional modules in the apparatus disclosed herein will be understood within the ordinary skill of an engineer, given the nature, function, and internal relationship of the modules. Accordingly, those skilled in the art can, using ordinary skill, practice the invention as set forth in the claims without undue experimentation. It is also to be understood that the specific concepts disclosed are merely illustrative of and not intended to limit the scope of the invention, which is defined by the appended claims and their full scope of equivalents.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (8)
1. A method of scheduling advertisements, comprising the steps of:
acquiring a configuration instruction, and determining a configuration condition according to the configuration instruction;
filtering the first candidate advertisement space according to the configuration conditions, and sequencing the filtered results to obtain an advertisement space list;
generating a candidate scheme through beam search according to a first target condition in the configuration conditions, wherein the candidate scheme is obtained by combining a plurality of first advertisement spaces;
and according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme.
2. The method of claim 1, wherein the method of scheduling advertisements further comprises the steps of:
determining the advertisement attribute in the target advertisement scheduling scheme according to the configuration instruction, and carrying out secondary filtering on the first candidate advertisement space according to the advertisement attribute;
the advertisement attributes include an advertisement type and an advertisement location.
3. The method of claim 1, wherein the step of generating candidates by beam search according to the first target condition of the configuration conditions comprises:
constructing a first search tree according to the advertisement space list, wherein leaf nodes of the first search tree are the first candidate advertisement spaces;
traversing the first search tree layer by layer, and selecting the leaf nodes;
and determining a path from the leaf node to a root node, and determining a candidate scheme according to the leaf node contained in the path.
4. The method of claim 3, wherein the step of generating candidates by beam search according to the first target condition of the configuration conditions further comprises:
acquiring the first target condition, and screening the candidate scheme according to the first target condition;
and selecting the candidate scheme with the minimum distance weighted sum from the screening results according to the distance weighted sum of the first target conditions of the candidate schemes.
5. The method of claim 3, wherein the step of generating a target advertisement scheduling scheme by determining a second ad slot through a depth-first search and adding the second ad slot to the candidate scheme according to a second target condition of the configuration conditions comprises:
constructing a second search tree according to the candidate scheme, wherein leaf nodes of the second search tree are optional days of the advertisement space;
determining a node path from a root node of the second search tree, wherein the node path comprises a plurality of leaf nodes meeting a second target condition;
and generating the target advertisement scheduling scheme according to the node path.
6. A system for scheduling advertisements, comprising:
the configuration acquisition unit is used for acquiring a configuration instruction and determining configuration conditions according to the configuration instruction;
the primary screening unit is used for filtering the first candidate advertisement space according to the configuration conditions and sequencing the filtered result to obtain an advertisement space list;
a plan generating unit configured to generate a candidate plan through beam search according to a first target condition among the configuration conditions;
the candidate scheme is obtained by combining a plurality of first advertisement positions;
and according to a second target condition in the configuration conditions, determining a second advertisement space through depth-first search and adding the second advertisement space to the candidate scheme to generate a target advertisement scheduling scheme.
7. An apparatus for scheduling advertisements, comprising:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to perform a method of advertising scheduling as claimed in any one of claims 1 to 5.
8. A storage medium having stored therein a processor-executable program, the processor-executable program when executed by a processor being for executing a method of advertisement scheduling according to any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110506337.XA CN113393259B (en) | 2021-05-10 | 2021-05-10 | Advertisement scheduling method, system, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110506337.XA CN113393259B (en) | 2021-05-10 | 2021-05-10 | Advertisement scheduling method, system, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113393259A true CN113393259A (en) | 2021-09-14 |
| CN113393259B CN113393259B (en) | 2024-03-29 |
Family
ID=77616789
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110506337.XA Active CN113393259B (en) | 2021-05-10 | 2021-05-10 | Advertisement scheduling method, system, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113393259B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103514561A (en) * | 2013-10-21 | 2014-01-15 | 东莞市东信网络技术有限公司 | Advertisement scheduling management method and system |
| CN110135903A (en) * | 2019-05-10 | 2019-08-16 | 重庆八戒电子商务有限公司 | Advertisement position ranks method, system, medium and electronic equipment |
| CN112767039A (en) * | 2021-01-26 | 2021-05-07 | 深圳市易售科技有限公司 | Method, device, equipment and medium for generating advertising machine delivery order |
-
2021
- 2021-05-10 CN CN202110506337.XA patent/CN113393259B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103514561A (en) * | 2013-10-21 | 2014-01-15 | 东莞市东信网络技术有限公司 | Advertisement scheduling management method and system |
| CN110135903A (en) * | 2019-05-10 | 2019-08-16 | 重庆八戒电子商务有限公司 | Advertisement position ranks method, system, medium and electronic equipment |
| CN112767039A (en) * | 2021-01-26 | 2021-05-07 | 深圳市易售科技有限公司 | Method, device, equipment and medium for generating advertising machine delivery order |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113393259B (en) | 2024-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Andreassen et al. | Business model innovation and value-creation: the triadic way | |
| Nijkamp et al. | Success factors for sustainable urban brownfield development: A comparative case study approach to polluted sites | |
| US7530025B2 (en) | Systems and methods for handling time-stamped data | |
| US20070112607A1 (en) | Score-based alerting in business logic | |
| Taecharungroj et al. | Sustainability as a place brand position: A resident-centric analysis of the ten towns in the vicinity of Bangkok | |
| Villamil et al. | Sustainabilty integration in product portfolio for sustainable development: Findings from the industry | |
| Jia et al. | An analysis of multisided platform research over the past three decades: Framework and discussion | |
| CN108076143A (en) | A kind of logistics Web service dynamic optimized combination method | |
| Snauwaert et al. | Mathematical formulations for project scheduling problems with categorical and hierarchical skills | |
| Coffey et al. | Strategic public land use assessment and planning in Victoria, Australia: Four decades of trailblazing but where to from here? | |
| Kaushal et al. | Towards a healthy ganga—improving river flows through understanding trade offs | |
| Gallardo et al. | Addressing ecosystem services from plan to project to further tiering in impact assessment: Lessons from highway planning in São Paulo, Brazil | |
| Dasari et al. | Multi-start heuristics for the profitable tour problem | |
| CN111784385A (en) | Manufacturing industry-oriented client portrait construction method and device and computer storage medium | |
| Carter et al. | Looking back and moving forward: 50 years of the Journal of Supply Chain Management | |
| Lee et al. | Climate change research in Taiwan: Beyond following the mainstream | |
| Moreland et al. | Understanding the role of information in marine policy development: establishing a coastal marine protected area in Nova Scotia, Canada | |
| CN113393259A (en) | Method, system, device and storage medium for advertisement scheduling | |
| CN105208534A (en) | Event notification method and system | |
| CN106021492A (en) | Method and device for unloading form data | |
| Li-Ying et al. | The Art of Prioritizing and Timing in Business Model Innovation | |
| US20220405307A1 (en) | Storage structure for data containing relational objects and methods for retrieval and visualized display | |
| Smith et al. | Ngāi Tahu print media before and after settlement | |
| Cerya et al. | Analysis of SMEs Readiness in Developing Countries to Implement the Circular Economy | |
| Lv et al. | Discovering context-specific integration practices for integrating NEPA into statewide and metropolitan project planning processes |
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 |