[go: up one dir, main page]

CN114418645B - Information delivery method and device, terminal equipment and storage medium - Google Patents

Information delivery method and device, terminal equipment and storage medium Download PDF

Info

Publication number
CN114418645B
CN114418645B CN202210079736.7A CN202210079736A CN114418645B CN 114418645 B CN114418645 B CN 114418645B CN 202210079736 A CN202210079736 A CN 202210079736A CN 114418645 B CN114418645 B CN 114418645B
Authority
CN
China
Prior art keywords
information
warehouse
period
delivery
preset
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
CN202210079736.7A
Other languages
Chinese (zh)
Other versions
CN114418645A (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.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
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 Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN202210079736.7A priority Critical patent/CN114418645B/en
Publication of CN114418645A publication Critical patent/CN114418645A/en
Application granted granted Critical
Publication of CN114418645B publication Critical patent/CN114418645B/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/0242Determining effectiveness of advertisements
    • G06Q30/0244Optimization
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

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 embodiment of the invention discloses a method, a device, terminal equipment and a storage medium for releasing information, wherein the method comprises the following steps: acquiring the delivery quantity and the delivery period of information to be delivered, and delivering carrier attributes of carriers corresponding to the information; predicting the number of target carriers matched with the attributes of each carrier in each warehouse within a preset period; the preset time period comprises each throwing period; determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and throwing period of each information; aiming at each information, in the corresponding throwing period, throwing the information based on the target carrier of the corresponding warehouse; the preset targets comprise: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers to the corresponding delivery quantity in a corresponding delivery period meets a first preset range; the average warehouse number of the corresponding warehouses of each information in the corresponding delivery period meets a second preset range. The warehouse utilization rate can be optimized, and the cost consumption is reduced.

Description

Information delivery method and device, terminal equipment and storage medium
Technical Field
The embodiment of the invention relates to the technical field of data processing, in particular to an information delivery method, an information delivery device, terminal equipment and a storage medium.
Background
Advertisements may be considered information that is widely delivered for some purpose. The package advertisement is a novel advertisement form taking a package as a delivery carrier, and can utilize a direct mail advertisement (DIRECT MAIL ADVERTISING, DM) sheet, an internal hinge and a small gift in the package, or a package paste outside the package, an express delivery face sheet or a package box body and the like as media to carry out advertisement delivery.
In the prior art, the information delivery method may include: selecting a warehouse which needs to be occupied by each piece of information in a throwing period based on a selection instruction input by a user; and (5) putting information corresponding to the same day in the warehouse by using a proper carrier in the warehouse.
In the process of implementing the present invention, the inventor finds that at least the following technical problems exist in the prior art:
Users often input selection instructions based on experience or by using simple rules, which easily results in low overall warehouse carrier utilization, while the more warehouses are occupied, the higher the lock warehouse cost and carrier consumable transportation cost will be.
Disclosure of Invention
The embodiment of the invention provides an information delivery method, an information delivery device, terminal equipment and a storage medium, which can optimize the utilization rate of an integral warehouse and reduce the warehouse locking cost and the carrier consumable transportation cost.
In a first aspect, an embodiment of the present invention provides a method for delivering information, including:
acquiring the delivery quantity and the delivery period of information to be delivered, and the carrier attribute of a delivery carrier corresponding to each piece of information;
Predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in a preset period; wherein the preset time period comprises each of the delivery periods;
Determining the corresponding relation between each warehouse and each piece of information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information;
aiming at each piece of information, in a corresponding throwing period, throwing the information based on the target carrier of the corresponding warehouse;
Wherein the preset targets include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers in a corresponding delivery period to the quantity of target carriers in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses of each piece of information in the corresponding delivery period meets a second preset range.
In a second aspect, an embodiment of the present invention provides an information delivery apparatus, including:
The information delivery system comprises an acquisition module, a delivery module and a delivery module, wherein the acquisition module is used for acquiring the delivery quantity and the delivery period of information to be delivered and the carrier attribute of a delivery carrier corresponding to each piece of information;
The prediction module is used for predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in a preset period; wherein the preset time period comprises each of the delivery periods;
The warehouse discharging module is used for determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information;
The delivery module is used for delivering the information based on the target carrier of the corresponding warehouse in the corresponding delivery period aiming at each piece of information;
Wherein the preset targets include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers in a corresponding delivery period to the quantity of target carriers in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses of each piece of information in the corresponding delivery period meets a second preset range.
In a third aspect, an embodiment of the present invention provides a terminal device, including:
One or more processors;
A memory for storing one or more programs;
When the one or more programs are executed by the one or more processors, the one or more processors implement the method for delivering information according to any embodiment of the present invention.
In a fourth aspect, an embodiment of the present invention provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements a method for delivering information according to any embodiment of the present invention.
The embodiment of the invention provides a method, a device, a terminal device and a storage medium for releasing information, wherein the method for releasing information comprises the following steps: acquiring the delivery quantity and the delivery period of information to be delivered, and the carrier attribute of a delivery carrier corresponding to each piece of information; predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in a preset period; wherein the preset time period comprises each of the delivery periods; determining the corresponding relation between each warehouse and each piece of information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information; aiming at each piece of information, in a corresponding throwing period, throwing the information based on the target carrier of the corresponding warehouse; wherein the preset targets include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers in a corresponding delivery period to the quantity of target carriers in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses of each piece of information in the corresponding delivery period meets a second preset range.
In the embodiment of the invention, the preset targets can comprise two targets, wherein the first target is the sum of the ratios corresponding to the information and meets a first preset range, and the second target is the average warehouse number of the information and meets a second preset range. The ratio corresponding to each piece of information can represent the ratio of the predicted throwing amount to the required throwing amount of the information, and the resource waste of carriers capable of throwing the information in the warehouse can be avoided by limiting the sum of the ratio to a first preset range with smaller value, so that the utilization rate of the whole warehouse is improved. The average warehouse quantity of each piece of information can represent the warehouse quantity which is required to be occupied by the piece of information in the throwing period, and the warehouse quantity occupied by each piece of information in the throwing process can be reduced by limiting the average warehouse quantity in a second preset range with smaller numerical value, so that the warehouse locking cost and the consumable transportation cost are reduced.
Therefore, by setting the requirement that the corresponding relation needs to meet the throwing amount and the throwing period corresponding to each piece of information, a feasible corresponding relation scheme can be primarily screened out. By adding the preset target, a better corresponding relation scheme with higher warehouse utilization rate and lower cost consumption can be screened from feasible schemes. Information is put in based on the screened scheme, so that the utilization rate of the whole warehouse can be optimized, and the warehouse locking cost and the carrier consumable transportation cost are reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below of the drawings required for the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 shows a flowchart of a method for delivering information according to a first embodiment of the present invention;
Fig. 2 is a flowchart of another information delivery method according to the first embodiment of the present invention;
fig. 3 shows a flowchart of a method for delivering information according to a second embodiment of the present invention;
fig. 4 is a schematic structural diagram of an information delivery device according to a fourth embodiment of the present invention;
fig. 5 shows a schematic hardware structure of a terminal device according to a fifth embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described by means of implementation examples with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention. In the following embodiments, optional features and examples are provided in each embodiment at the same time, and the features described in the embodiments may be combined to form multiple alternatives, and each numbered embodiment should not be considered as only one technical solution.
Example 1
Fig. 1 shows a flowchart of a method for delivering information according to an embodiment of the present invention. The information delivery method provided by the embodiment of the invention can be suitable for the situation of delivering the package advertisement, for example, the corresponding relation between the advertisement and the warehouse is determined firstly, and then the advertisement is delivered based on the warehouse with the determined corresponding relation. The method may be performed by information delivery means implemented in software and/or hardware, preferably in terminal devices, for example in a computer or the like.
As shown in fig. 1, the method for delivering information provided in the embodiment of the present invention includes the following steps:
s110, acquiring the delivery quantity and the delivery period of the information to be delivered and the carrier attribute of the delivery carrier corresponding to each information.
In the embodiment of the invention, the information to be put can comprise advertisements, and the put carrier corresponding to each information can comprise packages. Hereinafter, "advertisement" and "information" may refer to each other, and "package" and "delivery vehicle" may refer to each other. When receiving an advertisement order of an advertisement to be placed by an advertiser, advertisement information carried in the advertisement order can be extracted. The advertisement information may include, but is not limited to, package attributes (i.e., carrier attributes) of the advertisement, delivery volume, delivery period, and basic information (e.g., advertiser information, merchandise or service information to be promoted, advertisement identification, etc.).
When advertisement delivery is carried out in a package advertisement mode, the requirement of related dimensions on packages is generally required according to the condition of the advertisement, so that the advertisement can accurately reach audience groups with high relativity, and popularization effect is improved. Wherein the requirement of the advertisement on the package-related dimension can be considered as a carrier attribute of the delivery carrier corresponding to the information. The delivery amount may refer to the number of advertisement delivery that an advertiser expects to reach, and may consider that a package meeting the relevant dimension requirements corresponds to one delivery. Wherein the delivery period may include a start time and an end time of the advertisement delivery.
In some alternative embodiments, the carrier attributes may include at least one of: the receiving area, the goods class, the goods brand, the goods attribute and the carrier consumable information.
The receiving area may represent a requirement of the advertisement on a dimension of the receiving area of the package, and the receiving area includes, for example, province and city counties. The advertisement contact rate can be improved by utilizing packages corresponding to areas where goods or services to be promoted are received.
Wherein the goods category may characterize the demand of the advertisement for the category dimension of the goods in the package, and the goods category includes, for example, food, stationery, clothing, and the like. The advertisement contact rate can also be improved by utilizing packages corresponding to goods or goods with high service correlation degree to be promoted to carry out advertisement delivery.
Wherein the branding of the good may characterize the demand of the advertisement for the brand dimension of the good in the package. The advertisement access rate can also be improved by utilizing packages corresponding to the same or related goods brands as the goods or services to be promoted to carry out advertisement delivery.
Wherein the goods attributes may characterize the requirements of the advertisement for the attribute dimension of the goods in the package, and the goods attributes include, for example, the size, specification, color, style, configuration, etc. of the goods. The advertisement access rate can also be improved by utilizing packages corresponding to the goods attribute with high correlation degree of the goods or services to be promoted to carry out advertisement delivery.
The carrier consumable can characterize the requirement of advertisements on the dimension of the put medium, and comprises a DM sheet, an inner hinge, a parcel post, a parcel box and the like. Through utilizing the carrier that corresponds to the carrier consumptive material that is effectual to advertising, can promote advertising effect.
In these optional implementation modes, through requiring the parcel to dimensions such as receiving goods area, goods class, goods brand, goods attribute and carrier consumable information, can improve advertisement and touch the rate, promote advertisement popularization effect. In addition, based on the condition of the advertisement, the requirements of other dimensions of the package can also be applied to the embodiment of the invention, and the invention is not exhaustive here.
In this embodiment, when receiving an advertisement order, the carrier attribute, the delivery amount and the delivery period of the advertisement to be delivered may be directly extracted, and the subsequent steps S120-S140 are executed; or after the advertisement information is extracted, storing the advertisement information in a preset space, and reading the carrier attribute, the delivery amount and the delivery period of the advertisement to be delivered from the preset space in response to a preset trigger condition, and executing the following steps S120-S140. In addition, other timing and modes for acquiring the carrier attribute, the delivery amount and the delivery period can also be applied to the embodiment of the present invention, which is not exhaustive herein.
S120, predicting the number of target carriers matched with the carrier attribute of each information in each warehouse in a preset period.
In this embodiment, the preset period may be set according to an empirical value or an experimental value, for example, may be 30 days. The preset period includes each delivery period, for example, the delivery period of advertisement 1 is 1 month 1 to 1 month 9, and the delivery period of advertisement 2 is 1 month 4 to 1 month 12, and at this time, the preset period may be 1 month 1 to 1 month 31, i.e., each delivery period may be included in the preset period.
The number of target carriers in a warehouse that match the carrier attributes of a message may be referred to as the yield of the warehouse to the message. Wherein, the target carrier matched with the carrier attribute can be identified by calculating the similarity of each attribute value in the carrier attribute. The similarity between attribute values may be calculated, for example, based on a natural language processing model, and other ways of calculating the similarity may be applied thereto.
In this embodiment, in a preset period, each warehouse predicts the capacity of each advertisement to be placed by means of a statistical model, a machine learning algorithm and the like, so that the corresponding relationship between the warehouse and the advertisement with higher utilization rate of the warehouse capacity is facilitated to be determined.
S130, determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information.
In this embodiment, the process of determining the correspondence between the warehouse and the information may be referred to as a process of advertising and discharging the warehouse. The corresponding relation between each warehouse and each advertisement in the preset time interval can be subjected to traversal setting based on algorithms such as branch delimitation, integer programming algorithm or dynamic programming algorithm, namely, each advertisement in the preset time interval is subjected to warehouse arrangement. In the process, the setting scheme of the feasible corresponding relation can be primarily screened out by enabling the set corresponding relation to meet the throwing amount and the throwing period corresponding to each piece of information.
In order to optimize the utilization rate of the whole warehouse and reduce the warehouse locking cost and the carrier consumable transportation cost, the method can further screen out a better scheme with higher warehouse utilization rate and lower cost consumption from feasible schemes based on a preset target. Wherein, the preset targets may include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers to the corresponding delivery quantity in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses in the corresponding delivery period of each information meets a second preset range.
In this embodiment, the preset targets may include two targets: the first item of target is that the sum of the ratios corresponding to the information meets a first preset range; the second object is that the average warehouse quantity corresponding to each item of information meets a second preset range.
In the first object, the ratio corresponding to a certain information may refer to the ratio of the sum of the capacity of each warehouse set in the corresponding relation to the information to the required delivery amount of the information in the delivery period of the information. Accordingly, the sum of the ratios of the respective pieces of information in the preset period may refer to the sum of the ratios of each piece of information in the preset period.
By way of example, the first term target may be expressed using the following formula:
Wherein I is an advertisement identifier, and I is E I, wherein I is all advertisements to be put; j is the mark of a unit time period in a preset time period, and J is E J, wherein J is a prediction time period; k is a warehouse identifier, and K is E K, wherein K is all warehouses; z ijk is a decision variable, and can represent whether the advertisement i and the warehouse k are provided with a corresponding relation in the period j; y ijk is the predicted capacity, which can represent the available capacity of warehouse k for advertisement i during period j; x i is the amount of impressions, representing the number of ad impressions that the advertiser desires to achieve.
Wherein, the unit time period is a time period less than the preset time period, and can be set according to an empirical value or an experimental value, for example, 1 day. Wherein can restrictThe value of the representation Z ijk is 1 or 0, and when the value is 1, the one-to-one correspondence relationship between the advertisement i and the warehouse k is set, and when the value is 0, the correspondence relationship between the advertisement i and the warehouse k is not set. Wherein, can also restrictThe correspondence relationship between the representation warehouse and the advertisement in a certain unit time can be one-to-one correspondence, namely, one advertisement can occupy only one warehouse in a certain day, and one warehouse can be occupied by only one advertisement.
Wherein Σ j,kZijk×Yijk can characterize the sum of the capacity of each warehouse set in the corresponding relation to the advertisement in the delivery period of the advertisement i. Wherein, The corresponding ratio of advertisement i can be characterized and Σ j,kZijk×Yijk≥aXi can be constrained; wherein a is a fault tolerance coefficient, and the coefficient can be preset according to an actual delivery scene, for example, can be 1.3, so that the sum of capacity can be ensured to meet the requirement of delivery quantity. Wherein sum may characterize the sum of the ratios of advertisements over a predetermined period.
By way of example, the second term target may be expressed using the following formula:
wherein the same letters as the above formula denote the same meaning. In addition, n is the number of all advertisements to be placed; wherein Σ ij,kZijk can characterize the total number of warehouses occupied by advertisement i during its impression period; ave may characterize the number of warehouses that are occupied on average for each advertisement.
The first preset range and the second preset range can be set and adjusted according to actual throwing conditions. For example, the first preset range may be [1.3-1.5], and the second preset range may be [1-3]. Through setting the first preset range in the small range larger than 1, the fault tolerance coefficient is set, the delivery amount can be guaranteed, the waste of warehouse capacity is avoided, and the utilization rate of the whole warehouse is improved. Through setting up the second scope of predetermineeing in the within range that is greater than 1, can reduce the warehouse quantity that every advertisement needs to occupy as far as possible to reduce lock storehouse cost and carrier consumable transportation cost.
And S140, aiming at each information, information is put on the basis of the target carrier of the corresponding warehouse in the corresponding putting period.
After the scheme of the corresponding relation with higher warehouse utilization rate and lower cost consumption is determined based on the preset target, the corresponding relation between the warehouse and the information in the unit time period of the preset time period in the scheme can be utilized to put in the information by utilizing the target carrier corresponding to the information in the warehouse. The information release can be realized based on the corresponding warehouse in the release period for each information.
In the conventional delivery method, a user often inputs a selection instruction based on experience or by using a simple rule to perform bin arrangement. For example, referring to the number of carriers matching information in each warehouse history day, the storage can be satisfied by the rule selection from large to small (or small to large) until the accumulated number can satisfy the delivery amount condition. In this way, although the requirement of the throwing amount can be basically met, the whole warehouse carrier utilization rate is low, and meanwhile, the lock warehouse cost and the carrier consumable transportation cost are increased by occupying a plurality of warehouses.
In the embodiment of the invention, by combining the actual bin arrangement scene problem and considering various constraints in the scene, reasonable preset target setting is performed, so that the bin yield utilization rate can be optimized, and the bin locking cost and consumable transportation cost can be reduced.
In some optional embodiments, the corresponding relation satisfies the delivery amount and the delivery period corresponding to each piece of information, including: aiming at each piece of information, the corresponding relation is the corresponding relation between the corresponding throwing period and each warehouse, and the sum of the number of target carriers in each warehouse in the corresponding relation in the corresponding throwing period is not smaller than the corresponding throwing amount.
Illustratively, in these alternative embodiments, the correspondence may be expressed by the following formula:
Wherein the same letters as the above formula denote the same meaning. Furthermore, ts i may characterize the start time of the delivery period of advertisement i and Te i may characterize the end time of the delivery period of advertisement i. By setting all decision variables outside the advertisement period to zero, the constraint corresponding relationship can be realized as the corresponding relationship between the corresponding delivery period and each warehouse.
The sum of the number of target carriers in each warehouse in the corresponding relation in the advertisement delivery period can be represented by the sum of the productivity sigma j,kZijk×Yijk. When the sum of the productivity is not less than the corresponding delivery amount of the advertisement, the situation of incapacity of performing can be avoided. Further, the sum of the capacities may also satisfy the constraint Σ j,kZijk×Yijk≥aXi, and a is a fault tolerance coefficient, which may be preset according to an actual delivery scenario, for example, may be 1.3. By setting the fault tolerance coefficient slightly larger than 1, the sum of the capacity can be ensured to a great extent to meet the requirement of the throwing amount.
In some alternative embodiments, the preset target further comprises: the sum of the ratios is added to the average warehouse number and the addition result is minimized.
In these alternative embodiments, the preset target may be represented by e=min (sum+ave), where sum may refer to equation (1-1), and ave may refer to equation (1-2). The optimal scheme of comprehensive warehouse utilization factor and bin number factor can be screened from the setting schemes of feasible corresponding relations by restraining the minimum sum of the two targets, so that the warehouse utilization rate is expected to be improved, and the bin cost (comprising the bin locking cost, the consumable transportation cost and the like) is reduced. In addition, the preset target can also set the sum of the weight coefficients for the two project labels to be minimum, so that the decision importance degree of the warehouse utilization factor and the warehouse utilization factor can be adjusted according to the actual scene.
Fig. 2 is a flowchart illustrating another information delivery method according to the first embodiment of the present invention. Referring to fig. 2, the delivery method may further include: inquiring advertisement information of all advertisements with undetermined corresponding relations from a preset space when judging that a new advertisement order is entered; estimating the productivity of each advertisement in each warehouse in a preset period; based on the corresponding relation meeting the putting quantity and the putting period of each advertisement, arranging the advertisement according to a preset target; judging whether advertisements of the non-dischargeable bin exist or not, if yes, storing the advertisements of the non-dischargeable bin into a preset space to wait for the completion of a next-round discharging bin, and if not, completing all the advertisement discharging bins; and aiming at each advertisement based on the bin arrangement result, carrying out advertisement delivery based on the target package of the corresponding warehouse in the corresponding delivery period.
In the delivery process, all the advertisements which are not arranged in the bin can be arranged in the bin in response to receiving a new advertisement order. The preset space can also be polled regularly, and when the advertisement information of a new advertisement order exists, all the advertisements which are not arranged in the bin are arranged in the bin.
In the embodiment of the invention, the preset targets can comprise two targets, wherein the first target is the sum of the ratios corresponding to the information and meets a first preset range, and the second target is the average warehouse number of the information and meets a second preset range. The ratio corresponding to each piece of information can represent the ratio of the predicted throwing amount to the required throwing amount of the information, and the resource waste of carriers capable of throwing the information in the warehouse can be avoided by limiting the sum of the ratio to a first preset range with smaller value, so that the utilization rate of the whole warehouse is improved. The average warehouse quantity of each piece of information can represent the warehouse quantity which is required to be occupied by the piece of information in the throwing period, and the warehouse quantity occupied by each piece of information in the throwing process can be reduced by limiting the average warehouse quantity in a second preset range with smaller numerical value, so that the warehouse locking cost and the consumable transportation cost are reduced.
Therefore, by setting the requirement that the corresponding relation needs to meet the throwing amount and the throwing period corresponding to each piece of information, a feasible corresponding relation scheme can be primarily screened out. By adding the preset target, a better corresponding relation scheme with higher warehouse utilization rate and lower cost consumption can be screened from feasible schemes. Information is put in based on the screened scheme, so that the utilization rate of the whole warehouse can be optimized, and the warehouse locking cost and the carrier consumable transportation cost are reduced.
Example two
The present embodiment describes in detail the step of estimating the capacity of the warehouse for each piece of information on the basis of the above embodiment. By utilizing a pre-trained prediction model, the capacity of each warehouse for each piece of information in a preset period can be primarily predicted according to historical data. In addition, as the warehouse and the information can have unique corresponding relation, whether the warehouse has corresponding relation information or not can be integrated, and the productivity condition of the warehouse for each information in the preset time period can be estimated, so that the prediction accuracy can be improved.
Fig. 3 shows a flowchart of a method for delivering information according to a second embodiment of the present invention. Referring to fig. 3, the method for delivering information provided in the embodiment of the present invention includes the following steps:
s310, acquiring the delivery quantity and the delivery period of the information to be delivered, and the carrier attribute of the delivery carrier corresponding to each information.
S320, counting the number of target carriers matched with the carrier attribute of each information in each warehouse in each unit time period of the history time period.
Wherein, the history period can be set according to experimental values or experience values, for example, 60 days or 30 days, etc.; the unit period may be the same as the set value of the unit period disclosed hereinabove, for example, 1 day. According to the historical shipping conditions of the warehouses, the unit time periods of the historical time periods can be counted, and the warehouses can produce historical capacity for each piece of information to be put in.
S330, based on a prediction model, primarily predicting the number of target carriers matched with the carrier attribute of each information in each warehouse in each unit time period of the preset time period according to the statistical result.
Wherein the preset time period comprises each throwing period. The prediction model may be a pre-trained model, for example, a moving average model, an autoregressive model, or the like. The statistical historical productivity is input into the prediction module, so that the productivity of each warehouse to each information in each unit time period of the preset time period can be predicted through the prediction model.
S340, inquiring whether the corresponding relation is set in each warehouse in a preset period.
Wherein, the set correspondence relationship can be recorded. Correspondingly, in the process of discharging bins, the bin discharging records of all the warehouses can be queried to determine whether the corresponding relation of all the warehouses is set in a preset period, namely, the available unit period and the unavailable unit period of all the warehouses in the prediction period can be determined.
S350, determining the number of target carriers matched with the carrier attribute of each information in each warehouse according to the query result and the preliminary prediction result.
The capacity condition of each warehouse for each information in each unit time period of the prediction time period can be determined according to the unit time period available in the prediction time period of each warehouse in the query result and the preliminarily predicted capacity of each warehouse for each information in each unit time period.
In the traditional delivery method, a user often inputs a selection instruction with reference to the number of carriers matched with advertisements in historical days of each warehouse, and the situation that the number of carriers matched with advertisements in a real delivery period is far smaller or far larger than the required delivery amount easily occurs, so that no performance or warehouse capacity waste is caused. In the embodiment of the invention, the capacity within the preset period is predicted by the prediction model, so that the problem that the delivery amount cannot be performed or the capacity is wasted due to the investigation of the historical capacity can be solved.
In some alternative implementations, the preliminary prediction results are represented by a warehouse capacity matrix; the query results are represented by a warehouse availability matrix.
Illustratively, the preliminary prediction results may be represented by Y 0 and the warehouse availability matrix may be represented by F. Wherein the warehouse capacity matrix and the warehouse availability matrix are the same size. In the warehouse capacity matrix and the warehouse availability matrix, the row identification represents the corresponding warehouse and information, and the column identification represents each unit time period of the preset time period.
Wherein the data in the warehouse capacity matrix represents the number of target carriers. For example, the data corresponding to row identification i, k and column identification j in the warehouse capacity matrix may characterize the available capacity of warehouse k for information i during period j. Correspondingly, the warehouse can use data corresponding to row identifiers i and k and column identifiers j in the matrix, and whether the warehouse k can be used in the j period of the information i can be characterized. Wherein, the data in the warehouse availability matrix may indicate that the warehouse is unavailable when the data is a first preset value (e.g., 0), and may indicate that the warehouse is available when the data is a second preset value (e.g., 1);
Correspondingly, according to the query result and the preliminary prediction result, determining the number of target carriers matched with the carrier attribute of each information in each warehouse comprises the following steps: and multiplying the data of the corresponding positions in the warehouse capacity matrix and the warehouse usable identification matrix to obtain the number of target carriers matched with the carrier attribute of each information in each warehouse.
After the warehouse capacity matrix Y 0 and the position elements corresponding to the warehouse usable identification matrix F are multiplied, a final capacity matrix Y with the same size as the warehouse capacity matrix Y 0 and the warehouse usable identification matrix F can be obtained. In the final capacity matrix Y, the row identifiers may also represent the corresponding warehouse and information, and the column identifiers may also represent each unit period of the preset period. For example, the data corresponding to row identification i, k and column identification j in the final warehouse capacity matrix may characterize the final predicted available capacity of warehouse k for information i during period j.
S360, determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information.
The preset targets comprise: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers to the corresponding delivery quantity in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses in the corresponding delivery period of each information meets a second preset range.
And S370, aiming at each piece of information, carrying out information delivery based on the target carrier of the corresponding warehouse in the corresponding delivery period.
The embodiment of the invention describes the capacity estimation step of the warehouse on each information in detail on the basis of the embodiment. By utilizing a pre-trained prediction model, the capacity of each warehouse for each piece of information in a preset period can be primarily predicted according to historical data. In addition, as the warehouse and the information can have unique corresponding relation, whether the warehouse has corresponding relation information or not can be integrated, and the productivity condition of the warehouse for each information in the preset time period can be estimated, so that the prediction accuracy can be improved. In addition, the embodiment of the present invention and the method for delivering information provided by the above embodiment belong to the same inventive concept, and technical details not described in detail in the present embodiment can be referred to the above embodiment, and the present embodiment has the same beneficial effects as the above embodiment.
Example III
On the basis of the embodiment, the constraint conditions which need to be met in the bin discharging process are supplemented. By setting the lower limit constraint of the capacity, the situation that one bin is additionally locked for meeting the smaller throwing amount can be avoided, and the consumption of the cost of the bin can be reduced to a certain extent. By setting the positive capacity constraint, it is possible to avoid the occurrence of selecting a warehouse of negative capacity for the purpose of reducing the target item of the sum of the ratios. In addition, the embodiment also describes the adjustment step of the preset target and/or constraint condition, so that the preset target and/or constraint condition can be gradually optimized according to the actual throwing condition, and the bin discharging effect is further improved.
In some optional embodiments, when the corresponding relation satisfies the delivery amount and the delivery period corresponding to each piece of information, at least one of the following preset constraint conditions is satisfied:
For each piece of information, only determining the corresponding relation with the warehouse meeting the lower limit of the productivity; the sum of the number of target carriers in the corresponding delivery period is not smaller than the preset proportion of the corresponding delivery amount; for each piece of information, only determining the corresponding relation between the information and the warehouse which is producing energy in a unit period; the positive capacity of the unit time period refers to that the number of the target carriers is larger than 0 in the unit time period corresponding to the throwing period.
Illustratively, the lower capacity constraint may be expressed by the following formula:
Wherein the same letters as the above formula denote the same meaning. Wherein b is the reciprocal of a preset ratio, and the coefficient may be set according to a specific delivery scene, for example, may be 10. The formula may indicate that, for advertisement i, if the total capacity of warehouse k in its delivery period is less than one-half of the required delivery, warehouse k may be considered to be out of compliance with the capacity lower limit constraint of advertisement i. At this time, the correspondence between the warehouse and the advertisement is not set for each unit time interval, i.e. the decision variable is 0.
Because of the large number of available bins, the capacity of each bin for different information is also unequal. For example, there may be a case that a certain bin meets the capacity of a certain information by only one digit, and the information requirement is large, and at this time, it is unreasonable to select the bin for information delivery. By setting the lower limit constraint of the capacity, the situation that one bin is locked to meet the requirement of a part of too small delivery amount can be avoided, and the consumption of the cost of the bin can be reduced to a certain extent.
Illustratively, the positive capacity constraint may be expressed by the following formula:
Wherein the same letters as the above formula denote the same meaning. The formula may indicate that if the available capacity of warehouse k for advertisement i during period j is less than or equal to 0, warehouse k is deemed to be not in compliance with the positive capacity constraint of advertisement i. At this time, for the period of time that does not meet the positive capacity constraint, the correspondence between the warehouse and the advertisement is not set, i.e. the decision variable is 0.
Wherein, the bin capacity is less than or equal to 0 may include the following cases: a) The occupied bins of a certain day cannot be arranged, namely Y ijk is equal to 0; b) The bin is unoccupied for the day, but the predicted capacity based on the prediction model has a Y ijk of 0 or less. For each message, when a bin capacity is equal to or less than 0 on a day, then that bin is not selectable on that day.
In some optional embodiments, after information delivery based on the target carrier of the corresponding warehouse, the method further comprises: recording the actual delivery quantity of information delivery based on the target carrier of the corresponding warehouse in the corresponding delivery period for each piece of information; and adjusting a preset target and/or a preset constraint condition according to the actual delivery quantity.
In these alternative embodiments, after the actual warehouse discharging is performed, the actual delivery amount of each piece of information may be recorded, and the warehouse utilization rate and the consumable transportation cost corresponding to the actual delivery amount may also be recorded. By comparing the current recorded result with the historical recorded result, whether the performance is completed and whether the utilization rate is improved is analyzed, and meanwhile, the cost is reduced. And then, according to the analysis result, the preset target and/or preset conditions can be adjusted to continuously optimize the warehouse discharging process, so that the warehouse utilization rate is continuously improved, and the warehouse using cost is reduced.
On the basis of the embodiment, the embodiment of the invention supplements the constraint conditions which need to be met in the bin arrangement process. By setting the lower limit constraint of the capacity, the situation that one bin is additionally locked for meeting the smaller throwing amount can be avoided, and the consumption of the cost of the bin can be reduced to a certain extent. By setting the positive capacity constraint, it is possible to avoid the occurrence of selecting a warehouse of negative capacity for the purpose of reducing the target item of the sum of the ratios. In addition, the embodiment also describes the adjustment step of the preset target and/or constraint condition, so that the preset target and/or constraint condition can be gradually optimized according to the actual throwing condition, and the bin discharging effect is further improved.
The embodiment of the present invention and the method for delivering information provided by the above embodiment belong to the same inventive concept, and technical details not described in detail in the present embodiment can be referred to the above embodiment, and the present embodiment has the same beneficial effects as the above embodiment.
Example IV
Fig. 4 is a schematic structural diagram of an information delivery device according to a fourth embodiment of the present invention. The embodiment of the invention can be applied to the situation of delivering the package advertisement, for example, the situation of firstly determining the corresponding relation between the advertisement and the warehouse and then delivering the advertisement based on the warehouse with the determined corresponding relation.
As shown in fig. 4, the information delivery device provided by the embodiment of the present invention includes:
an acquisition module 410, configured to acquire a delivery amount and a delivery period of information to be delivered, and a carrier attribute of a delivery carrier corresponding to each information;
The predicting module 420 is configured to predict, in a preset period, the number of target carriers in each warehouse, where the number of target carriers matches with the carrier attribute of each information; wherein the preset time period comprises each throwing period;
The bin arrangement module 430 is configured to determine a correspondence between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information;
the delivery module 440 is configured to deliver, for each piece of information, information based on the target carrier in the corresponding warehouse in the corresponding delivery period;
the preset targets comprise: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers to the corresponding delivery quantity in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses in the corresponding delivery period of each information meets a second preset range.
In some alternative embodiments, the prediction module may be specifically configured to:
Counting the number of target carriers matched with the carrier attribute of each information in each warehouse in each unit time period of the history time period;
Based on a prediction model, primarily predicting the number of target carriers matched with the carrier attribute of each information in each warehouse in each unit time period of a preset time period according to a statistical result;
inquiring whether each warehouse is provided with a corresponding relation or not within a preset period;
and determining the number of target carriers matched with the carrier attribute of each information in each warehouse according to the query result and the preliminary prediction result.
In some alternative embodiments, the preliminary prediction results are represented by a warehouse capacity matrix; the query result is represented by a warehouse usable matrix;
in the warehouse capacity matrix and the warehouse availability matrix, the row identification represents the corresponding warehouse and information, and the column identification represents each unit time period of the preset time period; wherein the data in the warehouse capacity matrix represents the number of target carriers; the data in the warehouse availability matrix indicates that the warehouse is unavailable when the data is a first preset value, and indicates that the warehouse is available when the data is a second preset value;
accordingly, the prediction module may be specifically configured to:
And multiplying the data of the corresponding positions in the warehouse capacity matrix and the warehouse usable identification matrix to obtain the number of target carriers matched with the carrier attribute of each information in each warehouse.
In some optional embodiments, when determining the correspondence, the bin arrangement module satisfies the delivery amount and the delivery period corresponding to each piece of information, including:
Aiming at each piece of information, the corresponding relation is the corresponding relation between the corresponding throwing period and each warehouse, and the sum of the number of target carriers in each warehouse in the corresponding relation in the corresponding throwing period is not smaller than the corresponding throwing amount.
In some optional embodiments, when determining the correspondence, the bin arrangement module satisfies at least one preset constraint condition as follows while the correspondence satisfies the delivery amount and the delivery period corresponding to each piece of information:
for each piece of information, only determining the corresponding relation with the warehouse meeting the lower limit of the productivity; the sum of the number of target carriers in the corresponding delivery period is not smaller than the preset proportion of the corresponding delivery amount;
For each piece of information, only determining the corresponding relation between the information and the warehouse which is producing energy in a unit period; the positive capacity of the unit time period refers to that the number of the target carriers is larger than 0 in the unit time period corresponding to the throwing period.
In some alternative embodiments, the delivery device further comprises:
the recording module is used for recording the actual delivery amount of information delivery based on the target carrier of the corresponding warehouse in the corresponding delivery period for each piece of information after the information delivery is carried out based on the target carrier of the corresponding warehouse;
and the feedback module is used for adjusting a preset target and/or a preset constraint condition according to the actual delivery quantity.
In some alternative embodiments, the preset target further comprises: the sum of the ratios is added to the average warehouse number and the addition result is minimized.
In some alternative embodiments, the carrier properties include at least one of: the receiving area, the goods class, the goods brand, the goods attribute and the carrier consumable information.
The information delivery device provided by the embodiment of the present invention belongs to the same inventive concept as the information delivery method provided by the above embodiment, technical details which are not described in detail in the embodiment of the present invention can be seen in the above embodiment, and the embodiment of the present invention has the same beneficial effects as the above embodiment.
Example five
Fig. 5 shows a schematic hardware structure of a terminal device according to a fifth embodiment of the present invention. The terminal device in the embodiment of the present invention may include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), car terminals (e.g., car navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The terminal device shown in fig. 5 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 5, the terminal apparatus 500 may include a processing device (e.g., a central processor, a graphics processor, etc.) 501, which may perform various appropriate actions and processes according to a program stored in a Read-Only Memory (ROM) 502 or a program loaded from a storage device 508 into a random access Memory (Random Access Memory, RAM) 503. In the RAM503, various programs and data necessary for the operation of the terminal apparatus 500 are also stored. The processing device 501, the ROM 502, and the RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
In general, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 507 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 508 including, for example, magnetic tape, hard disk, etc.; and communication means 509. The communication means 509 may allow the terminal device 500 to communicate with other devices wirelessly or by wire to exchange data. While fig. 5 shows a terminal device 500 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
In particular, according to embodiments of the present invention, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 509, or from the storage means 508, or from the ROM 502. When executed by the processing device 501, the computer program performs the functions defined above in the method for delivering information provided by the embodiment of the present invention.
The terminal provided by the embodiment of the present invention and the information delivery method provided by the above embodiment belong to the same inventive concept, technical details which are not described in detail in the embodiment of the present invention can be seen in the above embodiment, and the embodiment of the present invention has the same beneficial effects as the above embodiment.
Example six
An embodiment of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the method for delivering information provided by the above embodiment.
It should be noted that, the computer readable storage medium according to the embodiment of the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (EPROM) or FLASH Memory (FLASH), an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in embodiments of the present invention, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer-readable storage medium may be included in the terminal device or may exist alone without being incorporated in the terminal device.
The terminal device stores one or more programs that, when executed by the terminal device, cause the terminal device to:
Acquiring the delivery quantity and the delivery period of the information to be delivered, and the carrier attribute of the delivery carrier corresponding to each information; predicting the number of target carriers matched with the carrier attribute of each information in each warehouse in a preset period; wherein the preset time period comprises each throwing period; determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information; aiming at each information, in the corresponding throwing period, throwing the information based on the target carrier of the corresponding warehouse; the preset targets comprise: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers to the corresponding delivery quantity in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses in the corresponding delivery period of each information meets a second preset range.
Computer program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functional pages noted in the blocks may occur out of the order noted in the figures. 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 involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present invention may be implemented in software or in hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.
The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary versions of hardware logic that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.

Claims (11)

1. The information delivery method is characterized by comprising the following steps:
Acquiring the delivery quantity and the delivery period of information to be delivered of all non-arranged bins and the carrier attribute of a delivery carrier corresponding to each piece of information; the bin arranging finger determines the corresponding relation between the warehouse and the information;
Predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in a preset period; wherein the preset time period comprises each of the delivery periods;
Determining the corresponding relation between each warehouse and each piece of information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information;
aiming at each piece of information, in a corresponding throwing period, throwing the information based on the target carrier of the corresponding warehouse;
Wherein the preset targets include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers in a corresponding delivery period to the quantity of target carriers in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses of each piece of information in the corresponding delivery period meets a second preset range.
2. The method of claim 1, wherein predicting the number of target carriers in each warehouse that match the carrier attribute of each piece of information for a predetermined period of time comprises:
counting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in each unit time period of the history time period;
based on a prediction model, primarily predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in each unit time period of a preset time period according to a statistical result;
inquiring whether corresponding relations are set in all the warehouses within a preset period;
And determining the number of target carriers matched with the carrier attribute of each piece of information in each warehouse according to the query result and the preliminary prediction result.
3. The method of claim 2, wherein the preliminary prediction results are represented by a warehouse capacity matrix; the query result is represented by a warehouse availability matrix;
In the warehouse capacity matrix and the warehouse availability matrix, row identifiers represent corresponding warehouses and information, and column identifiers represent each unit time period of a preset time period; wherein the data in the warehouse capacity matrix represents the number of target carriers; the data in the warehouse availability matrix indicates that the warehouse is unavailable when the data is a first preset value, and indicates that the warehouse is available when the data is a second preset value;
Correspondingly, according to the query result and the preliminary prediction result, determining the number of target carriers matched with the carrier attribute of each piece of information in each warehouse comprises the following steps:
Multiplying the warehouse capacity matrix and the data of the corresponding positions in the warehouse usable identification matrix to obtain the number of target carriers matched with the carrier attribute of each piece of information in each warehouse.
4. The method according to claim 1, wherein the correspondence satisfies a delivery amount and a delivery period corresponding to each piece of information, comprising:
For each piece of information, the corresponding relation is a corresponding relation between the corresponding throwing period and each warehouse, and the sum of the number of target carriers in each warehouse in the corresponding relation in the corresponding throwing period is not smaller than the corresponding throwing amount.
5. The method of claim 1, wherein the correspondence satisfies at least one preset constraint condition as well as a delivery amount and a delivery period corresponding to each piece of information:
For each piece of information, only determining a corresponding relation with a warehouse meeting the lower limit of productivity; the sum of the number of target carriers in the corresponding delivery period is not smaller than the preset proportion of the corresponding delivery amount;
For each piece of information, only determining the corresponding relation between the information and a warehouse which is producing energy in a unit period; the positive capacity of the unit time period refers to that the number of the target carriers is larger than 0 in the unit time period corresponding to the throwing period.
6. The method according to claim 5, further comprising, after the information delivery by the target carrier based on the corresponding warehouse:
for each piece of information, recording the actual delivery quantity of information delivery based on the target carrier of the corresponding warehouse in the corresponding delivery period;
And adjusting the preset target and/or preset constraint conditions according to the actual delivery quantity.
7. The method of claim 1, wherein the preset target further comprises: and adding the sum of the ratios to the average warehouse number, and minimizing the addition result.
8. The method of any one of claims 1-7, wherein the carrier property comprises at least one of: the receiving area, the goods class, the goods brand, the goods attribute and the carrier consumable information.
9. An information delivery device, comprising:
The acquisition module is used for acquiring the delivery quantity and the delivery period of the information to be delivered of all the non-arranged bins and the carrier attribute of the delivery carrier corresponding to each piece of information; the bin arranging finger determines the corresponding relation between the warehouse and the information;
The prediction module is used for predicting the number of target carriers matched with the carrier attribute of each piece of information in each warehouse in a preset period; wherein the preset time period comprises each of the delivery periods;
The warehouse discharging module is used for determining the corresponding relation between each warehouse and each information in a preset period based on a preset target; the corresponding relation satisfies the throwing amount and the throwing period corresponding to each piece of information;
The delivery module is used for delivering the information based on the target carrier of the corresponding warehouse in the corresponding delivery period aiming at each piece of information;
Wherein the preset targets include: in a preset period, the sum of the quantity of target carriers in a corresponding warehouse and the ratio of the quantity of target carriers in a corresponding delivery period to the quantity of target carriers in a corresponding delivery period meets a first preset range; and the average warehouse quantity of the corresponding warehouses of each piece of information in the corresponding delivery period meets a second preset range.
10. A terminal device, characterized in that the terminal comprises:
One or more processors;
A memory for storing one or more programs;
When executed by the one or more processors, causes the one or more processors to implement the method of delivering information as recited in any one of claims 1-8.
11. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements a method of delivering information according to any of claims 1-8.
CN202210079736.7A 2022-01-24 2022-01-24 Information delivery method and device, terminal equipment and storage medium Active CN114418645B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210079736.7A CN114418645B (en) 2022-01-24 2022-01-24 Information delivery method and device, terminal equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210079736.7A CN114418645B (en) 2022-01-24 2022-01-24 Information delivery method and device, terminal equipment and storage medium

Publications (2)

Publication Number Publication Date
CN114418645A CN114418645A (en) 2022-04-29
CN114418645B true CN114418645B (en) 2024-09-24

Family

ID=81277388

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210079736.7A Active CN114418645B (en) 2022-01-24 2022-01-24 Information delivery method and device, terminal equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114418645B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109961306A (en) * 2017-12-25 2019-07-02 北京京东尚科信息技术有限公司 A kind of inventory allocation method and apparatus of article
CN113538028A (en) * 2020-04-17 2021-10-22 北京京东振世信息技术有限公司 Advertisement putting method and device

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002099962A (en) * 2000-09-25 2002-04-05 Sony Corp Rental device, rental terminal, rental system, rental package and transfer information
US20060074752A1 (en) * 2004-10-05 2006-04-06 David Newmark Method of facilitating placement of advertising
JP2008546073A (en) * 2005-05-24 2008-12-18 マイケル サイ, Systems, methods and processes for delivery and ordering of classified goods and services through an integrated drive-through complex
KR101412198B1 (en) * 2011-09-09 2014-07-03 (주)재플 Method and System for Zapping Advertisement Service
WO2014124420A1 (en) * 2013-02-11 2014-08-14 Vindico Llc System and method to analyze and rate online advertisement placement quality and potential value
JP6752419B2 (en) * 2016-06-15 2020-09-09 株式会社リニア・サーキット Recorded media lending device
CN108269109A (en) * 2016-12-30 2018-07-10 深圳市优朋普乐传媒发展有限公司 A kind of Advertisement arrangement injected volume equalization methods and device
CN112749991A (en) * 2018-10-09 2021-05-04 广东聚宝屋传媒有限公司 Control method and device for advertising on express package
CN109359911B (en) * 2018-10-09 2021-05-11 广东聚宝屋传媒有限公司 Information management method and device based on package mediaization
CN110335076B (en) * 2019-07-02 2023-08-01 深圳市丰巢科技有限公司 Advertisement delivery method, advertisement delivery device, server and storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109961306A (en) * 2017-12-25 2019-07-02 北京京东尚科信息技术有限公司 A kind of inventory allocation method and apparatus of article
CN113538028A (en) * 2020-04-17 2021-10-22 北京京东振世信息技术有限公司 Advertisement putting method and device

Also Published As

Publication number Publication date
CN114418645A (en) 2022-04-29

Similar Documents

Publication Publication Date Title
CN109961306B (en) Method and device for distributing inventory of articles
CN103069421A (en) Method and apparatus for processing search requests for a partitioned index
CN107451785B (en) Method and apparatus for outputting information
CN110363455A (en) A route planning method and system for item collection
CN111159553A (en) Information pushing method and device, computer equipment and storage medium
CN108520471A (en) Overlapping community discovery method, device, equipment and storage medium
US20240397131A1 (en) Synthetic total audience ratings
CN115222456A (en) Marketing method, platform, equipment and medium based on big data user consumption preference
Rahman et al. Using spatio‐temporal deep learning for forecasting demand and supply‐demand gap in ride‐hailing system with anonymised spatial adjacency information
CN108197825A (en) System scheduling method and device
CN110196949B (en) Information push method, device, electronic device and computer readable medium
CN113469575B (en) User scheduling method and device in distribution scene, electronic equipment and storage medium
CN113128597B (en) Method and device for extracting user behavior characteristics and classifying and predicting user behavior characteristics
CN114418645B (en) Information delivery method and device, terminal equipment and storage medium
CN113743804A (en) Article transportation method, apparatus, device and computer readable medium
CN114429371A (en) Unmanned vehicle-based commodity marketing method and device, electronic equipment and storage medium
CN113760550A (en) Resource allocation method and resource allocation device
CN110942345B (en) Seed user selection method, device, equipment and storage medium
CN107203633A (en) Tables of data pushes away several processing methods, device and electronic equipment
CN112396266A (en) Order distribution method, device, server and storage medium
CN112308595A (en) Method and device for determining the state of an item
CN113487269B (en) Payment information generation method, device, electronic equipment and computer readable medium
CN114119054B (en) Method and device for publishing media information and storage medium
CN113077072B (en) Method and device for predicting cargo quantity
CN117522477A (en) Article click rate prediction method, apparatus, device, storage medium, and program product

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