A method and device for generating a delivery warehouse list for an order

通过根据订单优先级信息动态确定库房选择半径,生成配送库房列表,解决了现有技术中范围小导致的配送问题,提高了订单可得性和客户满意度。

CN110222860BActive Publication Date: 2024-12-06BEIJING JINGDONG SHANGKE INFORMATION TECH CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201810170824.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2018-03-01
Publication Date
2024-12-06
Estimated Expiration
2038-03-01

AI Technical Summary

Technical Problem

The existing technology considers too small when generating delivery warehouse lists for orders, which may lead to some products being unable to be delivered or the delivery list being empty, especially when processing massive orders, which cannot be dynamically adjusted, affecting the user experience.

Method used

Based on the priority information of the order, dynamically determine the warehouse selection radius, generate a distribution warehouse list, combine the warehouse selection radius, distribution address and item information, calculate the unit profit of the warehouse and filter out the appropriate warehouse list.

Benefits of technology

It improves the availability of orders, reduces the out-of-stock rate, reduces the number of suspended orders in the transfer process, and improves customer satisfaction, especially the experience of high-level or high-consumption users.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN110222860B_ABST
    Figure CN110222860B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and device for generating a distribution warehouse list for an order, and relates to the field of computer technology. A specific implementation of the method includes: obtaining order priority information; determining a warehouse selection radius according to the priority information; generating a distribution warehouse list for the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order. The embodiment of the present invention can adaptively and dynamically determine the warehouse selection radius of the order based on the acquired order priority information, and determine the distribution warehouse list for the order based on the warehouse selection radius. The availability of some orders is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for generating a distribution warehouse list for an order. Background Art

[0002] At present, with the development of e-commerce, shopping through the Internet has become an indispensable part of everyone's daily life consumption. In the process of Internet shopping, after the user places an order, the system generates an order, and determines the distribution center or distribution warehouse of the order according to the distribution warehouse list of the order, and then completes the delivery of the goods of the order. Among them, the distribution warehouse list of the order includes information of all warehouses that can deliver goods for the order. In the prior art, in the process of generating the distribution warehouse list of the order, the province, city and district to which the order belongs is determined according to the delivery address of the order, and further according to all the goods included in the order and all the warehouses included in the province, city and district to which the order belongs, the warehouse that can prepare goods for the order is determined, and these determined warehouses constitute the distribution warehouse list.

[0003] The above-mentioned technology for generating a delivery warehouse list for an order has the following problems during implementation: the delivery warehouse list for an order is determined only through the warehouses included in the province, city, and district to which the order belongs, and the scope of consideration is relatively small. The warehouses within the scope may not be able to deliver some of the goods in the order, or the determined delivery warehouse list is empty, resulting in the order being unable to be delivered; in the face of a large number of orders, when generating the delivery warehouse list for an order, the scope covered by the delivery warehouse list cannot be dynamically adjusted according to the priority of the order, affecting the user experience. Summary of the invention

[0004] In view of this, an embodiment of the present invention provides a method and device for generating a delivery warehouse list for an order, which can adaptively and dynamically determine the warehouse selection radius of the order based on the acquired order priority information, and determine the delivery warehouse list for the order based on the warehouse selection radius. Subsequently, the inventory calculation of the items in the order in the deliverable warehouses can be performed again based on the delivery warehouse list. If the delivery warehouse list shows that there is stock, indicating that production is possible, then the items are transferred to production. The availability of some orders is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction.

[0005] The method for generating a delivery warehouse list for an order in an embodiment of the present invention includes: obtaining priority information of the order; determining a warehouse selection radius based on the priority information; and generating a delivery warehouse list for the order based on the delivery address of the order, the warehouse selection radius, and the items included in the order.

[0006] Optionally, the order priority information includes at least one of the user level of the order, the user credit, the user's historical order data and the order profit.

[0007] Optionally, the step of determining the warehouse selection radius according to the priority information includes: processing the acquired priority information x according to the first formula i , corresponding to the priority data d i , i≡1,2,...,m, m is the number of priority information obtained; determine the comprehensive priority data d according to the second formula and all the priority data; determine the warehouse selection radius R according to the third formula and the comprehensive priority data d;

[0008] Among them, the first formula is: i≡1,2,...,m, x1 is a preset constant;

[0009] The second formula is:

[0010] The third formula is: d1, d2, and k are preset constants.

[0011] Optionally, the step of generating a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order includes: generating a candidate delivery warehouse list according to the delivery address of the order, the warehouse selection radius, and the items included in the order; for each warehouse in the candidate delivery warehouse list, determining a delivery route from the warehouse to the delivery address according to the address information of the warehouse and the delivery address of the order; determining a unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route; and generating a delivery warehouse list for the order based on the candidate delivery warehouse list and the determined unit profit of each warehouse and a preset threshold.

