Warehouse site selection method and device, electronic equipment and storage medium

Abstract

The invention discloses a warehouse site selection method and device, electronic equipment and a storage medium, and relates to the technical field of logistics transportation. The method comprises the following steps: firstly, obtaining supply point information of a supply point, receiving point information of a receiving point and initial position information of a plurality of warehouses to be subjected to site selection; secondly, determining a coverage relation and a supply relation according to the initial position information, the supply point information and the receiving point information; then, the total transportation cost is determined according to the coverage relation and the supply relation; and if the total transportation cost meets a preset cost condition, determining the initial position information as target position information of the warehouse to be subjected to site selection. Therefore, conflicts and influences among a plurality of warehouses to be subjected to site selection in the whole warehouse network structure can be eliminated through the reasonable coverage relation and the supply relation, and then the total transportation cost is determined according to the coverage relation and the supply relation, so that the transportation cost of the warehouse network structure after site selection can be accurately controlled, and the accuracy of site selection is ensured.

Description

Technical Field

[0001] The present application relates to the field of logistics and transportation technology, and in particular to a warehouse site selection method, device, electronic equipment and storage medium. Background Art

[0002] With the acceleration of globalization and the rapid development of e-commerce, the modern logistics system is facing unprecedented opportunities and challenges. In order to meet the growing customer needs and continuously expand the business scope, optimizing supply chain management has become the key to improving competitiveness. In this process, warehouse site selection, as an important part of supply chain network design, is directly related to the company's operational efficiency and cost control. Reasonable and effective warehouse site selection can not only reduce transportation costs and increase delivery speed, but also improve customer service experience and enhance the company's competitiveness in the market.

[0003] However, in related technologies, the site selection method is often discrete, which solves the site selection problem of a single warehouse. It does not take into account the supply relationship in the entire warehouse network structure when multiple warehouses are sited consecutively, which may lead to conflicts or mutual influences among warehouses after site selection, and further leads to poor control of transportation costs in the warehouse network structure after site selection, and the accuracy of warehouse site selection cannot be guaranteed. Summary of the invention

[0004] The embodiments of the present application provide a warehouse site selection method, device, electronic device and storage medium to solve the problem that the existing warehouse site selection method only focuses on the site selection of a single warehouse, thereby causing poor transportation cost control of the warehouse network structure after multiple warehouse sites are selected.

[0005] On the one hand, an embodiment of the present application provides a warehouse site selection method, including:

[0006] Obtaining the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected;

[0007] Determine the coverage relationship and supply relationship based on the initial location information, supply point information, and receiving point information; the coverage relationship represents the coverage of the receiving point by the warehouse to be located, and the supply relationship represents the supply of the supply point to the warehouse to be located;

[0008] According to the coverage relationship and supply relationship, the total transportation cost is determined. The total transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected;

[0009] If the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected.

[0010] On the one hand, an embodiment of the present application provides a warehouse site selection device, including:

[0011] An acquisition module, used to acquire the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected;

[0012] The relationship determination module is also used to determine the coverage relationship and the supply relationship according to the initial location information, the supply point information, and the receiving point information; the coverage relationship represents the coverage of the receiving point by the warehouse to be located, and the supply relationship represents the supply of the supply point to the warehouse to be located;

[0013] The cost determination module is used to determine the total transportation cost based on the coverage relationship and the supply relationship. The total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point and the warehouse to be selected;

[0014] The location determination module is used to determine the initial location information as the target location information of the warehouse to be selected if the total transportation cost meets the preset cost condition.

[0015] In a possible embodiment, the supply point information includes supply point location information, the receiving point information includes receiving point location information, and the relationship determination module is further used to:

[0016] Based on the supply point location information, the receiving point location information, and the initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained, and the allocation result includes the supply point and the receiving point to which the warehouse to be located is allocated;

[0017] Based on each allocation result, a covering relationship and a supplying relationship are generated.

[0018] In a possible embodiment, the device further includes:

[0019] A cost calculation module is used to calculate the sub-transportation cost corresponding to each allocation result, where the sub-transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected corresponding to the allocation result;

[0020] The first execution module is used to execute the step of determining the total transportation cost according to the coverage relationship and the supply relationship if the sub-transportation cost meets the target cost condition.

[0021] In a possible embodiment, the device further includes:

[0022] An updating module, used for updating the initial location information of the warehouse to be located corresponding to the allocation result to obtain updated location information if the sub-cost does not meet the target cost condition or the total transportation cost does not meet the preset cost condition;

[0023] The second execution module is used to return to execute based on the updated location information, based on the supply point location information, the receiving point location information, and the initial location information, and adopt the principle of nearest allocation to allocate the supply point and the receiving point to each warehouse to be located, so as to obtain the allocation result corresponding to each warehouse to be located; based on each allocation result, generate the steps of covering relationship and supply relationship until the sub-cost meets the target cost condition and the total transportation cost meets the preset cost condition.

[0024] In a possible embodiment, the relationship determination module is further configured to:

[0025] Construct a KD tree corresponding to the warehouse to be located based on the initial location information to obtain a first KD tree;

[0026] Construct a KD tree corresponding to the supply point based on the supply point location information to obtain a second KD tree;

[0027] Construct a KD tree corresponding to the delivery point based on the delivery point location information to obtain a third KD tree;

[0028] According to the first KD tree and the second KD tree, the supply point is allocated to the warehouse to be located by adopting the principle of nearest allocation;

[0029] According to the first KD tree and the third KD tree, the principle of nearest allocation is adopted to allocate receiving points to the warehouse to be located.

[0030] In a possible embodiment, the relationship determination module is further configured to:

[0031] Convert the supply point location information, the receiving point location information, and the initial location information from geographic coordinates to plane coordinates to obtain converted supply point location information, converted receiving point location information, and converted initial location information;

[0032] Based on the converted supply point location information, the converted receiving point location information, and the converted initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained;

[0033] The location determination module is also used for: if the total transportation cost meets the preset cost condition, the initial location information is converted from the plane coordinates to the geographic coordinates, and the converted initial location information is determined as the target location information of the warehouse to be selected.

[0034] In a possible embodiment, the supply point information includes supply point location information, the receiving point information includes receiving point location information, and the cost determination module is further used to:

[0035] For each warehouse to be located, determine the target receiving point corresponding to the warehouse to be located based on the coverage relationship, and determine the target supply point corresponding to the warehouse to be located based on the supply relationship;

[0036] Based on the initial location information of the warehouse to be selected and the location information of the target receiving point, a first distance between the warehouse to be selected and the target receiving point is calculated, and a first cost is calculated according to the first distance;

