Vehicle automatic matching method and system based on cargo information

Abstract

The application provides a vehicle automatic matching method and system based on cargo information, and relates to the technical field of dangerous chemical transportation. The vehicle automatic matching method and system based on cargo information specifically comprises the following steps: S1. User input, S2. Data loading and preprocessing, S3. And single, S4. Path calculation, S5. Matching candidate generation, S6. Maximum matching, S7. Message push and state update. By integrating cargo information and vehicle information, automatic dispatching is realized, ensuring efficient matching of transportation resources. At the same time, based on the path analysis function, the same or similar routes can be identified, supporting carpooling transportation, further improving vehicle utilization. In addition, it can also intelligently recommend suitable cargo sources according to the vehicle return route, effectively reducing the empty return and empty running phenomenon, significantly improving the vehicle full load rate, reducing the transportation cost, and enhancing the economy and sustainability of the overall logistics operation.

Description

Technical Field

[0001] This invention relates to the field of hazardous chemical transportation technology, specifically to an automated vehicle matching method and system based on cargo information. Background Technology

[0002] Hazardous chemical transport refers to the entire process of transporting chemicals with hazardous properties such as explosiveness, flammability, toxicity, corrosiveness, and radioactivity from their place of production, storage, or port to their place of use, place of sale, or other destination via road, rail, waterway, air, or pipeline.

[0003] Existing patent (publication number: CN104933474A) discloses "a fuzzy bi-level optimization method for the transportation of hazardous chemicals, which includes the following steps: determining risk parameters in the transportation network; collecting warehouse supply and demand information; upper-level decision-makers formulating customer allocation plans; lower-level decision-makers finding the optimal path; and deriving the optimal path based on the decisions of the upper and lower levels. This method uses bi-level programming to fully reflect the required decision-making levels, and utilizes its hierarchical decision-making characteristics to obtain a satisfactory solution through the mutual influence of decisions between planners and transporters. The model proposed in this method has effectiveness and optimality in terms of strategy and time."

[0004] Traditional hazardous chemical transportation often involves transporting goods together, as many cannot be mixed due to their inherent properties. Many personnel in the industry lack chemical knowledge and are unaware of which goods can be transported together, leading to very high costs. Now, this vehicle-cargo matching algorithm can automatically identify which goods can be transported together, reducing transportation costs. Summary of the Invention

[0005] To address the shortcomings of existing technologies, this invention provides an automated vehicle matching method and system based on cargo information, which is used to solve the vehicle-cargo matching problem in the transportation of hazardous chemicals.

[0006] To achieve the above objectives, the present invention provides the following technical solution: an automated vehicle matching method based on cargo information, specifically comprising the following steps: S1. User Input S101. Shipper places order The shipper places an order online, generating waybills A, B, ... N, and the status is marked as pending response; S102. Driver online. The driver registers vehicle records as C1, C2...CN, marks the status of vehicles C1, C2...CN as online, clicks to authorize the start of work and reports the location information, and reports the GPS within 2×10 minutes; S2. Data Loading and Preprocessing S201. Load Waybill Select the status as "Awaiting Corresponding Waybill" for loading; S202. Loading Vehicles Select vehicles that are online and have reported their location within 2×10 minutes for loading; S203. City Grouping Group waybills and vehicles together by the city of origin to reduce subsequent calculations. S3. (Single) S301. Two by two, one by one Try merging each pair of waybills in set X1 to get a merged set X2 with a time complexity of O(N*(N-1) / 2), where N is the number of waybills; S302. Three orders combined into one. Try merging the waybills from set X2 with those from set X1 in pairs to get a three-in-one merged waybill result set X3. The worst-case time complexity is O(N*(N-1) / 2*N), where N is the number of waybills. S303. Single Constraint Check Check whether the consolidated waybills meet all 8 rules for "consolidation of waybill attributes"; S304. Attribute Merging New waybill attributes are generated according to the rules for merging the combined waybill attributes and the rules for merging the vehicle self-load and vehicle transport attributes. S4. Path Calculation S401. Shortest Path Planning Taking the origin of shipment as the starting point and all unloading points as necessary points, calculate the shortest path with a complexity of O(N!), where N is the number of unloading points; S402. Alternative Route Planning Find at most two alternative routes whose length is less than or equal to 110% of the shortest path. S403. Path inclusion check Use the "path inclusion algorithm" to determine whether two paths can contain each other; S5. Matching Candidate Generation S501. Empty vehicle matching For each real waybill or virtual combined waybill, vehicles are filtered according to 9 rules of "waybill and empty vehicle matching constraint" and 8 rules of "combined waybill and empty vehicle matching constraint". S502. Carpooling Matching For shipments that can be combined, vehicles that already have one shipment are filtered according to the 9 rules of "shipment and carpooling matching constraints"; S503. Return to base matchmaking If the vehicle needs to return to the city, check the route inclusion relationship according to the "return to city matching" rule; S6. Maximum Matching S601. Construct a bipartite graph The left-hand node represents the waybill, including virtual combined waybills; the right-hand node represents the vehicle; and the edges satisfy all constraints. S602. Hungarian Algorithm Find the maximum cardinality matching with a time complexity of O(VE), where V is the number of vertices on the left side of the bipartite graph and E is the number of edges in the bipartite graph. Output the optimal combination of waybills and vehicles. S603. Result Splitting If a virtual waybill is matched, the original waybill contained within it should be marked as recommended. S7. Push Notifications and Status Updates S701. Send notification Send messages to successfully matched drivers and cargo owners; S702. Status Update Mark matched waybills as recommended and matched vehicles as accepted to prevent duplicate recommendations; S703. Process End This batch of recommendations is complete; the system is now awaiting the next round of triggering.

