Logistics channel automatic matching method based on multi-dimensional attribute constraint

Abstract

The invention relates to the field of logistics channel automatic matching, in particular to a logistics channel automatic matching method based on multi-dimensional attribute constraints. The method comprises the following steps: firstly, acquiring a logistics transporter set, a logistics service set of logistics transporters and attributes of logistics services; based on a single-ticket cargo delivery demand submitted by a user, obtaining a destination address code of the user, and determining an address reachable service set; then, based on the address reachable service set, obtaining a physical feasible service set; on the basis of the logistics service in the physical feasible service set, determining a charging reference of the logistics service, and calculating the transportation cost of the logistics service by adopting a segmented continuous step charging algorithm; pre-filtering the physical feasible service set to obtain a decision set; determining a service subset with the lowest price based on the decision set; and finally, based on the service subset with the lowest price, obtaining a final recommended logistics service. The technical problem that it is difficult to quickly and accurately obtain logistics service recommendation which is really reachable and optimal in cost performance is solved.

Description

Technical Field

[0001] This invention relates to the field of automatic matching of logistics channels, and in particular to an automatic matching method for logistics channels based on multidimensional attribute constraints. Background Technology

[0002] With the rapid development of e-commerce and the deepening of globalization, the modern logistics industry has become a crucial pillar supporting economic operations. The explosive growth of e-commerce platforms has led to a massive increase in orders, resulting in an explosive growth in logistics demand. The selection and matching of logistics channels directly impacts delivery efficiency, cost control, and customer satisfaction. However, traditional logistics channel matching relies mainly on manual experience or simple rules, making it difficult to cope with the diversity and complexity of orders. Therefore, an automatic logistics channel matching method based on multi-dimensional attribute constraints has emerged. This method aims to achieve efficient and accurate matching of orders and logistics channels through intelligent means, thereby improving the overall operational efficiency of the logistics system.

[0003] However, the existing methods mentioned above still have problems such as: in scenarios with multiple logistics carriers and multiple logistics service products, manual or simple rule matching methods can no longer cope with the complexity; the matching efficiency between logistics service supply and user demand is low and resources are wasted; it is difficult to quickly and accurately obtain truly accessible and cost-effective logistics service recommendations; and there is a systematic deviation between the promised on-time delivery rate of logistics services and the actual delivery, lacking an objective calibration mechanism. Summary of the Invention

[0004] This invention provides an automatic logistics channel matching method based on multi-dimensional attribute constraints to solve the problems of existing methods, which include a large number of unreachable logistics services, wasting computing resources and prolonging response time; existing methods lack effective timeliness filtering and sorting criteria, often resulting in the recommendation of low-priced services that have timed out; and when multiple logistics services have the same transportation cost, existing methods only sort by transportation cost or make random recommendations, ignoring the differences in timeliness reliability, leading to a poor actual delivery experience for users.

[0005] The present invention provides an automatic matching method for logistics channels based on multidimensional attribute constraints, comprising the following steps: S1. Obtain the set of logistics transporters, the set of logistics services of the logistics transporters, and the attributes of the logistics services; based on the single shipment delivery request submitted by the user, perform mandatory field verification. If the verification is successful, process the single shipment delivery request submitted by the user to obtain the user's destination address code; based on the user's destination address code, obtain the set of address-reachable services. S2. Based on the address-reachable service set and the attributes of the logistics service, obtain the physically feasible service set; based on the logistics services in the physically feasible service set, determine the billing benchmark for the logistics service; based on the billing benchmark for the logistics service, use the segmented continuing weight tiered billing algorithm to calculate the transportation cost of the logistics service. S3. Pre-filter the set of physically feasible services to obtain a decision set; based on the decision set and the transportation costs of logistics services, determine the subset of services with the lowest price; based on the subset of services with the lowest price, obtain the final recommended logistics service.

[0006] Preferably, S1 specifically includes: Based on the user's destination address code and the set of supported destination areas in the logistics service attributes, the address reachability determination result is obtained; based on the address reachability determination result, the address reachability service set is obtained.

[0007] Preferably, S2 specifically includes: Based on the logistics services in the set of physically feasible services, and combined with the billing weight value mode in the attributes of the logistics services, the billing benchmark for the logistics services is calculated.