[0037] Based on the initial location information of the warehouse to be selected and the supply point location information of the target supply point, a second distance between the warehouse to be selected and the target supply point is calculated, and a second cost is calculated according to the second distance;

[0038] Based on the first cost and the second cost, a total transportation cost is determined.

[0039] In a possible embodiment, the supply point information includes supply goods information, and the device further includes:

[0040] The third execution module is used to determine whether each type of stored goods in the warehouse to be selected is supplied by one supply point based on the supply relationship and the supply goods information if it is determined that each receiving point is covered by one warehouse to be selected based on the coverage relationship; if each type of stored goods in the warehouse to be selected is supplied by one supply point, the step of determining the total transportation cost based on the coverage relationship and the supply relationship is executed.

[0041] On the one hand, an embodiment of the present application provides an electronic device, which includes a processor and a memory, wherein the memory stores program code, and when the program code is executed by the processor, the processor executes any one of the above-mentioned warehouse site selection methods.

[0042] On the one hand, the present application provides a computer-readable storage medium, which includes a program code. When the storage medium is run on an electronic device, the program code is used to enable the electronic device to execute any of the above-mentioned warehouse site selection methods.

[0043] On the one hand, an embodiment of the present application provides a computer program product, which includes computer instructions, and the computer instructions are stored in a computer-readable storage medium; when a processor of an electronic device reads the computer instructions from the computer-readable storage medium, the processor executes the computer instructions, so that the electronic device executes any one of the above-mentioned warehouse site selection methods.

[0044] The beneficial effects of this application are as follows:

[0045] The embodiment of the present application provides a warehouse site selection method, device, electronic device and storage medium. The warehouse site selection method includes: first, obtaining the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected; second, determining the coverage relationship and the supply relationship based on the initial location information, the supply point information, and the receiving point information; wherein the coverage relationship represents the coverage of the warehouse to be selected for the receiving point, and the supply relationship represents the supply of the supply point to the warehouse to be selected; then, according to the coverage relationship and the supply relationship, determining the total transportation cost, the total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point and the warehouse to be selected; if the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected. In this way, when selecting sites for multiple warehouses to be located, the coverage relationship and supply relationship between multiple warehouses to be located, receiving points and supply points can be allocated according to the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be located, so as to eliminate the conflicts and influences between multiple warehouses to be located in the entire warehouse network structure through reasonable coverage relationship and supply relationship, and then determine the total transportation cost according to the coverage relationship and supply relationship, so as to accurately control the transportation cost of the warehouse network structure after site selection and ensure the accuracy of site selection.

[0046] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related technologies, the drawings required for use in the embodiments or the related technical descriptions are briefly introduced below. Obviously, the drawings described below are only the embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0048] Figure 1 This is a schematic diagram of an application scenario in an embodiment of the present application;

[0049] Figure 2 This is a flowchart of a warehouse site selection method in an embodiment of the present application;

[0050] Figure 3 A schematic diagram of a decoding process of a portion of a genetic algorithm in an embodiment of the present application;

[0051] Figure 4 A schematic diagram of another part of the decoding process of a genetic algorithm in an embodiment of the present application;

[0052] Figure 5 A schematic diagram of a decoding process of another part of a genetic algorithm in an embodiment of the present application;

[0053] Figure 6 A schematic diagram of the reverse decoding process of a genetic algorithm in an embodiment of the present application;

[0054] Figure 7 This is a structural schematic diagram of a warehouse site selection device in an embodiment of the present application;

[0055] Figure 8 A schematic diagram of the hardware structure of an electronic device in an embodiment of the present application. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical scheme and advantages of the present application clearer, the technical scheme in the embodiment of the present application will be clearly and completely described below in conjunction with the drawings in the embodiment of the present application. Obviously, the described embodiment is only a part of the embodiment of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application. In the absence of conflict, the embodiments in the present application and the features in the embodiments can be arbitrarily combined with each other. In addition, although the logical order is shown in the flow chart, in some cases, the steps shown or described can be performed in an order different from that here.

[0057] The terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the invention described herein can be implemented in sequences other than those illustrated or described herein.

[0058] The following is a brief introduction to the design concept of the embodiment of the present application:

[0059] In the prior art, when selecting a warehouse site, the best site is often selected from multiple candidate warehouse locations. This solution is limited by the optional range of the candidate warehouse locations and whether the candidate warehouse locations are fully considered, which may miss better site selection results. Therefore, the optional range of warehouse locations can be expanded through open warehouse site selection. However, the current open warehouse site selection solution is often only carried out for a single warehouse, discretizing the warehouse site selection problem, and can only consider the relationship between a single warehouse and the receiving point and supply point associated with the warehouse. It does not consider the supply relationship in the entire warehouse network structure when multiple warehouses are sited continuously, which may lead to conflicts or mutual influences between warehouses after site selection, and then lead to poor transportation cost control of the warehouse network structure after site selection, and the accuracy of warehouse site selection cannot be guaranteed. In addition, discretizing the warehouse site selection problem may inevitably exclude some potential optimal solutions, resulting in better site selection solutions being ignored.

[0060] In view of this, the embodiments of the present application provide a warehouse site selection method, device, electronic device and storage medium. The warehouse site selection method includes:

[0061] First, obtain the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be located; secondly, determine the coverage relationship and the supply relationship based on the initial location information, the supply point information, and the receiving point information; wherein the coverage relationship represents the coverage of the warehouse to be located on the receiving point, and the supply relationship represents the supply of the supply point to the warehouse to be located; then, determine the total transportation cost based on the coverage relationship and the supply relationship, and the total transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be located; if the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be located. In this way, when selecting sites for multiple warehouses to be located, the coverage relationship and supply relationship between multiple warehouses to be located, receiving points and supply points can be allocated according to the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be located, so as to eliminate the conflicts and influences between multiple warehouses to be located in the entire warehouse network structure through reasonable coverage relationship and supply relationship, and then determine the total transportation cost according to the coverage relationship and supply relationship, so as to accurately control the transportation cost of the warehouse network structure after site selection and ensure the accuracy of site selection.

[0062] The preferred embodiments of the present application are described below in conjunction with the drawings in the specification. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present application, and are not used to limit the present application. In addition, the embodiments and features in the embodiments of the present application may be combined with each other if there is no conflict.

[0063] like Figure 1, which is a schematic diagram of an application scenario provided by an embodiment of the present application. In the schematic diagram of the application scenario, a terminal device 101 and a server 102 are included. The terminal device 101 and the server 102 communicate with each other through a communication network.

[0064] The terminal device 101 is an electronic device used by the target object, and the electronic device may be a personal computer, a mobile phone, a tablet computer, a notebook, an e-book reader, a vehicle-mounted terminal, etc. In addition, a replenishment-related client may be installed on the terminal device 101, and the client may be a software (e.g., an APP, a browser, etc.), or a web page, a small program, etc. The target object may use the above-mentioned warehouse site selection-related client through the terminal device 101 to perform warehouse site selection-related operations.

