A method and apparatus for determining a distribution relationship
By determining the optimal delivery relationship between the target warehouse and the transfer center in logistics distribution, and combining transportation distance and cargo volume, the problems of high transportation costs and poor flexibility in existing technologies are solved, and a more efficient delivery strategy is achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- BEIJING JINGDONG YUANSHENG TECH CO LTD
- Filing Date
- 2025-01-07
- Publication Date
- 2026-07-14
Smart Images
Figure CN122390610A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of logistics technology, and more specifically, to a method and apparatus for determining delivery relationships. Background Technology
[0002] The current delivery model where goods are distributed from transit centers to warehouses is typically a mirror model, meaning each transit center can deliver to downstream warehouses. In this mirror model, as long as the transit center has the goods needed by the warehouse, it can deliver to any warehouse. This can lead to a situation where a warehouse, although close to one transit center, receives its goods from another, farther away transit center. This unreasonable delivery relationship results in increased transportation costs and poor flexibility and applicability. Summary of the Invention
[0003] In view of this, the present disclosure provides at least one method, apparatus, electronic device and storage medium for determining delivery relationships, which can improve the flexibility and applicability of determining delivery relationships and reduce transportation costs.
[0004] In a first aspect, embodiments of this disclosure provide a method for determining delivery relationships, including:
[0005] Determine the transportation distance between the target warehouse and each candidate transshipment center;
[0006] In response to the existence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the candidate transshipment center with the shortest transportation distance to the target warehouse is selected as the target transshipment center, and the first delivery relationship between the target transshipment center and the target warehouse is determined.
[0007] In response to the absence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the delivery cost of delivering the goods to be delivered by each candidate transshipment center is determined based on the volume of the goods to be delivered, so as to determine the target transshipment center from among the candidate transshipment centers based on the delivery cost, and to determine the first delivery relationship between the target transshipment center and the target warehouse.
[0008] Optionally, delivery costs include transportation costs, operating costs, and pickup costs; transportation costs are determined based on the transportation plan used to transport the goods to be delivered, which includes the type and number of vehicles; operating costs and pickup costs are determined based on the quantity of the goods to be delivered.
[0009] Optionally, transportation costs may include transshipment costs; the method may also include:
[0010] In response to the fact that the volume of transit goods that need to be transferred among the goods to be delivered is greater than or equal to the second threshold, the transit cost is determined based on the number of vehicles corresponding to the transit goods;
[0011] In response to the fact that the volume of transit goods that need to be transferred among the goods to be delivered is less than the second threshold, the transit cost is determined based on the transportation plan corresponding to the transit goods.
[0012] Optionally, a transportation plan for transporting the goods to be delivered can be determined through the following steps:
[0013] The actual transport volume is determined based on the difference between the quantity of goods to be delivered and the quantity of goods that need to be stored.
[0014] Based on the actual volume of goods transported and the corresponding vehicle capacity for each type of vehicle, a transportation plan is determined.
[0015] Optionally, the transportation plan for transshipment goods can be determined through the following steps:
[0016] The actual transit volume is determined based on the volume of goods that need to be transferred from the upstream sorting center to the target warehouse, the volume of goods that need to be transferred from the target transshipment center to the target warehouse, and the volume of goods that need to be transferred from the target transshipment center to the target warehouse via other transshipment centers; other transshipment centers are determined from candidate transshipment centers other than the target transshipment center.
[0017] Based on the actual transshipment volume and the corresponding vehicle capacity for each type of vehicle, a transportation plan is determined.
[0018] Optionally, the method further includes:
[0019] Based on the cargo volume corresponding to the upstream sorting center and the transportation distance between the upstream sorting center and each candidate transfer center, the delivery cost of the upstream sorting center delivering goods to each candidate transfer center is determined. Based on the delivery cost, at least one designated transfer center is determined from each candidate transfer center, and a second delivery relationship between the upstream sorting center and at least one designated transfer center is determined.
[0020] Secondly, embodiments of this disclosure provide a delivery relationship determination device, comprising:
[0021] The distance module is used to determine the transportation distance between the target warehouse and each candidate transshipment center;
[0022] The first determining module is used to determine the first delivery relationship between the target transfer center and the target warehouse in response to the existence of a candidate transfer center among the candidate transfer centers whose transportation distance to the target warehouse is less than or equal to a first threshold.
[0023] The second determining module is used to respond to the fact that there is no candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, and to determine the delivery cost of the goods to be delivered by each candidate transshipment center based on the quantity of the goods to be delivered, so as to determine the target transshipment center from each candidate transshipment center based on the delivery cost, and to determine the first delivery relationship between the target transshipment center and the target warehouse.
[0024] Thirdly, embodiments of this disclosure also provide an electronic device, including: a processor, a memory, and a bus. The memory stores machine-readable instructions executable by the processor. When the computer device is running, the processor communicates with the memory via the bus. When the machine-readable instructions are executed by the processor, the steps of the first aspect or any optional implementation of the first aspect are performed.
[0025] Fourthly, embodiments of this disclosure also provide a computer-readable storage medium storing a computer program that, when executed by a processor, performs the steps of the first aspect or any optional implementation thereof.
[0026] Fifthly, embodiments of this disclosure also provide a computer program product, including a computer program that, when executed by a processor, implements the methods of any of the above embodiments.
[0027] Any of the above-mentioned aspects or any implementation methods, by comprehensively considering factors such as transportation distance and delivery cost, flexibly determine the delivery relationship between warehouses and candidate transshipment centers, thereby improving the applicability of the delivery strategy and reducing delivery costs. First, by calculating the transportation distance between the warehouse and each candidate transshipment center, transshipment centers that meet the distance criteria can be quickly screened, and the candidate transshipment center with the shortest transportation distance is prioritized as the target transshipment center, thus establishing a primary delivery relationship between the warehouse and the target transshipment center. This method can pre-bind the delivery relationships between some warehouses and transshipment centers that are relatively close, effectively reducing transportation time and costs and improving delivery efficiency. If no candidate transshipment center meets the distance criteria, the delivery cost of each candidate transshipment center can be further evaluated based on the volume of goods to be delivered, and the target transshipment center can be selected from multiple candidate transshipment centers based on the delivery cost. This provides greater flexibility and adaptability in the face of complex and changing transportation demands, while simultaneously focusing on transportation distance and delivery cost, not only optimizing resource utilization efficiency but also effectively reducing overall transportation costs. Furthermore, the above method can also meet diverse delivery needs in different scenarios.
[0028] The effects of the aforementioned delivery relationship determination device, electronic equipment, and storage medium are described in the explanation of the delivery relationship determination method above, and will not be repeated here. Attached Figure Description
[0029] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the accompanying drawings used in the embodiments will be briefly described below. These drawings are incorporated in and constitute a part of this specification. They illustrate embodiments conforming to this disclosure and, together with the specification, serve to explain the technical solutions of this disclosure. It should be understood that the following drawings only show some embodiments of this disclosure and should not be considered as limiting the scope. Those skilled in the art can obtain other related drawings based on these drawings without creative effort.
[0030] Figure 1 A flowchart of a delivery relationship determination method provided by an embodiment of this disclosure is shown;
[0031] Figure 2 A schematic diagram of a delivery relationship determination method provided by an embodiment of this disclosure is shown;
[0032] Figure 3 A schematic diagram of a delivery relationship determination device provided in an embodiment of this disclosure is shown;
[0033] Figure 4 An exemplary system architecture in which embodiments of this disclosure can be applied is shown;
[0034] Figure 5 A schematic diagram of the structure of a computer system used to implement the embodiments of the present disclosure is shown. Detailed Implementation
[0035] To make the objectives, technical solutions, and advantages of the embodiments of this disclosure clearer, the technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this disclosure, and not all of them. The components of the embodiments of this disclosure described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of this disclosure provided in the accompanying drawings is not intended to limit the scope of the claimed disclosure, but merely represents selected embodiments of this disclosure. All other embodiments obtained by those skilled in the art based on the embodiments of this disclosure without inventive effort are within the scope of protection of this disclosure.
[0036] It should be noted that the collection, use, storage, sharing and transfer of user personal information involved in the technical solution of the present invention all comply with the provisions of relevant laws and regulations, and require notification to users and obtaining their consent or authorization. When applicable, user personal information is subjected to de-identification and / or anonymization and / or encryption technical processing.
[0037] The above problems and solutions are the result of the inventor's practice and careful research. The discovery process of the above problems and the solutions proposed for the above problems should be considered as the inventor's contribution to this disclosure.
[0038] The technical solutions of this disclosure will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this disclosure, and not all of them. The components of this disclosure described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of this disclosure provided in the accompanying drawings is not intended to limit the scope of the claimed disclosure, but merely to illustrate selected embodiments of this disclosure. All other embodiments obtained by those skilled in the art based on the embodiments of this disclosure without inventive effort are within the scope of protection of this disclosure.
[0039] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.
[0040] To facilitate understanding of this embodiment, a detailed description of the delivery relationship determination method disclosed in this disclosure is provided first. The execution entity of the delivery relationship determination method provided in this disclosure is generally a computer device with a certain computing capability. This computer device may include, for example, a terminal device, a server, or other processing equipment. The terminal device may be a user equipment (UE), mobile device, user terminal, terminal, cellular phone, cordless phone, personal digital assistant (PDA), handheld device, computing device, vehicle-mounted device, wearable device, etc. In some possible implementations, this delivery relationship determination method can be implemented by a processor calling computer-readable instructions stored in memory.
[0041] See Figure 1 The diagram shows a flowchart of a delivery relationship determination method provided in this embodiment of the present disclosure. The method includes steps S101 to S103, wherein:
[0042] S101: Determine the transportation distance between the target warehouse and each candidate transshipment center.
[0043] like Figure 2 As shown, a transshipment center can establish distribution relationships with multiple warehouses, and each warehouse only distributes goods through one transshipment center. In existing technology, the distribution relationship between a transshipment center and a warehouse is usually determined by the inventory within the transshipment center. For example, if the target warehouse needs 100 items A, transshipment center A has 150 items, and transshipment center B has 80 items, then the goods will be distributed from transshipment center A to the target warehouse. In this model, even if the distance between transshipment center A and the target warehouse is much greater than the distance between transshipment center B and the target warehouse, the goods will still be distributed from transshipment center A to the target warehouse, which significantly increases transportation costs.
[0044] In this embodiment of the disclosure, to solve the above-mentioned problems, the transportation distance between the target warehouse and each candidate transfer center can be determined before determining the distribution relationship between the target warehouse and the transfer center. In specific implementation, one warehouse can be randomly selected from the set of warehouses whose distribution relationship needs to be determined as the target warehouse, and then the transportation distance between the target warehouse and each candidate transfer center can be determined. When determining the transportation distance, the straight-line distance between the two points can be calculated using the Euclidean distance formula based on the geographical coordinates of the target warehouse and each candidate transfer center. Considering practical factors such as terrain and roads, the actual transportation distance between the target warehouse and each candidate transfer center can also be calculated using road network data and the shortest path algorithm. Alternatively, the distance between the target warehouse and each candidate transfer center can be determined based on historical transportation routes and distances. It should be noted that the above methods are only illustrative examples of feasible implementation methods of this disclosure and do not constitute an improper limitation of the present invention. In practical applications, settings can be made according to actual conditions and needs. This disclosure does not specifically limit the implementation methods, but aims to achieve the desired function.
[0045] S102: In response to the existence of a candidate transfer center among the candidate transfer centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the candidate transfer center with the shortest transportation distance to the target warehouse is selected as the target transfer center, and the first delivery relationship between the target transfer center and the target warehouse is determined.
[0046] In this step, after determining the transportation distance between the target warehouse and each candidate transshipment center, the delivery relationship between the target warehouse and the transshipment center can be determined based on the transportation distance corresponding to each candidate transshipment center and a pre-set first threshold.
[0047] In practice, if only one candidate transshipment center among the candidate transshipment centers has a distance from the target warehouse less than or equal to a first threshold, then that candidate transshipment center can be directly designated as the target transshipment center, and a first delivery relationship can be established between the target transshipment center and the target warehouse. If multiple candidate transshipment centers among the candidate transshipment centers have a distance from the target warehouse less than or equal to the first threshold, then the candidate transshipment center closest to the target warehouse among those meeting the first threshold condition can be designated as the target transshipment center, and a delivery relationship can be established between the target transshipment center and the target warehouse.
[0048] For example, assuming a pre-set first threshold of 10 kilometers, the distance between the target warehouse and candidate transshipment center A is 8 kilometers, the distance to candidate transshipment center B is 12 kilometers, the distance to candidate transshipment center C is 9 kilometers, and the distance to candidate transshipment center D is 5 kilometers. Then, the candidate transshipment centers whose distance to the target warehouse is less than or equal to the first threshold are candidate transshipment center A, candidate transshipment center C, and candidate transshipment center D. The candidate transshipment center with the closest distance to the target warehouse is candidate transshipment center D. At this point, a first delivery relationship can be established between candidate transshipment center D and the target warehouse, meaning that all goods in the target warehouse will be delivered by candidate transshipment center D.
[0049] In another possible implementation, when there are multiple candidate transshipment centers whose distance to the target warehouse is less than or equal to a first threshold, in addition to directly identifying the candidate transshipment center with the shortest corresponding distance as the target transshipment center, other dimensions of the candidate transshipment centers that meet the first threshold condition can also be considered to determine the final target transshipment center. For example, the processing capacity of each candidate transshipment center that meets the first threshold condition can be considered, and the candidate transshipment center that can efficiently handle the transportation needs of the target warehouse can be selected as the target transshipment center; the inventory status of each candidate transshipment center that meets the first threshold condition, the traffic conditions corresponding to the transportation routes from each candidate transshipment center that meets the first threshold condition to the target warehouse, and the historical transportation scores of each candidate transshipment center that meets the first threshold condition can also be considered, and information from these dimensions can be used to determine the final target transshipment center. It should be noted that the other dimensions of conditions that can be considered above are only illustrative examples of possible implementation methods of this disclosure and do not constitute an improper limitation of the present invention. In practical applications, one or more of the dimensions exemplified above can be selected to determine the target transfer center. When determining the target transfer center based on conditions under multiple dimensions, it can also be determined by setting different weights for different dimensions. In addition, conditions of any other dimension can be referenced to determine the final target transfer center. This disclosure does not impose any specific limitations on this. In practical applications, the settings can be made according to actual needs to achieve its function.
[0050] In this embodiment of the disclosure, if a candidate transshipment center exists among the candidate transshipment centers whose transportation distance between the target warehouses is less than or equal to a first threshold, the determined target transshipment center can form a binding relationship with the target warehouse. That is, when other batches of goods need to be delivered subsequently, it is not necessary to re-establish the first delivery relationship. Alternatively, when other batches of goods need to be delivered subsequently, a delivery relationship suitable for the current scenario can be re-determined among the candidate transshipment centers that meet the first threshold condition.
[0051] S103: In response to the absence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the delivery cost of the goods to be delivered by each candidate transshipment center is determined based on the quantity of the goods to be delivered, so as to determine the target transshipment center from among the candidate transshipment centers based on the delivery cost, and to determine the first delivery relationship between the target transshipment center and the target warehouse.
[0052] In this embodiment of the disclosure, as described above, if the target warehouse is close to a candidate transshipment center, the target transshipment center can be directly determined based on the transportation distance, thereby establishing the delivery relationship between the target transshipment center and the target warehouse. For a target warehouse located in the middle of various candidate transshipment centers, the target transshipment center can be determined by calculating the transportation cost of the goods to be delivered. Assuming the first threshold is 10 kilometers, the distance between the target warehouse and candidate transshipment center A is 15 kilometers, and the distance to candidate transshipment center B is 14 kilometers, then the delivery cost of transporting the goods to be delivered from candidate transshipment center A to the target warehouse and the delivery cost of transporting the goods to be delivered from candidate transshipment center B to the target warehouse can be calculated respectively, thereby determining the target transshipment center.
[0053] In one possible implementation, delivery costs may include transportation costs, operating costs, and pickup costs. Transportation costs refer to the costs incurred in transporting goods from the target transshipment center to the target warehouse, and these costs may include expenses and time costs. Transportation costs are primarily determined by the transportation plan for the goods, such as the type, quantity, and duration of the required vehicles. Operating costs refer to the expenses incurred in the actual operational stages involved in transportation, such as warehousing, loading and unloading, sorting, and order fulfillment. These costs are typically calculated based on the actual shipment volume, and in practice, the operating cost per unit volume can be pre-set, usually as a fixed value. Pickup costs refer to the expenses incurred in picking up goods during the logistics process, and are usually related to the quantity of goods to be delivered and the cost per cubic meter of goods (i.e., cost per cubic meter).
[0054] In practice, it is assumed that there are two candidate transshipment centers. and To determine the target transshipment center, the transportation cost of the goods to be delivered can be calculated using the following formula:
[0055] ;
[0056] Where cost1 represents transportation cost; in the first term, j is used to identify candidate transshipment centers; K is the set of warehouses, and k is used to identify the target warehouse; This indicates the number of vehicles used to transport goods from candidate transfer center j to target warehouse k. The superscripts A and B indicate different vehicle types. The specific value can be determined by vehicle volume, vehicle tonnage, or other vehicle-related parameters. The vehicle cost may vary depending on the vehicle type. The superscript indicates the unit transportation cost of a vehicle, and its meaning is the same as... The superscript has the same meaning, so it will not be repeated here. In the second item, 'i' is used to identify the upstream sorting center or other candidate transfer centers upstream of the candidate transfer center; This indicates the number of vehicles used to transport goods from upstream sorting center i to the target transfer center j. The superscript has the same meaning as... The superscript has the same meaning; The superscript indicates the unit transportation cost of a vehicle, and its meaning is the same as... The superscript has the same meaning. The third item represents the transit cost between two candidate transit centers. For example, if the candidate transit centers... As a target transshipment center, transporting goods to be delivered to the target warehouse may involve issues related to candidate transshipment centers. If internal inventory is insufficient, then it is necessary to source from a candidate transshipment center. The costs incurred in transferring goods can be understood as transit costs. Among them, Indicates from candidate transit center Transport to candidate transshipment center The required number of vehicles This represents the unit transportation cost of the vehicle in this process; similarly, Indicates from candidate transit center Transport to candidate transshipment center The required number of vehicles This represents the unit transportation cost of the vehicle in this process; the meanings of the superscripts A and B are consistent with those described above, and will not be repeated here. It should be noted that if the inventory in the target transshipment center is sufficient and there is no need to transfer goods from another candidate transshipment center, the transshipment cost is 0; the transshipment cost will be explained in detail below, and will not be repeated here.
[0057] In one possible implementation, transportation costs may include transshipment costs. Specifically, transportation costs include transshipment costs; the method further includes: determining transshipment costs based on the number of vehicles corresponding to the transshipment goods in response to the quantity of transshipment goods requiring transshipment among the goods to be delivered being greater than or equal to a second threshold; and determining transshipment costs based on the transportation plan corresponding to the transshipment goods in response to the quantity of transshipment goods requiring transshipment among the goods to be delivered being less than the second threshold.
[0058] In practice, there are two types of transshipment: shuttle transshipment and point-to-point transshipment. Shuttle transshipment typically uses a fixed route and regular round-trip transportation model. For example, between two transshipment centers, shuttle buses or other transportation vehicles run back and forth, transferring goods from one transshipment center to the other, ensuring that the other transshipment center has sufficient inventory to distribute goods to the target warehouse. Point-to-point transshipment, on the other hand, is a transportation model that uses one or more transshipment points to transport goods.
[0059] In practical implementation, it can be first determined whether the volume of the transit goods exceeds the second threshold. This second threshold can be set based on actual conditions and historical experience; this embodiment does not impose specific limitations on it. Since shuttle transit is more suitable for small-batch, fixed-route cargo transportation, it can be used when the volume of transit goods is less than the second threshold. The calculation method for shuttle costs has been explained above and will not be repeated here. When the volume of transit goods is large, considering flexibility, cost, and efficiency, a point-to-point transit method can be used. For example, if the goods in the target transit center are far from meeting the volume requirements of the target warehouse, a candidate transit center with sufficient cargo volume can be used as a transit point. The transport vehicle departs from the target transit center, passes through the candidate transit center, and loads sufficient goods onto the vehicle within the candidate transit center, thereby transporting the goods to the target warehouse. The point-to-point cost can be calculated using the following formula:
[0060]
[0061] Where i is used to identify the upstream sorting center; j is used to identify the target transfer center; Indicates the number of transport vehicles that need to be linked together; This is a pre-set fixed value, representing the average cost per vehicle in the point-to-point transport system. It should be noted that if the transshipment method is point-to-point transshipment, then the third term in the above cost2 formula can be replaced with the third term in the cost1 formula. When calculating transshipment costs, the processing speed of the transshipment points can also be taken into account, i.e., the time cost of transshipment. If goods remain at the transshipment point for too long, it may lead to overall transportation delays, affecting not only the timeliness of delivery but also increasing overall operating costs.
[0062] In this embodiment of the disclosure, the transportation plan corresponding to the transit cargo can be determined by the following steps: determining the actual transit cargo volume based on the cargo volume that needs to be transited from the upstream sorting center to the target warehouse, the cargo volume that needs to be transited from the target transfer center to the target warehouse, and the cargo volume that needs to be transited from the target transfer center to the target warehouse via other transfer centers; other transfer centers are determined from candidate transfer centers other than the target transfer center; and determining the transportation plan based on the actual transit cargo volume and the vehicle capacity corresponding to each vehicle type.
[0063] In practice, before determining the transportation plan for transshipment goods, the actual transshipment volume can be determined first. Specifically, the actual transshipment volume consists of three parts: the volume of goods directly dispatched from the upstream sorting center with the target transshipment center as a transit point; the volume of goods dispatched from the target transshipment center but requiring transit through other transshipment centers; and the volume of goods that need to be transferred from the target transshipment center to other transshipment centers. After obtaining the actual transshipment volume, the transportation plan for the transshipment goods can be determined based on the constraint that the maximum loading capacity of the vehicles required for transshipment must be greater than or equal to the actual transshipment volume.
[0064] As described above, in addition to transportation costs, delivery costs can also include handling costs and pickup costs. Handling costs can be calculated directly based on the actual shipment volume and a pre-determined unit fee, using the formula: cost3 = actual shipment volume * unit fee per cubic meter. Pickup costs can be calculated using the following formula:
[0065]
[0066] Here, cost3 represents the collection cost, and the meanings of i, j, and k are consistent with those described above, and will not be repeated here. This represents the volume of goods transported from upstream sorting center i to target transfer center j and then to target warehouse k during the pickup process. This represents the average cost of pickup from upstream sorting center i to the target transit center j.
[0067] In this embodiment of the disclosure, the process of calculating the delivery of goods from each candidate transshipment center to the target warehouse can also be completed by a model. The calculation formulas for the above-mentioned costs can be used as the objective function to obtain the delivery cost formula. With the goal of minimizing L, the specific parameters in the formula can be determined according to the actual situation, thereby identifying the target transfer center with the lowest delivery cost, and then establishing the first delivery relationship between the target transfer center and the target warehouse.
[0068] In another possible implementation, the delivery cost may also include transportation costs, such as highway tolls for long-distance transportation; in addition, it may also include packaging costs, personnel costs, depreciation and maintenance costs of transportation vehicles, etc. This disclosure does not impose specific limitations on these aspects, and in practical applications, the costs can be set according to actual needs to achieve the desired function.
[0069] In this embodiment of the disclosure, a transportation plan for transporting goods to be delivered can be determined by the following steps: determining the actual transport volume based on the difference between the volume of goods to be delivered and the volume of goods that need to be stockpiled; and determining the transportation plan based on the actual transport volume and the vehicle capacity corresponding to each type of vehicle.
[0070] In practice, stockpiling may occur when transporting goods awaiting delivery. For example, suppose 63 cubic meters of goods are sent from the target transshipment center to the target warehouse on the first day, but a single vehicle can only carry a maximum of 60 cubic meters. The remaining 3 cubic meters must wait until the second day for shipment. Therefore, when calculating the second day's shipment volume, the stockpiled volume from the previous day needs to be considered. Thus, when determining the transportation plan for goods awaiting delivery, the actual transport volume can be obtained based on the difference between the current volume of goods awaiting delivery and the volume requiring stockpiling. This actual transport volume can then be used to determine the type and number of vehicles needed to transport this portion of the goods, resulting in a reliable transportation plan. The final determined transportation plan must have a loading capacity greater than or equal to the actual transport volume to ensure the goods can be delivered normally. Furthermore, the stockpiled volume can also be considered when determining the transportation plan for transit goods. Specifically, the actual transit volume at the target transshipment center can be calculated by subtracting the required inventory volume for today from the sum of the volume of goods transiting to the target transshipment center, the volume of goods collected by the target transshipment center itself, and the inventory volume of the previous day. This allows for the determination of the corresponding transportation plan for the transit goods. In practice, a maximum limit on the inventory volume can be set according to actual conditions to balance inventory management, capital occupation, storage space, and transportation efficiency, avoiding the negative impact of excessive inventory.
[0071] like Figure 2 As shown in this embodiment, in addition to determining the first delivery relationship between the target transshipment center and the target warehouse, a second delivery relationship between the upstream sorting center and each candidate transshipment center can also be determined. Specifically, the method further includes: determining the delivery cost of delivering goods from the upstream sorting center to each candidate transshipment center based on the cargo volume corresponding to the upstream sorting center and the transportation distance between the upstream sorting center and each candidate transshipment center, so as to determine at least one designated transshipment center from each candidate transshipment center based on the delivery cost, and determining the second delivery relationship between the upstream sorting center and at least one designated transshipment center.
[0072] In practice, an upstream sorting center can simultaneously deliver goods to multiple candidate transshipment centers, and a candidate transshipment center can simultaneously receive goods from multiple upstream sorting centers. In this case, the delivery cost of the upstream sorting center delivering the current batch of goods to each candidate transshipment center can be determined based on the current delivery volume of the upstream sorting center and the transportation distance between the upstream sorting center and each candidate transshipment center. Thus, at least one candidate transshipment center with the lowest delivery cost can be selected as the designated transshipment center, and a second delivery relationship can be established between the upstream sorting center and at least one designated transshipment center. Furthermore, when determining the second delivery relationship, data such as the type of goods in the current batch and timeliness requirements can also be considered; alternatively, the second delivery relationship can be determined based on the previously described binding first delivery relationship. For example, if transshipment center A has already established a binding relationship with warehouse A, and warehouse A mainly stores frozen fresh produce, then when determining the second delivery relationship between the upstream sorting center and the transshipment center, if the current batch of goods at the upstream sorting center is fresh produce, then the second delivery relationship between the upstream sorting center and transshipment center A can be established first. When determining the second delivery relationship, weight values can also be set for each reference dimension to obtain a more reasonable second delivery relationship.
[0073] According to a second aspect of the embodiments of this disclosure, such as Figure 3 As shown, a delivery relationship determination device 300 is provided, comprising:
[0074] Distance module 301 is used to determine the transportation distance between the target warehouse and each candidate transshipment center;
[0075] The first determining module 302 is used to determine the first delivery relationship between the target transfer center and the target warehouse in response to the existence of a candidate transfer center among the candidate transfer centers whose transportation distance to the target warehouse is less than or equal to a first threshold.
[0076] The second determining module 303 is used to respond to the fact that there is no candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, and to determine the delivery cost of the goods to be delivered by each candidate transshipment center based on the quantity of the goods to be delivered, so as to determine the target transshipment center from each candidate transshipment center based on the delivery cost, and to determine the first delivery relationship between the target transshipment center and the target warehouse.
[0077] Optionally, delivery costs include transportation costs, operating costs, and pickup costs; transportation costs are determined based on the transportation plan used to transport the goods to be delivered, which includes the type and number of vehicles; operating costs and pickup costs are determined based on the quantity of the goods to be delivered.
[0078] Optionally, the transportation cost includes transshipment costs; the second determining module 303 is also used for:
[0079] In response to the fact that the volume of transit goods that need to be transferred among the goods to be delivered is greater than or equal to the second threshold, the transit cost is determined based on the number of vehicles corresponding to the transit goods;
[0080] In response to the fact that the volume of transit goods that need to be transferred among the goods to be delivered is less than the second threshold, the transit cost is determined based on the transportation plan corresponding to the transit goods.
[0081] Optionally, the second determining module 303 is further configured to:
[0082] The actual transport volume is determined based on the difference between the quantity of goods to be delivered and the quantity of goods that need to be stored.
[0083] Based on the actual volume of goods transported and the corresponding vehicle capacity for each type of vehicle, a transportation plan is determined.
[0084] Optionally, the second determining module 303 is further configured to:
[0085] The actual transit volume is determined based on the volume of goods that need to be transferred from the upstream sorting center to the target warehouse, the volume of goods that need to be transferred from the target transshipment center to the target warehouse, and the volume of goods that need to be transferred from the target transshipment center to the target warehouse via other transshipment centers; other transshipment centers are determined from candidate transshipment centers other than the target transshipment center.
[0086] Based on the actual transshipment volume and the corresponding vehicle capacity for each type of vehicle, a transportation plan is determined.
[0087] Optionally, the device further includes a third determining module 304; the third determining module 304 is specifically used for:
[0088] Based on the cargo volume corresponding to the upstream sorting center and the transportation distance between the upstream sorting center and each candidate transfer center, the delivery cost of the upstream sorting center delivering goods to each candidate transfer center is determined. Based on the delivery cost, at least one designated transfer center is determined from each candidate transfer center, and a second delivery relationship between the upstream sorting center and at least one designated transfer center is determined.
[0089] According to a third aspect of the present disclosure, an electronic device for determining delivery relationships is provided, comprising: one or more processors; and a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method provided in the first aspect of the present invention.
[0090] According to a fourth aspect of the present disclosure, a computer-readable medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method provided in the first aspect of the present invention.
[0091] According to a fifth aspect of the present invention, a computer program product is provided, comprising a computer program that, when executed by a processor, implements the method of any of the above embodiments.
[0092] Figure 4 An exemplary system architecture 400 is shown that can be applied to the delivery relationship determination method or delivery relationship determination apparatus implemented in this disclosure.
[0093] like Figure 4 As shown, system architecture 400 may include terminal devices 401, 402, and 403, a network 404, and a server 405. Network 404 serves as the medium for providing communication links between terminal devices 401, 402, and 403 and server 405. Network 404 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.
[0094] Users can use terminal devices 401, 402, and 403 to interact with server 405 via network 404 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 401, 402, and 403, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social media platform software, etc. (for example only).
[0095] Terminal devices 401, 402, and 403 can be various electronic devices with displays that support web browsing, including but not limited to smartphones, tablets, laptops, and desktop computers.
[0096] Server 405 can be a server that provides various services, such as a back-end management server that supports shopping websites browsed by users using terminal devices 401, 402, and 403 (for example only). The back-end management server can process received delivery relationship determination requests and send the processing results (for example only) back to the terminal devices.
[0097] It should be noted that the delivery relationship determination method provided in this embodiment of the invention is generally executed by server 405, and correspondingly, the delivery relationship determination device is generally set in server 405. The delivery relationship determination method provided in this embodiment of the invention can also be executed by terminal devices 401, 402, and 403, and correspondingly, the delivery relationship determination device can be set in terminal devices 401, 402, and 403.
[0098] It should be understood that Figure 4The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.
[0099] The following is for reference. Figure 5 It shows a schematic diagram of the structure of a computer system 500 suitable for implementing a terminal device of the present invention. Figure 5 The terminal device shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.
[0100] like Figure 5 As shown, the computer system 500 includes a central processing unit (CPU) 501, which can perform various appropriate actions and processes based on programs stored in read-only memory (ROM) 502 or programs loaded from storage section 508 into random access memory (RAM) 503. The RAM 503 also stores various programs and data required for the operation of the system 500. The CPU 501, ROM 502, and RAM 503 are interconnected via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.
[0101] The following components are connected to I / O interface 505: an input section 506 including a keyboard, mouse, etc.; an output section 507 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to I / O interface 505 as needed. A removable medium 511, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 510 as needed so that computer programs read from it can be installed into storage section 508 as needed.
[0102] In particular, according to the embodiments disclosed in this invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 509, and / or installed from removable medium 511. When the computer program is executed by central processing unit (CPU) 501, it performs the functions defined above in the system of this invention.
[0103] It should be noted that the computer-readable medium shown in this invention can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this invention, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this invention, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media can also be any computer-readable medium other than computer-readable storage media, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.
[0104] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0105] The modules described in the embodiments of the present invention can be implemented in software or in hardware. The described modules can also be located in a processor. For example, a processor includes a distance module, a first determining module, and a second determining module. The names of these modules do not necessarily limit the module itself. For example, the distance module can also be described as "a module for determining the transportation distance between the target warehouse and each candidate transshipment center".
[0106] In another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiments; or it may exist independently and not assembled into the device. The computer-readable medium carries one or more programs, which, when executed by the device, implement the following method: determining the transportation distance between a target warehouse and each candidate transshipment center; in response to the existence of candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, selecting the candidate transshipment center with the shortest transportation distance to the target warehouse as the target transshipment center, and determining a first delivery relationship between the target transshipment center and the target warehouse; in response to the absence of candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to the first threshold, determining the delivery cost for each candidate transshipment center to deliver the goods based on the quantity of the goods to be delivered, thereby determining the target transshipment center from among the candidate transshipment centers based on the delivery cost, and determining the first delivery relationship between the target transshipment center and the target warehouse.
[0107] Finally, it should be noted that the above embodiments are merely specific implementations of this disclosure, used to illustrate the technical solutions of this disclosure, and not to limit it. The protection scope of this disclosure is not limited thereto. Although this disclosure has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features, within the scope of the technology disclosed in this disclosure. Such modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this disclosure, and should all be covered within the protection scope of this disclosure. Therefore, the protection scope of this disclosure should be determined by the protection scope of the claims.
Claims
1. A method for determining delivery relationships, characterized in that, include: Determine the transportation distance between the target warehouse and each candidate transshipment center; In response to the existence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the candidate transshipment center with the shortest transportation distance to the target warehouse is selected as the target transshipment center, and a first delivery relationship between the target transshipment center and the target warehouse is determined. In response to the absence of any candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, the delivery cost of delivering the goods to be delivered by each candidate transshipment center is determined based on the volume of the goods to be delivered, so as to determine the target transshipment center from among the candidate transshipment centers based on the delivery cost, and to determine the first delivery relationship between the target transshipment center and the target warehouse.
2. The method according to claim 1, characterized in that, The delivery cost includes transportation cost, operating cost, and pickup cost; the transportation cost is determined based on the transportation plan used to transport the goods to be delivered, the transportation plan including the type and number of vehicles; the operating cost and pickup cost are determined based on the quantity of the goods to be delivered.
3. The method according to claim 2, characterized in that, The transportation costs include transshipment costs; the method further includes: In response to the fact that the quantity of transit goods that need to be transferred among the goods to be delivered is greater than or equal to a second threshold, the transit cost is determined based on the number of vehicles corresponding to the transit goods; In response to the fact that the quantity of transit goods requiring transshipment among the goods to be delivered is less than a second threshold, the transshipment cost is determined based on the transportation plan corresponding to the transit goods.
4. The method according to claim 2, characterized in that, The transportation plan for transporting the goods to be delivered is determined through the following steps: The actual transport volume is determined based on the difference between the quantity of goods to be delivered and the quantity of goods that need to be stockpiled. The transportation plan is determined based on the actual volume of goods transported and the vehicle capacity corresponding to each type of vehicle.
5. The method according to claim 3, characterized in that, The transportation plan for the transit goods is determined through the following steps: The actual transit volume is determined based on the volume of goods that need to be transferred from the upstream sorting center to the target warehouse, the volume of goods that need to be transferred from the target transshipment center to the target warehouse, and the volume of goods that need to be transferred from the target transshipment center to the target warehouse via other transshipment centers; the other transshipment centers are determined from candidate transshipment centers other than the target transshipment center. The transportation plan is determined based on the actual transshipment volume and the vehicle capacity corresponding to each vehicle type.
6. The method according to any one of claims 1-5, characterized in that, The method further includes: Based on the cargo volume corresponding to the upstream sorting center and the transportation distance between the upstream sorting center and each candidate transfer center, the delivery cost of the upstream sorting center delivering goods to each candidate transfer center is determined, and at least one designated transfer center is determined from each candidate transfer center based on the delivery cost, and a second delivery relationship between the upstream sorting center and at least one designated transfer center is determined.
7. A delivery relationship determination device, characterized in that, include: The distance module is used to determine the transportation distance between the target warehouse and each candidate transshipment center; The first determining module is configured to, in response to the existence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, select the candidate transshipment center with the shortest transportation distance to the target warehouse as the target transshipment center and determine the first delivery relationship between the target transshipment center and the target warehouse. The second determining module is configured to, in response to the absence of a candidate transshipment center among the candidate transshipment centers whose transportation distance to the target warehouse is less than or equal to a first threshold, determine the delivery cost of delivering the goods to be delivered by each candidate transshipment center based on the quantity of the goods to be delivered, so as to determine the target transshipment center from among the candidate transshipment centers based on the delivery cost, and determine the first delivery relationship between the target transshipment center and the target warehouse.
8. An electronic device, characterized in that, include: One or more processors; Storage device for storing one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of claims 1-6.
9. A computer-readable medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method as described in any one of claims 1-6.
10. A computer program product comprising a computer program that, when executed by a processor, implements the method according to any one of claims 1-6.