[0007] Preferably, the following material segregation prohibition measures are also included: A1. The set of attributes of material A intersects with the prohibited attributes of goods B, i.e., they are prohibited from being matched. A2. The set of prohibited attributes of material A overlaps with the attributes of goods B, i.e., they are prohibited.

[0008] Preferably, in S303, the eight rules for "merging order attributes" include: the user accepts grouping orders; the vehicle requirement for the order is a regular vehicle; the goods in the order must meet the non-delivery requirements; the vehicle type requirements for the goods in the order must overlap; the shipping cities of the orders are all in the same city; the shipping times of the orders are on the same day; the routes between the orders are matched; and the vehicle length requirement for merging orders is the maximum required length of the order.

[0009] Preferably, in S501, the nine rules of "waybill and empty vehicle matching constraint" include: the vehicle is empty; the vehicle type meets any of the waybill vehicle type requirements; if the waybill is set not to accept groupage, an empty vehicle with its own load cannot be accepted; the types of goods that the vehicle can accept include the types of goods in the waybill; the gross weight of the waybill + the vehicle's self-loaded load <= the vehicle's load; when the vehicle has no self-loaded load and the vehicle's load > 10, the gross weight of the waybill must be >= the vehicle's load * 0.2; the goods in the waybill and the goods carried by the empty vehicle meet the prohibition requirements; when the waybill requires a tanker truck and the vehicle is a tanker truck, the vehicle's tank function must include the tank function required by the waybill; the waybill has a length requirement and the vehicle length is >= the length required by the waybill.

[0010] Preferably, in S501, the eight rules for "combined shipment and empty vehicle matching constraints" include: the vehicle is empty; the vehicle cannot be a tanker truck; the vehicle type meets any of the requirements for combined shipment vehicle type; the types of goods that the vehicle can carry include the types of goods in the combined shipment; the gross weight of the waybill + the vehicle's self-loaded load <= the vehicle's load capacity; when the vehicle has no self-loaded load capacity and the vehicle's load capacity > 10, the gross weight of the waybill must be >= the vehicle's load capacity * 0.2; the goods on the waybill and the goods carried by the empty vehicle meet the non-matching requirements; the waybill has a length requirement and the vehicle length is >= the length required by the waybill.

[0011] Preferably, in S502, the nine rules of "waybill and carpooling matching constraint" include: waybill can be carpooled, tank truck cannot be carpooled, vehicle currently has a waybill and the quantity is 1, waybill must be shipped on the same day, vehicle type meets any of the waybill vehicle type requirements, waybill gross weight + vehicle self-loaded load <= vehicle load, route matching, waybill has set length requirements and vehicle length >= waybill required length.