[0065] The server 102 may be an independent physical server or an edge device 102 in the field of cloud computing. It may also be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud storage, cloud functions, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (English name: Content Delivery Network, abbreviated as CDN), as well as big data and artificial intelligence platforms.

[0066] There is no restriction on the number of the terminal devices 101 and / or servers 102 .

[0067] It should be noted that the warehouse site selection method in the embodiment of the present application can be executed by the terminal device 101 or the server 102 alone, or can be executed jointly by the terminal device 101 and the server 102. For example, when executed jointly by the terminal device 101 and the server 102, the server 102 can receive the supply point information of the supply point created by the target object, the receiving point information of the receiving point, and the target number of warehouses to be selected; then, the initial location information of multiple warehouses to be selected is generated according to the target number; then, the coverage relationship and the supply relationship are determined according to the initial location information, the supply point information, and the receiving point information; then, the total transportation cost is determined according to the coverage relationship and the supply relationship, and then, when the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected, and the terminal device 102 can receive the target location information and present the target location information to the target object, so that the target object selects the warehouse location according to the target location information.

[0068] The following describes the warehouse site selection method provided by the exemplary embodiment of the present application in combination with the above-mentioned application scenarios and with reference to the accompanying drawings. It should be noted that the above-mentioned application scenarios are only shown to facilitate understanding of the spirit and principles of the present application, and the implementation methods of the present application are not subject to any limitations in this regard.

[0069] refer to Figure 2 , is an implementation flow chart of a warehouse site selection method provided in an embodiment of the present application. Here, the server is used as the execution subject for introduction. The specific implementation process of the method is as follows:

[0070] S201, obtaining supply point information of a supply point, receiving point information of a receiving point, and initial location information of a plurality of warehouses to be selected.

[0071] In this embodiment, a warehouse may also refer to any facility with a cargo storage function (hereinafter referred to as a facility), such as a store for cargo storage, etc. A supply point may refer to an upstream of a facility, which is used to supply cargo to the facility, and a receiving point may refer to a customer of the facility, to whom the facility supplies cargo.

[0072] The supply point information may include the location information of the supply point (hereinafter referred to as the supply point location information), the information and quantity of the goods that can be supplied, etc. The receiving point information may include the location information of the receiving point (hereinafter referred to as the receiving point location information), the information and quantity of the goods that need to be received, etc. The number of supply points and the number of receiving points may be one or more, and are not limited here.

[0073] In some embodiments, the supply point information of the supply point and the receiving point information of the receiving point can be obtained in advance, and then sent by the target object to the server through the above-mentioned terminal device to instruct the server to select a warehouse location based on the supply point information and the receiving point information. Optionally, when the target object sends the supply point information and the receiving point information to the server, it can also send the target number of warehouses to be selected. The server can randomly generate multiple different initial location information based on the target number, and the number of the multiple initial location information is consistent with the target number. Optionally, the initial location information can also be set by the target user and sent to the server.

[0074] S202, determining the coverage relationship and the supply relationship based on the initial location information, the supply point information, and the receiving point information; the coverage relationship represents the coverage of the receiving point by the warehouse to be located, and the supply relationship represents the supply of the supply point to the warehouse to be located.

[0075] Among them, coverage means that the warehouse can supply goods to the receiving points, and the coverage relationship refers to which warehouses in the warehouse network structure composed of the above-mentioned receiving points, the above-mentioned supply points and the warehouses to be selected can supply goods to which receiving points.

[0076] Among them, supply means that the supply point can supply goods to the warehouse, and the supply relationship refers to which supply points in the above warehouse network structure can supply goods to which warehouses to be selected.

[0077] In some embodiments, the coverage relationship can be determined based on the distance between the warehouse to be located and the receiving point. For example, the warehouse to be located 1 can supply goods to the receiving points within a distance of no more than X0 meters. If the distance between the receiving point 1 and the warehouse to be located 1 is X1 meters, and the distance between the receiving point 2 and the warehouse to be located 1 is X2 meters, where X1 and X2 are both less than X0, then the coverage relationship can be obtained that the warehouse to be located 1 covers both the receiving point 1 and the receiving point 2. For another example, the warehouse to be located 1 can cover the designated number of receiving points closest to it. If the designated number is 1, the distance between the receiving point 1 and the warehouse to be located 1 is X1 meters, and the distance between the receiving point 2 and the warehouse to be located 1 is X2 meters, and X1 is less than X2, then the coverage relationship can be obtained that the warehouse to be located 1 covers the receiving point 1.

[0078] Similarly, the supply relationship can also be determined based on the distance between the warehouse to be selected and the supply point. Therefore, in this embodiment, the supply point location information can be extracted from the supply point information, and then the distance between each warehouse to be selected and each supply point can be calculated based on the initial location information and the supply point location information, and the supply relationship is determined based on the distance. Also, the receiving point location information is extracted from the receiving point information, and then the distance between each warehouse to be selected and each receiving point can be calculated based on the initial location information and the receiving point location information, and the coverage relationship is determined based on the distance.

[0079] In some implementations, the supply point information includes supply point location information, and the receiving point information includes receiving point location information. In S202, specific implementations of determining the coverage relationship and the supply relationship based on the initial location information, the supply point information, and the receiving point information may include:

[0080] The cargo point location information, the receiving point location information and the initial location information may be geographic coordinates or plane coordinates, which are not limited here.

[0081] S2021, based on the supply point location information, the receiving point location information, and the initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained, and the allocation result includes the supply point and the receiving point to which the warehouse to be located is allocated.

[0082] As an implementation method, in S2021, based on the supply point location information, the receiving point location information, and the initial location information, the implementation method of allocating supply points and receiving points to each warehouse to be located using the principle of nearest allocation may include: constructing a KD tree corresponding to the warehouse to be located based on the initial location information to obtain a first KD tree; constructing a KD tree corresponding to the supply point based on the supply point location information to obtain a second KD tree; constructing a KD tree corresponding to the receiving point based on the receiving point location information to obtain a third KD tree; according to the first KD tree and the second KD tree, allocating supply points to the warehouse to be located using the principle of nearest allocation; according to the first KD tree and the third KD tree, allocating receiving points to the warehouse to be located using the principle of nearest allocation.

[0083] The full name of KD tree is K-Dimensional Tree, which is a data structure used to organize K-dimensional spatial data, and is mainly used for searching key data in multidimensional space, such as range search and nearest neighbor search. KD tree is a special binary tree, in which each node represents a point in K-dimensional space, and the structure of the tree enables fast spatial search operations. In this embodiment, KD trees can be constructed for the warehouses to be located, the supply points, and the receiving points to perform nearest neighbor search, so that the supply points and receiving points closest to each warehouse to be located can be searched.