[0012] Optionally, the step of determining the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route includes: for each delivery route, obtaining the location information of the waypoints of the delivery route; determining the warehousing cost, operating cost and transportation cost of the delivery route according to the location information of the waypoints, and taking the sum of the warehousing cost, operating cost and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determining the value data of each item in the order; and determining the unit profit of the warehouse according to the unit cost of the warehouse and the value data.

[0013] Optionally, based on the candidate delivery warehouse list, the step of generating the delivery warehouse list for the order according to the determined unit profit of each warehouse and a preset threshold includes: sorting the candidate delivery warehouse list according to the determined unit profit of each warehouse; and screening the warehouses in the candidate delivery warehouse list according to the sorting result and the preset threshold to obtain the delivery warehouse list for the order.

[0014] To achieve the above objective, according to another aspect of an embodiment of the present invention, a device for generating a list of delivery warehouses for an order is provided.

[0015] The device for generating a delivery warehouse list for an order in an embodiment of the present invention includes: an acquisition module for acquiring priority information of an order; a determination module for determining a warehouse selection radius according to the priority information; and a generation module for generating a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius and the items included in the order.

[0016] Optionally, the determination module is further configured to process the acquired priority information x according to the first formula i , corresponding to the priority data d i , i≡1,2,...,m, m is the number of priority information obtained; determine the comprehensive priority data d according to the second formula and all the priority data; determine the warehouse selection radius R according to the third formula and the comprehensive priority data d;

[0017] Among them, the first formula is: i≡1,2,...,m, x1 is a preset constant;

[0018] The second formula is:

[0019] The third formula is: d1, d2, and k are preset constants.

[0020] Optionally, the generation module is further used to generate a candidate delivery warehouse list according to the delivery address of the order, the warehouse selection radius and the items included in the order; for each warehouse in the candidate delivery warehouse list, determine a delivery route from the warehouse to the delivery address according to the address information of the warehouse and the delivery address of the order; determine the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route; based on the candidate delivery warehouse list, generate the delivery warehouse list for the order according to the determined unit profit of each warehouse and a preset threshold.

[0021] Optionally, the generation module is also used to, for each delivery route, obtain location information of the waypoints of the delivery route; determine the warehousing cost, operating cost and transportation cost of the delivery route based on the location information of the waypoints, and use the sum of the warehousing cost, operating cost and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determine the value data of each item in the order; and determine the unit profit of the warehouse based on the unit cost of the warehouse and the value data.

[0022] Optionally, the generation module is further used to sort the candidate delivery warehouse list according to the determined unit profit of each warehouse; and screen the warehouses in the candidate delivery warehouse list according to the sorting result and a preset threshold to obtain the delivery warehouse list for the order.

[0023] To achieve the above objective, according to another aspect of an embodiment of the present invention, there is provided an electronic device for generating a list of delivery warehouses for an order.

[0024] An electronic device for generating a delivery warehouse list for an order in an embodiment of the present invention includes: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement any of the above-mentioned methods for generating a delivery warehouse list for an order.

[0025] To achieve the above-mentioned purpose, according to another aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored, characterized in that when the program is executed by a processor, any of the above-mentioned methods for generating a delivery warehouse list for an order is implemented.

[0026] One embodiment of the above invention has the following advantages or beneficial effects: the warehouse selection radius can be adaptively and dynamically determined according to the priority information of the order, and the distribution warehouse list of the order can be generated based on the selection radius. At the same time, the priority information is some information already available in the existing system (user level, user historical order data or order profit), which is convenient for the implementation of the technical solution. Moreover, under the premise of controlling costs, the distribution warehouse list of the order can be comprehensively calculated by combining the priority information such as the user level and order profit value of the order. Subsequently, the inventory calculation of the items in the order in the distributable warehouse can be performed again based on the distribution warehouse list. If the distribution warehouse list shows that there is stock, it means that production can be carried out, then it is transferred to production. The availability of some orders (orders with higher priority) is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction, especially the consumption experience of high-level or high-consumption users.

[0027] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0029] Figure 1 is a schematic diagram of the main process of a method for generating a delivery warehouse list for an order according to an embodiment of the present invention;

[0030] Figure 2 is a schematic diagram of a method for generating a delivery warehouse list for an order according to an embodiment of the present invention;

[0031] Figure 3 is a schematic diagram of main modules of an apparatus for generating a delivery warehouse list of an order according to an embodiment of the present invention;

