Logistics transfer node site selection method and apparatus, and electronic device

Abstract

The embodiment of the invention provides a site selection method for logistics transfer nodes. Obtaining task processing data of the plurality of to-be-selected logistics addresses in the historical duration; updating a to-be-selected logistics address according to a target execution address in the task processing data, and determining at least one logistics address group according to the updated to-be-selected logistics address; for a to-be-selected logistics address in the at least one logistics address group, determining a target cost corresponding to the to-be-selected logistics address according to task processing data, a cost control function and a target constraint condition of the to-be-selected logistics address; and determining a target logistics address according to the at least one target cost corresponding to the at least one logistics address group. According to the technical scheme provided by the embodiment of the invention, the logistics address group is determined according to the updated to-be-selected logistics address, then the target cost corresponding to the logistics address group is determined, and finally the target logistics address is determined, so that reasonable node layout can be performed on logistics transfer nodes, the operation efficiency is improved, and the cost is reduced.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the field of logistics, and in particular to a method, device and electronic equipment for selecting a site for a logistics transfer node. Background Art

[0002] In the modern logistics system, in order to deliver express to various areas, many network levels are set up. Different network levels correspond to different sizes of areas. The network level can be understood as a tree-like structure. For each network node in each level, a corresponding address must be selected.

[0003] Traditional site selection and layout methods mostly select sites for single-type nodes, such as traditional P-median, K-Means and other clustering methods. In the face of complex scenarios with multiple network levels, multiple planning elements, and multiple product types, there are defects such as low performance, insufficient adaptability, and complex modeling. In the face of the above scenarios, it is difficult to effectively handle the complex data relationships brought about by multiple network levels, and it is impossible to flexibly optimize and adjust according to the characteristics of different levels.

[0004] In addition, traditional site selection algorithms cannot achieve coordinated planning of nodes and routes. In actual complex network systems such as logistics and transportation, nodes and routes are interdependent and influence each other. Traditional algorithms lack the evaluation of the operating efficiency of the entire transportation network after site selection and layout, which makes it difficult to implement planning results. Summary of the invention

[0005] The embodiments of the present disclosure provide a method, device and electronic device for selecting a site for a logistics transfer node. According to an updated logistics address to be selected, a logistics address group is determined, and then a target cost corresponding to the logistics address group is determined. Finally, a target logistics address is determined. This can reasonably layout the logistics transfer nodes, improve operational efficiency and reduce costs.

[0006] In a first aspect, an embodiment of the present disclosure provides a method for selecting a location of a logistics transfer node, the method comprising:

[0007] Acquire task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for the logistics addresses to be selected to execute corresponding tasks;

[0008] updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group according to the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected;

[0009] For a logistics address to be selected in the at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to the task processing data, the cost control function and the target constraint condition of the logistics address to be selected;

[0010] A target logistics address is determined according to at least one target cost corresponding to the at least one logistics address group, wherein the target logistics address is a logistics address among the at least one logistics address to be selected.

[0011] In a second aspect, an embodiment of the present invention further provides a site selection device for a logistics transfer node, the device comprising:

[0012] A task processing data acquisition module is used to acquire task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for the logistics address to be selected to execute a corresponding task;

[0013] A logistics address group determination module, used to update the logistics address to be selected according to the target execution address in the task processing data, and determine at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected;

[0014] A target cost determination module, for determining, for a logistics address to be selected in the at least one logistics address group, a target cost corresponding to the logistics address to be selected according to the task processing data, the cost control function and the target constraint condition of the logistics address to be selected;

[0015] The target logistics address determination module is used to determine the target logistics address according to at least one target cost corresponding to the at least one logistics address group, wherein the target logistics address is a logistics address among the at least one logistics address to be selected.

[0016] In a third aspect, an embodiment of the present invention further provides an electronic device, the electronic device comprising:

[0017] one or more processors;

[0018] a storage device for storing one or more programs,

[0019] When the one or more programs are executed by the one or more processors, the one or more processors implement the method for selecting a logistics transfer node as described in any one of the embodiments of the present invention.

[0020] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to execute a method for selecting a logistics transfer node as described in any one of the embodiments of the present invention.

[0021] The technical solution of the embodiment of the present disclosure obtains task processing data of multiple logistics addresses to be selected within a historical period, wherein the task processing data at least includes a target execution address for the logistics address to be selected to execute the corresponding task, and then updates the logistics address to be selected according to the target execution address in the task processing data, and determines at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected, and further, for the logistics address to be selected in at least one logistics address group, determines the target cost corresponding to the logistics address to be selected according to the task processing data of the logistics address to be selected, the cost control function and the target constraint condition, and finally determines the target logistics address according to at least one target cost corresponding to at least one logistics address group, wherein the target logistics address is a logistics address in at least one logistics address to be selected, so as to reasonably layout the logistics transit nodes, improve the operation efficiency and reduce the cost. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale.