[0084] For example, in practical applications, when constructing a KD tree, the coordinates of each supply point, the coordinates of each receiving point, and the initial position of each warehouse to be located can be collected; then, based on the coordinates of each supply point, the coordinates of each receiving point, and the initial position of each warehouse to be located, scipy.spatial.KDTree (a class in the SciPy library for building and querying KD trees) can be used to build KD trees for the supply point, the receiving point, and the warehouse to be located. Next, for each warehouse to be located, the nearest supply point and the nearest receiving point can be found, wherein the method of finding the nearest supply point and the nearest receiving point can be specifically implemented by calling the query method of the KD tree (a method for finding the nearest neighbor of a given point in a constructed KD tree). Finally, each warehouse to be located and its nearest supply point and receiving point information can be stored in a list as a distribution result, and the distribution result is output.

[0085] S2022, based on each allocation result, generate a coverage relationship and a supply relationship.

[0086] Since an allocation result includes the coverage relationship and supply relationship of a warehouse to be located, by integrating the allocation results, the overall coverage relationship and overall supply relationship between all warehouses to be located and the receiving points and supply points can be obtained.

[0087] In this embodiment, the coverage relationship and the supply relationship are obtained by constructing a KD tree, thereby reducing the computational complexity of the coverage relationship and the supply relationship.

[0088] In some implementations, in S2021, based on the supply point location information, the receiving point location information, and the initial location information, a supply point and a receiving point are allocated to each warehouse to be located by adopting the principle of nearest allocation. The specific implementation method of obtaining the allocation result corresponding to each warehouse to be located may include:

[0089] First, the supply point location information, the receiving point location information and the initial location information are converted from geographic coordinates to plane coordinates to obtain the converted supply point location information, the converted receiving point location information and the converted initial location information.

[0090] As an implementation method, the longitude and latitude coordinates of the supply point location information, the receiving point location information and the initial location information can be projected into a plane coordinate system using the Universal Transverse Mercator Projection (UTM) to obtain the converted supply point location information, the converted receiving point location information and the converted initial location information.

[0091] Then, based on the converted supply point location information, the converted receiving point location information, and the converted initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained.

[0092] In this embodiment, since the location information of the supply point, the location information of the receiving point, and the location information of the warehouse are all geographic coordinates in actual applications, in order to reduce the difficulty of designing the search operator for calculating the spherical distance, the geographic coordinates can be mapped to a plane coordinate system and the distance can be calculated using the Euclidean distance. By using the characteristics of the Euclidean distance, the efficient data structure KD tree is used to accelerate the matching decision between customers, upstream and facilities.

[0093] S203, determining the total transportation cost according to the coverage relationship and the supply relationship, where the total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point and the warehouse to be selected.

[0094] In some implementations, before step S203, the method may further include:

[0095] For each allocation result, the sub-transportation cost corresponding to the allocation result is calculated. The sub-transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected corresponding to the allocation result.

[0096] If the sub-transportation cost meets the target cost condition, the step of determining the total transportation cost according to the coverage relationship and the supply relationship is executed.

[0097] The target cost condition may be that the sub-transportation cost is less than or equal to the first cost threshold, or that the sub-transportation cost is the minimum transportation cost that can be allocated in the corresponding allocation result.

[0098] Taking the target cost condition that the sub-transportation cost is the minimum transportation cost that can be allocated in the corresponding allocation result as an example, if each warehouse to be located does not have a corresponding fence, then for each warehouse to be located, according to the receiving point location information of the receiving point and the supply point location information of the supply point in the allocation result corresponding to the warehouse to be located, the minimum transportation cost can be solved according to the Weiszfeld algorithm (an iterative algorithm for solving the weighted geometric median problem), and then the sub-transportation cost corresponding to the allocation result corresponding to the warehouse to be located is matched with the minimum transportation cost. If they match, it is determined that the sub-transportation cost meets the target cost condition.

[0099] If each warehouse to be located is set with a corresponding fence, then for each warehouse to be located, the minimum transportation cost can be solved according to the SLSQP algorithm (a numerical optimization method for solving nonlinear optimization problems) based on the receiving point location information of the receiving point and the supply point location information of the supply point in the allocation result corresponding to the warehouse to be located, and then the sub-transportation cost corresponding to the allocation result corresponding to the warehouse to be located is matched with the minimum transportation cost. If they match, it is determined that the sub-transportation cost meets the target cost condition.

[0100] In some embodiments, the method may further include:

[0101] First, if the sub-cost does not meet the target cost condition, or the total transportation cost does not meet the preset cost condition, the initial location information of the warehouse to be located corresponding to the allocation result is updated to obtain the updated location information.

[0102] Among them, the target cost condition can be that the total transportation cost is less than or equal to the second cost threshold, or that the total transportation cost is the minimum total transportation cost that can be allocated in the current warehouse network structure.

[0103] Then, based on the updated location information, return to execute based on the supply point location information, the receiving point location information, and the initial location information, and adopt the principle of nearest allocation to allocate the supply point and the receiving point to each warehouse to be located, and obtain the allocation result corresponding to each warehouse to be located; based on each allocation result, generate the steps of covering relationship and supply relationship until the sub-cost meets the target cost condition and the total transportation cost meets the preset cost condition.

[0104] It is understandable that after the initial location information is updated, it is necessary to re-adopt the principle of nearest allocation to generate new coverage relationships and supply relationships, and detect whether the sub-transportation cost corresponding to each allocation result under the new coverage relationship and supply relationship meets the target cost conditions. If so, it indicates that the transportation cost of each warehouse to be located in its corresponding allocation result has reached the optimal level. Thereafter, the current coverage relationship and supply relationship can continue to be used to calculate the total transportation cost. When the total transportation cost also meets the preset cost conditions, it indicates that the transportation cost of the warehouse network structure composed of multiple warehouses to be located has also reached the optimal level, so that the updated location information of each warehouse to be located can be output as the target location information.

[0105] In some implementations, in step S203, specific implementations of determining the total transportation cost according to the coverage relationship and the supply relationship may include:

[0106] 1. For each warehouse to be located, determine the target receiving point corresponding to the warehouse to be located based on the coverage relationship, and determine the target supply point corresponding to the warehouse to be located based on the supply relationship;

[0107] 2. Based on the initial location information of the warehouse to be sited and the location information of the target delivery point, a first distance between the warehouse to be sited and the target delivery point is calculated, and a first cost is calculated according to the first distance;

[0108] Exemplarily, the first cost may be calculated by the following formula:

[0109]