[0008] Preferably, S2 specifically includes: In the segmented additional weight tiered billing algorithm, the additional weight cost is calculated based on the billing benchmark of the logistics service and the additional weight threshold in the attributes of the logistics service; the initial weight cost and the additional weight cost in the attributes of the logistics service are added together to obtain the transportation cost of the logistics service.

[0009] Preferably, S3 specifically includes: In the decision set, iterate through the transportation costs of all logistics services and find the logistics service with the lowest transportation cost. The logistics service with the lowest transportation cost constitutes the lowest-priced service subset.

[0010] Preferably, S3 specifically includes: When the lowest-priced service subset contains a single logistics service, it is directly determined as the final recommended logistics service.

[0011] Preferably, S3 specifically includes: When the lowest-priced service subset contains two or more logistics services, the effective expected delivery time of each logistics service in the lowest-priced service subset is calculated based on the historical on-time rate, historical average delay time and promised delivery time attributes of the logistics services.

[0012] Preferably, S3 specifically includes: Within the lowest-priced service subset, the effective expected delivery time of all logistics services is compared, and the logistics service with the smallest effective expected delivery time value is selected as the final recommended logistics service.

[0013] The beneficial effects of the technical solution of the present invention are: 1. By filtering address reachability at the earliest stage of logistics channel matching, it achieves rapid initial screening of the logistics service set of all logistics transporters, retaining only the logistics services that can actually deliver to the user's destination for subsequent processing, thereby significantly reducing invalid calculations, reducing computing resource consumption, and improving overall response speed. It is particularly suitable for complex scenarios with many types of logistics services and large differences in coverage areas.

[0014] 2. By introducing a secondary verification of physical transportation restrictions on top of address reachability, we effectively prevent the delivery of logistics services that do not meet actual transportation conditions to users. This significantly reduces the probability of order rejections and cancellations due to overweight or oversized items, thereby improving order fulfillment success rates and user ordering experience.

[0015] 3. The segmented incremental weight tiered billing algorithm accurately calculates the final transportation cost of each logistics service. It is flexibly adapted to the billing weight value mode of different logistics services, which can truly reflect the actual charging rules of various logistics services, thereby obtaining more accurate transportation cost comparison results. This provides users with a truly meaningful basis for recommending the lowest price, effectively improving price competitiveness and user trust.

[0016] 4. When the transportation costs of multiple logistics services are the same, an effective expected delivery time calculation method based on historical on-time rate and historical average delay time is introduced. The promised delivery time is reasonably penalized and corrected to obtain an effective expected delivery time that is closer to the real experience. This breaks through the limitation of existing technologies that rely solely on promised delivery time, and enables accurate selection of the fastest actual logistics service under the premise of the same transportation cost, significantly improving users' final satisfaction with the delivery time. Attached Figure Description

[0017] Figure 1 This is a flowchart of an automatic logistics channel matching method based on multidimensional attribute constraints, as described in this invention. Detailed Implementation

[0018] To further illustrate the technical means and effects adopted by the present invention to achieve its intended purpose, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0019] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0020] The following description, in conjunction with the accompanying drawings, details a specific scheme for an automatic logistics channel matching method based on multidimensional attribute constraints provided by the present invention.

[0021] See attached document Figure 1 The diagram illustrates a flowchart of an automatic logistics channel matching method based on multidimensional attribute constraints, provided by an embodiment of the present invention. The method includes the following steps: S1. Obtain the set of logistics transporters, the set of logistics services of the logistics transporters, and the attributes of the logistics services; based on the single shipment delivery request submitted by the user, perform mandatory field verification. If the verification is successful, process the single shipment delivery request submitted by the user to obtain the user's destination address code; based on the user's destination address code, obtain the set of services reachable from the address.