[0023] Figure 1 It is a flow chart of a method for selecting a location of a logistics transfer node provided by an embodiment of the present disclosure;

[0024] Figure 2 It is a flow chart of a method for selecting a location of a logistics transfer node provided by an embodiment of the present disclosure;

[0025] Figure 3 It is a flow chart of a method for selecting a location of a logistics transfer node provided by an embodiment of the present disclosure;

[0026] Figure 4 It is a schematic diagram of a method for selecting a location of a logistics transfer node provided by an embodiment of the present disclosure;

[0027] Figure 5 A schematic diagram of the structure of a site selection device for a logistics transfer node provided by an embodiment of the present invention;

[0028] Figure 6 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0029] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0030] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0031] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0032] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0033] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0034] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.

[0035] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0036] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet the relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0037] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.

[0038] Before introducing the embodiments of the present disclosure, an exemplary description of the application scenarios of the embodiments of the present disclosure can be given. The technical solution can be applied to the site selection and determination of target logistics transfer nodes corresponding to different levels. According to the updated logistics address to be selected, the logistics address group is determined, and then the target cost corresponding to the logistics address group is determined, and finally the target logistics address is determined, so that a reasonable node layout of the logistics transfer nodes can be carried out, which improves operational efficiency and reduces costs.

[0039] Embodiment 1

[0040] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

[0041] Figure 1 It is a flow chart of a method for site selection of a logistics transfer node provided in an embodiment of the present disclosure. The embodiment of the present disclosure is applicable to situations in which the site selection of a logistics transfer node is determined. The method can be executed by a site selection device for a logistics transfer node. The device can be implemented in the form of software and / or hardware. The hardware can be an electronic device such as a server. The electronic device can execute the method for site selection of a logistics transfer node provided in the present technical solution.

[0042] like Figure 1 As shown, the method includes:

[0043] S110, obtaining task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for executing a corresponding task at the logistics address to be selected;

[0044] Among them, the logistics address to be selected can be determined based on the historical logistics address. For example, we can take all the historical logistics addresses as the logistics addresses to be selected. Exemplarily, for the site selection layout of the terminal collection and delivery node, the currently existing terminal collection and delivery node can be used as the logistics address to be selected for the terminal collection and delivery node; for the site selection layout of the small collection node, all districts and counties can be used as the logistics address to be selected; for the site selection layout of the medium-sized transit node, all small collection nodes can be used as the logistics address to be selected; for the site selection layout of the first-level hub center, all medium-sized transit nodes can be used as the logistics address to be selected.

[0045] Among them, historical duration mainly refers to a period of time within a certain historical time range, for example, last year's Double Eleven or 618 period.

[0046] The task processing data refers to the historical data of all tasks executed by all logistics addresses to be selected within the historical time period. In this embodiment, the task processing data at least includes the target execution address of the logistics address to be selected to execute the corresponding task.

[0047] The target execution address refers to the next-level address or the target customer address of the logistics address to be selected. For example, during the Double 11 period last year, a logistics address to be selected had many execution addresses for tasks executed by Company A, so Company A is the target execution address for the logistics address to be selected to execute the corresponding tasks.

[0048] In this embodiment, the task processing data includes the task quantity, task type and task size of at least one task to be executed corresponding to the logistics address to be selected.

[0049] The number of tasks, measured in days, refers to the average number of all tasks performed by the logistics address to be selected during the off-season or peak season in historical time.

[0050] Among them, the task type of the tasks to be executed refers to all types of tasks to be executed at the selected logistics address within the historical time, such as fresh food, toys, clothes, maternal and child products, etc.

[0051] The task size refers to the length, width, height, etc. of all tasks to be executed. For example, a task to be executed is a refrigerator, and its size is 2m*1m*1m.

[0052] Specifically, for the off-season or the peak seasons such as 618 and Double 11, the task processing data of all logistics addresses last year are obtained. The task processing data includes: the number of tasks executed by all logistics addresses, the task type of the tasks executed, the task size data of the tasks executed, and the next-level execution address or customer address of the tasks executed by the logistics address. After obtaining the task processing data of the off-season and peak season, subsequent analysis is performed.

[0053] S120, updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group according to the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected;

[0054] It should be noted that the target execution address can be used as the logistics address to be selected. For example, for the location layout of a terminal pickup and delivery node, if last year's task processing data shows that the mail volume of company A within its coverage area accounts for a high proportion, company A can be used as the logistics address to be selected for the terminal pickup and delivery node.

[0055] It should also be noted that for a certain area, the logistics address to be selected is updated according to the target execution address in the task processing data. For example, for area A, there were 10 terminal collection and delivery nodes that existed last year. According to the target execution address in the task processing data, 5 new logistics addresses to be selected as logistics addresses are determined, and these 15 addresses are the updated logistics addresses to be selected.