[0110] Where D1 is the first cost, N is the number of warehouses to be located, M is the number of receiving points, γ is the ton-kilometer cost from the warehouse to be located to the receiving point, p is the index of the warehouse to be located (which can be regarded as the pth warehouse to be located among N warehouses to be located), x p is the location information of the pth warehouse to be selected, i is the index of the receiving point (which can be regarded as the i-th receiving point among M receiving points), X i is the location information of the i-th receiving point. pi is the coverage relationship between the pth warehouse to be selected and the i-th receiving point (for example, whether the pth warehouse to be selected covers the i-th receiving point), S is the number of sku, s is the index of sku, Q is is the demand for the sth sku at the i-th receiving point.

[0111] SKU stands for Stock Keeping Unit, which is the basic unit used to distinguish and track goods in business and supply chain management. Each SKU represents a unique commodity or product variant and is usually used for inventory management and sales records. SKU numbers can help companies efficiently manage and track inventory, ensure that the right goods are delivered to the right location, and respond quickly to changes in market demand.

[0112] 3. Based on the initial location information of the warehouse to be selected and the location information of the target supply point, calculate the second distance between the warehouse to be selected and the target supply point, and calculate the second cost according to the second distance;

[0113] For example, the second cost can be calculated by the following formula:

[0114]

[0115] Where D2 is the second cost, U is the number of supply points, u is the index of the supply point (which can be regarded as the u-th supply point among U receiving points), X u is the location information of the u-th supply point, δ is the ton-kilometer cost from the supply point to the warehouse to be selected, β pus Indicates whether the sth sku of the pth warehouse to be located is supplied by the uth supply point.

[0116] 4. Based on the first cost and the second cost, determine the total transportation cost.

[0117] Continuing with the above example, the first cost and the second cost can be added together to obtain the total transportation cost.

[0118] In some embodiments, the supply point information includes supply goods information. Before step S203, the method may further include:

[0119] If it is determined according to the coverage relationship that each receiving point is covered by a warehouse to be selected, then according to the supply relationship and the supplied goods information, it is determined whether each type of stored goods in the warehouse to be selected is supplied by a supply point;

[0120] If each type of stored goods in the warehouse to be sited is supplied by one supply point, a step of determining the total transportation cost according to the coverage relationship and the supply relationship is performed.

[0121] In this embodiment, by setting constraints during transportation, it is constrained that each receiving point is covered by a warehouse to be selected, and whether each type of stored goods in the warehouse to be selected is supplied by a supply point, so as to effectively ensure the efficiency of transportation of goods between the warehouse to be selected, the receiving point, and the supply point.

[0122] S204: If the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected.

[0123] In some implementations, if the supply point location information, the receiving point location information, and the initial location information are converted from geographic coordinates to plane coordinates in step S2021, then the specific implementation of S204 may include:

[0124] If the total transportation cost meets the preset cost condition, the initial location information is converted from plane coordinates to geographic coordinates, and the converted initial location information is determined as the target location information of the warehouse to be selected.

[0125] In this embodiment, since the location information of the plane coordinate system of the warehouse to be sited cannot be intuitively displayed on a geographic map, it is necessary to use UTM projection reverse mapping to convert it into longitude and latitude coordinates to facilitate warehouse site selection for the target object.

[0126] In this embodiment, the warehouse site selection method of the above steps S201 to S204 can be applied to an actual facility site selection problem scenario for illustration. In this scenario, the warehouse to be sited can be represented by a facility, the receiving point can be represented by a customer, and the supply point can be represented by an upstream.

[0127] First, when the target object is selecting a facility site, the customer information, upstream information and site selection information can be input into the server. Optionally, the customer information can include the customer's latitude and longitude coordinates, the sku and quantity required by the customer, etc. The upstream information can include the upstream's latitude and longitude coordinates, the available sku, etc. The site selection information can include the number of facilities opened (i.e. the target number mentioned above), the ton-kilometer cost from the facility to the customer, and the ton-kilometer cost from the upstream to the facility.

[0128] Secondly, since the goal of site selection is to minimize transportation costs, the transportation cost is equal to the sum of the transportation distance from all upstream facilities to facilities and facilities to customers * cargo volume * ton-kilometer cost. The transportation distance is affected by the location of the facility. The non-fixed nature of the facility location makes it unrealistic to calculate the road network distance, so the spherical distance can be used instead. However, the calculation of the spherical distance generally uses the Haversine formula, which involves the angle-related sine and cosine calculations. The complexity is higher than that of the Euler formula, and it is not conducive to solving using nonlinear optimization algorithms such as convex optimization or approximate optimization. In order to simplify the calculation of distance using Euclidean distance, in this implementation, the universal transverse Mercator projection method can be used to project the longitude and latitude coordinates of the customer and the longitude and latitude coordinates of the upstream to the plane coordinate system. Although it will cause a certain distance error (the plane distance after projection is greater than the spherical distance), the algorithm optimization effect and performance improvement are considerable. In addition, there is a gap between the spherical distance and the road network distance itself, and the use of plane distance will not affect the site selection results in a macro sense. When using UTM projection, the longitude zone where the customer is located should be considered as the projection input to reduce deformation and thus reduce the loss of distance accuracy.

[0129] Then, after simplifying the location problem by the projection of the coordinate system, a location model can be established to minimize the network transportation cost, under the conditions that each customer is covered by only one facility, each sku of each facility is supplied by only one supplier, and the facility is within the feasible area, to decide the location of N facilities and the network flow. The location model can be shown as follows:

[0130]

[0131] Among them, the target transportation costs from facilities to customers; represents the transportation cost from upstream to the facility; constraint (1) is a simplification of the problem that each customer is covered by only one facility; constraint (2) stipulates that there can only be one supplier for each sku supply of each facility; constraint (3) requires that each facility must be located in any of the specified multiple regions. The meanings of the mathematical symbols involved in the above location model can be shown in Table 1:

[0132] Table 1

[0133]

[0134]

[0135] Next, after the site selection model is established, the site selection model can be solved. In the process of solving, in order to reduce the complexity of the model, the coverage relationship (α pi ) and supply relationship (β pus) decision, the coverage relationship between facilities and customers, and the supply relationship between upstream and facilities can be completely determined by the distance. Since the computational complexity of calculating the coverage relationship and the supply relationship is quadratic, it is known that the above model has M customers, N facilities, and U upstreams. The complexity of calculating the coverage relationship between all facilities and all customers is O(MN), and the complexity of calculating the supply relationship between all upstreams and all facilities is O(MU). If KD trees are constructed for the facility locations and upstream locations respectively, the complexity of calculating the coverage relationship is O((M+N)log(N)), and the complexity of calculating the supply relationship is O((N+U)log(U)), which can effectively reduce the complexity of judging the coverage relationship and the supply relationship.