[0012] Preferably, in S503, the "return to city matching" rule is that the path from the current city of the vehicle to the return city includes the path of the waybill, the path from the current city to the return city includes the cities passed through, and the path of the waybill does not include the cities passed through.

[0013] Preferably, S5 also includes additional rules for prohibited shipments, dangerous goods, and general goods. These additional rules include: vehicles carrying goods of categories 1, 7, and 9 cannot be shared; goods of categories 6 and 8 cannot be accepted for general goods within 30 days after the completion of the waybill; general goods have no prohibited shipment restrictions; general goods and dangerous goods cannot be transported together, including vehicles carrying their own cargo. If a vehicle is carrying both general and dangerous goods, it cannot accept any more orders; and abnormal dangerous goods cannot be shared. If a vehicle is carrying abnormal dangerous goods, it cannot accept any more orders.

[0014] An automated vehicle matching system based on cargo information specifically includes the following functional modules: User and terminal access module: responsible for all human-machine interactions and device access for cargo owners, drivers, and management. Waybill and Vehicle Data Module: Unifies the maintenance of master data and state machines for waybills, vehicles, goods, prohibited items, dangerous goods, and others; Consolidation and Route Calculation Module: Aggregates mergeable waybills into virtual waybills and plans the shortest and alternative routes for them; Rules engine module: Centrally manages all business constraints in the form of a hot-update rule base; Matching decision module: Performs optimal bipartite graph matching between waybills, virtual waybills, empty trucks, carpooling, and return trips; Scheduling and Message Bus Module: Triggers timed and event-driven scheduling for the entire process and is responsible for reliable message delivery.

[0015] This invention provides a method and system for automated vehicle matching based on cargo information. It offers the following advantages: 1. This invention provides a vehicle automated matching method and system based on cargo information. By integrating cargo information and vehicle information, it achieves automated order dispatch, ensuring efficient matching of transportation resources. At the same time, based on the route analysis function, it can identify cargo on the same or similar routes, support carpooling, and further improve vehicle utilization. In addition, it can intelligently recommend suitable cargo sources based on the vehicle's return route, effectively reducing empty returns and empty runs, significantly improving vehicle load factor, reducing transportation costs, and enhancing the economy and sustainability of the overall logistics operation. Attached Figure Description

[0016] Figure 1 This is a schematic diagram of the overall workflow of the present invention; Figure 2 This is a schematic diagram of the parallel single algorithm flow of the present invention; Figure 3 This is a schematic diagram of the shortest path algorithm of the present invention; Figure 4 This is a schematic diagram of the path inclusion algorithm flow of the present invention; Figure 5 This is a schematic diagram of the Hungarian algorithm flow of the present invention. Detailed Implementation

[0017] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. 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.

[0018] like Figure 1 As shown in the figure, this embodiment of the invention provides a vehicle automated matching method based on cargo information, specifically including the following steps: S1. User Input S101. Shipper places order The shipper places an order online, generating waybills A, B, ... N, and the status is marked as pending response; S102. Driver online. The driver registers vehicle records as C1, C2...CN, marks the status of vehicles C1, C2...CN as online, clicks to authorize the start of work and reports the location information, and reports the GPS within 2×10 minutes; S2. Data Loading and Preprocessing S201. Load Waybill Select the status as "Awaiting Corresponding Waybill" for loading; S202. Loading Vehicles Select vehicles that are online and have reported their location within 2×10 minutes for loading; S203. City Grouping Group waybills and vehicles together by the city of origin to reduce subsequent calculations. S3. (Single) S301. Two by two, one by one Try merging each pair of waybills in set X1 to get a merged set X2 with a time complexity of O(N*(N-1) / 2), where N is the number of waybills; S302. Three orders combined into one. Try merging the waybills from set X2 with those from set X1 in pairs to get a three-in-one merged waybill result set X3. The worst-case time complexity is O(N*(N-1) / 2*N), where N is the number of waybills. Specifically, such as Figure 2 As shown, set X1 is the set of related waybills participating in the merging process. Then, waybills are tried to be merged in pairs, and the result set is X2. This process is called 2-to-1 merging. After that, X2 and X1 are tried to be merged in pairs, and the result set is X3. This process is called 3-to-1 merging.