[0056] Among them, the logistics address group refers to the combination of all logistics addresses of the same level that meet the specified number set in the area. For example, there are 15 addresses as updated logistics addresses to be selected. Assuming that the number of logistics addresses planned in this area is 5-7, then the combination of all 5 logistics addresses to be selected, 6 logistics addresses to be selected, and 7 logistics addresses to be selected selected from the 15 logistics addresses to be selected is the logistics address group. In addition, the logistics address group includes at least one logistics address to be selected, that is, there is no situation where there is no logistics address in this area.

[0057] Specifically, after obtaining the target execution address data according to the task processing data, the target execution address can be added to the original logistics address to be selected as the logistics address to be selected. For the updated logistics address to be selected, the logistics addresses to be selected are combined and selected according to the planned number of target logistics addresses, that is, the planned number of logistics addresses are selected from the updated logistics addresses to be selected. Each group of selected logistics addresses is called a logistics address group.

[0058] For example, after obtaining the target execution address data based on the task processing data during the peak seasons such as 618 and Double Eleven last year, the three target execution addresses of Company 1, Company 2 and Company 3 are added to the original ten logistics addresses to be selected as logistics addresses to be selected. At this time, the updated logistics addresses to be selected are thirteen. If it is planned to set up eight logistics addresses in this area, then any eight of the thirteen logistics addresses to be selected can be used as the logistics address group.

[0059] S130, for a logistics address to be selected in at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to task processing data, a cost control function and a target constraint condition of the logistics address to be selected;

[0060] Among them, for each logistics address to be selected, the cost control function refers to the sum of all distribution costs of the logistics address to be selected and the construction cost of the logistics address.

[0061] In this embodiment, the cost control function includes a distribution cost sub-function and a construction cost sub-function. The distribution cost sub-function is determined based on the task type, task size and the number of tasks to be distributed corresponding to the task type; the construction cost sub-function is determined based on the construction scale and / or construction location corresponding to the logistics address to be selected.

[0062] The delivery cost sub-function is determined based on the task type, task size, and the number of tasks to be delivered corresponding to the task type. Different task types have different delivery costs, and the delivery cost is positively correlated with the task size and the number of tasks to be delivered.

[0063] The construction cost sub-function is determined based on the construction scale and / or construction location corresponding to the selected logistics address. The larger the construction scale, the higher the construction cost of the logistics address; the land transfer price and labor cost of the construction location are closely related to the construction cost.

[0064] Specifically, the formula is: min(∑ k∈K ∑ j∈J R k k j +∑ j∈J B j k j ),j∈J,k∈K. Among them, R k represents the lowest cost standard for different types of products, and k represents different types of products. j =1 means the logistics address to be selected is selected. B jrepresents the maximum construction cost of the logistics address to be selected, and j represents a logistics address to be selected. Based on the task type, task size, and the number of tasks to be delivered corresponding to the task type, the minimum delivery cost of the logistics address to be selected is calculated; based on the construction scale and / or construction location, the maximum construction cost of the logistics address is determined. The delivery cost and the construction cost are taken as the total cost of the logistics address.

[0065] Among them, the constraints determined based on the maximum / minimum business scale of the logistics address to be selected, the maximum / minimum number of next-level nodes or customers covered, the maximum service radius, the time limit level of different types of products, and the cost level of different types of products are the target constraints.

[0066] Optionally, the target constraint conditions include at least one of the following: the distance from the logistics address to be selected to at least one covered address to be delivered is less than a preset distance threshold; the number of tasks carried by the logistics address to be selected is within a preset task number range; the number of addresses to be delivered associated with the logistics address to be selected is within a preset address number range; the number of logistics addresses to be selected associated with the address to be delivered is a preset associated number.

[0067] It should be noted that the distance from the logistics address to be selected to at least one of the covered delivery addresses is less than the preset distance threshold. The formula is: k j =1 represents that the logistics address to be selected is selected, and j represents a logistics address to be selected. ij Indicates the distance between the logistics address to be selected and the logistics address of the next level or the customer, that is, the distance between the logistics address to be selected and the delivery location. ij =1 indicates that the logistics address to be selected serves the next level of logistics address or customer. l Represents the development coefficient of different regions, where l represents the region where a logistics address to be selected is located, and the development coefficient is closely related to the region. j The maximum service range of the logistics address to be selected. For all the covered addresses to be delivered, the sum of all distances between the logistics addresses in the logistics address group and the delivery locations is less than the preset distance threshold, which is the product of the development coefficient and the maximum service range of the logistics address to be selected.

