Distributed warehouse site selection method, equipment and medium

Abstract

The invention provides a distributed warehouse site selection method, equipment and a medium, and relates to the technical field of warehouse logistics. The method comprises the following steps: dividing a target area; determining an initial address of an alternative collection and distribution warehouse in each sub-region to obtain a collection and distribution warehouse initial site selection set; based on order information, taking the minimum total cost as a target, and screening an optimal site selection combination of which the logistics range can cover all orders from the initial site selection set of the distributed warehouse; the optimal site selection combination is an initial address combination of a plurality of alternative collection and distribution warehouses; and on the basis of order information, taking the minimum transportation cost as a target, adjusting the initial address of each alternative distribution warehouse in the optimal site selection combination, and obtaining the target site selection of each alternative distribution warehouse in the optimal site selection combination. According to the method, the sub-regions are divided, the addresses are primarily selected in the sub-region range, and the primarily selected addresses are screened and finely adjusted based on the cost, so that the site selection of the distributed warehouses under the condition of no alternative distributed warehouses is realized.

Description

Technical Field

[0001] The present invention relates to the technical field of warehousing logistics, and particularly to a method, device and medium for locating a distribution warehouse. Background Art

[0002] The existing methods for locating a distribution warehouse generally determine a non-empty subset from the alternative distribution warehouses under the condition that there are existing alternative distribution warehouses, and take the minimum cost as the goal to determine the coverage relationship between the distribution warehouse and other upstream and downstream stations. This location method requires that alternative distribution warehouses must be provided, but it is difficult to achieve in the exploration stage when data is relatively lacking and alternative distribution warehouses cannot be provided, and the applicable scope of the technical solution is limited. Summary of the Invention

[0003] The present invention provides a method, device and medium for locating a distribution warehouse, which is used to solve the defect that the existing method for locating a distribution warehouse requires that alternative distribution warehouses must be provided, and realizes the location of a distribution warehouse in the case of no alternative distribution warehouse.

[0004] The present invention provides a method for locating a distribution warehouse, including the following steps.

[0005] Divide the target area to obtain a plurality of sub-areas; Determine an initial address of an alternative distribution warehouse in each of the sub-areas to obtain an initial location set of the distribution warehouse; Based on the order information, with the goal of minimizing the total cost, screen the optimal location combination whose logistics scope can cover all orders from the initial location set of the distribution warehouse; the optimal location combination is composed of the initial addresses of a plurality of the alternative distribution warehouses; Based on the order information, with the goal of minimizing the transportation cost, adjust the initial addresses of the alternative distribution warehouses in the optimal location combination to obtain the target locations of the alternative distribution warehouses in the optimal location combination.

[0006] According to the method for locating a distribution warehouse provided by the present invention, the total cost includes: the transportation cost, the warehousing cost and the inventory cost.

[0007] According to the method for locating a distribution warehouse provided by the present invention, the transportation cost includes the trunk transportation cost and the branch transportation cost; the trunk transportation cost represents the transportation cost from the factory to the distribution warehouse, and the branch transportation cost represents the transportation cost from the distribution warehouse to the terminal site.

[0008] According to the method for locating a distribution warehouse provided by the present invention, the calculation steps of the transportation cost are as follows: Based on the destination address in the order information and the logistics coverage scope of the alternative distribution warehouse, determine the order corresponding to each alternative distribution warehouse; Calculate the main-line transportation cost of the alternative distribution warehouse based on the initial address of the alternative distribution warehouse, the delivery address and the quantity of goods in the order corresponding to the alternative distribution warehouse; Calculate the feeder transportation cost of the alternative distribution warehouse based on the initial address of the alternative distribution warehouse and the destination address in the order corresponding to the alternative distribution warehouse; Calculate the transportation cost of the alternative distribution warehouse based on the main-line transportation cost and the feeder transportation cost; Calculate the transportation cost of the site selection combination based on the transportation costs of the alternative distribution warehouses in the site selection combination.

[0009] According to a method for selecting a distribution warehouse location provided by the present invention, the calculation formula for the main-line transportation cost is as follows: Wherein, represents the main-line transportation cost, represents the main-line transportation distance, represents the volume of the goods, represents the weight of the goods, represents the main-line transportation management cost coefficient, represents the main-line per-square-kilometer rate, represents the main-line per-ton-kilometer rate, and the main-line per-square-kilometer rate and the main-line per-ton-kilometer rate are step rates based on the main-line transportation distance.