[0019] S303. Single Constraint Check Check whether the consolidated waybills meet all 8 rules for "consolidation of waybill attributes"; Specifically, the eight rules for "merging order attributes" include: users accepting group orders; the vehicle requirement for the order is a regular vehicle; the goods in the two orders must meet the non-delivery requirements; the vehicle types of the goods in the two orders must overlap; the shipping cities of the two orders must be in the same city; the shipping times of the two orders must be on the same day; the routes between the two orders must match; and the vehicle length requirement for merging orders is the maximum required length of the order.

[0020] Specifically, for route matching between waybills, if waybills A and B each have a maximum of 3 routes, the 3 routes are the shortest route and a maximum of 2 alternative routes not exceeding 100% of the shortest route length, and waybill A's route (with cities it passes through) includes waybill B's route (without cities it passes through), meaning waybill A and waybill B can be matched, or waybill B's route (with cities it passes through) includes waybill A's route (without cities it passes through), meaning waybill A and waybill B can be matched, then the temporary route for this combined waybill is the larger route.

[0021] S304. Attribute Merging For virtual waybills that pass the inspection, new waybill attributes are generated according to the rules for merging the combined waybill attributes and the rules for merging the vehicle self-load and vehicle transport attributes. Specifically, merging single attributes refers to how the attributes of a merged single vehicle are calculated after merging n single vehicles. These attributes affect vehicle recommendations and include the following aspects: Resource attributes: The union of the attributes of all resources; Material Incompatible Attributes: The union of all material incompatible attributes; Vehicle type requirement: The intersection of all waybill vehicle types; Cargo type: Union of all cargo types on all waybills; Weight attribute: Sum of weight attributes for all waybills; Path attribute: The longest path among all waybills.

[0022] The merging of vehicle self-load and vehicle transport attributes specifically includes the following aspects: Material attributes: The union of the vehicle's own load and the attributes of the materials transported by the vehicle; Material restriction attributes: The union of the vehicle's own load and the vehicle's transported material restriction attributes; Weight attribute: The sum of the vehicle's own weight and the weight of the goods transported by the vehicle; Operation path: The preferred path of the shipment.

[0023] S4. Path Calculation S401. Shortest Path Planning Taking the origin of shipment as the starting point and all unloading points as necessary points, calculate the shortest path with a complexity of O(N!), where N is the number of unloading points; S402. Alternative Route Planning Find at most two alternative routes whose length is less than or equal to 110% of the shortest path. Specifically, such as Figure 3 As shown, shortest path planning specifically includes the following: Path definition: A route is a line that starts from the point of shipment and passes through all the unloading points (marked with color). Preferred route: The shortest route calculated based on the unloading location; Alternative routes: Paths with a length less than or equal to 110% of the preferred route; Algorithm logic: Traverse all paths, and the path with the minimum total cost is the shortest path.

[0024] S403. Path inclusion check Use the "path inclusion algorithm" to determine whether two paths can contain each other; Specifically, such as Figure 4 As shown in the diagram, the inclusion algorithm defines two identical paths. Regardless of whether any N (N < the total number of nodes in the path) points of the yellow path are taken (the dashed line represents the taken points), it is considered that the blue path includes the yellow path. Y = Yellow path; B = Blue path; The algorithm logic code is shown below: int j = 0; Current Y = Y.get(j); for(int i = 0; i < B length; i++) { if (current Y == current B) { j++; if (j == length of Y) { return true; } Current Y = Y.get(j); } } The time complexity is O(N+M) in the worst case, where N and M are the number of nodes on the two paths, respectively.

[0025] S5. Matching Candidate Generation S501. Empty vehicle matching For each real waybill or virtual combined waybill, vehicles are filtered according to 9 rules of "waybill and empty vehicle matching constraint" and 8 rules of "combined waybill and empty vehicle matching constraint". Specifically, the nine rules for "waybill and empty vehicle matching constraints" include: the vehicle is empty; the vehicle type meets any of the waybill vehicle type requirements; if the waybill is set not to accept consolidation, an empty vehicle with its own load cannot be accepted; the types of goods that the vehicle can accept include the types of goods in the waybill; the gross weight of the waybill + the vehicle's self-loaded load <= the vehicle's load capacity; when the vehicle has no self-loaded load capacity and the vehicle's load capacity > 10, the gross weight of the waybill must be >= the vehicle's load capacity * 0.2; the goods in the waybill and the goods carried by the empty vehicle meet the prohibition requirements; when the waybill requires a tank truck and the vehicle is a tank truck, the vehicle's tank function must include the tank function required by the waybill; and the waybill has a length requirement and the vehicle's length is >= the length required by the waybill.