[0032] Figure 4 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0033] Figure 5 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0034] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0035] Figure 1 FIG. 1 is a schematic diagram of the main process of a method for generating a delivery warehouse list for an order according to an embodiment of the present invention. Figure 1 As shown, the method for generating a delivery warehouse list of an order in an embodiment of the present invention mainly includes:

[0036] Step S101: Get order priority information. Order priority information is used to determine the priority of order processing. The higher the order priority, the larger the warehouse selection radius of the order. The more warehouses are included in the distribution warehouse list of the order, the greater the possibility of being able to distribute the goods included in the order. Among them, the order priority information includes at least one of the user level of the order, user credit, user historical order data and order profit. Therefore, the warehouse selection radius of the order can be adaptively and dynamically adjusted according to the difference in order priority information. In addition, the priority information is some information already available in the existing system, which is convenient for the implementation of the embodiments of the present invention.

[0037] Step S102: Determine the warehouse selection radius according to the priority information. Specifically, the priority information x obtained by processing the first formula i , corresponding to the priority data d i , i≡1,2,...,m, m is the number of priority information obtained; the comprehensive priority data d is determined according to the second formula and all the priority data; the warehouse selection radius R is determined according to the third formula and the comprehensive priority data d.

[0038] Among them, the first formula is: i≡1,2,...,m, x1 is a preset constant. The second formula is: The third formula is: d1, d2, k are preset constants. The preset constants x1 and d1, k can be set according to experience or adjusted according to user needs. For each order, through the above process, the warehouse selection radius of the order can be accurately and adaptively determined dynamically according to the priority information of the order.

[0039] In the embodiment of the present invention, the first formula, the second formula and the third formula can also be changed according to actual needs. The present invention is not limited to these three formulas in the process of determining the warehouse selection radius, and the selection radius can also be automatically determined by other formulas, or the selection radius can be determined by manual calculation and inputting the calculation results. As long as the technical feature of dynamically determining the warehouse selection radius through the order priority information, it should be included in the protection scope of the present invention.

[0040] Step S103: Generate a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order.

[0041] Specifically, a candidate delivery warehouse list is generated according to the delivery address of the order, the warehouse selection radius, and the items included in the order; for each warehouse in the candidate delivery warehouse list, a delivery route from the warehouse to the delivery address is determined according to the address information of the warehouse and the delivery address of the order; the unit profit of each warehouse in the candidate delivery warehouse list is determined according to each delivery route; based on the candidate delivery warehouse list, a delivery warehouse list of the order is generated according to the determined unit profit of each warehouse and a preset threshold. The step of determining the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route includes: for each delivery route, obtaining the location information of the waypoints of the delivery route; determining the storage cost, operation cost, and transportation cost of the delivery route according to the location information of the waypoints, and taking the sum of the storage cost, operation cost, and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determining the value data of each item in the order; and determining the unit profit of the warehouse according to the unit cost and value data of the warehouse. Based on the candidate delivery warehouse list, the step of generating the delivery warehouse list of the order according to the determined unit profit of each warehouse and the preset threshold includes: sorting the candidate delivery warehouse list according to the determined unit profit of each warehouse; screening the warehouses in the candidate delivery warehouse list according to the sorting result and the preset threshold to obtain the delivery warehouse list of the order. In the screening process, deleting the warehouse with a relatively high unit cost from the candidate delivery warehouse list may result in the inability to complete the delivery of the order based on the last generated delivery warehouse list. However, the generated list can have a directional effect on the suspended orders (there are one or more undeliverable goods in the order), so that when processing some orders (it has been confirmed that some goods in the order can be delivered, and it only needs to be judged again whether the goods that were previously determined to be undeliverable can be delivered at this stage), warehouses with lower costs and higher profits can be screened out to deliver the goods in the order.

[0042] In the prior art, the warehouse attributes of all SKUs under the order are obtained from the inventory interface. Through the warehouse attributes, the warehouses with the stocking qualification of the SKU, as well as the inventory status and inventory record data of the warehouse can be known. These warehouses may not be in stock of the SKU, but they are eligible for stocking. Then the distribution center configuration interface is called to obtain the distribution warehouse list that can produce the order, and the distribution warehouse list of the order is obtained according to the obtained warehouse attributes and the third-level address (province, city, district) of the order. The distribution warehouse list that can produce the order is circulated, the inventory status of each SKU under the warehouse is calculated, and then the inventory status of the SKU under each distribution center is calculated, and then the inventory status of the order under each distribution center is calculated, and finally the final distribution center or warehouse is located, and the inventory status of the order in the final distribution center or warehouse is obtained. For example, in the process of locating the warehouse, the calculation is performed according to the inventory status of the order in the warehouse under the distribution center. If the order is in stock or in transit (that is, quasi-spot) in one or some warehouses of the distribution center, it is directly located in the distribution center and the loop is jumped out. If after looping through all the distribution centers that can produce, none of the distribution centers in the warehouse list of the distribution center that can produce the order has spot goods and none of them are quasi-spot goods, then the first distribution center with the stocking attribute will be located.