[0010] According to a method for selecting a distribution warehouse location provided by the present invention, the calculation formula for the feeder transportation cost is as follows: Wherein, represents the feeder transportation cost, represents the feeder transportation distance, represents the volume of the goods, represents the weight of the goods, represents the feeder transportation management cost coefficient, feeder per-square-kilometer rate, represents the feeder per-ton-kilometer rate.

[0011] According to a method for selecting a distribution warehouse location provided by the present invention, screening the optimal site selection combination whose logistics scope can cover all orders from the initial site selection set of the distribution warehouse, including: Based on the specified coverage relationship constraint and the specified distribution warehouse opening constraint, screen the optimal site selection combination whose logistics scope can cover all orders from the initial site selection set of the distribution warehouse; the specified coverage relationship constraint means that a specified terminal site is covered by a specified distribution warehouse, and the specified distribution warehouse opening constraint means that a specified address is used as the target site selection.

[0012] A method for selecting the location of a distribution center provided by the present invention includes screening the most optimal location combination whose logistics scope can cover all orders from the initial location set of the distribution center, and further includes: Based on the constraint of the coverage radius of the distribution center and the constraint of the specified number of distribution centers, screening the most optimal location combination whose logistics scope can cover all orders from the initial location set of the distribution center.

[0013] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the method for selecting the location of the distribution center as described in any one of the above is implemented.

[0014] The present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method for selecting the location of the distribution center as described in any one of the above is implemented.

[0015] The present invention also provides a computer program product, including a computer program. When the computer program is executed by a processor, the method for selecting the location of the distribution center as described in any one of the above is implemented.

[0016] The present invention provides a method, device, and medium for selecting the location of a distribution center. By dividing a target area into multiple sub-areas, generating an initial address of an alternative distribution center within the scope of each sub-area, screening the most optimal location combination that can cover all orders based on cost, and finally adjusting the initial addresses of the alternative distribution centers in the most optimal location combination based on transportation cost, the target locations of the alternative distribution centers in the most optimal location combination are obtained. The present invention realizes the location selection of the distribution center in the case of no alternative distribution center by dividing sub-areas, initially selecting addresses within the sub-area range, and screening and fine-tuning the initially selected addresses based on cost. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0018] Figure 1 It is a flowchart of the method for selecting the location of the distribution center provided by the embodiment of the present invention.

[0019] Figure 2 It is a schematic diagram of the transportation network structure provided by the embodiment of the present invention.

[0020] Figure 3It is a schematic flow chart of the method for calculating transportation costs provided by an embodiment of the present invention.

[0021] Figure 4 It is a schematic structural diagram of the device for selecting the location of the distribution warehouse provided by an embodiment of the present invention.

[0022] Figure 5 It is a schematic structural diagram of the electronic device provided by the present invention. Detailed implementation manners

[0023] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below with reference to the accompanying drawings in the present invention. Apparently, the described embodiments are some but not all of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present invention without creative efforts shall fall within the protection scope of the present invention.

[0024] The following combines Figures 1-3 to describe the method for selecting the location of the distribution warehouse of the present invention.

[0025] Figure 1 It is a schematic flow chart of the method for selecting the location of the distribution warehouse provided by an embodiment of the present invention. As Figure 1 shown, the method includes the following: Step 101: Divide the target area to obtain a plurality of sub-areas.

[0026] Step 102: Determine an initial address of an alternative distribution warehouse in each of the sub-areas to obtain an initial location set of the distribution warehouse.

[0027] Step 103: Based on the order information, with the goal of minimizing the total cost, screen the optimal location combination from the initial location set of the distribution warehouse whose logistics scope can cover all orders; the optimal location combination is composed of the initial addresses of a plurality of the alternative distribution warehouses.

[0028] Step 104: Based on the order information, with the goal of minimizing the transportation cost, adjust the initial addresses of the alternative distribution warehouses in the optimal location combination to obtain the target locations of the alternative distribution warehouses in the optimal location combination.

[0029] In some embodiments of the present invention, the target area is the whole country. When dividing sub-areas, it can be divided according to administrative units. For example, the target area can be divided by county or district. Each sub-area corresponds to a county or district administrative unit, and an address is determined within the jurisdiction of each county or district administrative unit as the initial site selection of the sub-area and added to the initial site selection set of distribution warehouses. Specifically, the longitude and latitude of the location of each county-level government can be used as the initial address of the above-mentioned alternative distribution warehouses. The initial site selection set of distribution warehouses contains the initial site selections corresponding to all county-level administrative units in the country, with nearly 3,000 in number.