[0068] It should be noted that the number of tasks carried by the logistics address to be selected is within the preset task number range. The formula is: Indicates the minimum business scale of the logistics address to be selected, which is set manually. Indicates the maximum business scale of the logistics address to be selected, which is set manually. iRepresents the historical average number of tasks for each logistics address to be selected. For all the covered delivery addresses, the historical average number of tasks for each logistics address to be selected in the logistics address group is less than the preset maximum business scale of the logistics address to be selected, and greater than the preset maximum business scale of the logistics address to be selected.

[0069] It should be noted that the number of addresses to be delivered associated with the logistics address to be selected is within the preset address quantity range. The formula is: Represents the minimum number of delivery locations to be covered. Represents the maximum number of delivery locations covered. For all the delivery addresses covered, the number of delivery addresses for each logistics address to be selected in the logistics address group is less than the preset maximum number of delivery locations covered by the logistics address to be selected, and greater than the preset minimum number of delivery locations covered by the logistics address to be selected.

[0070] It should be noted that the number of logistics addresses to be selected associated with the delivery address is the preset associated number. The formula is: For a logistics address group, the relationship between the logistics addresses to be selected and the addresses to be delivered is that each address to be delivered has a corresponding logistics address to be selected.

[0071] Among them, the target cost refers to the minimum value of the cost control function corresponding to the logistics address to be selected, which is determined based on the target constraint condition and the number of logistics address groups of the logistics address to be selected.

[0072] Specifically, based on data such as the product business volume, geographical information, and site conditions of the logistics address to be selected, the constraints determined according to the maximum / minimum business scale of the logistics address to be selected, the maximum / minimum number of next-level nodes or customers covered, the maximum service radius, the time limit level of different types of products, and the cost level of different types of products are used as target constraints, and the sum of the target costs corresponding to all the logistics addresses to be selected in each logistics address group is calculated.

[0073] S140. Determine a target logistics address based on at least one target cost corresponding to at least one logistics address group, wherein the target logistics address is a logistics address among at least one logistics address to be selected.

[0074] Among them, for the logistics address group with the lowest target cost, the logistics address therein is the target logistics address. And the target logistics address is a logistics address among at least one logistics address to be selected.

[0075] Optionally, for at least one logistics address group, the total cost of the logistics address group is obtained by accumulating the target costs corresponding to each logistics address to be selected in the logistics address group; the logistics address group with the smallest total cost is taken as the target logistics address group, and the address to be selected in the target logistics address group is taken as the target logistics address.

[0076] Specifically, for all logistics address groups, a specified number of logistics addresses to be selected are included. For the logistics addresses to be selected in all logistics address groups, the target cost of the logistics addresses to be selected is determined according to the task processing data, cost control function and target constraint conditions of the logistics addresses to be selected. The total cost is obtained by summing up the target costs of the logistics addresses to be selected in the logistics address groups. The total costs of all logistics address groups are compared, and the logistics address group with the smallest total cost is taken as the target logistics address group, and the addresses to be selected in the target logistics address group are taken as the target logistics addresses, so as to obtain the target logistics addresses.

[0077] The technical solution of the embodiment of the present disclosure obtains task processing data of multiple logistics addresses to be selected within a historical period, wherein the task processing data at least includes a target execution address for the logistics address to be selected to execute the corresponding task, and then updates the logistics address to be selected according to the target execution address in the task processing data, and determines at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected, and further, for the logistics address to be selected in at least one logistics address group, determines the target cost corresponding to the logistics address to be selected according to the task processing data of the logistics address to be selected, the cost control function and the target constraint condition, and finally determines the target logistics address according to at least one target cost corresponding to at least one logistics address group, wherein the target logistics address is a logistics address in at least one logistics address to be selected, so as to reasonably layout the logistics transit nodes, improve the operation efficiency and reduce the cost.

[0078] Embodiment 2

[0079] Figure 2 The present invention provides a flow chart of a method for selecting a location of a logistics transfer node. Based on the above embodiment, the specific implementation of S120 is described in detail. The specific implementation method can refer to the technical solution of this embodiment. The technical terms that are the same or corresponding to the above embodiment are not repeated here.

[0080] like Figure 2 As shown, the method specifically comprises the following steps:

[0081] S210, obtaining task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for executing a corresponding task at the logistics address to be selected;

[0082] S220: When the number of tasks corresponding to the target execution address is greater than a preset number threshold, the target execution address is updated to the logistics address to be selected;

[0083] Specifically, for each logistics address to be selected, the target execution address for executing the corresponding task at the logistics address to be selected is obtained, and then the number of tasks corresponding to each target execution address is obtained. If the number of tasks corresponding to the target execution address is greater than the preset quantity threshold, it means that the task volume of this target execution address is large, and this target execution address can be updated to the logistics address to be selected.