[0043] In the process of implementing the above-mentioned prior art, there is a situation where the distribution center configuration interface is called to obtain the list of distribution warehouses that can be produced, which is empty, resulting in the inability to produce. As a result, the order has been suspended in the transfer because of the lack of goods, and the warehouse production cannot be transferred, resulting in user complaints. The reason why the above distribution warehouse list is empty is: because the distribution center configuration will change from time to time according to the online situation, when the order is placed, there may be a distribution center warehouse list that can be produced for the order, but when the transfer system is suspended for a period of time, the distribution center configuration has changed, and the distribution center warehouse covered may no longer exist; because the distribution center warehouse list that can be produced is determined based on the third-level address of the order and the warehouse attributes of the commodity sku under the order, for example, when the order is placed, the skuA of the order has a stock attribute under warehouse 1, and it is a spot-like product in transit, so the order is placed and enters the transfer system. However, when the transfer system is suspended, skuA is removed from warehouse 1, resulting in skuA having no stock attribute under warehouse 1, so that the subsequent transfer and processing of the order cannot obtain the distribution center warehouse list that can be produced.

[0044] Figure 2 is a schematic diagram of a method for generating a delivery warehouse list for an order according to an embodiment of the present invention. Figure 2 As shown, the method for generating a delivery warehouse list of an order according to an embodiment of the present invention includes:

[0045] Step S201: Eliminate orders that do not meet the conditions. The warehouse in the distribution warehouse list generated according to the embodiment of the present invention may be far away from the delivery address of the order, and some commodity SKUs are not suitable for long-distance transportation. In the embodiment of the present invention, the commodities that are not suitable for long-distance transportation become prohibited commodities. For example, prohibited commodity attributes include large household appliances, extended warranty machines, contract machines, liquid categories, fragile categories, dangerous goods, gifts, etc. If there are prohibited commodities in the order, the distribution warehouse list can be returned as empty. Therefore, after the order is generated according to the user's order information, it is determined whether there are prohibited commodities in the order according to the commodity attributes of the commodities included in the order and the preset prohibited commodity attributes. If the commodity attribute of a certain SKU under the order is a prohibited commodity attribute, the order does not participate in the subsequent logic, and the distribution warehouse list of the order is directly returned as empty.

[0046] Step S202: Calculate the warehouse selection radius of the order. After step S202, the processable orders are screened out, and then the warehouse selection radius of each order is calculated. After the order is generated according to the user's order information, the priority information of the order is obtained according to the commodity attributes of the commodity included in the order, such as the user level of the order, the user credit, the user's historical order data or the order profit. In the embodiment of the present invention, the two priority information of user level and order profit are obtained as an example.

[0047] Through the order user name, call the external interface (such as the interface of the user system) to obtain the user level corresponding to the user name. In the embodiment of the present invention, the user level 300 is a high-level user in the user system. For subsequent calculations, high-level users are no longer subdivided and are unified as 300. Therefore, in the embodiment of the present invention, after obtaining the user level of the order, the user level x is judged according to the following formula. If the user level x is less than 0, the user level f(x) of the order is determined to be 0. If the user level x is greater than 300, the user level f(x) of the order is determined to be 300. Finally, the range of user level f(x) is 0 to 300:

[0048]

[0049] According to the sku numbers of all the goods under the order, call the external interface to obtain the individual profit value of each sku. The individual profit value of the sku is the actual selling price minus the warehouse quotation (the warehouse quotation refers to the purchase price plus storage and custody fees). According to the individual profit values ​​of all the goods in the order and the following, determine the order profit y of the order: a i is the number of sku, b i is the single profit value of the sku, and n is the number of sku included in the order.

[0050] In the embodiment of the present invention, through the integration of historical order data or machine learning, it is determined that orders with order profits greater than 300 are high-profit orders, and the order profits greater than 300 can be directly taken as 300 to calculate the warehouse selection radius. Therefore, after obtaining the order profit value of the order, the order profit y is judged according to the following formula. If the order profit value is less than y, the order profit g(y) of the order is determined to be 0. If the order profit value y is greater than 300, the order profit g(y) of the order is determined to be 300. Finally, the range of the order profit g(y) is 0 to 300:

[0051]

[0052] After determining the user level and order profit of the order, a two-dimensional rectangular coordinate system can be established, where the x-axis represents the user level and the y-axis represents the order profit. The coordinates of the coordinate point p corresponding to the order are (f(x), g(y)). In addition, the distance d (comprehensive priority data) from the coordinate point p to the coordinate origin O is determined according to the following formula:

[0053]

[0054] After determining the above comprehensive priority data d, the warehouse selection radius R can be determined according to the following formula: When d is less than 100, the combined value of the user level value and order profit value of the order is too low to meet the conditions for calculating the distribution warehouse list, and R is determined to be 0. If R = 0, no subsequent logical calculation is performed, and the distribution warehouse list is directly returned to be empty; otherwise, the next step of calculation is entered.

[0055] Step S203: Calculate the candidate delivery warehouse list. In this process, with the delivery address (delivery address) of the order as the center and the warehouse selection radius R as the radius, select warehouses that have the stocking attributes of at least one sku in the order, that is, these warehouses can stock the sku in the order, and these warehouses form the candidate delivery warehouse list. The specific process is as follows:

[0056] Based on the electronic map system, the longitude and latitude of the order delivery address can be determined, and then a certain coordinate point on the map is located according to the longitude and latitude to generate a POI. Among them, POI (Point of Interest) is a "point of interest" or a "Point of Information". POIs are generally represented by bubble icons on electronic maps. Tourist attractions, government agencies, companies, shopping malls, restaurants, etc. on electronic maps are all POIs. POI is the most core data based on location services and is widely used in electronic maps, such as selecting a destination before navigation and checking surrounding restaurants. With the determined POI as the center and the warehouse selection radius R as the radius, a circle is drawn. The area within the circle in China is used as the warehouse selection area.

[0057] According to the sku numbers of all the products included in the order, call the external interface to obtain the warehouse attributes of these skus (that is, the number of the warehouse with the stocking attribute of the sku). Merge these warehouse numbers to remove duplicates and obtain the warehouse list of the order stocking attribute. For example, the warehouse attribute of skuA is [4-2,6-1,5-1,8-0] (4-2 means warehouse number 2 of distribution center 4, the same below), and the warehouse attribute of skuB is [4-13,7-1,6-0,5-1,8-0]. After merging and removing duplicates, the warehouse list of the order stocking attribute is [4-2,6-1,5-1,8-0,4-13,7-1,6-0]. Call the external interface to obtain the address information of the warehouse in the warehouse list of the order stocking attribute, as well as the longitude and latitude of the warehouse in the warehouse list of the order stocking attribute, and then locate these warehouses on the map according to the longitude and latitude to generate the POI of these warehouses.

[0058] After determining the warehouse selection area and the warehouse list of the order stocking attributes, select the warehouse POIs in the warehouse selection area, and form a candidate delivery warehouse list with the warehouses corresponding to these warehouse POIs. If the candidate delivery warehouse list is empty, no subsequent logical calculation is performed, and the delivery warehouse list of the order is directly returned to be empty. If the candidate delivery warehouse list is not empty, enter step S204.

[0059] Step S204: Re-sort the candidate delivery warehouse list according to the cost. Based on the candidate delivery warehouse list obtained in the previous step, loop through the list and calculate the unit cost from each warehouse in the list to the delivery address.

[0060] Call the external interface to obtain the delivery route from each warehouse in the candidate delivery warehouse list to the order delivery address. For example, the originating warehouse - initial sorting center - originating RDC sorting center - destination RDC sorting center - destination FDC sorting center - city transfer yard - distribution site. Call the external interface to obtain the longitude and latitude of each waypoint in the delivery route, and generate corresponding POIs for each waypoint in the delivery route on the map based on the longitude and latitude of each waypoint. Take the warehouse POI in the candidate delivery warehouse list as the starting point, the distribution site POI corresponding to the order as the end point, and the other waypoint POIs of the delivery route as the waypoints in the corresponding order according to the order of the delivery route to generate the map recommended path RouteMap.

[0061] For each warehouse in the candidate distribution warehouse list, the unit cost C of the warehouse is calculated by the following formula: Among them, α is the unit storage cost of the warehouse, β k is the operating cost of each waypoint of the distribution route corresponding to the warehouse, o is the number of waypoints of the distribution route corresponding to the warehouse, γ is the unit transportation cost per kilometer, and L is the number of kilometers of the route determined according to the recommended route RouteMap of the electronic map.