[0030] Of course, the target area of logistics transportation may not be within the whole country. For example, the target area can be the Yangtze River Delta region. The division standard of sub-areas may not be based on administrative units, and can be divided according to actual situations or actual needs, which is not restricted here.

[0031] The screening of the most optimal site selection combination will be introduced below.

[0032] Construct a cost calculation function as follows: Among them, represents the transportation cost, represents the warehousing cost, represents the inventory cost.

[0033] Taking the minimum value of the result of the above function, that is, the minimum cost as the goal, the branch and bound algorithm is used to select the optimal combination of initial addresses to obtain the most optimal site selection combination. Of course, certain constraints need to be met in the above solution process. Among them, the most basic constraint is that the logistics network constructed by the initial addresses of each alternative distribution warehouse in the initial site selection combination and its coverage range can cover the entire target area.

[0034] Specifically, for example, the logistics transportation coverage range of the alternative distribution warehouse located in Chaoyang District, Beijing is 20 kilometers. That is to say, all terminal sites within a radius of 20 kilometers of the distribution warehouse in Chaoyang District, Beijing can be covered by this alternative distribution warehouse. Among them, the terminal site refers to the downstream site of the distribution warehouse, such as the terminal store. The logistics transportation coverage ranges of each alternative distribution warehouse in the initial site selection combination should be integrated to cover the entire target area.

[0035] It should be noted that the data used in the above solution process is historical order data. For example, the historical order data for the whole previous year is adopted. Of course, the historical order data for the previous quarter or half year can also be used, and the historical order data can also be selected according to actual situations, which is not restricted here.

[0036] In some embodiments of the present invention, the above-mentioned target area may be a target area determined according to historical orders. Specifically, by extracting the delivery addresses of each order information, all the addresses that need to be covered by logistics transportation can be obtained, and these addresses constitute the target area described above. The combined logistics transportation coverage of each alternative distribution warehouse in the initial site selection combination should be able to cover all the delivery addresses of the above orders.

[0037] The following introduces the specific calculation methods of the transportation cost, warehousing cost, and inventory cost described above.

[0038] (1) Total transportation cost As Figure 2 shown, the goods are sent from Factory 1, transported to Distribution Warehouse 2, and then transported from Distribution Warehouse 2 to Terminal Site 3. The calculation method of the transportation cost from Factory 1 to Distribution Warehouse 2 is different from that from Distribution Warehouse 2 to Terminal Site 3. Therefore, in the embodiments of the present invention, the calculation of the transportation cost is divided into two parts, one part is the main line transportation cost, and the other part is the branch line transportation cost. The main line 4 refers to the line between Factory 1 and Distribution Warehouse 2, and the branch line 5 refers to the line between Distribution Warehouse 2 and Terminal Site 3.

[0039] The calculation formula for the main line transportation cost is as follows: Among them, represents the main line transportation cost, represents the main line transportation distance, represents the volume of the goods, represents the weight of the goods, represents the main line transportation management fee coefficient, represents the main line per square kilometer rate, represents the main line per ton-kilometer rate, and the main line per square kilometer rate and the main line per ton-kilometer rate are step rates based on the main line transportation distance.

[0040] The calculation formula for the branch line transportation cost is as follows: Among them, represents the branch line transportation cost, represents the branch line transportation distance, represents the volume of the goods, represents the weight of the goods, represents the branch line transportation management fee coefficient, branch line per square kilometer rate, represents the branch line per ton-kilometer rate.

[0041] It should be noted that in the calculation of trunk transportation costs, the per square kilometer rate and the per ton-kilometer rate are stepped rates based on the trunk transportation distance. In the calculation of branch transportation costs, the per square kilometer rate and the per ton-kilometer rate are unified rates, not stepped rates.