[0084] For example, for the A-terminal delivery node, the target execution address of the A-terminal delivery node for executing the corresponding task is obtained, and the number of tasks corresponding to each target execution address is obtained. If the preset quantity threshold is 100 pieces, and the number of tasks corresponding to company M is 120 pieces, it means that the task volume of this company M is large, and the address of this company M can be updated to the logistics address to be selected.

[0085] S230, when the number of tasks corresponding to the target execution address is greater than a preset number threshold, and the ratio of the number of tasks to the total number of tasks of the logistics address to be selected corresponding to the target execution address is greater than a preset ratio, the logistics address to be selected is removed from at least one logistics address, and the target execution address is used as an address in the logistics addresses to be selected;

[0086] Specifically, when the number of tasks corresponding to the target execution address is greater than a preset number threshold, the total number of tasks of the logistics address to be selected corresponding to the target execution address is obtained. The ratio of the number of tasks corresponding to the target execution address to the total number of tasks of the logistics address to be selected corresponding to the target execution address is calculated. When the ratio is greater than the preset ratio, it not only proves that the amount of tasks of the target execution address at this time is large, but also proves that the proportion of the tasks of the target execution address to the total tasks of the logistics address to be selected is very large. Therefore, the logistics address to be selected is removed from at least one logistics address, and the target execution address is used as an address in the logistics address to be selected, so as to save costs.

[0087] Exemplarily, for the A-terminal collection and delivery node, the target execution address for the A-terminal collection and delivery node to perform the corresponding task is obtained, and the number of tasks corresponding to each target execution address is obtained. If the preset quantity threshold is 100 pieces, and the number of tasks corresponding to company M is 120 pieces, then the number of tasks corresponding to the target execution address is greater than the preset quantity threshold. At this time, the total number of tasks of the A-terminal collection and delivery node corresponding to company M is obtained. Suppose at this time the total number of tasks of the A-terminal collection and delivery node is 200 pieces, and the preset ratio is 40%. At this time, the ratio of the number of tasks corresponding to company M to the total number of tasks of the A-terminal collection and delivery node corresponding to company M is greater than the preset ratio of 40%, which not only proves that the task volume of company M is large at this time, but also proves that the proportion of company M in the total tasks of the A-terminal collection and delivery node is very large at this time, so the A-terminal collection and delivery node is removed from the logistics address, and company M is used as the address in the logistics address to be selected.

[0088] S240, grouping the updated physical addresses to be selected according to the preset address quantity range corresponding to each logistics address group, and obtaining at least one logistics address group associated with each address quantity within the address quantity range;

[0089] The address quantity range is the artificially set number of logistics addresses existing in this area.

[0090] Specifically, based on the address quantity range corresponding to each logistics address group preset manually, the updated physical addresses to be selected are grouped according to the address quantity range, thereby obtaining at least one logistics address group associated with each address quantity within the address quantity range.

[0091] For example, for area G, the preset address quantity range for each logistics address group is 10. Assuming that the updated physical addresses to be selected are 15, the 15 updated physical addresses to be selected are grouped and 10 updated physical addresses to be selected are selected as the logistics address group.

[0092] S250, for a logistics address to be selected in at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to task processing data, a cost control function and a target constraint condition of the logistics address to be selected;

[0093] S260, determining a target logistics address according to at least one target cost corresponding to at least one logistics address group, wherein the target logistics address is a logistics address in at least one logistics address to be selected;

[0094] The technical solution of the embodiment of the present disclosure is that when the number of tasks corresponding to the target execution address is greater than a preset number threshold, the target execution address is updated to the logistics address to be selected, and then, when the number of tasks corresponding to the target execution address is greater than the preset number threshold and the ratio of the number of tasks to the total number of tasks of the logistics address to be selected corresponding to the target execution address is greater than the preset ratio, the logistics address to be selected is removed from at least one logistics address, and the target execution address is used as the address in the logistics address to be selected; finally, according to the preset address number range corresponding to each logistics address group, the updated physical addresses to be selected are grouped to obtain at least one logistics address group associated with each address number within the address number range, so that a more reasonable node layout of the logistics transit nodes can be performed according to the task number, thereby improving operational efficiency and reducing costs.

[0095] Embodiment 3

[0096] Figure 3 A flow chart of a method for selecting a logistics transfer node is provided in an embodiment of the present invention. Based on the above embodiment, after obtaining the target logistics address, it is necessary to search the target logistics address upstream and output the result and display it after obtaining the target logistics address. The specific implementation method can refer to the technical solution of this embodiment. Among them, the technical terms that are the same or corresponding to the above embodiment are not repeated here.

[0097] like Figure 3 As shown, the method specifically comprises the following steps:

[0098] S310, obtaining task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for executing a corresponding task at the logistics address to be selected;

[0099] S320, updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group according to the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected;

[0100] S330, for a logistics address to be selected in at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to task processing data, a cost control function and a target constraint condition of the logistics address to be selected;