[0136] In addition, in the process of solving the above-mentioned site selection model, a genetic algorithm can be used as the main framework of the solution model, the facility location is abstracted into a real number code, and a tournament selection operator, SBX simulated binary crossover operator, and PM polynomial mutation operator are used. In order to adapt to the site selection problem, the present invention proposes a hybrid search operator based on multi-center search in the decoding step.

[0137] Specifically, the initial position information of the target number of facilities can be customized, and then the initial positions of the facilities in the plane coordinates (x-axis and y-axis) can be used as chromosomes using real number coding, that is, the chromosome length is 2N, thereby realizing the encoding of the genetic algorithm.

[0138] Then, the decoding process of the genetic algorithm is executed, that is, the process of solving the above-mentioned site selection model. Figure 3 As shown, the chromosomes are converted into the coordinates of the facilities (x1, y1), (x2, y2), (x3, y3), and the customers and upstreams of each facility are assigned using the KD tree according to the nearest allocation rule, so that the one-to-many coverage relationship α between the facility and the customer and the many-to-one supply relationship β between the upstream and the facility can be determined. Figure 3 It can be seen that after the nearest allocation, the customer who is closer to facility 1 will be marked with "1" to indicate that the customer is covered by facility 1. Similarly, the coverage relationship between facility 2 and facility 3 can also be marked in the same way.

[0139] Among them, consider that the customer is only covered by one facility. After near allocation processing, the facilities and customers can be divided into N independent groups (i.e. the above allocation results), where each group includes a facility and several customers and upstream. Then, for each group, the group can be considered as a single facility location problem. Among them, the single facility location can be solved by the Weiszfeld algorithm first. If the location result is within any fence, the single facility location is completed. Otherwise, the SLSQP algorithm is used in each fence to solve the solution with the lowest cost as the single facility location result. Figure 4As shown, after the single facility site selection for each group, the position of each facility will be updated. For example, after the single facility site selection update of facility 1, its position moves from the X-axis to the bottom of the X-axis.

[0140] like Figure 5 As shown in the figure, after the single facility site selection, the facility location has changed. At this time, the existing coverage and supply relationship may not be optimal. Therefore, the idea of ​​the multi-center search algorithm can be used to update the coverage and supply relationship, and the single facility problem can be solved again. Then, according to the updated location information obtained by resolving the single facility problem, the nearest allocation is continued to update the coverage relationship and supply relationship. The nearest allocation and single facility site selection are repeated until the total transportation cost converges. Among them, t is the number of rounds of one nearest allocation and one single facility site selection. It can be seen that when the nearest allocation and single facility site selection are executed alternately, the coverage relationship and the location of the facility are constantly updated.

[0141] The above series of operations can be collectively referred to as chromosome decoding, such as Figure 6 As shown, in order to improve the convergence efficiency of individuals, the chromosome can be updated using the inverse coding of the facility location obtained through the multi-center search, so as to obtain the location information of each facility, that is, the location information of the facility in the plane coordinate system obtained by solving the site selection model.

[0142] Finally, since the location information of the facility's plane coordinate system cannot be intuitively displayed on the map, it is necessary to use UTM projection reverse mapping to convert it into longitude and latitude coordinates, and use the converted longitude and latitude coordinates as the target location information of the facility.

[0143] It can be seen that in this embodiment, the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected are obtained; secondly, the coverage relationship and the supply relationship are determined according to the initial location information, the supply point information, and the receiving point information; wherein the coverage relationship represents the coverage of the warehouse to be selected for the receiving point, and the supply relationship represents the supply of the supply point to the warehouse to be selected; then, according to the coverage relationship and the supply relationship, the total transportation cost is determined, and the total transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected; if the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected. In this way, when selecting multiple warehouses to be located, the coverage relationship and supply relationship between multiple warehouses to be located, the receiving point and the supply point can be allocated according to the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be located, so as to eliminate the conflicts and influences between multiple warehouses to be located in the entire warehouse network structure through reasonable coverage relationship and supply relationship, and then determine the total transportation cost according to the coverage relationship and supply relationship, so as to accurately control the transportation cost of the warehouse network structure after the location selection, and ensure the accuracy of the location selection. In addition, a hybrid optimization location selection algorithm based on multi-center search is proposed for genetic algorithm decoding to improve the search efficiency of the location selection results; in addition, the KD tree is used to obtain the coverage and supply relationship of the facilities with a computational complexity of O(nlog(n)), which can reduce a lot of computing time when solving the location selection model. In addition, there is no need to select the location of alternative facilities in an open manner, and compared with entering alternative facilities, a better solution can be searched in a larger solution space. In addition, by transforming the spherical coordinate system into a plane coordinate system through projection to create a site selection model, the efficiency of solving the model can be greatly improved. In summary, the warehouse site selection method of this embodiment can not only ensure the accuracy of site selection, but also greatly improve the efficiency of site selection.

[0144] Based on the same inventive concept, the embodiment of the present application also provides a warehouse site selection device. Figure 7 As shown, it is a schematic diagram of the structure of the warehouse site selection device 700, which may include:

[0145] An acquisition module 701 is used to acquire the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected;

[0146] The relationship determination module 702 is further used to determine the coverage relationship and the supply relationship according to the initial location information, the supply point information, and the receiving point information; the coverage relationship represents the coverage of the receiving point by the warehouse to be selected, and the supply relationship represents the supply of the supply point to the warehouse to be selected;

[0147] The cost determination module 703 is used to determine the total transportation cost according to the coverage relationship and the supply relationship, where the total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point and the warehouse to be selected;

[0148] The location determination module 704 is used to determine the initial location information as the target location information of the warehouse to be selected if the total transportation cost meets the preset cost condition.

[0149] In a possible embodiment, the supply point information includes supply point location information, the receiving point information includes receiving point location information, and the relationship determination module 702 is further configured to:

[0150] Based on the supply point location information, the receiving point location information, and the initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained, and the allocation result includes the supply point and the receiving point to which the warehouse to be located is allocated;

[0151] Based on each allocation result, a covering relationship and a supplying relationship are generated.

[0152] In a possible embodiment, the device further includes:

[0153] A cost calculation module is used to calculate the sub-transportation cost corresponding to each allocation result, where the sub-transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected corresponding to the allocation result;

[0154] The first execution module is used to execute the step of determining the total transportation cost according to the coverage relationship and the supply relationship if the sub-transportation cost meets the target cost condition.

[0155] In a possible embodiment, the device further includes:

[0156] An updating module, used for updating the initial location information of the warehouse to be located corresponding to the allocation result to obtain updated location information if the sub-cost does not meet the target cost condition or the total transportation cost does not meet the preset cost condition;