[0022] Obtain a collection of logistics providers from the logistics system. Each logistics provider offers different logistics services, denoted as _____. ,in, Indicates the first A collection of logistics services from various logistics and transportation providers. Indicates the first The first logistics and transportation provider Individual logistics services Indicates the first The number of logistics services provided by each logistics and transportation provider. Each logistics provider's logistics services include the following attributes, listed in section [number]. The first logistics and transportation provider Taking a logistics service as an example: the identifier of the logistics and transportation provider. Supported delivery destination area set The global region set The national standard "Postal Delivery Address Coding Rules" (GB / T 41832) is adopted for unified coding, with each region corresponding to a unique standard address code and volumetric weight conversion factor. Billing weight value retrieval mode Where 0 = only the actual weight of the goods, 1 = the larger of the actual weight and the volumetric weight of the goods, and 2 = only the volumetric weight of the goods or the maximum actual weight limit. Maximum volume limit Maximum billing weight limit Billing rules parameters include initial weight fee. Number of segments for continued weight billing , No. Continued repetition rate , No. Segment Repetition Threshold Commitment Time Limit Historical on-time delivery rate is obtained by statistically analyzing the long-term accumulated actual delivery data in the historical database of the logistics system. 1 indicates 100% on time, and 0 indicates completely untimely. The historical average delay time is calculated based on long-term accumulated delay instances in the logistics system's historical database. .

[0023] In real-world logistics order placement scenarios, users submit single-shipment delivery requests through the logistics system's front-end interface, such as an app, webpage, or mini-program. These requests include the destination address text, the actual weight of the goods, the external dimensions of the packaging (length, width, and height), and optional delivery time requirements. Upon receiving the single-shipment delivery request, the logistics system's back-end performs mandatory field validation: the destination address text cannot be empty, the actual weight of the goods must be greater than zero, and the length, width, and height of the packaging must be greater than zero. If validation fails, a corresponding error message is returned, requiring the user to re-enter the information. If validation succeeds, the system processes the user-submitted single-shipment delivery request, such as parsing the user-inputted destination address text and converting it into a user-defined destination address code. The system uses an API to call external professional address resolution providers, such as map apps, in real time or in batches, submitting the user's input destination address text to a third-party server, which then returns the user's destination address code. If the user has specified a timeframe requirement, such as "hoping to arrive within 3 days," this is converted into a numeric maximum allowed timeframe. If not filled in, set to null.

[0024] Each user's destination address code is checked individually to see if it belongs to the set of destination areas supported by the logistics provider's logistics service. This is used to determine whether the logistics provider's logistics service supports delivery to the user's destination address. The formula is expressed as: in, This indicates the address reachability determination result; This indicates that the user's destination address code belongs to the set of destination areas supported by the logistics service of the logistics provider.

[0025] Collect logistics services from all logistics and transportation providers that support delivery to obtain a set of address-reachable services. If the address reachable service set is empty, the entire matching process will be terminated directly, and "No logistics services available" will be returned.

[0026] At the very beginning of the logistics channel matching process, it quickly determines whether the user's destination address is within the delivery range of each logistics service, ensuring that subsequent calculations are only performed on truly reachable services, avoiding ineffective calculations and wasting resources, and achieving strict address reachability filtering.

[0027] S2. Based on the address-reachable service set and the attributes of the logistics service, obtain the physically feasible service set; based on the logistics services in the physically feasible service set, determine the billing benchmark for the logistics service; based on the billing benchmark for the logistics service, use the segmented continuous weight tiered billing algorithm to calculate the transportation cost of the logistics service.

[0028] Based on the already filtered set of reachable services, and considering the attributes of the logistics services provided by the transporters, the system further checks whether the goods meet the physical transport restrictions of each logistics service. For example, it checks whether the actual weight of the goods does not exceed the maximum actual weight limit of the logistics service; if it does, the logistics service is considered compliant, otherwise not. It also checks whether the volume of the goods does not exceed the maximum volume limit of the logistics service; if it does, the logistics service is considered compliant, otherwise not. Only when all the physical transport restrictions of each logistics service are met can a set of physically feasible services be obtained. If the set of physically feasible services is empty, the entire matching process is terminated, and "No available logistics services" is returned.

[0029] Based on logistics services within the set of physically feasible services, the billing benchmark is determined according to the chargeable weight value pattern for each logistics service. Specifically: When the billing weight value mode for logistics services is 0, the actual weight of the goods is used directly as the billing basis. When the billing weight value mode of the logistics service is 1, the actual weight of the goods is compared with the volumetric weight of the goods under the logistics service, and the maximum value of the two is taken as the billing benchmark; based on the external dimensions of the packaging input by the user, namely length, width and height, the volume of the goods is obtained by multiplying them, and the volumetric weight of the goods under the logistics service is calculated by combining the volumetric weight conversion factor. When the billing weight value mode for logistics services is 2, the volume of goods is used directly as the billing basis.