[0062] The list of candidate delivery warehouses determined by the loop can calculate the unit cost of each candidate delivery warehouse to the order delivery address, for example, {S1:C1, S2:C2, S3:C3}, S k For the warehouse, C k is the unit cost of the warehouse. If the unit costs of warehouses S1, S2, and S3 are respectively C1<C3<C2, then the candidate distribution warehouse list is sorted according to the determined unit cost of each warehouse, and the sorted result is {S1, S3, S2}.

[0063] Step S205: Eliminate warehouses with too high costs to obtain a list of warehouses for delivery of the order. Deleting warehouses with relatively high unit costs from the candidate delivery warehouse list may result in the inability to complete the delivery of the order based on the last generated delivery warehouse list. However, the generated list can guide the suspension of orders, so that when processing some orders, warehouses with lower costs and higher profits can be selected to deliver the goods in the order.

[0064] According to the sku numbers of all the goods under the order, call the external interface to obtain the single profit value δ of the sku delivered by the warehouse in the candidate delivery warehouse list i , i = 1, 2, ..., f, where f is the number of sku that can be delivered by the warehouse in the candidate delivery warehouse list for the order. For each warehouse in the candidate delivery warehouse, calculate the net profit P of the warehouse according to the following formula ik :Pik =δ i -C k , i=1,2,...,f,k=1,2,...,u,f is the number of sku that can be delivered by the warehouse in the candidate delivery warehouse list of the order, and u is the number of warehouses in the candidate delivery warehouse list. For each warehouse in the candidate delivery warehouse list, if the P of the warehouse is calculated ik If it is not greater than 0, the warehouse is deleted from the candidate delivery warehouse list to generate the delivery warehouse list for the order. Through this process, warehouses with too high costs are deleted, so that the delivery warehouse list generated based on the order priority information not only has more warehouses to choose from, but also has a relatively low cost.

[0065] The embodiment of the present invention can only dynamically determine the warehouse selection radius according to the priority information of the order, and generate the distribution warehouse list of the order based on the selection radius. At the same time, the priority information is some information (user level, user historical order data or order profit) already in the existing system, which is convenient for the implementation of the technical solution. In addition, the distribution warehouse list of the order can be comprehensively calculated under the premise of controlling costs, combined with the priority information such as the user level and order profit value of the order. Subsequently, the inventory calculation of the items in the order in the distributable warehouse can be performed again based on the distribution warehouse list. If the distribution warehouse list shows that there is stock, it means that it can be produced, then it is transferred to production. The availability of orders is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction, especially the consumption experience of high-level or high-consumption users. The problem that the distribution warehouse list can only be determined according to the delivery address of the order and the fixed selection range when generating the distribution list of the order in the prior art is solved, and the distribution warehouse list cannot be dynamically generated according to the different priority information of different orders.

[0066] Figure 3 is a schematic diagram of the main modules of the device for generating a delivery warehouse list of an order according to an embodiment of the present invention, such as Figure 3 As shown, the device 300 for generating a delivery warehouse list of an order according to the embodiment of the present invention mainly includes an acquisition module 301 , a determination module 302 and a generation module 303 .

[0067] The acquisition module 301 is used to acquire order priority information, which includes at least one of the user level, user credit, user historical order data and order profit of the order.

[0068] The determination module 302 is used to determine the warehouse selection radius according to the priority information. The determination module 302 is also used to process the acquired priority information x according to the first formula i , corresponding to the priority data d i, i≡1,2,...,m, m is the number of priority information obtained; the comprehensive priority data d is determined according to the second formula and all the priority data; the warehouse selection radius R is determined according to the third formula and the comprehensive priority data d.

[0069] Among them, the first formula is: i≡1,2,...,m, x1 is a preset constant;

[0070] The second formula is:

[0071] The third formula is: d1, d2, and k are preset constants.

[0072] The generation module 303 is used to generate a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order. The generation module 303 is also used to generate a candidate delivery warehouse list according to the delivery address of the order, the warehouse selection radius, and the items included in the order; for each warehouse in the candidate delivery warehouse list, determine the delivery route from the warehouse to the delivery address according to the address information of the warehouse and the delivery address of the order; determine the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route; based on the candidate delivery warehouse list, generate the delivery warehouse list for the order according to the determined unit profit of each warehouse and a preset threshold.

[0073] The generation module is also used to, for each delivery route, obtain the location information of the waypoints of the delivery route; determine the warehousing cost, operating cost and transportation cost of the delivery route based on the location information of the waypoints, and use the sum of the warehousing cost, operating cost and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determine the value data of each item in the order; and determine the unit profit of the warehouse based on the unit cost and value data of the warehouse.