[0101] S340, determining a target logistics address according to at least one target cost corresponding to at least one logistics address group, wherein the target logistics address is a logistics address in at least one logistics address to be selected;

[0102] S350, searching the upstream node for the address to be processed that the target logistics address depends on, and taking the address to be processed as the logistics address to be selected, and repeatedly executing the step of determining the target logistics address corresponding to the upstream node until the preset stop condition is met;

[0103] In this embodiment, the preset stop condition includes that there is no to-be-processed address that the uplink depends on, or the number of uplink searches reaches a preset number threshold.

[0104] The upward search starts from the beginning of the data structure and searches upward step by step. For example, the small aggregation node location layout is determined first, and then all the small aggregation nodes are used as the logistics addresses to be selected for the medium-sized transfer node location layout to determine the medium-sized transfer node location layout.

[0105] Specifically, for the site selection and layout of small aggregation nodes, all districts and counties can be used as the logistics addresses to be selected; for the site selection and layout of medium-sized transit nodes, all small aggregation nodes can be used as the logistics addresses to be selected; for the site selection and layout of the first-level hub center, all medium-sized transit nodes can be used as the logistics addresses to be selected. When selecting the target logistics address, the upstream search is performed with the pending address on which it depends, and the pending address is used as the logistics address to be selected. Then, the steps of determining the target logistics address corresponding to the upstream node are repeated to finally determine the target logistics address. When there is no pending address that the upstream depends on or the number of upstream searches reaches the preset number threshold, the site selection and layout of the first-level hub center has been determined at this time, and there is no need to perform site selection and layout again, that is, the task is completed.

[0106] S360, outputting the target logistics address and the target coverage area corresponding to the target logistics address;

[0107] Specifically, Figure 4 As shown, after obtaining the site selection layout of the terminal collection and delivery node, the site selection layout of the small collection node, the site selection layout of the medium-sized transit node and the site selection layout of the first-level hub center, the node logistics addresses of each level are output, and the target coverage range corresponding to each target logistics address of each level is output.

[0108] S370, determining and displaying logistics circulation links according to target logistics addresses corresponding to different levels;

[0109] Among them, the logistics circulation link refers to the path of logistics circulation.

[0110] Specifically, once the target logistics addresses corresponding to the specific different levels and the target coverage ranges corresponding to the target logistics addresses are obtained, the visualization results of the node layouts at different levels can be output through intelligent means, the logistics flow links can be output, the layout of network nodes at all levels can be intuitively displayed, and the reverse adjustment and optimization of the planning and site selection layout results can be achieved, making the layout of network nodes at all levels more scientific, reasonable and efficient.

[0111] The technical solution of the disclosed embodiment relates to a method for selecting a location of a logistics transfer node. The method includes: obtaining task processing data of multiple logistics addresses to be selected within a historical time period, wherein the task processing data at least includes the target execution address of the logistics address to be selected to perform the corresponding task, and then, updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected, and further, for the logistics address to be selected in at least one logistics address group, according to the task processing data of the logistics address to be selected, the cost control function and the target constraint condition, determine the target cost corresponding to the logistics address to be selected, and finally, according to at least one target cost corresponding to at least one logistics address group, determine the target logistics address, wherein the target logistics address is the logistics address in at least one logistics address to be selected. The technical solution of the disclosed embodiment, according to the updated logistics address to be selected, determines the logistics address group, and then determines the target cost corresponding to the logistics address group, and finally determines the target logistics address, can reasonably layout the logistics transfer node, improve operation efficiency and reduce costs.

[0112] Embodiment 4

[0113] Figure 5 is a schematic diagram of a site selection device for a logistics transfer node provided by an embodiment of the present disclosure, such as Figure 5 As shown, the device includes: a task processing data acquisition module 410, a logistics address group determination module 420, a target cost determination module 430 and a target logistics address determination module 440.

[0114] The task processing data acquisition module 410 is used to obtain the task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes the target execution address of the logistics address to be selected to perform the corresponding task; the logistics address group determination module 420 is used to update the logistics address to be selected according to the target execution address in the task processing data, and determine at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected; the target cost determination module 430 is used to determine the target cost corresponding to the logistics address to be selected in the at least one logistics address group according to the task processing data of the logistics address to be selected, the cost control function and the target constraint condition; the target logistics address determination module 440 is used to determine the target logistics address according to the at least one target cost corresponding to the at least one logistics address group, wherein the target logistics address is a logistics address in the at least one logistics address to be selected.

[0115] On the basis of the above-mentioned technical solutions, the logistics address group determination module 420 includes a target execution address update submodule, a to-be-selected logistics address determination submodule and a logistics address group determination submodule.

[0116] A target execution address updating submodule, used for updating the target execution address to the logistics address to be selected when the number of tasks corresponding to the target execution address is greater than a preset number threshold;