[0042] When calculating the transportation costs above in this embodiment, it is necessary to determine the trunk transportation mileage and the branch trunk transportation mileage based on the order information, the factory location, and the initial addresses of each alternative distribution warehouse, and then obtain the transportation costs. See Figure 3 , which specifically includes the following steps: Step 301: Based on the destination address in the order information and the logistics coverage of the alternative distribution warehouses, determine the orders corresponding to each alternative distribution warehouse; Step 302: Based on the initial address of the alternative distribution warehouse and the shipping address and the quantity of goods in the orders corresponding to the alternative distribution warehouse, calculate the trunk transportation costs of the alternative distribution warehouses; Step 303: Based on the initial address of the alternative distribution warehouse and the destination address in the orders corresponding to the alternative distribution warehouse, calculate the branch transportation costs of the alternative distribution warehouses; Step 304: Based on the trunk transportation costs and the branch transportation costs, calculate the transportation costs of the alternative distribution warehouses; Step 305: Based on the transportation costs of each alternative distribution warehouse in the site selection combination, calculate the transportation costs of the site selection combination.

[0043] The calculation of transportation costs will be introduced in detail below.

[0044] 1) Trunk line transportation costs The calculation formula for the total trunk transportation cost is as follows: For each distribution warehouse, there is a corresponding line between it and the factory to be transported, that is, each trunk line is corresponding to the combination of (distribution warehouse, factory). The calculation formula for the transportation cost on each trunk line is as follows: Trunk line transportation cost = max{weight of goods on the line × per ton-kilometer rate × actual distance, volume of goods on the line × per square kilometer rate × actual distance} × (1 + transportation management cost coefficient).

[0045] Among them, the goods on the line include the goods of all orders on this line, that is, all orders from the covered sites of the distribution warehouse to the corresponding factory. The per ton-kilometer / per square kilometer rate is a stepped rate based on the actual trunk transportation distance. The actual distance is the distance from the distribution warehouse to the factory, which is obtained by calling the map API with the longitude and latitude of the distribution warehouse and the factory.

[0046] 2) Branch line transportation costs The total cost of feeder transportation only considers the terminal stations passing through the distribution warehouse, including the feeder transportation cost from the distribution warehouse to the terminal stations.

[0047] For each distribution warehouse, a feeder line corresponds to each terminal station it covers. That is, each feeder line is corresponding to the combination of (terminal station, distribution warehouse). The calculation formula for the transportation cost on each feeder line is as follows: Feeder line transportation cost = max{weight of goods on the line × rate per ton-kilometer × actual distance, volume of goods on the line × rate per cubic-kilometer × actual distance} × (1 + coefficient of transportation management fee) Among them, the goods on the line include the goods of all orders on this line, that is, all orders corresponding to the terminal station. The actual distance is the distance from the station to the distribution warehouse, which is obtained by calling the map API with the longitude and latitude of the terminal station and the distribution warehouse.

[0048] In addition, it should be noted that the embodiments of the present invention combine two cost calculation methods of weight and volume. Considering the specific situation of the goods, the calculation method with the larger cost is adopted. For example, for a certain order information, if its volume of goods is too large and the weight is not heavy, the cost calculation method based on volume is used for this order. In actual transportation, the freight of this order will also be charged according to the volume-based charging method. Adopting this method to calculate the transportation cost in this embodiment can more accurately fit the actual situation and conform to the actual cost consumption.

[0049] (2) Total warehousing cost For each distribution warehouse, the calculation formula for the warehousing cost is as follows: Distribution warehouse warehousing cost = (warehouse rent + operation cost) × (1 + coefficient of warehousing management fee) 1) Warehouse rent For each distribution warehouse, when calculating the warehouse rent, all orders of the distribution warehouse are considered and calculated together.

[0050] Warehouse rent = warehouse area × daily rent per unit area × number of working days in the cycle Warehouse area = max{ × inventory days × area coefficient, minimum rentable area} 2) Operation cost For each distribution warehouse, when calculating the operation cost, all orders of the distribution warehouse are considered and calculated separately: (3) Total inventory cost For each distribution warehouse, the inventory cost is calculated by considering all orders of the distribution warehouse and combining them: Distribution warehouse inventory cost = Inventory Days Unit volume value Cycle working day The following is a detailed introduction to the calculation method of the transportation cost of each alternative distribution warehouse in the above cost calculation with examples.