[0030] The formula for the billing benchmark is expressed as follows: in, Indicates the first The first logistics and transportation provider Billing benchmarks for individual logistics services; Indicates the actual weight of the goods; Indicates the first The first logistics and transportation provider The billing weight calculation method for individual logistics services; The volume of the goods is represented by multiplying the external dimensions of the packaging (length, width, and height) entered by the user. Indicates the first The first logistics and transportation provider The formula for calculating the volumetric weight of goods under a logistics service is as follows: , Indicates the first The first logistics and transportation provider Volume and weight conversion factor for logistics services.

[0031] For logistics services within the set of physically feasible services, a segmented, incremental weight-based tiered billing algorithm is used to calculate the final transportation cost.

[0032] The initial weight fee for each logistics service covers fixed transportation costs within a certain weight range. The subsequent weight charge calculation is then performed based on the weight thresholds specified in the logistics service attributes, employing a "segmented accumulation" mechanism: weight charges only begin to be calculated when the billing benchmark exceeds the first weight threshold; if the billing benchmark falls between the current and next weight thresholds, only the portion exceeding the current weight threshold is charged; if the billing benchmark exceeds all weight thresholds, the weight charges for all applicable segments are accumulated sequentially upwards from the lowest segment. The final transportation cost calculation formula is: in, Indicates the first The first logistics and transportation provider Transportation costs for individual logistics services; Indicates the first The first logistics and transportation provider The initial cost of each logistics service; Indicates the first The first logistics and transportation provider Number of subsequent weight-based billing segments for each logistics service; Indicates the first The first logistics and transportation provider The first logistics service Continued recurrence rate; Indicates the first The first logistics and transportation provider The first logistics service Segment continuation threshold; Indicates the billing benchmark in the The maximum number of segments shall not exceed the number of segments. Segment continuation threshold; Indicates the first The actual billing weight triggered within the segment; This indicates an indicator function used to determine whether the current billing base exceeds the specified threshold. The segment weight threshold is set to 1 if it is met, and 0 otherwise, to ensure that transportation costs are only calculated when the current weight threshold is exceeded.

[0033] S3. Pre-filter the set of physically feasible services to obtain a decision set; based on the decision set and the transportation costs of logistics services, determine the subset of services with the lowest price; based on the subset of services with the lowest price, obtain the final recommended logistics service.

[0034] Based on whether the user specifies a maximum allowed timeframe, the set of physically feasible services is pre-filtered to obtain a decision set. If the user does not specify a maximum allowed timeframe, or if a maximum allowed timeframe is specified but there are still logistics services that can meet the requirement, then these services are included in the decision set.

[0035] Within the decision set, the transportation costs of all logistics services are iterated through to find the service with the lowest transportation cost. This lowest-cost service is then collected, forming a subset of services with the lowest-priced transportation cost. This subset must contain at least one logistics service to ensure that the subsequently recommended logistics service is the most cost-efficient. If the subset contains only one logistics service, it is directly selected as the final recommended logistics service.

[0036] Only when the lowest-priced service subset contains more than one logistics service is the effective expected delivery time calculated for each logistics service within that subset. Specifically, the promised delivery time, historical on-time rate, and historical average delay time are retrieved from the logistics service's attributes; the delay probability is calculated as 1 minus the historical on-time rate; the delay probability is multiplied by the historical average delay time to obtain a weighted delay penalty; finally, this weighted delay penalty is added to the promised delivery time to obtain the effective expected delivery time. A positive penalty is only applied when the historical on-time rate is less than 1, and the penalty magnitude increases with the increase in the delay probability or the historical average delay time, thus calibrating the accuracy of the promised delivery time and improving the actual user experience of the recommendation results.