[0074] The generation module is also used to sort the candidate delivery warehouse list according to the determined unit profit of each warehouse; and screen the warehouses in the candidate delivery warehouse list according to the sorting result and a preset threshold value to obtain the delivery warehouse list for the order.

[0075] The embodiment of the present invention can only dynamically determine the warehouse selection radius according to the priority information of the order, and generate the distribution warehouse list of the order based on the selection radius. At the same time, the priority information is some information (user level, user historical order data or order profit) already in the existing system, which is convenient for the implementation of the technical solution. Moreover, under the premise of controlling costs, the distribution warehouse list of the order can be comprehensively calculated in combination with the priority information such as the user level and order profit value of the order. Subsequently, the inventory calculation of the items in the order in the distributable warehouse can be performed again based on the distribution warehouse list. If the distribution warehouse list shows that there is stock, it means that it can be produced, then it is transferred to production. The availability of orders is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction, especially the consumption experience of high-level or high-consumption users. It solves the problem that in the prior art, when generating the distribution list of an order, the distributable warehouse can only be determined according to the distribution address of the order and the fixed selection range, and the distribution warehouse list cannot be dynamically generated according to the different priority information of different orders.

[0076] Figure 4 An exemplary system architecture 400 is shown to which the method for generating a list of delivery warehouses for an order or the apparatus for generating a list of delivery warehouses for an order according to an embodiment of the present invention can be applied.

[0077] like Figure 4 As shown, system architecture 400 may include terminal devices 401, 402, 403, network 404 and server 405. Network 404 is used to provide a medium for communication links between terminal devices 401, 402, 403 and server 405. Network 404 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0078] Users can use terminal devices 401, 402, 403 to interact with server 405 through network 404 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 401, 402, 403, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0079] The terminal devices 401 , 402 , and 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0080] Server 405 may be a server that provides various services, such as a backend management server (only an example) that provides support for shopping websites browsed by users using terminal devices 401, 402, and 403. The backend management server may analyze and process the received data such as product information query requests, and feed back the processing results to the terminal device.

[0081] It should be noted that the method for generating a delivery warehouse list for an order provided in the embodiment of the present invention is generally executed by the server 405 , and accordingly, the device for generating a delivery warehouse list for an order is generally disposed in the server 405 .

[0082] It should be understood that Figure 4 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to the implementation requirements.

[0083] Reference below Figure 5 , which shows a schematic diagram of the structure of a computer system 500 of a terminal device suitable for implementing an embodiment of the present invention. Figure 5 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0084] like Figure 5 As shown, the computer system 500 includes a central processing unit (CPU) 501, which can 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 part 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0085] The following components are connected to the I / O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, a modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I / O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage section 508 as needed.

[0086] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 509, and / or installed from the removable medium 511. When the computer program is executed by the central processing unit (CPU) 501, the above-mentioned functions defined in the system of the present invention are executed.

[0087] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0088] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0089] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes an acquisition module, a determination module and a generation module. The names of these modules do not constitute a limitation on the modules themselves in some cases, for example, the acquisition module may also be described as a "module for acquiring order priority information".

[0090] As another aspect, the present invention further provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: obtaining priority information of an order; determining a warehouse selection radius according to the priority information; and generating a delivery warehouse list of the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order.

[0091] The embodiment of the present invention can only dynamically determine the warehouse selection radius according to the priority information of the order, and generate the distribution warehouse list of the order based on the selection radius. At the same time, the priority information is some information (user level, user historical order data or order profit) already in the existing system, which is convenient for the implementation of the technical solution. In addition, the distribution warehouse list of the order can be comprehensively calculated under the premise of controlling costs, combined with the priority information such as the user level and order profit value of the order. Subsequently, the inventory calculation of the items in the order in the distributable warehouse can be performed again based on the distribution warehouse list. If the distribution warehouse list shows that there is stock, it means that it can be produced, then it is transferred to production. The availability of orders is improved, the out-of-stock rate of orders is reduced, and the number of suspended orders in the transfer link is reduced, thereby improving customer satisfaction, especially the consumption experience of high-level or high-consumption users. The problem that the distribution warehouse list can only be determined according to the delivery address of the order and the fixed selection range when generating the distribution list of the order in the prior art is solved, and the distribution warehouse list cannot be dynamically generated according to the different priority information of different orders.

[0092] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for generating a delivery warehouse list for an order, characterized in that: include: Obtaining order priority information, wherein the order priority information is used to determine the priority of order processing, and the higher the order priority, the larger the warehouse selection radius of the order; Determine the warehouse selection radius according to the priority information; A delivery warehouse list for the order is generated according to the delivery address of the order, the warehouse selection radius, and the items included in the order, wherein the warehouses in the delivery warehouse list are warehouses with stocking attributes of at least one sku in the order within a circle with the delivery address of the order as the center and the warehouse selection radius as the radius.