[0051] Take the orders of the previous year as the basic data, first count the destination addresses of each order of the previous year, and assign the corresponding alternative distribution warehouse to each order in combination with the logistics coverage of each alternative distribution warehouse. For example, the orders {Y1, Y2, ..., Ym} are all the orders of the previous year. If only the destination addresses of 100 orders Y1, Y2, ..., Y100 are covered by the alternative distribution warehouse A1, and the shipping place of Y1, Y2, ..., Y50 is factory 1, and the shipping place of Y51, Y52, ..., Y100 is factory 2. Then, for the alternative distribution warehouse A1, its trunk line transportation cost is the sum of the transportation cost max of all orders of Y1, Y2, …, Y50 {total weight of goods × ton-kilometer rate × distance from factory 1 to alternative distribution warehouse A1, total volume of goods × ton-kilometer rate × distance from factory 1 to alternative distribution warehouse A1} × (1 + transportation management cost coefficient) and the transportation cost max of all orders of Y51, Y52, …, Y100 {total weight of goods × ton-kilometer rate × distance from factory 2 to alternative distribution warehouse A1, total volume of goods × ton-kilometer rate × distance from factory 2 to alternative distribution warehouse A1} × (1 + transportation management cost coefficient). The branch line transportation cost is the sum of the max {line cargo weight × ton-kilometer rate × distance from alternative distribution warehouse A1 to the destination, line cargo volume × cubic kilometer rate × distance from alternative distribution warehouse A1 to the destination} × (1 + transportation management fee coefficient) for each order in Y1, Y2, ..., Y100. Finally, the trunk line transportation cost and branch line transportation cost of alternative distribution warehouse A1 are added together to obtain the transportation cost of alternative distribution warehouse A1.

[0052] The above gives the transportation cost of the alternative distribution warehouse A1. Now we calculate the storage cost of the alternative distribution warehouse A1. The storage cost includes two parts: warehouse rental and operating expenses.

[0053] (1) Warehouse rental The formula for calculating the warehouse rent is "Warehouse rent = Warehouse area × Daily rent per unit area × Number of working days in the cycle". Specifically, for the alternative distribution warehouse A1, the number of working days in the previous year's cycle is calculated as 365. The total volume of goods for all orders is Z, and the warehouse area = Z / 365 * Area coefficient. Here, the area coefficient is used to convert the volume of goods to the warehouse area and provide a certain amount of space redundancy. For example, if Z / 365 = 100 cubic meters and the area coefficient is 1.2, that is, 1 cubic meter of goods requires 1.2 square meters of warehouse area, then the warehouse area is 120 square meters. The daily rent per unit area is determined according to the local rent of the alternative distribution warehouse A1.

[0054] (2) Operating costs For the alternative distribution warehouse A1, taking the annual cost calculation as an example, the goods of the annual historical orders corresponding to the alternative distribution warehouse A1 are counted or volume, and based on the formula " " calculate the operating cost of each order of the alternative distribution warehouse A1, and sum them up to obtain the total annual operating cost of the alternative distribution warehouse A1.

[0055] After determining the warehouse rent and operating costs of the alternative distribution warehouse A1, calculate the warehousing cost of the alternative distribution warehouse A1 according to "Distribution warehouse warehousing cost = (Warehouse rent + Operating costs) × (1 + Warehousing management cost coefficient)".

[0056] Next, calculate the inventory cost of the alternative distribution warehouse A1.

[0057] Based on the formula " × Inventory days × Value per unit volume × Number of working days in the cycle" to calculate the inventory cost of the alternative distribution warehouse A1. For example, it is counted that the total monthly (30 days) shipment volume of 100 orders Y1, Y2,..., Y100 within the coverage of the alternative distribution warehouse A1 is 300 cubic meters, and the average daily shipment volume: = = 10 cubic meters. Assuming the inventory days is 5 days, that is, the goods are stored in the warehouse for an average of 5 days, so the average in-warehouse quantity of goods is 50 cubic meters, and the daily interest rate is , and then the daily inventory cost can be calculated according to the daily interest rate, that is, Daily interest rate * 50 cubic meters * Value per unit volume. Multiply the daily inventory cost by the number of working days in the cycle 30 to obtain the inventory cost of the alternative distribution warehouse A1 for one cycle (30 days). Among them, the inventory days can be determined by human experience or based on historical data analysis.

[0058] The transportation cost, warehousing cost, and inventory cost of the alternative distribution warehouse A1 are obtained respectively above.

[0059] Next, the screening of the optimal site combination will be introduced in the form of an example.

[0060] (1) Obtain the following business data: 1. Sites: a. Terminal site address; b. Terminal site longitude and latitude.

[0061] 2. Factories: a. Factory address; b. Factory longitude and latitude.