[0037] The formula for calculating the effective expected timeframe is: in, Indicates the first The first logistics and transportation provider The effective expected delivery time of each logistics service; Indicates the first The first logistics and transportation provider The promised delivery time for each logistics service; Indicates the first The first logistics and transportation provider Historical on-time delivery rate of logistics services; Indicates the first The first logistics and transportation provider The probability of delays in logistics services; Indicates the first The first logistics and transportation provider The historical average delay time for each logistics service; This indicates the weighted penalty for delay.

[0038] Within the lowest-priced service subset, the effective expected delivery time of all logistics services is compared, and the logistics service with the smallest effective expected delivery time value, i.e. the fastest expected logistics service, is selected as the final recommended logistics service.

[0039] In summary, a method for automatic matching of logistics channels based on multidimensional attribute constraints has been developed.

[0040] The order of the embodiments is for illustrative purposes only and does not represent the superiority or inferiority of the embodiments. The processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are possible or may be advantageous.

[0041] The various embodiments in this specification are described in a progressive manner. The same or similar parts between the various embodiments can be referred to each other. Each embodiment focuses on describing the differences from other embodiments.

[0042] The above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications 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 the present invention, and should all be included within the protection scope of the present invention.

Claims

1. A method for automatic matching of logistics channels based on multidimensional attribute constraints, characterized in that, Includes the following steps: S1. Obtain the set of logistics transporters, the set of logistics services of the logistics transporters, and the attributes of the logistics services; Based on the user's submitted single shipment delivery request, the required fields are validated. If the validation is successful, the user's submitted single shipment delivery request is processed to obtain the user's destination address code; based on the user's destination address code, the set of address reachable services is obtained. S2. Based on the set of address-reachable services, and combined with the attributes of logistics services, we obtain the set of physically feasible services; Based on the logistics services in the set of physically feasible services, the billing benchmark for logistics services is determined; based on the billing benchmark for logistics services, a segmented incremental weight tiered billing algorithm is used to calculate the transportation cost of logistics services. S3. Pre-filter the set of physically feasible services to obtain the decision set; Based on the decision set and the transportation costs of logistics services, a subset of services with the lowest prices is determined; based on the subset of services with the lowest prices, the final recommended logistics service is obtained.

2. The automatic matching method for logistics channels based on multi-dimensional attribute constraints according to claim 1, characterized in that, S1 specifically includes: Based on the user's destination address code and the set of supported destination areas in the logistics service attributes, the address reachability determination result is obtained; based on the address reachability determination result, the address reachability service set is obtained.

3. The automatic matching method for logistics channels based on multi-dimensional attribute constraints according to claim 1, characterized in that, S2 specifically includes: Based on the logistics services in the set of physically feasible services, and combined with the billing weight value mode in the attributes of the logistics services, the billing benchmark for the logistics services is calculated.

4. The automatic matching method for logistics channels based on multi-dimensional attribute constraints according to claim 3, characterized in that, S2 specifically includes: In the segmented additional weight tiered billing algorithm, the additional weight cost is calculated based on the billing benchmark of the logistics service and the additional weight threshold in the attributes of the logistics service; the initial weight cost and the additional weight cost in the attributes of the logistics service are added together to obtain the transportation cost of the logistics service.

5. The method for automatic matching of logistics channels based on multi-dimensional attribute constraints according to claim 1, characterized in that, S3 specifically includes: In the decision set, iterate through the transportation costs of all logistics services and find the logistics service with the lowest transportation cost. The logistics service with the lowest transportation cost constitutes the lowest-priced service subset.

6. The method for automatic matching of logistics channels based on multidimensional attribute constraints according to claim 5, characterized in that, S3 specifically includes: When the lowest-priced service subset contains a single logistics service, it is directly determined as the final recommended logistics service.

7. The method for automatic matching of logistics channels based on multidimensional attribute constraints according to claim 5, characterized in that, S3 specifically includes: When the lowest-priced service subset contains two or more logistics services, the effective expected delivery time of each logistics service in the lowest-priced service subset is calculated based on the historical on-time rate, historical average delay time and promised delivery time attributes of the logistics services.

8. The automatic matching method for logistics channels based on multidimensional attribute constraints according to claim 7, characterized in that, S3 specifically includes: Within the lowest-priced service subset, the effective expected delivery time of all logistics services is compared, and the logistics service with the smallest effective expected delivery time value is selected as the final recommended logistics service.

Images