[0026] The eight rules for "Matching Consolidation of Waybills and Empty Vehicles" include: the vehicle must be empty; the vehicle cannot be a tanker truck; the vehicle type must meet any of the requirements for vehicle type in the consolidated shipment; the types of goods the vehicle can carry include the types of goods in the consolidated shipment; the gross weight of the waybill plus the vehicle's self-loaded load must be less than or equal to the vehicle's load capacity; when the vehicle has no self-loaded load capacity and the vehicle's load capacity is greater than 10, the gross weight of the waybill must be greater than or equal to the vehicle's load capacity * 0.2; the goods on the waybill and the goods carried by the empty vehicle must meet the prohibition requirements; and the waybill has a length requirement and the vehicle length must be greater than or equal to the length required by the waybill.

[0027] S502. Carpooling Matching For shipments that can be combined, vehicles that already have one shipment are filtered according to the 9 rules of "shipment and carpooling matching constraints"; Specifically, the nine rules for "waybill and carpooling matching constraints" include: waybills can be carpooled, tank trucks cannot be carpooled, vehicles currently have one waybill, waybills must be shipped on the same day, vehicle type meets any of the waybill vehicle type requirements, waybill gross weight + vehicle self-loaded load <= vehicle load, route matching, waybill length requirements are set and vehicle length >= waybill required length.

[0028] In route matching, the main route for group buying is the route from the current city to the destination (including cities along the way). Group buying means that even though the main route has been determined, there may still be several routes (the shortest route + a maximum of 2 alternative routes not exceeding 100% of the length of the shortest route) available for matching. If the vehicle does not report its location at the planned location, i.e., the loading point (unloading point + cities along the route), then it will not be combined with another vehicle. The route of the main package of the group-buying order (excluding the cities it passes through) is the route matching.

[0029] S503. Return to base matchmaking If the vehicle needs to return to the city, check the route inclusion relationship according to the "return to city matching" rule; Specifically, the "return to city matching" rule is that the path from the current city of the vehicle to the return city includes the path of the waybill, the path from the current city to the return city includes the cities it passes through, and the path of the waybill does not include the cities it passes through.

[0030] S6. Maximum Matching S601. Construct a bipartite graph The left-hand node represents the waybill, including virtual combined waybills; the right-hand node represents the vehicle; and the edges satisfy all constraints. S602. Hungarian Algorithm Find the maximum cardinality matching with a time complexity of O(VE), where V is the number of vertices on the left side of the bipartite graph and E is the number of edges in the bipartite graph. Output the optimal combination of waybills and vehicles. Specifically, such as Figure 5 The Hungarian algorithm shown is used to solve the maximum matching problem in a bipartite graph. The maximum matching is the one that successfully pairs the most vehicles and cargo, and the time complexity is O(VE). V is the number of vertices on the left side of the bipartite graph, and E is the number of edges in the bipartite graph.

[0031] S603. Result Splitting If a virtual waybill is matched, the original waybill contained within it should be marked as recommended. S7. Push Notifications and Status Updates S701. Send notification Send messages to successfully matched drivers and cargo owners; S702. Status Update Mark matched waybills as recommended and matched vehicles as accepted to prevent duplicate recommendations; S703. Process End This batch of recommendations is complete; the system is now awaiting the next round of triggering.

[0032] This method also includes the following material restriction steps: A1. The set of attributes of material A intersects with the prohibited attributes of goods B, i.e., they are prohibited from being matched. A2. The set of prohibited attributes of material A overlaps with the attributes of goods B, i.e., they are prohibited.

[0033] Specifically, the attribute set of Aa=A is converted into a 31-bit binary number; Convert the set of forbidden attributes of Ab=A into a 31-bit binary number; Convert the attribute set of Ba=B into a 31-bit binary number; Convert the set of forbidden attributes of Bb=B into a 31-bit binary number; (Aa&Bb>0)||(Ab&Ba>0) is a forbidden pair.