[0117] A submodule for determining the logistics address to be selected, used for removing the logistics address to be selected from the at least one logistics address and using the target execution address as an address among the logistics addresses to be selected when the number of tasks corresponding to the target execution address is greater than the preset number threshold and the ratio of the number of tasks to the total number of tasks of the logistics address to be selected corresponding to the target execution address is greater than the preset ratio;

[0118] The logistics address group determination submodule is used to group the updated physical addresses to be selected according to the address quantity range corresponding to each preset logistics address group, and obtain at least one logistics address group associated with each address quantity within the address quantity range.

[0119] On the basis of the above-mentioned technical solutions, the target cost determination module 430 includes: the target constraint condition includes at least one of the following: the distance from the logistics address to be selected to at least one covered address to be delivered is less than a preset distance threshold; the number of tasks carried by the logistics address to be selected is within the preset task number range; the number of addresses to be delivered associated with the logistics address to be selected is within the preset address number range; the number of logistics addresses to be selected associated with the address to be delivered is the preset associated number. Among them, the task processing data includes the number of tasks to be performed corresponding to the logistics address to be selected, the task type and the task size of the task to be performed, the cost control function includes a distribution cost sub-function and a construction cost sub-function, the distribution cost sub-function is determined based on the task type, the task size and the number of tasks to be delivered corresponding to the task type, and the construction cost sub-function is determined based on the construction scale and / or construction location corresponding to the logistics address to be selected.

[0120] Based on the above technical solutions, the target logistics address determination module 440 includes: for the at least one logistics address group, the total cost of the logistics address group is obtained by accumulating the target costs corresponding to each logistics address to be selected in the logistics address group; the logistics address group with the smallest total cost is used as the target logistics address group, and the address to be selected in the target logistics address group is used as the target logistics address.

[0121] On the basis of the above technical solutions, it also includes an uplink search module and an output module.

[0122] An upstream search module is used to upstream search for the pending address that the target logistics address depends on, and use the pending address as the logistics address to be selected, and repeatedly execute the step of determining the target logistics address corresponding to the upstream node until a preset stop condition is met; wherein the preset stop condition includes that there is no pending address that the upstream depends on, or the number of upstream searches reaches a preset number threshold;

[0123] The output module is used to output the target logistics address and the target coverage range corresponding to the target logistics address; determine the logistics flow link and display it according to the target logistics addresses corresponding to different levels.

[0124] The technical solution of the disclosed embodiment relates to a method for selecting a location of a logistics transfer node. The method includes: obtaining task processing data of multiple logistics addresses to be selected within a historical time period, wherein the task processing data at least includes the target execution address of the logistics address to be selected to perform the corresponding task, and then, updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected, and further, for the logistics address to be selected in at least one logistics address group, according to the task processing data of the logistics address to be selected, the cost control function and the target constraint condition, determine the target cost corresponding to the logistics address to be selected, and finally, according to at least one target cost corresponding to at least one logistics address group, determine the target logistics address, wherein the target logistics address is the logistics address in at least one logistics address to be selected. The technical solution of the disclosed embodiment, according to the updated logistics address to be selected, determines the logistics address group, and then determines the target cost corresponding to the logistics address group, and finally determines the target logistics address, can reasonably layout the logistics transfer node, improve operation efficiency and reduce costs.

[0125] The site selection device for the logistics transfer node provided in the embodiments of the present disclosure can execute the site selection method for the logistics transfer node provided in any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.

[0126] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present disclosure.

[0127] Embodiment 5

[0128] Figure 6 Schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. Figure 6 , which shows an electronic device (eg, Figure 6 The terminal device in the embodiment of the present disclosure may include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 6 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0129] like Figure 6 As shown, the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An edit / output (I / O) interface 505 is also connected to the bus 504.

[0130] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 6 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0131] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 509, or installed from a storage device 508, or installed from a ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0132] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0133] The electronic device provided in the embodiment of the present disclosure and the method for selecting a location for a logistics transfer node provided in the above embodiment belong to the same inventive concept. For technical details not fully described in this embodiment, reference can be made to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0134] Embodiment 6

[0135] An embodiment of the present disclosure provides a computer storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for selecting a location for a logistics transfer node provided in the above embodiment.

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

[0137] In some embodiments, the server can communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and can be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0138] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0139] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:

[0140] Acquire task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for the logistics addresses to be selected to execute corresponding tasks;

[0141] updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group according to the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected;

[0142] For a logistics address to be selected in the at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to the task processing data, the cost control function and the target constraint condition of the logistics address to be selected;

[0143] According to at least one target cost corresponding to the at least one logistics address group, a target logistics address is determined, wherein the target logistics address is a logistics address in the at least one logistics address to be selected. Computer program codes for performing the operations of the present disclosure can be written in one or more programming languages ​​or a combination thereof, and the programming languages ​​include but are not limited to object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, using an Internet service provider to connect through the Internet).

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