2. The method according to claim 1, characterized in that The order priority information includes at least one of the user level of the order, the user credit, the user's historical order data and the order profit.

3. The method according to claim 1, characterized in that The step of determining the warehouse selection radius according to the priority information includes: Process the obtained priority information x according to the first formula i , corresponding to the priority data d i , i≡1,2,...,m, m is the number of priority information obtained; Determine comprehensive priority data d according to the second formula and all priority data; Determine the warehouse selection radius R according to the third formula and the comprehensive priority data d; Among them, the first formula is: x1 is a preset constant; The second formula is: The third formula is: d1, d2, and k are preset constants.

4. The method according to claim 1, characterized in that: The step of generating a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius, and the items included in the order includes: generating a candidate delivery warehouse list according to the delivery address of the order, the warehouse selection radius, and the items included in the order; For each warehouse in the candidate delivery warehouse list, determining a delivery route from the warehouse to the delivery address according to the address information of the warehouse and the delivery address of the order; Determine the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route; Based on the candidate delivery warehouse list, a delivery warehouse list for the order is generated according to the determined unit profit of each warehouse and a preset threshold.

5. The method according to claim 4, characterized in that The step of determining the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route comprises: For each delivery route, obtain the location information of the waypoints of the delivery route; Determine the storage cost, operation cost and transportation cost of the delivery route according to the location information of the waypoints, and use the sum of the storage cost, operation cost and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determining value data for each item in the order; The unit profit of the warehouse is determined according to the unit cost of the warehouse and the value data.

6. The method according to claim 4, characterized in that Based on the candidate delivery warehouse list, the step of generating the delivery warehouse list for the order according to the determined unit profit of each warehouse and a preset threshold comprises: Sorting the candidate distribution warehouse list according to the determined unit profit of each warehouse; The warehouses in the candidate delivery warehouse list are screened according to the sorting result and a preset threshold value to obtain a delivery warehouse list for the order.

7. A device for generating a list of delivery warehouses for an order, characterized in that: include: An acquisition module, used to acquire order priority information, wherein the order priority information is used to determine the priority of order processing, and the higher the order priority, the larger the warehouse selection radius of the order; A determination module, used to determine a warehouse selection radius according to the priority information; A generation module is used to generate a delivery warehouse list for the order according to the delivery address of the order, the warehouse selection radius and the items included in the order, wherein the warehouses in the delivery warehouse list are warehouses with stocking attributes of at least one sku in the order within a circle with the delivery address of the order as the center and the warehouse selection radius as the radius.

8. The device according to claim 7, characterized in that The determination module is further configured to process the acquired priority information x according to the first formula i , corresponding to the priority data d i , i≡1,2,...,m, m is the number of priority information obtained; Determine comprehensive priority data d according to the second formula and all priority data; Determine the warehouse selection radius R according to the third formula and the comprehensive priority data d; Among them, the first formula is: x1 is a preset constant; The second formula is: The third formula is: d1, d2, and k are preset constants.

9. The device according to claim 7, characterized in that The generating module is further configured to generate a candidate delivery warehouse list according to the delivery address of the order, the warehouse selection radius, and the items included in the order; for each warehouse in the candidate delivery warehouse list, determine a delivery route from the warehouse to the delivery address according to the address information of the warehouse and the delivery address of the order; Determine the unit profit of each warehouse in the candidate delivery warehouse list according to each delivery route; Based on the candidate delivery warehouse list, a delivery warehouse list for the order is generated according to the determined unit profit of each warehouse and a preset threshold.

10. The device according to claim 9, characterized in that The generation module is also used to, for each delivery route, obtain the location information of the waypoints of the delivery route; determine the warehousing cost, operating cost and transportation cost of the delivery route based on the location information of the waypoints, and use the sum of the warehousing cost, operating cost and transportation cost as the unit cost of the warehouse corresponding to the delivery route; determine the value data of each item in the order; and determine the unit profit of the warehouse based on the unit cost of the warehouse and the value data.

11. The device according to claim 9, characterized in that The generation module is also used to sort the candidate delivery warehouse list according to the determined unit profit of each warehouse; and screen the warehouses in the candidate delivery warehouse list according to the sorting result and a preset threshold to obtain the delivery warehouse list for the order.

12. An electronic device for generating a list of delivery warehouses for an order, characterized in that: include: one or more processors; a storage device 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 according to any one of claims 1 to 6.

13. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.