[0062] 3. Existing distribution warehouses (not mandatory): a. Distribution warehouse address; b. Distribution warehouse longitude and latitude; c. Relevant cost item rates and constraints.

[0063] 4. Orders: a. Order origin; b. Order destination; c. Order quantity (weight and volume).

[0064] 5. Alternative range: Support using nearly 3,000 district - level administrative divisions across the country as alternatives, considering the corresponding cost item rates and constraints.

[0065] (2) Obtain the following cost item data: 1. Transportation cost: a. Feeder transportation rate: ton - kilometer transportation rate / cubic - kilometer transportation rate; b. Main - line transportation rate (charged by distance tiers): i. Number of tiers, ii. Tier upper and lower limits, iii. Ton - kilometer transportation rate for each tier, iv. Cubic - kilometer transportation rate for each tier.

[0066] 2. Warehousing cost - warehouse rent a. Area coefficient; b. Inventory days; c. Cycle working days (i.e., time span); d. The daily rent per unit area can be maintained separately for each distribution warehouse and alternative range.

[0067] 3. Warehousing cost - operation rate a. The operation cost per ton can be maintained separately for each distribution warehouse and alternative range; b. The operation cost per cubic can be maintained separately for each distribution warehouse and alternative range.

[0068] 4. Inventory cost a. Value per unit volume of goods; b. Annual interest rate.

[0069] 5. Management fee rate a. Warehouse management cost coefficient; b. Transportation management cost coefficient.

[0070] (3) Select the optimal site combination based on the following model s.t. ≤ ≤ = 1 = 1 , {0, 1} wherein, in the objective function, it represents the total transportation cost of each alternative distribution warehouse in the site selection combination , the total warehousing cost and the total inventory cost to be minimized. represents whether the distribution warehouse i is opened (i.e., whether it is selected), represents whether the site j is covered by a distribution warehouse i , represents the distribution warehouse coverage radius constraint, represents the specified distribution warehouse quantity constraint, represents the specified coverage relationship constraint, represents the specified distribution warehouse selection constraint. It should be noted that based on the specified distribution warehouse opening constraint, the present invention is also applicable to the scenario where some distribution warehouses already exist. Based on the specified coverage relationship constraint, the present invention is also applicable to the case where some coverage relationships are specified in advance. Based on this, the solution of the present invention is more flexible.

[0071] Use a solver to solve the above mixed-integer linear programming model to obtain the preliminary distribution warehouse selection result and the coverage relationship of each distribution warehouse. Under the condition of retaining the coverage relationship, continue to apply the subsequent algorithm to further adjust and refine the initial addresses of the distribution warehouses to obtain the optimal longitude and latitude of the distribution warehouses.

[0072] It should be noted that the initial addresses of the above alternative distribution warehouses are longitude and latitude addresses selected within the sub-region. These longitude and latitude addresses are roughly selected. After determining the optimal site selection combination, it is necessary to finely adjust the initial sites of each alternative distribution warehouse in the optimal site selection combination. The following introduces the fine adjustment of the initial sites of each alternative distribution warehouse in the optimal site selection combination.

[0073] This fine-tuning step (also known as the center-of-gravity adjustment step) generally splits the original problem into multiple sub-problems based on the above-mentioned most optimal site selection combination according to the collection and distribution warehouses. For each sub-problem, considering its collection and distribution warehouse and the covered terminal sites, if the location of the collection and distribution warehouse can be adjusted, the iterative center-of-gravity method is applied for single-site location, taking into account both the upstream and downstream, to obtain the optimal longitude and latitude results of the collection and distribution warehouse. Otherwise, the current collection and distribution warehouse location result is retained.

[0074] When performing single-site location for each sub-problem, since the coverage relationship is fixed and the warehousing cost and inventory cost basically remain unchanged, the total transportation cost, that is, the feeder transportation cost and the main-line transportation cost, can be used as the optimization objective to establish the following mathematical model: Apply the iterative center-of-gravity method to solve the above mathematical problem S1 Initial solution: S2 Iterative steps: Among them, represents the equivalent transportation volume of the order (considering weight and volume), and each order appears twice, corresponding to the feeder and the main line respectively. represents the equivalent transportation rate (considering weight and volume). ( ， ) represents the longitude and latitude of the other end (terminal site or factory) of the order. represents the distance from the site or factory to the collection and distribution warehouse (at the current step).