[0157] The second execution module is used to return to execute based on the updated location information, based on the supply point location information, the receiving point location information, and the initial location information, and adopt the principle of nearest allocation to allocate the supply point and the receiving point to each warehouse to be located, so as to obtain the allocation result corresponding to each warehouse to be located; based on each allocation result, generate the steps of covering relationship and supply relationship until the sub-cost meets the target cost condition and the total transportation cost meets the preset cost condition.

[0158] In a possible embodiment, the relationship determination module 702 is further configured to:

[0159] Construct a KD tree corresponding to the warehouse to be located based on the initial location information to obtain a first KD tree;

[0160] Construct a KD tree corresponding to the supply point based on the supply point location information to obtain a second KD tree;

[0161] Construct a KD tree corresponding to the delivery point based on the delivery point location information to obtain a third KD tree;

[0162] According to the first KD tree and the second KD tree, the supply point is allocated to the warehouse to be located by adopting the principle of nearest allocation;

[0163] According to the first KD tree and the third KD tree, the principle of nearest allocation is adopted to allocate receiving points to the warehouse to be located.

[0164] In a possible embodiment, the relationship determination module 702 is further configured to:

[0165] Convert the supply point location information, the receiving point location information, and the initial location information from geographic coordinates to plane coordinates to obtain converted supply point location information, converted receiving point location information, and converted initial location information;

[0166] Based on the converted supply point location information, the converted receiving point location information, and the converted initial location information, the supply point and the receiving point are allocated to each warehouse to be located using the principle of nearest allocation, and the allocation result corresponding to each warehouse to be located is obtained;

[0167] The location determination module 704 is also used for: if the total transportation cost meets the preset cost condition, the initial location information is converted from plane coordinates to geographic coordinates, and the converted initial location information is determined as the target location information of the warehouse to be selected.

[0168] In a possible embodiment, the supply point information includes supply point location information, the receiving point information includes receiving point location information, and the cost determination module 703 is further used to:

[0169] For each warehouse to be located, determine the target receiving point corresponding to the warehouse to be located based on the coverage relationship, and determine the target supply point corresponding to the warehouse to be located based on the supply relationship;

[0170] Based on the initial location information of the warehouse to be selected and the location information of the target receiving point, a first distance between the warehouse to be selected and the target receiving point is calculated, and a first cost is calculated according to the first distance;

[0171] Based on the initial location information of the warehouse to be selected and the supply point location information of the target supply point, a second distance between the warehouse to be selected and the target supply point is calculated, and a second cost is calculated according to the second distance;

[0172] Based on the first cost and the second cost, a total transportation cost is determined.

[0173] In a possible embodiment, the supply point information includes supply goods information, and the device further includes:

[0174] The third execution module is used to determine whether each type of stored goods in the warehouse to be selected is supplied by one supply point based on the supply relationship and the supply goods information if it is determined that each receiving point is covered by one warehouse to be selected based on the coverage relationship; if each type of stored goods in the warehouse to be selected is supplied by one supply point, the step of determining the total transportation cost based on the coverage relationship and the supply relationship is executed.

[0175] The warehouse site selection device provided in the embodiment of the present application can determine the coverage relationship and the supply relationship based on the initial location information, the supply point information, and the receiving point information after the server obtains the supply point information of the supply point, the receiving point information, and the initial location information of multiple warehouses to be selected. The coverage relationship represents the coverage of the receiving point by the warehouse to be selected, and the supply relationship represents the supply of the supply point to the warehouse to be selected. Then, the total transportation cost is determined based on the coverage relationship and the supply relationship, and the total transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point and the warehouse to be selected. If the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected. In this way, when selecting sites for multiple warehouses to be located, the coverage relationship and supply relationship between multiple warehouses to be located, receiving points and supply points can be allocated according to the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be located, so as to eliminate the conflicts and influences between multiple warehouses to be located in the entire warehouse network structure through reasonable coverage relationship and supply relationship, and then determine the total transportation cost according to the coverage relationship and supply relationship, so as to accurately control the transportation cost of the warehouse network structure after site selection and ensure the accuracy of site selection.

[0176] In some possible implementations, the warehouse site selection device according to the present application may include at least a processor and a memory. The memory stores program code, and when the program code is executed by the processor, the processor executes the steps of the warehouse site selection method according to various exemplary embodiments of the present application described in this specification. For example, the processor may execute the following steps: Figure 2 Follow the steps shown in .

[0177] Based on the same inventive concept, an electronic device is also provided in the embodiment of the present application, and the electronic device can realize the functions of the aforementioned warehouse site selection method device, referring to Figure 8 , the electronic device comprises:

[0178] At least one processor 801, and a memory 802 connected to the at least one processor 801. The specific connection medium between the processor 801 and the memory 802 is not limited in the embodiment of the present application. Figure 8 In the example, the processor 801 and the memory 802 are connected via a bus 800. Figure 8 The connections between other components are shown in bold lines, and are not intended to be limiting. The bus 800 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, Figure 8 Only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus. Alternatively, the processor 801 can also be called a controller, and there is no limitation on the name.

[0179] In the embodiment of the present application, the memory 802 stores instructions that can be executed by at least one processor 801. The at least one processor 801 can execute the warehouse location selection method discussed above by executing the instructions stored in the memory 802. The processor 801 can implement Figure 7 The functions of each module in the device shown.

[0180] Among them, the processor 801 is the control center of the device, and can use various interfaces and lines to connect the various parts of the entire control device. By running or executing instructions stored in the memory 802 and calling the data stored in the memory 802, the various functions of the device and process data, the device can be monitored as a whole.

[0181] In one possible design, the processor 801 may include one or more processing units, and the processor 801 may integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the modem processor may not be integrated into the processor 801. In some embodiments, the processor 801 and the memory 802 may be implemented on the same chip, and in some embodiments, they may also be implemented separately on separate chips.

[0182] Processor 801 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor can be a microprocessor or any conventional processor, etc. The steps of the warehouse site selection method disclosed in the embodiments of the present application can be directly embodied as a hardware processor to be executed, or a combination of hardware and software modules in the processor can be executed.

[0183] The memory 802 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 802 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 802 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 802 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0184] By programming the processor 801, the code corresponding to the warehouse location selection method described in the above embodiment can be fixed into the chip, so that the chip can execute the code when running. Figure 2 The steps of the warehouse site selection method of the embodiment shown are as follows: How to design and program the processor 801 is a technique known to those skilled in the art and will not be described in detail here.

[0185] Based on the same inventive concept, an embodiment of the present application also provides a storage medium, which stores computer instructions. When the computer instructions are executed on a computer, the computer executes the warehouse site selection method discussed above.