[0145] The units involved in the embodiments described in the present disclosure may be implemented by software or hardware, wherein the name of a unit does not, in some cases, limit the unit itself.

[0146] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0147] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0148] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0149] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0150] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.

Claims

1. A method for selecting a location for a logistics transfer node, characterized in that: include: Acquire task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for the logistics addresses to be selected to execute corresponding tasks; updating the logistics address to be selected according to the target execution address in the task processing data, and determining at least one logistics address group according to the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected; For a logistics address to be selected in the at least one logistics address group, determining a target cost corresponding to the logistics address to be selected according to the task processing data, the cost control function and the target constraint condition of the logistics address to be selected; A target logistics address is determined according to at least one target cost corresponding to the at least one logistics address group, wherein the target logistics address is a logistics address among the at least one logistics address to be selected.

2. The method according to claim 1, characterized in that The updating of the logistics address to be selected according to the target execution address in the task processing data includes: When the number of tasks corresponding to the target execution address is greater than a preset number threshold, the target execution address is updated to the logistics address to be selected; or, When the number of tasks corresponding to the target execution address is greater than the preset number threshold, and the ratio of the number of tasks to the total number of tasks of the logistics address to be selected corresponding to the target execution address is greater than the preset ratio, the logistics address to be selected is removed from the at least one logistics address, and the target execution address is used as the address among the logistics addresses to be selected.

3. The method according to claim 1, characterized in that The task processing data includes the task quantity of at least one task to be executed corresponding to the logistics address to be selected, the task type and the task size of the task to be executed; the cost control function includes a distribution cost sub-function and a construction cost sub-function; the distribution cost sub-function is determined based on the task type, task size and the number of tasks to be delivered corresponding to the task type; the construction cost sub-function is determined based on the construction scale and / or construction location corresponding to the logistics address to be selected.

4. The method according to claim 1, characterized in that: The target constraint condition includes at least one of the following: The distance between the logistics address to be selected and at least one covered delivery address is less than a preset distance threshold; The number of tasks carried by the logistics address to be selected is within the preset task number range; The number of addresses to be delivered associated with the logistics address to be selected is within a preset address quantity range; The number of logistics addresses to be selected associated with the delivery address is the preset associated quantity.

5. The method according to claim 1, characterized in that The step of determining at least one logistics address group according to the updated logistics address to be selected includes: According to the preset address quantity range corresponding to each logistics address group, the updated physical addresses to be selected are grouped to obtain at least one logistics address group associated with each address quantity within the address quantity range.

6. The method according to claim 1, characterized in that The determining the target logistics address according to at least one target cost corresponding to the at least one logistics address group includes: For the at least one logistics address group, the total cost of the logistics address group is obtained by accumulating the target cost corresponding to each logistics address to be selected in the logistics address group; The logistics address group with the smallest total cost is taken as the target logistics address group, and the address to be selected in the target logistics address group is taken as the target logistics address.

7. The method according to claim 1, characterized in that After obtaining the target logistics address, the method further includes: Searching the pending address that the target logistics address depends on in the upstream direction, and taking the pending address as the logistics address to be selected, and repeatedly executing the step of determining the target logistics address corresponding to the upstream node until the preset stop condition is met; The preset stop condition includes that there is no address to be processed that the uplink depends on, or the number of uplink searches reaches a preset number threshold.

8. The method according to claim 1, characterized in that After obtaining the target logistics address, the method further includes: outputting the target logistics address and the target coverage area corresponding to the target logistics address; According to the target logistics addresses corresponding to different levels, the logistics flow links are determined and displayed.

9. A site selection device for a logistics transfer node, characterized in that: include: A task processing data acquisition module is used to acquire task processing data of multiple logistics addresses to be selected within a historical period; wherein the task processing data at least includes a target execution address for the logistics address to be selected to execute a corresponding task; A logistics address group determination module, used to update the logistics address to be selected according to the target execution address in the task processing data, and determine at least one logistics address group based on the updated logistics address to be selected, wherein the logistics address group includes at least one logistics address to be selected; A target cost determination module, for determining, for a logistics address to be selected in the at least one logistics address group, a target cost corresponding to the logistics address to be selected according to the task processing data, the cost control function and the target constraint condition of the logistics address to be selected; The target logistics address determination module is used to determine the target logistics address according to at least one target cost corresponding to the at least one logistics address group, wherein the target logistics address is a logistics address among the at least one logistics address to be selected.

10. An electronic device, characterized in that: The electronic device comprises: one or more processors; a storage device for storing one or more programs, When one or more programs are executed by one or more processors, the one or more processors implement the method for selecting a logistics transit node as described in any one of claims 1 to 8.

Images