[0075] When the iteration converges, that is, when the longitude and latitude of the collection and distribution warehouse in two consecutive iterations ( ， ) is the same as ( ， ), the algorithm ends, and the longitude and latitude of the current iterative step are output as the adjusted collection and distribution warehouse result. In addition, since the location of the collection and distribution warehouse will change during the algorithm iteration process, that is, the distance from the terminal site to the collection and distribution warehouse is also changed, the coverage radius constraint of the collection and distribution warehouse is considered to ensure the feasibility of the result.

[0076] The above realizes the location of the collection and distribution warehouse in the case of no alternative collection and distribution warehouses.

[0077] The device for selecting the location of a distribution warehouse provided by the present invention will be described below. The device for selecting the location of a distribution warehouse described below can be correspondingly referred to the method for selecting the location of a distribution warehouse described above. Refer to Figure 4 , the device for selecting the location of a distribution warehouse includes: A region division module 401, configured to divide a target region to obtain a plurality of sub-regions; An initial alternative distribution warehouse set generation module 402, configured to determine an initial address of an alternative distribution warehouse in each of the sub-regions to obtain an initial location set of distribution warehouses; An optimal location combination screening module 403, configured to, based on order information and with the goal of minimizing the total cost, screen an optimal location combination from the initial location set of distribution warehouses whose logistics scope can cover all orders; the optimal location combination is composed of the initial addresses of a plurality of the alternative distribution warehouses; A target location adjustment module 404, configured to, based on order information and with the goal of minimizing the transportation cost, adjust the initial addresses of the alternative distribution warehouses in the optimal location combination to obtain the target locations of the alternative distribution warehouses in the optimal location combination.

[0078] For how each module in the device works specifically, it can be correspondingly referred to the method for selecting the location of a distribution warehouse described above, and details will not be elaborated here.

[0079] Figure 5 An example of a schematic physical structure diagram of an electronic device is shown in Figure 5 As shown, the electronic device may include: a processor 510, a communication interface 520, a memory 530, and a communication bus 540. Among them, the processor 510, the communication interface 520, and the memory 530 communicate with each other through the communication bus 540. The processor 510 can call the logical instructions in the memory 530 to execute the method for selecting the location of a distribution warehouse, and the method includes: dividing a target region to obtain a plurality of sub-regions; determining an initial address of an alternative distribution warehouse in each of the sub-regions to obtain an initial location set of distribution warehouses; based on order information and with the goal of minimizing the total cost, screening an optimal location combination from the initial location set of distribution warehouses whose logistics scope can cover all orders; the optimal location combination is composed of the initial addresses of a plurality of the alternative distribution warehouses; based on order information and with the goal of minimizing the transportation cost, adjusting the initial addresses of the alternative distribution warehouses in the optimal location combination to obtain the target locations of the alternative distribution warehouses in the optimal location combination. For a more specific method, it can be referred to the description of the method for selecting the location of a distribution warehouse above, and details will not be elaborated here.

[0080] In addition, when the logical instructions in the above-mentioned memory 530 are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs.

[0081] On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the distribution center location selection method provided by the above-mentioned various methods. The method includes: dividing a target area to obtain a plurality of sub-areas; determining an initial address of an alternative distribution center in each of the sub-areas to obtain an initial location selection set of distribution centers; based on order information, with the goal of minimizing the total cost, screening out an optimal location selection combination from the initial location selection set of distribution centers whose logistics scope can cover all orders; the optimal location selection combination consists of the initial addresses of a plurality of the alternative distribution centers; based on order information, with the goal of minimizing the transportation cost, adjusting the initial addresses of the alternative distribution centers in the optimal location selection combination to obtain the target locations of the alternative distribution centers in the optimal location selection combination. As for more specific methods, reference can be made to the distribution center location selection described above, and details are not repeated here.

[0082] In another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it implements the distribution warehouse site selection method provided by the above-mentioned various methods. The method includes: dividing a target area to obtain a plurality of sub-areas; determining an initial address of an alternative distribution warehouse in each of the sub-areas to obtain an initial site selection set of distribution warehouses; based on order information, with the goal of minimizing the total cost, screening out an optimal site selection combination from the initial site selection set of distribution warehouses whose logistics scope can cover all orders; the optimal site selection combination is composed of the initial addresses of a plurality of the alternative distribution warehouses; based on order information, with the goal of minimizing the transportation cost, adjusting the initial addresses of the alternative distribution warehouses in the optimal site selection combination to obtain the target site selections of the alternative distribution warehouses in the optimal site selection combination. As for a more specific method, reference can be made to the distribution warehouse site selection described above, which will not be elaborated here.