[0034] An automated vehicle matching system based on cargo information is characterized by comprising the following functional modules: User and terminal access module: responsible for all human-machine interactions and device access for cargo owners, drivers, and management. Waybill and Vehicle Data Module: Unifies the maintenance of master data and state machines for waybills, vehicles, goods, prohibited items, dangerous goods, and others; Consolidation and Route Calculation Module: Aggregates mergeable waybills into virtual waybills and plans the shortest and alternative routes for them; Rules engine module: Centrally manages all business constraints in the form of a hot-update rule base; Matching decision module: Performs optimal bipartite graph matching between waybills, virtual waybills, empty trucks, carpooling, and return trips; Scheduling and Message Bus Module: Triggers timed and event-driven scheduling for the entire process and is responsible for reliable message delivery.

[0035] Although embodiments of the invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims and their equivalents.

Claims

1. A method for automated vehicle matching based on cargo information, characterized in that, Specifically, the following steps are included: S1. User Input S101. Shipper places order The shipper places an order online, generating waybills A, B, ... N, and the status is marked as pending response; S102. Driver online. The driver registers vehicle records as C1, C2...CN, marks the status of vehicles C1, C2...CN as online, clicks to authorize the start of work and reports the location information, and reports the GPS within 2×10 minutes; S2. Data Loading and Preprocessing S201. Load Waybill Select the status as "Awaiting Corresponding Waybill" for loading; S202. Loading Vehicles Select vehicles that are online and have reported their location within 2×10 minutes for loading; S203. City Grouping Group waybills and vehicles together by the city of origin to reduce subsequent calculations. S3. (Single) S301. Two by two, one by one Try merging each pair of waybills in set X1 to get a merged set X2 with a time complexity of O(N*(N-1) / 2), where N is the number of waybills; S302. Three orders combined into one. Try merging the waybills from set X2 with those from set X1 in pairs to get a three-in-one merged waybill result set X3. The worst-case time complexity is O(N*(N-1) / 2*N), where N is the number of waybills. S303. Single Constraint Check Check whether the consolidated waybills meet all 8 rules for "consolidation of waybill attributes"; S304. Attribute Merging New waybill attributes are generated according to the rules for merging the combined waybill attributes and the rules for merging the vehicle self-load and vehicle transport attributes. S4. Path Calculation S401. Shortest Path Planning Taking the origin of shipment as the starting point and all unloading points as necessary points, calculate the shortest path with a complexity of O(N!), where N is the number of unloading points; S402. Alternative Route Planning Find at most two alternative routes whose length is less than or equal to 110% of the shortest path. S403. Path inclusion check Use the "path inclusion algorithm" to determine whether two paths can contain each other; S5. Matching Candidate Generation S501. Empty vehicle matching For each real waybill or virtual consolidated waybill, vehicles are filtered according to 9 rules of "waybill and empty vehicle matching constraint" and 8 rules of "consolidated waybill and empty vehicle matching constraint". S502. Carpooling Matching For shipments that can be combined, vehicles that already have one shipment are filtered according to the 9 rules of "shipment and carpooling matching constraints"; S503. Return to base matchmaking If the vehicle needs to return to the city, check the route inclusion relationship according to the "return to city matching" rule; S6. Maximum Matching S601. Construct a bipartite graph The left-hand node represents the waybill, including virtual combined waybills; the right-hand node represents the vehicle; and the edges satisfy all constraints. S602. Hungarian Algorithm Find the maximum cardinality matching with a time complexity of O(VE), where V is the number of vertices on the left side of the bipartite graph and E is the number of edges in the bipartite graph. Output the optimal combination of waybills and vehicles. S603. Result Splitting If a virtual waybill is matched, the original waybill contained within it should be marked as recommended. S7. Push Notifications and Status Updates S701. Send notification Send messages to successfully matched drivers and cargo owners; S702. Status Update Mark matched waybills as recommended and matched vehicles as accepted to prevent duplicate recommendations; S703. Process End This batch of recommendations is complete; the system is now awaiting the next round of triggering.

2. The automated vehicle matching method based on cargo information according to claim 1, characterized in that, This also includes the following prohibited material measures: A1. The set of attributes of material A intersects with the prohibited attributes of goods B, i.e., they are prohibited from being matched. A2. The set of prohibited attributes of material A overlaps with the attributes of goods B, i.e., they are prohibited.

3. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: In S303, the eight rules for "merging order attributes" include: users accepting group orders; the vehicle requirement for the order is a regular vehicle; the goods in the order must meet the non-delivery requirements; the vehicle type requirements for the goods in the order must overlap; the shipping cities of the orders are all in the same city; the shipping times of the orders are on the same day; the routes between the orders are matched; and the vehicle length requirement for merging orders is the maximum required length of the order.

4. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: In S501, the nine rules for "waybill and empty vehicle matching constraints" include: the vehicle is empty; the vehicle type meets any of the waybill vehicle type requirements; if the waybill is set not to accept consolidation, an empty vehicle with its own load cannot be accepted; the types of goods that the vehicle can accept include the types of goods in the waybill; the gross weight of the waybill + the vehicle's self-loaded load <= the vehicle's load; when the vehicle has no self-loaded load and the vehicle's load > 10, the gross weight of the waybill must be >= the vehicle's load * 0.2; the goods in the waybill and the goods carried by the empty vehicle meet the prohibition requirements; when the waybill requires a tank truck and the vehicle is a tank truck, the vehicle's tank function must include the tank function required by the waybill; the waybill has a length requirement and the vehicle length is >= the length required by the waybill.

5. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: In S501, the eight rules for "Matching Consolidation of Waybills and Empty Vehicles" include: the vehicle is empty; the vehicle cannot be a tanker truck; the vehicle type meets any of the requirements for vehicle type in the merged shipment; the types of goods that the vehicle can carry include the types of goods in the merged shipment; the gross weight of the waybill + the vehicle's self-loaded load <= the vehicle's load capacity; when the vehicle has no self-loaded load capacity and the vehicle's load capacity > 10, the gross weight of the waybill must be >= the vehicle's load capacity * 0.2; the goods on the waybill and the goods carried by the empty vehicle meet the prohibition requirements; the waybill has a length requirement and the vehicle length is >= the length required by the waybill.

6. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: In S502, the nine rules for "waybill and carpooling matching constraints" include: waybill can be carpooled, tank trucks cannot be carpooled, the vehicle currently has a waybill and the quantity is 1, the waybill must be shipped on the same day, the vehicle type meets any of the waybill vehicle type requirements, the gross weight of the waybill + the self-provided load capacity of the vehicle is less than or equal to the vehicle load capacity, route matching, and the waybill has a length requirement and the vehicle length is greater than or equal to the length required by the waybill.

7. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: In S503, the "return to city matching" rule is that the path from the current city of the vehicle to the return city includes the path of the waybill, the path from the current city to the return city includes the cities passed through, and the path of the waybill does not include the cities passed through.

8. The automated vehicle matching method based on cargo information according to claim 1, characterized in that: S5 also includes additional rules for prohibited shipments, dangerous goods, and general goods. These additional rules include: vehicles carrying goods of categories 1, 7, and 9 cannot be shared; goods of categories 6 and 8 cannot be accepted for general goods within 30 days after the completion of the waybill; general goods have no prohibited shipment restrictions; general goods and dangerous goods cannot be transported together, including vehicles carrying their own cargo. If a vehicle is carrying both general and dangerous goods, it cannot accept any more orders; and abnormal dangerous goods cannot be shared. If a vehicle is carrying abnormal dangerous goods, it cannot accept any more orders.

9. A vehicle automated matching system based on cargo information, characterized in that, Specifically, it includes the following functional modules: User and terminal access module: responsible for all human-machine interactions and device access for cargo owners, drivers, and management. Waybill and Vehicle Data Module: Unifies the maintenance of master data and state machines for waybills, vehicles, goods, prohibited items, dangerous goods, and others; Consolidation and Route Calculation Module: Aggregates mergeable waybills into virtual waybills and plans the shortest and alternative routes for them; Rules engine module: Centrally manages all business constraints in the form of a hot-update rule base; Matching decision module: Performs optimal bipartite graph matching between waybills, virtual waybills, empty trucks, carpooling, and return trips; Scheduling and Message Bus Module: Triggers timed and event-driven scheduling for the entire process and is responsible for reliable message delivery.

Images