[0186] In some possible implementations, various aspects of the warehouse site selection method provided in the present application may also be implemented in the form of a program product, which includes program code. When the program product is run on an apparatus, the program code is used to enable the control device to execute the steps of the warehouse site selection method according to various exemplary embodiments of the present application described above in this specification.

[0187] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0188] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0189] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0190] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0191] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A warehouse site selection method, characterized in that: include: Obtaining the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected; Determining a coverage relationship and a supply relationship according to the initial location information, the supply point information, and the receiving point information; The coverage relationship represents the coverage of the warehouse to be located to the receiving point, and the supply relationship represents the supply of the supply point to the warehouse to be located; Determine the total transportation cost according to the coverage relationship and the supply relationship, wherein the total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point, and the warehouse to be selected; If the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected.

2. The method according to claim 1, characterized in that: The supply point information includes supply point location information, the receiving point information includes receiving point location information, and determining the coverage relationship and the supply relationship according to the initial location information, the supply point information, and the receiving point information includes: Based on the supply point location information, the receiving point location information, and the initial location information, a supply point and a receiving point are allocated to each of the warehouses to be located by adopting the principle of nearest allocation, and an allocation result corresponding to each of the warehouses to be located is obtained, wherein the allocation result includes the supply point and the receiving point to which the warehouses to be located are allocated; Based on each of the allocation results, the coverage relationship and the supply relationship are generated.

3. The method according to claim 2, characterized in that: Before determining the total transportation cost according to the coverage relationship and the supply relationship, the method further includes: For each of the allocation results, calculating a sub-transportation cost corresponding to the allocation result, wherein the sub-transportation cost represents the cost incurred when transporting goods between the supply point, the receiving point, and the warehouse to be selected corresponding to the allocation result; If the sub-transportation cost meets the target cost condition, the step of determining the total transportation cost according to the coverage relationship and the supply relationship is performed.

4. The method according to claim 3, characterized in that: The method further comprises: If the sub-cost does not meet the target cost condition, or the total transportation cost does not meet the preset cost condition, the initial location information of the warehouse to be selected corresponding to the allocation result is updated to obtain updated location information; Based on the updated location information, return to execute the steps of allocating supply points and receiving points to each of the warehouses to be located based on the supply point location information, the receiving point location information, and the initial location information, using the principle of nearest allocation to obtain an allocation result corresponding to each of the warehouses to be located; based on each of the allocation results, generate the steps of the covering relationship and the supply relationship until the sub-cost meets the target cost condition and the total transportation cost meets the preset cost condition.

5. The method according to claim 2, characterized in that: The allocating a supply point and a receiving point to each of the warehouses to be selected based on the supply point location information, the receiving point location information, and the initial location information by using the principle of nearest allocation includes: Construct a KD tree corresponding to the warehouse to be located based on the initial location information to obtain a first KD tree; Construct a KD tree corresponding to the supply point based on the supply point location information to obtain a second KD tree; Construct a KD tree corresponding to the receiving point based on the receiving point location information to obtain a third KD tree; Allocating a supply point for the warehouse to be selected based on the first KD tree and the second KD tree using the principle of nearest allocation; According to the first KD tree and the third KD tree, a receiving point is allocated to the warehouse to be located by adopting the principle of nearest allocation.

6. The method according to claim 2, characterized in that: The method of allocating a supply point and a receiving point to each warehouse to be located based on the supply point location information, the receiving point location information, and the initial location information using the principle of nearest allocation, and obtaining an allocation result corresponding to each warehouse to be located, includes: Convert the supply point location information, the receiving point location information, and the initial location information from geographic coordinates to plane coordinates to obtain converted supply point location information, converted receiving point location information, and converted initial location information; Based on the converted supply point location information, the converted receiving point location information, and the converted initial location information, a supply point and a receiving point are allocated to each of the warehouses to be located using the principle of nearest allocation, to obtain an allocation result corresponding to each of the warehouses to be located; If the total transportation cost meets the preset cost condition, the initial location information is determined as the target location information of the warehouse to be selected, including: If the total transportation cost meets the preset cost condition, the initial location information is converted from plane coordinates to geographic coordinates, and the converted initial location information is determined as the target location information of the warehouse to be selected.

7. The method according to any one of claims 1 to 6, characterized in that: The supply point information includes supply point location information, the receiving point information includes receiving point location information, and the determining the total transportation cost according to the coverage relationship and the supply relationship includes: For each of the warehouses to be located, determine the target receiving point corresponding to the warehouse to be located according to the coverage relationship, and determine the target supply point corresponding to the warehouse to be located according to the supply relationship; Based on the initial location information of the warehouse to be selected and the location information of the target receiving point, a first distance between the warehouse to be selected and the target receiving point is calculated, and a first cost is calculated according to the first distance; Based on the initial location information of the warehouse to be selected and the supply point location information of the target supply point, a second distance between the warehouse to be selected and the target supply point is calculated, and a second cost is calculated according to the second distance; The total transportation cost is determined based on the first cost and the second cost.

8. The method according to any one of claims 1 to 6, characterized in that: The supply point information includes supply goods information. Before determining the total transportation cost according to the coverage relationship and the supply relationship, the method further includes: If it is determined according to the coverage relationship that each of the receiving points is covered by one of the warehouses to be selected, then it is determined according to the supply relationship and the supplied goods information whether each type of stored goods in the warehouse to be selected is supplied by one of the supply points; If each type of stored goods in the warehouse to be selected is supplied by one of the supply points, the step of determining the total transportation cost based on the coverage relationship and the supply relationship is performed.

9. A warehouse site selection device, characterized in that: include: An acquisition module, used to acquire the supply point information of the supply point, the receiving point information of the receiving point, and the initial location information of multiple warehouses to be selected; The relationship determination module is further used to determine a coverage relationship and a supply relationship according to the initial location information, the supply point information, and the receiving point information; the coverage relationship represents the coverage of the warehouse to be selected for the receiving point, and the supply relationship represents the supply of the supply point to the warehouse to be selected for the location; A cost determination module, used to determine the total transportation cost according to the coverage relationship and the supply relationship, wherein the total transportation cost represents the cost incurred when the goods are transported between the supply point, the receiving point and the warehouse to be selected; The location determination module is used to determine the initial location information as the target location information of the warehouse to be selected if the total transportation cost meets a preset cost condition.

10. An electronic device, characterized in that: The device comprises a processor and a memory, wherein the memory stores program codes, and when the program codes are executed by the processor, the processor executes any one of the methods in claims 1 to 8.

11. A computer-readable storage medium, characterized in that: The storage medium comprises a program code, and when the storage medium is run on an electronic device, the program code is used to enable the electronic device to execute any one of the methods of claims 1 to 8.

Images