CN113781095A - Method for optimizing product delivery channel and related device - Google Patents
Method for optimizing product delivery channel and related device Download PDFInfo
- Publication number
- CN113781095A CN113781095A CN202110863103.0A CN202110863103A CN113781095A CN 113781095 A CN113781095 A CN 113781095A CN 202110863103 A CN202110863103 A CN 202110863103A CN 113781095 A CN113781095 A CN 113781095A
- Authority
- CN
- China
- Prior art keywords
- node
- delivery channel
- ratio
- order
- ordering node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 68
- 238000012216 screening Methods 0.000 claims abstract description 11
- 238000005457 optimization Methods 0.000 claims abstract description 10
- 239000000047 product Substances 0.000 claims description 73
- 230000015654 memory Effects 0.000 claims description 31
- 238000004590 computer program Methods 0.000 claims description 13
- 239000006227 byproduct Substances 0.000 claims description 5
- 238000004891 communication Methods 0.000 description 8
- 230000009286 beneficial effect Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003631 expected effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 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/0201—Market modelling; Market analysis; Collecting market data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Data Mining & Analysis (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the application discloses a method for optimizing a product delivery channel and a related device, wherein the method comprises the following steps: comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node; the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node; calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume; calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel; and adjusting a first ordering node in the first delivery channel based on the first ratio and the second ratio so as to realize optimization of the first delivery channel.
Description
Technical Field
The invention relates to the technical field of information processing, in particular to a method for optimizing a product delivery channel and a related device.
Background
At present, most products are sold on line, and when the products are sold on line, a channel for selling the products is provided with a plurality of ordering nodes for users to operate so as to realize purchase.
In the prior art, the advantages and disadvantages of all the ordering nodes of the delivery channel are judged artificially and subjectively, and when the advantages and disadvantages of all the ordering nodes are judged artificially, the delivery channel is optimized by depending on personal intuition, so that a plurality of uncertainties exist in an optimization result, time and labor are wasted, and an expected effect is difficult to achieve.
Disclosure of Invention
An object of the present application is to provide a method and related apparatus for optimizing a delivery channel of a product, which is advantageous in that the delivery channel is optimized based on data of order nodes by quantifying the data of the order nodes in the delivery channel.
An object of the present application is to provide a method and a related apparatus for optimizing a delivery channel of a product, which are advantageous in that a first ratio and a second ratio are obtained through calculation, the first ratio is a specific gravity of an order realized through an ordering node and a delivery channel order transaction amount, the second ratio is a transaction efficiency of selling a product by an ordering node, and the ordering node in the delivery channel is adjusted based on numerical values of the first ratio and the second ratio.
An object of the present application is to provide a method and a related apparatus for optimizing a delivery channel of a product, which are advantageous in that based on obtaining a quantity of return orders after orders are fulfilled through an ordering node in the delivery channel by the product, and calculating a fifth ratio between the quantity of return orders after orders are fulfilled by the ordering node and the quantity of return orders fulfilled through the ordering node, if the fifth ratio is greater than a fifth preset value, the ordering node in the delivery channel is optimized to reduce a return rate.
The plurality of clients are analyzed to screen the intention clients, and the intention clients can be selectively communicated further, so that the working efficiency of the professional consultant is improved.
An object of the present application is to provide a prompting method, apparatus and computer storage medium, which are advantageous in that it is convenient to determine whether a client is an intended client by determining objective tendency values and subjective tendency values of the client through characteristic information of the client and interactive messages with the client to determine a comprehensive tendency value of the client.
In a first aspect, an embodiment of the present application provides a method for optimizing a delivery channel of a product, where the method includes the following steps:
respectively acquiring order volume of a plurality of putting channels sold by products in a preset time;
comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node;
calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume;
calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel;
and adjusting a first ordering node in the first delivery channel based on the first ratio and the second ratio so as to realize optimization of the first delivery channel.
According to the first aspect, in a possible implementation manner, the adjusting a first subscription node in the first delivery channel includes:
if the first ratio is smaller than the first preset value, and the second ratio is smaller than the second preset value;
and removing the first order node in the first delivery channel.
According to the first aspect, in a possible implementation manner, the method further includes the steps of: screening a second delivery channel with the order volume reaching a preset volume from a plurality of delivery channels, wherein the second delivery channel at least comprises a third ordering node and a fourth ordering node;
obtaining the clicked quantity and the effective clicked quantity of a third ordering node in a second delivery channel, wherein the effective clicked quantity of the third ordering node is the quantity of businesses which pass through the third ordering node;
calculating a third ratio of the effective destination quantity of a third ordering node in the second delivery channel to the order traffic quantity;
calculating a fourth ratio of the effective clicked quantity to the clicked quantity of a third ordering node in a second delivery channel;
and if the third ratio is greater than the third preset value and the fourth ratio is greater than the fourth preset value, adding a third ordering node in the first delivery channel.
According to the first aspect, in a possible implementation manner, after the first ratio and the second ratio are calculated, the method includes the steps of:
if the first ratio is smaller than the first preset value, and the second ratio is larger than or equal to the second preset value;
and adjusting the position of the selling interface of the first ordering node in the first delivery channel, or adjusting the size of the selling interface of the first ordering node in the first delivery channel.
According to the first aspect, in a possible implementation manner, the adjusting the position of the selling interface of the first order node in the first delivery channel includes the steps of:
repeatedly adjusting the position of a selling interface of a first ordering node in a first putting channel;
when the maximum order volume is realized through the first order node within the preset time, the position of a selling interface where the first order node is located is the final position;
the adjustment of the size of the selling interface of the first ordering node in the first putting channel comprises the following steps:
repeatedly adjusting the size of a selling interface of the first ordering node in a first putting channel;
when the maximum order volume is realized through the first ordering node within the preset time, the size of the first ordering node on the selling interface is the final size.
According to the first aspect, in a possible implementation manner, the adjusting a first subscription node in the first delivery channel includes:
if the first ratio is greater than or equal to a first preset value, and the second ratio is smaller than a second preset value;
and simplifying the operation steps of realizing order transaction by the first ordering node.
According to the first aspect, in a possible implementation manner, when a third subscription node is added to the first delivery channel, the method includes the steps of:
adjusting the sequence of the third ordering node in the traffic path in the first delivery channel;
and the order with the largest volume is realized by the third ordering node within the preset time is the final order of the third ordering node in the first delivery channel.
According to the first aspect, in a possible implementation manner, the method further includes the steps of:
acquiring the quantity of returned orders of the products after the orders are committed through the first ordering node;
calculating a fifth ratio of the number of the returned orders after the order fulfillment through the first order node to the number of the order fulfillment through the first order node;
and if the fifth ratio is larger than a fifth preset value, increasing the display content of the product at the first ordering node.
In a second aspect, an embodiment of the present application provides an apparatus for optimizing a delivery channel of a product, the apparatus includes a memory and a processor, the memory is configured to store computer instructions, and the processor is configured to execute the computer to implement the following steps:
respectively acquiring order volume of a plurality of putting channels sold by products in a preset time;
comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node;
calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume;
calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel;
and adjusting a first order node in the first delivery channel based on the first ratio and the second ratio.
In a third aspect, an embodiment of the present application provides a computer storage medium, where a computer program is stored, and when executed by a processor, the computer program implements the method described above.
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 main flow diagram of a delivery channel for optimizing products according to an embodiment of the present disclosure;
fig. 2 is a schematic flowchart illustrating a process of adding a third order node in a first delivery channel according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a process of removing a first subscription node in a first delivery channel according to an embodiment of the present application;
fig. 4 is a schematic flowchart illustrating a process of changing a size or a location of a first subscription node in a first delivery channel according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an apparatus for optimizing a delivery channel of a product according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described below with reference to the drawings in the embodiments of the present application.
The terms "including" and "having," and any variations thereof, in the description and claims of this application and the drawings described above, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
At present, most products are sold on line, and when the products are sold on line, a channel for selling the products is provided with a plurality of ordering nodes for users to operate so as to realize purchase.
In the prior art, the advantages and disadvantages of all the ordering nodes of the delivery channel are judged artificially and subjectively, and when the advantages and disadvantages of all the ordering nodes are judged artificially, the delivery channel is optimized by depending on personal intuition, so that a plurality of uncertainties exist in an optimization result, time and labor are wasted, and an expected effect is difficult to achieve.
The present application provides a method for optimizing a delivery channel of a product, and referring to fig. 1 in particular, fig. 1 is a main flow chart of an optimized delivery channel of a product provided in an embodiment of the present application, and for better understanding, an executing subject of the method may be specifically an apparatus 100, and the method includes, but is not limited to, the following steps:
s1, obtaining the order volume of a plurality of putting channels sold by the product in the preset time;
in the embodiments provided in the present application, the delivery channel is a channel of products sold on the internet, and for example, the delivery channel may specifically be naobao, jingdong, and the like.
The order volume is a total order volume of products sold and delivered in a delivery channel, for example, when a user sells clothes through the internet, the order volume is 1 if one user purchases one clothes at a time, the order volume is 10 if one user purchases 10 clothes at a time, the order volume is 2 if one user purchases clothes twice, and the total order volume of products purchased by all users in the delivery channel within a preset time is the order volume.
In the embodiment provided by the application, the same product is released in a plurality of releasing channels, and meanwhile, the selling price of the product in each releasing channel is consistent, for example, the products sold in the plurality of channels are clothes with the same brand, type and price.
S2, comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the delivery path for selling the products through the delivery channel is provided with ordering nodes for a user to operate to realize delivery, and the ordering nodes can comprise a first ordering node and a second ordering node; illustratively, the ordering node may be embodied as an option for a package of products, a loading item for a shopping cart for the products, an option for an installment of the products, a predetermined item for an activity of the products, and the like.
Generally, the more the order nodes, the more the modes for customers to select for bargaining, but the too many order nodes are inconvenient for the customers to carry out bargaining operation and can be suitable for the opposite, in the embodiment provided by the present application, each delivery channel may have different order nodes, and the device 100, when optimizing the delivery channel of the product, takes the first delivery channel with the largest ordered bargaining amount as a basic frame and optimizes the first delivery channel.
In the embodiments provided by the present application, the delivery channels may specifically include a first delivery channel, a second delivery channel, or more delivery channels, and the order volume of selling products may be different from each other in each delivery channel, for example, the order volume of selling products in a plurality of delivery channels is 2000 orders, 1000 orders, 500 orders, and when the device 100 optimizes the delivery channels, the delivery channel with the order volume of 2000 orders is selected as the first delivery channel, and the first delivery channel is used as the basic framework for optimization.
S3, obtaining the clicked volume and the effective clicked volume of the first order node in the first delivery channel, wherein the effective clicked volume of the first order node is the number of businesses which pass through the first order node.
The clicked amount is a total number of times that the user clicks the ordering node, for example, the first ordering node is a shopping cart, the clicked amount of the shopping cart is 1 if one user pulls one product into the shopping cart, the clicked amount of the shopping cart is 2 if one user pulls two products into the shopping cart, and the total number of the products pulled into the shopping cart is the clicked amount of the shopping cart when selling the products through the first delivery channel.
The effective clicked amount is the number of ordered transactions by clicking the ordering node, for example, the first ordering node is a shopping cart, if one user pulls two products into the shopping cart, the user realizes payment in the shopping cart, and purchases 2 products, the effective clicked amount of the shopping cart is 2, the user realizes payment in the shopping cart, and purchases 1 product, the effective clicked amount of the shopping cart is 1, and if the user does not realize payment in the shopping cart, the effective clicked amount of the cart shopping is 0.
S4, calculating a first ratio of the effective clicked volume of the first order node in the first delivery channel to the order volume;
s5, calculating a second ratio of the effective clicked volume to the clicked volume of the first order node in the first delivery channel;
in an embodiment provided by the present application, the first order node may be any order node in the delivery channel, and the apparatus 100 may quantify a ratio of the volume of the first order node to the volume of the order according to the clicked volume of the first order node and the volume of the order node, where the ratio of the volume of the first order node to the volume of the order is a first ratio.
The apparatus 100 may quantify a transaction efficiency of the first order node according to the effective click rate and the clicked amount of the first order node, where the transaction efficiency is a second ratio.
S6, adjusting the first order node in the first delivery channel based on the first ratio and the second ratio to realize the optimization of the first delivery channel.
In the embodiment provided by the present application, the apparatus 100 measures the specific situation of the first subscription node through a first ratio and a second ratio, and when optimizing the first delivery channel, adjusts the first subscription node based on the first ratio and the second ratio, so as to optimize the first delivery channel.
Specifically, the actual situation of the first order node is quantified by using the first ratio and the second ratio, so that the defects of the first order node can be obtained, and the first order node can be specifically adjusted when the first delivery channel is optimized, so that the first delivery channel is optimized.
Referring to fig. 3, fig. 3 is a schematic flowchart of a process for removing a first subscription node in a first delivery channel according to an embodiment of the present application, where adjusting the first subscription node in the first delivery channel includes the steps of:
s61, if the first ratio is smaller than the first preset value, and the second ratio is smaller than the second preset value;
and S62, removing the first order node in the first delivery channel.
Generally, products are sold on the internet, and on a delivery channel on the internet, the easier a user operates on the delivery channel, the more beneficial the user purchases the products on the internet, however, the more optimization activities of the products in the delivery channel, the more beneficial the product sale, when the optimization activities of the products are more, the more order nodes need to be set on the delivery channel, and the more order nodes, the more inconvenient the user operates to purchase the products.
In the embodiment provided by the application, in order to optimize the first delivery channel, some first order nodes which are not beneficial to a user to purchase products are removed.
Specifically, a first order node which is not beneficial to a user to purchase a product can be judged through a first ratio and a second ratio, when the first ratio and the second ratio of the first order node are respectively lower than a first preset value and a second preset value, the situation that the setting of the first order node is not beneficial to product selling can be determined, the first order node can be removed when the first delivery channel is optimized, so that an order interface in the first delivery channel is simpler, the user can purchase the product through other order nodes in the first delivery channel conveniently, and the optimization of the first delivery channel is realized.
Referring to fig. 2, fig. 2 is a schematic flowchart illustrating adding a third ordering node in a first delivery channel according to an embodiment of the present application; the method further comprises the steps of:
s7, screening a second delivery channel with the order volume reaching a preset volume from a plurality of delivery channels, wherein the second delivery channel at least comprises a third ordering node and a fourth ordering node;
s8, obtaining the clicked volume and the effective clicked volume of a third ordering node in a second delivery channel, wherein the effective clicked volume of the third ordering node is the number of businesses which pass through the third ordering node;
s9, calculating a third ratio of the effective destination quantity of a third order node in the second delivery channel to the order volume;
calculating a fourth ratio of the effective clicked quantity to the clicked quantity of a third ordering node in a second delivery channel;
and S10, if the third ratio is greater than the third preset value and the fourth ratio is greater than the fourth preset value, adding a third ordering node in the first delivery channel.
In an embodiment provided by the present application, the second delivery channel may be any delivery channel other than the first delivery channel.
When the number of the ordering nodes in the first delivery channel is small, or the ordering interface in the first delivery channel is simple, and enough space is provided for adding the ordering nodes, the ordering nodes can be added in the first delivery channel to attract users to purchase products in the first delivery channel.
Specifically, when the first delivery channel is optimized, the ordering node (e.g., third ordering node) in other delivery channels (e.g., second delivery channel) may be consulted, and for example, if the product is sold through the second delivery channel, the sold ordering volume exceeds the preset volume, where the third ordering node may be any ordering node in the second delivery channel, and the fourth ordering node may be any ordering node other than the third ordering node.
When the device 100 optimizes the first delivery channel, the device 100 obtains the clicked volume and the effective clicked volume of the third order node in the second delivery channel, and when the third ratio and the fourth ratio of the third order node in the second delivery channel are respectively greater than the third preset value and the fourth preset value, the device 100 adds the third order node in the first delivery channel.
In the embodiment provided by the present application, referring to fig. 4, fig. 4 is a schematic flowchart illustrating a process of changing a size or a location of a first subscription node in a first delivery channel according to the embodiment of the present application, and when optimizing the first delivery channel, the apparatus 100 may add a third subscription node in a second delivery channel to the first delivery channel.
After the first ratio and the second ratio are calculated, the method comprises the following steps:
s63, if the first ratio is smaller than the first preset value, and the second ratio is larger than or equal to the second preset value;
and S64, adjusting the position of the selling interface of the first order node in the first delivery channel, or adjusting the size of the selling interface of the first order node in the first delivery channel.
In the embodiment provided by the application, after the device 100 acquires the relevant data of the first ordering node, the device 100 analyzes the relevant data of the first ordering node, and if the first ratio is smaller than a preset value, the second ratio is greater than or equal to a second preset value; the device 100 can analyze and obtain the transaction efficiency of the first order node, but the transaction amount on the first order node is too low with the total order transaction amount, so that the first ratio is smaller than the preset value, and the second ratio is greater than or equal to the second preset value, possibly the exposure of the first order node is too low, the first order node is at a hidden position in a selling interface in the first putting channel and is not easy to be found by people, at this time, the first putting channel is optimized, the position or size of the first order node can be adjusted, the exposure of the first order node is improved, the first ratio is further increased, the selling number of products on the first order node is finally improved, and the order transaction amount of the products in the first putting channel is finally improved.
The adjustment of the position of the selling interface of the first ordering node in the first putting channel comprises the following steps:
repeatedly adjusting the position of a selling interface of a first ordering node in a first putting channel;
when the maximum order volume is realized through the first order node within the preset time, the position of a selling interface where the first order node is located is the final position;
for example, when adjusting the location of the first ordering node, the apparatus 100 may divide the first delivery channel into a plurality of groups (groups such as A, B, C, etc.), where the location of the first ordering node in each group is set at a different location, set a preset time, and the same product is sold through the plurality of groups of first delivery channels, repeatedly perform the steps a plurality of times, compare the order volume of the first ordering node at each different location, and if the order volume of the group a is the largest, use the location of the first ordering node in the group a as the final location, and if the order volume of the group B is the largest, use the location of the first ordering node in the group B as the final location.
The adjustment of the size of the selling interface of the first ordering node in the first putting channel comprises the following steps:
repeatedly adjusting the size of a selling interface of the first ordering node in a first putting channel;
when the maximum order volume is realized through the first ordering node within the preset time, the size of the first ordering node on the selling interface is the final size.
For example, when the device 100 adjusts the size of the first ordering node, the first delivery channels may be divided into a plurality of groups (groups such as A, B, C, etc.), the sizes of the first ordering nodes in each group are not the same, a preset time is set, the same product is sold through the plurality of groups of first delivery channels, the steps are repeatedly executed for a plurality of times, the order volume of the first ordering nodes with different sizes is compared, if the volume of the group a is the largest, the size of the first ordering node in the group a is taken as the final size, and if the volume of the group B is the largest, the size of the first ordering node in the group B is taken as the final size.
The adjusting the first order node in the first delivery channel comprises the following steps:
if the first ratio is greater than or equal to a first preset value, and the second ratio is smaller than a second preset value;
and simplifying the operation steps of realizing order transaction by the first ordering node.
In this embodiment of the application, when the first ratio of the first ordering node is greater than or equal to the first preset value and the second ratio is smaller than the second preset value, the device 100 may analyze that the click rate of the first ordering node is sufficient, but the transaction efficiency is low, and the reason why the transaction efficiency is low may be that the operation of the customer at the first ordering node is complicated and many customers may not pay smoothly.
When a third ordering node is additionally arranged in the first delivery channel, the method comprises the following steps:
adjusting the sequence of the third ordering node in the traffic path in the first delivery channel;
and the order with the largest volume is realized by the third ordering node within the preset time is the final order of the third ordering node in the first delivery channel.
Acquiring the quantity of returned orders of the products after the orders are committed through the first ordering node;
calculating a fifth ratio of the number of the returned orders after the order fulfillment through the first order node to the number of the order fulfillment through the first order node;
and if the fifth ratio is larger than a fifth preset value, increasing the display content of the product at the first ordering node.
In the embodiment provided by the application, when the product is sold on the internet, the customer may return goods after ordering, and the very large waste of manpower and material resources of returning goods, when optimizing the first delivery channel, the device 100 can obtain the fifth ratio of the quantity of returned goods and the transaction quantity in the first ordering node, if the fifth ratio is greater than the fifth preset value, the content of the displayed product is increased at the first ordering node, so that the user can know the product more conveniently, and the customer can be prevented from executing the operation of returning goods after the order is placed because the condition of the product cannot be known.
The embodiment of the present application further provides an apparatus 100 for optimizing a delivery channel of a product, the apparatus 100 includes a memory 120 and a processor 110, the memory 120 is configured to store computer instructions, and the processor 110 is configured to execute the computer to implement the following steps:
respectively acquiring order volume of a plurality of putting channels sold by products in a preset time;
comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node;
calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume;
calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel;
and adjusting a first order node in the first delivery channel based on the first ratio and the second ratio.
In one possible implementation, when adjusting the first subscription node in the first delivery channel, the processor 110 is configured to perform the following steps:
and if the first ratio is smaller than the first preset value and the second ratio is smaller than the second preset value, removing the first ordering node in the first delivery channel.
In one possible implementation, the processor 110 is configured to perform the steps of: screening a second delivery channel with the order volume reaching a preset volume from a plurality of delivery channels, wherein the second delivery channel at least comprises a third ordering node and a fourth ordering node;
obtaining the clicked quantity and the effective clicked quantity of a third ordering node in a second delivery channel, wherein the effective clicked quantity of the third ordering node is the quantity of businesses which pass through the third ordering node;
calculating a third ratio of the effective destination quantity of a third ordering node in the second delivery channel to the order traffic quantity;
calculating a fourth ratio of the effective clicked quantity to the clicked quantity of a third ordering node in a second delivery channel;
and if the third ratio is greater than the third preset value and the fourth ratio is greater than the fourth preset value, adding a third ordering node in the first delivery channel.
In one possible implementation, after calculating the first ratio and the second ratio, the processor 110 is configured to perform the following steps:
if the first ratio is smaller than the first preset value, and the second ratio is larger than or equal to the second preset value;
and adjusting the position of the selling interface of the first ordering node in the first delivery channel, or adjusting the size of the selling interface of the first ordering node in the first delivery channel.
In one possible implementation, when the adjusting the position of the selling interface of the first ordering node in the first delivery channel, the processor 110 is configured to perform the following steps:
repeatedly adjusting the position of a selling interface of a first ordering node in a first putting channel;
when the maximum order volume is realized through the first order node within the preset time, the position of a selling interface where the first order node is located is the final position;
the adjustment of the size of the selling interface of the first ordering node in the first putting channel comprises the following steps:
repeatedly adjusting the size of a selling interface of the first ordering node in a first putting channel;
when the maximum order volume is realized through the first ordering node within the preset time, the size of the first ordering node on the selling interface is the final size.
In one possible implementation, when adjusting the first subscription node in the first delivery channel, the processor 110 is configured to perform the following steps:
if the first ratio is greater than or equal to a first preset value, and the second ratio is smaller than a second preset value;
and simplifying the operation steps of realizing order transaction by the first ordering node.
In one possible implementation manner, when a third order node is added to the first delivery channel, the processor 110 is configured to perform the following steps:
adjusting the sequence of the third ordering node in the traffic path in the first delivery channel;
and the order with the largest volume is realized by the third ordering node within the preset time is the final order of the third ordering node in the first delivery channel.
In one possible implementation, the processor 110 is configured to perform the following steps:
acquiring the quantity of returned orders of the products after the orders are committed through the first ordering node;
calculating a fifth ratio of the number of the returned orders after the order fulfillment through the first order node to the number of the order fulfillment through the first order node;
and if the fifth ratio is larger than a fifth preset value, increasing the display content of the product at the first ordering node.
An embodiment of the present application further provides a computer storage medium, which stores a computer program, and when the computer program is executed by the processor 110, the computer program implements the method described above.
Embodiments of the present application also provide a computer storage medium, which stores a computer program, and when the computer program is executed by the processor 110, the computer program implements the method described above.
For the concepts, explanations, details and other steps related to the technical solutions provided in the embodiments of the present application related to the apparatus 100, reference is made to the description of the foregoing methods or the contents of the method steps executed by the apparatus 100 in other embodiments, which are not described herein again.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an apparatus for optimizing a delivery channel of a product according to an embodiment of the present application, where the apparatus 100 may include:
a processor 110, a memory 120, and a communication interface 130. The processor 110, the memory 120, and the communication interface 130 are coupled via the bus 1040, the memory 120 is configured to store instructions, and the processor 110 is configured to execute the instructions stored by the memory 120 to implement the method steps corresponding to fig. 1-4, as described above.
The processor 110 is configured to execute the instructions stored in the memory 120 to control the communication interface 130 to receive and transmit signals, thereby implementing the steps of the above-described method. The memory 120 may be integrated in the processor 110, or may be provided separately from the processor 110.
In one possible implementation, the function of the communication interface 130 may be implemented by a transceiver circuit or a dedicated chip for transceiving. The processor 110 may be considered to be implemented by a dedicated processing chip, processing circuit, processor, or a general-purpose chip.
In another possible implementation manner, the apparatus 100 provided by the embodiment of the present application may be implemented by using a general-purpose computer. Program code that will implement the functions of the processor 110 and the communication interface 130 is stored in the memory 120, and a general-purpose processor implements the functions of the processor 110 and the communication interface 130 by executing the code in the memory 120.
For the concepts, explanations, details and other steps related to the technical solutions provided in the embodiments of the present application related to the apparatus 100, reference is made to the description of the method or the contents of the method steps executed by the apparatus in other embodiments, which is not described herein again.
As another implementation manner of the present embodiment, a computer-readable storage medium is provided for storing a computer program, and the computer-readable storage medium stores instructions that, when executed on a computer, perform the method in the above-described method embodiment.
As another implementation of the present embodiment, a computer program product is provided that contains instructions that, when executed, perform the method in the above-described method embodiments.
Those skilled in the art will appreciate that only one memory and processor are shown in fig. 5 for ease of illustration. In an actual terminal or server, there may be multiple processors and memories. The memory may also be referred to as a storage medium or a storage device, and the like, which is not limited in this application.
It should be understood that, in the embodiment of the present Application, the processor may be a Central Processing Unit (CPU), and the processor may also be other general-purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field-Programmable Gate arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, and the like.
It will also be appreciated that the memory referred to in the embodiments of the application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. The volatile Memory may be a Random Access Memory (RAM) which serves as an external cache. By way of example and not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct bus RAM (DR RAM).
It should be noted that when the processor is a general-purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, the memory (memory module) is integrated in the processor.
It should be noted that the memory described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
The bus may include a power bus, a control bus, a status signal bus, and the like, in addition to the data bus. But for clarity of illustration the various buses are labeled as buses in the figures.
It should also be understood that reference herein to first, second, third, fourth, and various numerical designations is made only for ease of description and should not be used to limit the scope of the present application.
It should be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor. To avoid repetition, it is not described in detail here.
In the embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various Illustrative Logical Blocks (ILBs) and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical division, and in actual implementation, there may be other divisions, for example, multiple modules or components may be combined or integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
The modules described as separate components may or may not be physically separate. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present application may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid state disk), among others.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for optimizing a delivery channel of a product, comprising the steps of:
respectively acquiring order volume of a plurality of putting channels sold by products in a preset time;
comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node;
calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume;
calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel;
and adjusting a first ordering node in the first delivery channel based on the first ratio and the second ratio so as to realize optimization of the first delivery channel.
2. The method of claim 1, wherein said adjusting a first subscription node in said first delivery channel comprises the steps of:
if the first ratio is smaller than the first preset value, and the second ratio is smaller than the second preset value;
and removing the first order node in the first delivery channel.
3. The method according to claim 2, characterized in that the method further comprises the step of: screening a second delivery channel with the order volume reaching a preset volume from a plurality of delivery channels, wherein the second delivery channel at least comprises a third ordering node and a fourth ordering node;
obtaining the clicked quantity and the effective clicked quantity of a third ordering node in a second delivery channel, wherein the effective clicked quantity of the third ordering node is the quantity of businesses which pass through the third ordering node;
calculating a third ratio of the effective destination quantity of a third ordering node in the second delivery channel to the order traffic quantity;
calculating a fourth ratio of the effective clicked quantity to the clicked quantity of a third ordering node in a second delivery channel;
and if the third ratio is greater than the third preset value and the fourth ratio is greater than the fourth preset value, adding a third ordering node in the first delivery channel.
4. The method of claim 3, wherein after calculating the first ratio and the second ratio, comprising the steps of:
if the first ratio is smaller than the first preset value, and the second ratio is larger than or equal to the second preset value;
and adjusting the position of the selling interface of the first ordering node in the first delivery channel, or adjusting the size of the selling interface of the first ordering node in the first delivery channel.
5. The method of claim 4, wherein said adjusting the location of the sales interface of the first subscription node in the first delivery channel comprises the steps of:
repeatedly adjusting the position of a selling interface of a first ordering node in a first putting channel;
when the maximum order volume is realized through the first order node within the preset time, the position of a selling interface where the first order node is located is the final position;
the adjustment of the size of the selling interface of the first ordering node in the first putting channel comprises the following steps:
repeatedly adjusting the size of a selling interface of the first ordering node in a first putting channel;
when the maximum order volume is realized through the first ordering node within the preset time, the size of the first ordering node on the selling interface is the final size.
6. The method of claim 1, wherein said adjusting a first subscription node in said first delivery channel comprises the steps of:
if the first ratio is greater than or equal to a first preset value, and the second ratio is smaller than a second preset value;
and simplifying the operation steps of realizing order transaction by the first ordering node.
7. The method of claim 3, wherein adding a third order node in the first delivery channel comprises the steps of:
adjusting the sequence of the third ordering node in the traffic path in the first delivery channel;
and the order with the largest volume is realized by the third ordering node within the preset time is the final order of the third ordering node in the first delivery channel.
8. The method according to claim 1, characterized in that the method further comprises the step of:
acquiring the quantity of returned orders of the products after the orders are committed through the first ordering node;
calculating a fifth ratio of the number of the returned orders after the order fulfillment through the first order node to the number of the order fulfillment through the first order node;
and if the fifth ratio is larger than a fifth preset value, increasing the display content of the product at the first ordering node.
9. An apparatus for optimizing delivery channels for a product, the apparatus comprising a memory configured to store computer instructions and a processor configured to execute the computer to perform the steps of:
respectively acquiring order volume of a plurality of putting channels sold by products in a preset time;
comparing the order volume of the plurality of delivery channels, and screening out a first delivery channel with the largest order volume; the crossing path in the first delivery channel at least comprises a first ordering node and a second ordering node;
the method comprises the steps of obtaining the clicked quantity and the effective clicked quantity of a first ordering node in a first delivery channel, wherein the effective clicked quantity of the first ordering node is the quantity of businesses which pass through the first ordering node;
calculating a first ratio of the effective clicked quantity of a first order node in a first putting channel to the order volume;
calculating a second ratio of the effective clicked quantity to the clicked quantity of the first ordering node in the first delivery channel;
and adjusting a first order node in the first delivery channel based on the first ratio and the second ratio.
10. A computer storage medium, characterized in that it stores a computer program which, when executed by a processor, implements the method of any one of the preceding claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110863103.0A CN113781095A (en) | 2021-07-29 | 2021-07-29 | Method for optimizing product delivery channel and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110863103.0A CN113781095A (en) | 2021-07-29 | 2021-07-29 | Method for optimizing product delivery channel and related device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113781095A true CN113781095A (en) | 2021-12-10 |
Family
ID=78836432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110863103.0A Pending CN113781095A (en) | 2021-07-29 | 2021-07-29 | Method for optimizing product delivery channel and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113781095A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115408586A (en) * | 2022-08-25 | 2022-11-29 | 广东博成网络科技有限公司 | Intelligent channel operation data analysis method, system, equipment and storage medium |
| CN117495504A (en) * | 2023-11-20 | 2024-02-02 | 广州市翎泷科技有限公司 | Order data analysis method, system, equipment and storage medium for digital commodity |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408964A (en) * | 2008-11-25 | 2009-04-15 | 阿里巴巴集团控股有限公司 | Method and apparatus for regulating foreground category of electronic commerce website |
| US20140026066A1 (en) * | 2012-07-23 | 2014-01-23 | Yahoo! Inc. | User interaction-based website optimization |
| CN109716379A (en) * | 2016-07-20 | 2019-05-03 | 深圳市东信时代信息技术有限公司 | Optimization method, device and the media advertising system of media advertisement clicking rate |
-
2021
- 2021-07-29 CN CN202110863103.0A patent/CN113781095A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101408964A (en) * | 2008-11-25 | 2009-04-15 | 阿里巴巴集团控股有限公司 | Method and apparatus for regulating foreground category of electronic commerce website |
| US20140026066A1 (en) * | 2012-07-23 | 2014-01-23 | Yahoo! Inc. | User interaction-based website optimization |
| CN109716379A (en) * | 2016-07-20 | 2019-05-03 | 深圳市东信时代信息技术有限公司 | Optimization method, device and the media advertising system of media advertisement clicking rate |
Non-Patent Citations (1)
| Title |
|---|
| 周启清等: "《ITMC电子商务综合实训与竞赛系统指导手册》", vol. 1, 北京合众伟业印刷有限公司, pages: 226 - 227 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115408586A (en) * | 2022-08-25 | 2022-11-29 | 广东博成网络科技有限公司 | Intelligent channel operation data analysis method, system, equipment and storage medium |
| CN115408586B (en) * | 2022-08-25 | 2024-01-23 | 广东博成网络科技有限公司 | Intelligent channel operation data analysis method, system, equipment and storage medium |
| CN117495504A (en) * | 2023-11-20 | 2024-02-02 | 广州市翎泷科技有限公司 | Order data analysis method, system, equipment and storage medium for digital commodity |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TW201941130A (en) | Self-service shopping settlement method and system | |
| US10970758B2 (en) | Electronic marketplace for hosted service images | |
| JP6706348B2 (en) | Product recommendation method/apparatus/equipment and computer-readable storage medium | |
| CN113781095A (en) | Method for optimizing product delivery channel and related device | |
| US20120066055A1 (en) | Generating a user interface based on predicted revenue yield | |
| US20150178820A1 (en) | System and method for online shopping | |
| JP2020129225A (en) | Information processing method, program, and information processing device | |
| JP2021089734A (en) | Method and system of commodity reservation purchase | |
| CN111626823B (en) | Display method and device | |
| KR102672386B1 (en) | Systems and methods for e-commerce checkout with delay loading of checkout options | |
| CN113065882A (en) | Commodity processing method and device and electronic equipment | |
| Giannikas et al. | Examining the value of flexible logistics offerings | |
| US20130024309A1 (en) | Barter chains | |
| KR102023090B1 (en) | Electronic commerce system for providing delivering service and electronic commerce method sing the same | |
| CN108351887A (en) | The presentation of numerical data | |
| CN110232581B (en) | Method and device for providing coupons for users | |
| CN110675207A (en) | Image display combination recommendation method, device and equipment | |
| CN111222934B (en) | Information release method, device and computer system | |
| CN109804349A (en) | System and method for reducing downloading request | |
| WO2016209990A1 (en) | Presenting opportunities for instant transactions | |
| CN109474884B (en) | Data processing method and system | |
| KR20120076575A (en) | System for purchase mediation and providing method thereof | |
| US20220284441A1 (en) | Detection of Warranty Expiration and Forwarding Notification | |
| CN111833151B (en) | Cloud ecological service method, cloud server, system, device and readable storage medium | |
| US20190347625A1 (en) | System and method to increase liquidity combining fiat currency and virtual currency in a sales transaction |
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 |