[0083] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement it without creative labor.

[0084] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on such an understanding, the essence of the above technical solution, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disc, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0085] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for selecting the location of a distribution warehouse, characterized in that, including: divide the target area to obtain multiple sub-areas; determine the initial address of an alternative distribution warehouse in each of the sub-areas to obtain a set of initial site selections for the distribution warehouse; based on the order information, with the goal of minimizing the total cost, screen the optimal site selection combination whose logistics scope can cover all orders from the set of initial site selections for the distribution warehouse; the optimal site selection combination consists of the initial addresses of multiple alternative distribution warehouses; based on the order information, with the goal of minimizing the transportation cost, adjust the initial addresses of the alternative distribution warehouses in the optimal site selection combination to obtain the target site selections of the alternative distribution warehouses in the optimal site selection combination.

2. The site selection method of the collection and distribution warehouse according to claim 1, wherein, The total cost includes: the transportation cost, the warehousing cost, and the inventory cost.

3. The method for selecting a distribution warehouse location according to claim 1, wherein The transportation cost includes the trunk transportation cost and the feeder transportation cost; the trunk transportation cost represents the transportation cost from the factory to the distribution warehouse, and the feeder transportation cost represents the transportation cost from the distribution warehouse to the terminal site.

4. The method for selecting a distribution warehouse location according to claim 1 or 2, characterized in that The calculation steps of the transportation cost are as follows: based on the destination address in the order information and the logistics coverage scope of the alternative distribution warehouse, determine the orders corresponding to each alternative distribution warehouse; based on the initial address of the alternative distribution warehouse and the shipping address and the quantity of goods in the orders corresponding to the alternative distribution warehouse, calculate the trunk transportation cost of the alternative distribution warehouse; based on the initial address of the alternative distribution warehouse and the destination address in the orders corresponding to the alternative distribution warehouse, calculate the feeder transportation cost of the alternative distribution warehouse; based on the trunk transportation cost and the feeder transportation cost, calculate the transportation cost of the alternative distribution warehouse; based on the transportation costs of the alternative distribution warehouses in the site selection combination, calculate the transportation cost of the site selection combination.

5. The method for selecting a distribution warehouse location according to claim 3 or 4, characterized in that The calculation formula of the trunk transportation cost is as follows: Among them, represents the trunk transportation cost, represents the trunk transportation distance, represents the volume of the goods, represents the weight of the goods, represents the coefficient of the trunk transportation management fee, represents the trunk per square kilometer rate, represents the trunk per ton-kilometer rate, and the trunk per square kilometer rate and the trunk per ton-kilometer rate are step rates based on the trunk transportation distance.

6. The site selection method of the collection and distribution warehouse according to claim 3 or 4, characterized in that The calculation formula of the feeder transportation cost is as follows: Among them, represents the feeder transportation cost, represents the feeder transportation distance, represents the volume of goods, represents the weight of goods, represents the coefficient of feeder transportation management cost, feeder cost per square kilometer, represents the feeder cost per ton-kilometer.

7. The location selection method of the collection and distribution warehouse according to claim 1, characterized in that Screening the optimal site selection combination whose logistics scope can cover all orders from the set of initial site selections for the distribution warehouse includes: based on the specified coverage relationship constraint and the specified distribution warehouse opening constraint, screen the optimal site selection combination whose logistics scope can cover all orders from the set of initial site selections for the distribution warehouse; the specified coverage relationship constraint means that a specified terminal site is covered by a specified distribution warehouse, and the specified distribution warehouse opening constraint means that a specified address is used as the target site selection.

8. The siting method of the collection and distribution warehouse according to claim 7, characterized in that Screening the optimal site selection combination whose logistics scope can cover all orders from the set of initial site selections for the distribution warehouse further includes: based on the distribution warehouse coverage radius constraint and the specified distribution warehouse quantity constraint, screen the optimal site selection combination whose logistics scope can cover all orders from the set of initial site selections for the distribution warehouse.

9. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and running on the processor, characterized in that, When the processor executes the program, it implements the distribution warehouse site selection method according to any one of claims 1 to 8.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the distribution warehouse site selection method according to any one of claims 1 to 8.

Images