Transportation data processing method and processing device

By integrating road and vehicle attributes, the method optimizes vehicle dispatch to improve efficiency and reduce costs by prioritizing passable paths and load distribution, addressing inefficiencies in traditional scheduling.

CN117409604BActive Publication Date: 2024-12-03SICHUAN ACAD OF TRANSPORTATION DEV STRATEGY & PLANNING
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311491014.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-11-09
Publication Date
2024-12-03
Estimated Expiration
2043-11-09

AI Technical Summary

Technical Problem

Traditional vehicle scheduling often overlooks road section attributes and vehicle attributes, leading to inefficiencies and increased costs due to vehicles being unable to pass through certain sections, necessitating route replanning.

Method used

A method and device that integrate road section attributes and vehicle attributes to optimize vehicle dispatch by identifying passable and detour paths, sorting vehicles by path length and load capacity, and screening based on user needs to ensure efficient and cost-effective transportation.

Benefits of technology

Improves transportation efficiency by prioritizing vehicles that can pass through the shortest paths and optimizing load distribution, reducing transportation distance and resource waste while meeting user-specific demands.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117409604B_ABST
    Figure CN117409604B_ABST
Patent Text Reader

Abstract

The present invention provides a transportation data processing method and a processing device. The method comprises the following steps: segmenting the shortest transportation path based on restricted attributes to obtain restricted sections and non-restricted sections, determining sub-passable vehicle sets corresponding to each restricted section and each non-restricted path according to vehicle attributes, obtaining the intersection of multiple sub-passable vehicle sets to obtain the passable vehicle set corresponding to the shortest transportation path; generating detour sections corresponding to each restricted section according to a detour strategy, obtaining detour transportation paths corresponding to each restricted section based on each detour section, and determining detour vehicle sets corresponding to each detour transportation path; sorting each vehicle set according to the path length to obtain a vehicle set sequence, screening vehicles in the vehicle set sequence according to a vehicle screening strategy to obtain a primary screening set; screening vehicles in the primary screening set according to a screening load and a required transportation volume to obtain a secondary screening set, and controlling the vehicles in the secondary screening set to complete transportation.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to data processing technology, and in particular to a transportation data processing method and a processing device. Background Art

[0002] Vehicle dispatch is a key link in enterprise transportation. Reasonable and efficient vehicle dispatch can reduce costs and improve transportation efficiency.

[0003] Traditional vehicle scheduling is usually based on human experience, and often only considers the driving distance of the route, while ignoring the road section attributes and vehicle attributes. This may cause some vehicles to be unable to pass through a certain section of the driving route. If they cannot pass, they need to return and replan the route, which may not only reduce transportation efficiency, but also increase transportation costs.

[0004] Therefore, how to combine road section attributes and vehicle attributes to dispatch transport vehicles and improve transportation efficiency has become a problem that needs to be solved urgently. Summary of the invention

[0005] The embodiment of the present invention provides a transportation data processing method and a processing device, which can dispatch transportation vehicles in combination with road section attributes and vehicle attributes to improve transportation efficiency.

[0006] A first aspect of an embodiment of the present invention provides a method for processing transportation data, comprising:

[0007] The transport task is parsed to obtain a transport starting point, a transport end point and a required transport volume, the shortest transport path is obtained according to the transport starting point and the transport end point, and the shortest transport path is segmented based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include a license plate restriction attribute, a vehicle type restriction attribute, a height restriction attribute and a load attribute;

[0008] Counting idle vehicles and vehicle attributes, determining sub-passable vehicle sets corresponding to each restricted road section and each non-restricted path according to the vehicle attributes, and obtaining the intersection of multiple sub-passable vehicle sets to obtain the passable vehicle set corresponding to the shortest transportation path;

[0009] Generate detour sections corresponding to the restricted sections according to the detour strategy, update the shortest transport path based on the detour sections to obtain detour transport paths corresponding to the restricted sections, determine the intersection of the sub-passable vehicle sets of the remaining restricted sections in each detour transport path based on the idle vehicle set, obtain the initial vehicle set, remove duplicates from each of the initial vehicle sets based on the passable vehicle set, and obtain the detour vehicle set corresponding to each detour transport path;

[0010] The passing vehicle set and the detour vehicle set are sorted according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and the vehicles in the vehicle set sequence are screened according to the vehicle screening strategy and the required transport volume to obtain a screened set;

[0011] The load capacities corresponding to all vehicles in the primary screening set are counted to obtain a screening load capacities, the vehicles in the primary screening set are screened according to the screening load capacities and the required transport volume to obtain a secondary screening set, and the vehicles in the secondary screening set are controlled to complete the transport.

[0012] Optionally, in a possible implementation of the first aspect, generating a detour section corresponding to each restricted section according to a detour strategy, and updating the shortest transportation path based on each detour section to obtain a detour transportation path corresponding to each restricted section includes:

[0013] Acquire two sections of non-restricted road sections and / or restricted road sections adjacent to each of the restricted road sections to obtain an adjacent road section set corresponding to each of the restricted road sections, acquire a plurality of preset position points corresponding to each of the non-restricted road sections and / or the restricted road sections in the adjacent road section set, and generate a plurality of candidate road sections that bypass the corresponding restricted road sections based on a one-to-one combination of the plurality of preset position points corresponding to the adjacent non-restricted road sections and / or restricted road sections;

[0014] The alternative road section with the shortest path length among multiple alternative road sections is selected as the detour road section corresponding to the corresponding restricted road section, and the shortest transportation path is updated based on each of the detour road sections to obtain the detour transportation path corresponding to each restricted road section.

[0015] Optionally, in a possible implementation of the first aspect, an intersection of sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths is determined based on the idle vehicle set to obtain an initial vehicle set, and each of the initial vehicle sets is deduplicated based on the passable vehicle set to obtain a detour vehicle set corresponding to each detour transport path, including:

[0016] Obtaining the intersection of the sub-vehicle sets corresponding to the remaining restricted sections in each of the detour transport routes, and obtaining the initial vehicle sets corresponding to each of the detour transport routes;

[0017] The initial vehicle sets are compared with the passing vehicle sets, and the vehicles in the initial vehicle sets that are repeated with the passing vehicle sets are obtained and deleted, so as to obtain the detour vehicle sets corresponding to each detour transport path.

[0018] Optionally, in a possible implementation manner of the first aspect, the passing vehicle set and the detour vehicle set are sorted according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and the vehicles in the vehicle set sequence are screened according to a vehicle screening strategy and the required transport volume to obtain a screened set, including:

[0019] sequentially counting the first total load corresponding to each vehicle set in the vehicle set sequence until the first total load is greater than or equal to the required transport volume, then stopping acquiring the vehicle sets, and taking the last acquired vehicle set as a first-category vehicle set, and taking all vehicle sets before the first-category vehicle set as a second-category vehicle set;

[0020] All vehicles in the second type of vehicle set are taken as second target vehicles, the second total load corresponding to all the second type of vehicle sets is counted, and the remaining demand is obtained according to the difference between the required transport volume and the second total load;

[0021] The first type of vehicle set is taken as candidate vehicles, demand information input by a user is received, the candidate vehicles are screened according to a vehicle screening strategy, the demand information and the remaining demand, a first target vehicle is obtained, and a screening set is generated according to the first target vehicle and the second target vehicle.

[0022] Optionally, in a possible implementation of the first aspect, receiving demand information input by a user, screening the candidate vehicles according to a vehicle screening strategy, the demand information, and the remaining demand, to obtain a first target vehicle, includes:

[0023] Parsing the demand information to obtain quantity screening information, acquiring a first loading capacity of each candidate vehicle based on the quantity screening information, and sorting the candidate vehicles from large to small according to the first loading capacity to obtain a first vehicle sequence;

[0024] Acquire a candidate vehicle in the first vehicle sequence whose first load is greater than or equal to the remaining demand and whose first load is the smallest as the first vehicle, obtain a first remaining quantity according to the difference between the first load and the remaining demand of the first vehicle, and if the first remaining quantity is within a preset remaining quantity range, take the first vehicle as the first target vehicle;

[0025] If the first vehicle does not exist in the first vehicle sequence, or the first remaining quantity is not within a preset remaining quantity range, an alternative vehicle whose first loading quantity is less than the remaining required quantity and whose first loading quantity is the largest in the first vehicle sequence is obtained as a second vehicle, and the first vehicle sequence is intercepted based on the second vehicle to obtain a second vehicle sequence;

[0026] The second vehicle sequence is screened according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles.

[0027] Optionally, in a possible implementation of the first aspect, the second vehicle sequence is screened according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles, including:

[0028] The first candidate vehicle in the second vehicle sequence is obtained as the first selected vehicle, and a second remaining quantity is obtained according to the difference between the remaining demand quantity and the first loading quantity of the first selected vehicle, and a candidate vehicle in the second vehicle sequence whose first loading quantity is greater than or equal to the second remaining quantity and whose first loading quantity is the smallest is obtained as the second selected vehicle, and both the first selected vehicle and the second selected vehicle are used as the first target vehicles;

[0029] If the second selected vehicle does not exist in the second vehicle sequence, the first selected vehicle is deleted to obtain an updated second vehicle sequence, the first candidate vehicle in the updated second vehicle sequence is continuously obtained as the next first selected vehicle, and an updated second remaining quantity is obtained according to the difference between the second remaining quantity and the first loading quantity of the next first selected vehicle;

[0030] Repeat the above steps until the total load capacity of all first selected vehicles and second selected vehicles meets the remaining demand, and stop the above steps, and use the obtained first selected vehicles and second selected vehicles as the first target vehicles.

[0031] Optionally, in a possible implementation of the first aspect, receiving demand information input by a user, screening the candidate vehicles according to a vehicle screening strategy, the demand information, and the remaining demand, to obtain a first target vehicle, includes:

[0032] Parsing the demand information to obtain cost screening information, obtaining the transportation cost of each candidate vehicle based on the cost screening information, and sorting the candidate vehicles in ascending order according to the transportation cost to obtain a third vehicle sequence;

[0033] The third total load of each candidate vehicle in the third vehicle sequence is counted in sequence until the third total load is greater than or equal to the remaining demand, then the candidate vehicles are stopped from being acquired, and all acquired candidate vehicles are used as first target vehicles.

[0034] Optionally, in a possible implementation manner of the first aspect, the vehicles in the primary screening set are screened according to the screening load volume and the required transportation volume to obtain a secondary screening set, including:

[0035] Obtain the remaining load capacity according to the difference between the screening load capacity and the required transport capacity, and if there is a target vehicle with a load capacity less than or equal to the remaining load capacity in the primary screening set, obtain the target vehicle with a load capacity less than or equal to the remaining load capacity in the primary screening set as a vehicle to be deleted;

[0036] Obtain a to-be-deleted vehicle with the smallest load in the to-be-deleted vehicles as a target to-be-deleted vehicle, delete the target to-be-deleted vehicle in the primary screening set, and obtain an updated primary screening set;

[0037] Count the updated loads corresponding to all vehicles in the updated primary screening set, and obtain the updated remaining amount according to the difference between the updated load and the required transport amount. If there is no target vehicle with a load less than or equal to the updated remaining amount in the updated primary screening set, stop updating the primary screening set, and use the updated primary screening set as the secondary screening set.

[0038] If there is a target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, repeat the above steps until there is no target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, stop updating the primary filtering set, and use the updated primary filtering set as the secondary filtering set.

[0039] Optionally, in a possible implementation of the first aspect, the method further includes:

[0040] Obtain target vehicles with consistent transport paths in the secondary screening set to generate multiple vehicle collection sets, count the total number of vehicles corresponding to each of the vehicle collection sets, and obtain the interface proportion corresponding to each of the vehicle collection sets according to the ratio of the total number of vehicles;

[0041] Retrieving an initial display interface, dividing the initial display interface according to a preset division direction and the interface proportion, and obtaining sub-display interfaces corresponding to each of the retrieved vehicle sets;

[0042] Retrieve the vehicle icons corresponding to each target vehicle in the retrieved vehicle set, arrange each of the vehicle icons in a corresponding sub-display interface according to a preset arrangement direction, obtain a plurality of sub-vehicle display interfaces, and display the transportation paths corresponding to each retrieved vehicle set in the corresponding sub-vehicle display interface to obtain a vehicle dispatch interface.

[0043] A second aspect of an embodiment of the present invention provides a transportation data processing device, comprising:

[0044] An attribute module is used to parse the transport task to obtain a transport starting point, a transport end point and a required transport volume, obtain the shortest transport path according to the transport starting point and the transport end point, and segment the shortest transport path based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include a license plate restriction attribute, a vehicle type restriction attribute, a height restriction attribute and a load attribute;

[0045] A traffic module is used to count idle vehicles and vehicle attributes, determine sub-traffic vehicle sets corresponding to each restricted road section and each non-restricted path according to the vehicle attributes, and obtain the intersection of multiple sub-traffic vehicle sets to obtain the traffic vehicle set corresponding to the shortest transportation path;

[0046] A detour module, for generating detour sections corresponding to each of the restricted sections according to the detour strategy, updating the shortest transport path based on each of the detour sections to obtain a detour transport path corresponding to each of the restricted sections, determining an initial vehicle set obtained by an intersection of sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths based on the idle vehicle set, and removing duplicates from each of the initial vehicle sets based on the passable vehicle set to obtain a detour vehicle set corresponding to each detour transport path;

[0047] A screening module, used for sorting the passing vehicle set and the detour vehicle set according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and screening the vehicles in the vehicle set sequence according to a vehicle screening strategy and the required transport volume to obtain a screening set;

[0048] The screening weight module is used to count the load capacities corresponding to all vehicles in the primary screening set to obtain the screening load capacities, screen the vehicles in the primary screening set according to the screening load capacities and the required transport capacity to obtain the secondary screening set, and control the vehicles in the secondary screening set to complete the transport.

[0049] The beneficial effects of the present invention are as follows:

[0050] 1. The present invention can dispatch transport vehicles in combination with road section attributes and vehicle attributes to improve transport efficiency. When dispatching vehicles, the present invention will first divide the shortest transport path into multiple restricted sections and non-restricted paths according to the restricted attributes, and then obtain the set of vehicles that can pass through the restricted sections and non-restricted paths in the shortest transport path through the vehicle attributes, so that when retrieving vehicles, the vehicles corresponding to the shortest transport path can be preferentially retrieved, reducing the transportation distance of the vehicle and improving transportation efficiency. In addition, the present invention will also generate detour transport paths corresponding to each restricted section, and obtain the detour vehicle set corresponding to each detour transport path, so that when the total loading capacity of all vehicles in the shortest transport path does not meet the required transportation capacity, the remaining demand can be filled by obtaining the vehicles in the detour vehicle set, so that the dispatched vehicles can load the required transportation capacity. After obtaining the vehicle set corresponding to each transport path, the present invention will sort each vehicle set from small to large according to the path length, and then screen the vehicles in the sorted vehicle set, so that the vehicles in the vehicle set with a shorter transport path can be preferentially retrieved, reducing the transportation distance of the vehicle and improving transportation efficiency. When screening the set of vehicles after sorting, the present invention will screen the vehicles in progress in different ways according to the different needs of users, so that vehicles that meet the user's needs can be screened according to the user's needs, and after screening the target vehicles that meet the user's needs, the present invention will also perform a secondary screening on the acquired target vehicles based on the remaining load obtained by the total load capacity of all target vehicles and the required transportation capacity, so that target vehicles with excess load capacity can be screened out, reducing the waste of vehicle resources.

[0051] 2. When the present invention screens the vehicles in the vehicle set according to the needs of the user, the user's needs will be analyzed first. When the user's needs are quantity screening information, the present invention will sort the candidate vehicles from large to small according to the load capacity to obtain the first vehicle sequence, and then determine whether there is an alternative vehicle in the first vehicle sequence that can load the required transportation volume at one time and the remaining space is also within a reasonable range. If there is such an alternative vehicle, the present invention will obtain the alternative vehicle with the smallest load capacity as the target vehicle, so that the loading of all required transportation volumes can be completed with the least number of target vehicles, so that the number of target vehicles obtained is optimal. If there is no such alternative vehicle, the present invention will obtain the vehicles in the first vehicle sequence whose load capacity is less than the required transportation volume and combine them to obtain multiple target vehicles, so that the waste of vehicle loading space can be reduced while ensuring that the number of vehicles retrieved is small. When the user's demand is transportation cost, the present invention will sort the alternative vehicles in order from small to large according to the transportation cost to obtain a third vehicle sequence, and then sequentially obtain the alternative vehicles in the third vehicle sequence whose total loading volume meets the required transportation volume as target vehicles. In this way, the target vehicle can be obtained according to the user's transportation cost demand, so that the transportation cost of the obtained target vehicle can be optimized.

[0052] 3. After obtaining multiple dispatched vehicles, the present invention will also display the dispatched vehicles of each transportation path through the vehicle dispatch interface, so that the user can intuitively understand the dispatch status of the vehicle through the vehicle dispatch interface. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 A flow chart of a method for processing transportation data provided by an embodiment of the present invention;

[0054] Figure 2 A schematic diagram of a vehicle dispatching interface provided by an embodiment of the present invention;

[0055] Figure 3 A schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present invention. Implementation

[0056] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0057] See also Figure 1, is a flow chart of a method for processing transportation data provided by an embodiment of the present invention, Figure 1 The execution subject of the method shown may be a software and / or hardware device. The execution subject of the present application may include but is not limited to at least one of the following: user equipment, network equipment, etc. Among them, user equipment may include but is not limited to computers, smart phones, personal digital assistants (PDA) and the electronic devices mentioned above. Network equipment may include but is not limited to a single network server, a server group consisting of multiple network servers, or a cloud based on cloud computing consisting of a large number of computers or network servers, wherein cloud computing is a type of distributed computing, a super virtual computer composed of a group of loosely coupled computers. This embodiment does not limit this. It includes steps S1 to S5, as follows:

[0058] S1, analyzing and processing the transport task to obtain the transport starting point, transport end point and required transport volume, obtaining the shortest transport path according to the transport starting point and transport end point, and segmenting the shortest transport path based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include license plate restriction attributes, vehicle type restriction attributes, height restriction attributes and load attributes.

[0059] It is understandable that in actual applications, only specified vehicles are allowed to pass through some restricted sections, and other vehicles that do not meet the requirements may need to bypass the restricted sections to pass. Therefore, after obtaining the shortest transportation path, this solution will also find vehicles that can completely pass through the shortest transportation path based on the restriction attributes and vehicle attributes. In this way, when performing subsequent vehicle scheduling, vehicles that can completely pass through the shortest transportation path can be scheduled first, thereby reducing the path distance during vehicle transportation and improving transportation efficiency.

[0060] Among them, the required transportation volume refers to the total transportation volume of goods. In actual applications, when obtaining the shortest transportation path according to the transportation starting point and the transportation end point, the shortest path can be obtained by adopting the method of obtaining the shortest path in the existing technology, which is not elaborated in this solution.

[0061] S2, counting idle vehicles and vehicle attributes, determining sub-passable vehicle sets corresponding to each restricted road section and each non-restricted path according to the vehicle attributes, and obtaining the intersection of multiple sub-passable vehicle sets to obtain the passable vehicle set corresponding to the shortest transportation path.

[0062] The above vehicle attributes may include license plate attributes, vehicle type attributes, vehicle height attributes and vehicle load attributes. The above sub-passing vehicle set refers to a set of vehicles that can pass through each restricted road section and non-restricted road section.

[0063] It can be understood that after obtaining multiple sub-passing vehicle sets, the vehicles obtained by their intersection are the vehicles that can pass through all sections on the shortest transportation path, so the passing vehicle set corresponding to the shortest transportation path can be generated based on these vehicles.

[0064] Through the above method, vehicles that can pass through all sections of the shortest transportation route can be obtained, so that these vehicles can be prioritized in subsequent vehicle scheduling, thereby improving the efficiency of vehicle transportation.

[0065] S3, generating detour sections corresponding to each of the restricted sections according to the detour strategy, updating the shortest transport path based on each of the detour sections to obtain the detour transport path corresponding to each of the restricted sections, determining the intersection of the sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths based on the idle vehicle set to obtain the initial vehicle set, deduplicating each of the initial vehicle sets based on the passable vehicle set to obtain the detour vehicle set corresponding to each detour transport path.

[0066] It is understandable that in order to allow vehicles to pass through restricted sections, this solution will also generate detour sections corresponding to each restricted section, so that detour transportation paths corresponding to each restricted section can be generated based on each detour path.

[0067] For example, if the shortest transport path has three restricted sections, this solution will generate detour sections corresponding to each restricted section, and then use the three detour sections to update the shortest transport path to obtain three detour transport paths, that is, only one detour section is used to update the shortest transport path each time, so that the generated detour transport path can be relatively short. If all detour paths are used to update the shortest transport path at one time, the detour transport path may be too long, which may extend the transportation time and reduce transportation efficiency.

[0068] After obtaining the detour transport path, this scheme will also obtain the initial vehicle set corresponding to each detour transport path. It can be understood that there may be duplicate vehicles in the initial vehicle set with the passing vehicle set. Therefore, in order to prevent vehicle duplication in subsequent vehicle scheduling, this scheme will deduplicate each initial vehicle set through the passing vehicle set, thereby obtaining the detour vehicle set corresponding to each detour transport path.

[0069] Specifically, based on the above embodiment, the specific implementation method of "generating detour sections corresponding to the restricted sections according to the detour strategy, updating the shortest transportation path based on the detour sections, and obtaining the detour transportation path corresponding to the restricted sections" in step S3 can be:

[0070] S31, obtaining two sections of non-restricted road sections and / or restricted road sections adjacent to each of the restricted road sections to obtain an adjacent section set corresponding to each restricted road section, obtaining a plurality of preset position points corresponding to each of the non-restricted road sections and / or the restricted road sections in the adjacent section set, and generating a plurality of alternative sections that bypass the corresponding restricted road sections based on a one-to-one combination of the plurality of preset position points corresponding to the adjacent non-restricted road sections and / or restricted road sections.

[0071] In actual applications, the user may set a plurality of preset location points in advance in each restricted road section and non-restricted road section, so that a plurality of alternative routes may be generated according to the combination of any two of the preset location points.

[0072] Specifically, in order to obtain the detour section corresponding to each restricted road section, two non-restricted road sections and / or restricted road sections adjacent to each restricted road section can be obtained first, and then multiple alternative road sections can be generated based on the preset position points on these two adjacent non-restricted road sections and / or restricted road sections.

[0073] For example, if there is a preset position point on each of two adjacent non-restricted road sections and / or restricted road sections, then the candidate road sections corresponding to the corresponding restricted road sections can be generated based on the two preset position points.

[0074] It is worth mentioning that, generally speaking, the restricted road section may be located in the middle of the shortest transportation path, and the above scheme is also laid out based on this. If in other cases, the restricted road section is located at the beginning or the end of the shortest transportation path, the end point of the restricted path away from the adjacent road section can be used as the above-mentioned preset position point, and then the preset position point is combined with multiple preset position points on the road section adjacent to the restricted road section to obtain multiple alternative sections.

[0075] S32, selecting the candidate road section with the shortest path length among the multiple candidate road sections as the detour road section corresponding to the corresponding restricted road section, and updating the shortest transportation path based on each of the detour road sections to obtain the detour transportation path corresponding to each restricted road section.

[0076] It can be understood that by selecting the alternative road section with the shortest path length as the detour section corresponding to the corresponding restricted road section, the obtained detour transportation path can be made relatively shorter, thereby reducing the transportation time.

[0077] Based on the above embodiment, the specific implementation method of step S3 of "determining the intersection of the sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths based on the idle vehicle set, obtaining the initial vehicle set, and removing duplicates from each of the initial vehicle sets based on the passable vehicle set to obtain the detour vehicle set corresponding to each detour transport path" can be:

[0078] S33, obtaining the intersection of the sub-vehicle sets corresponding to the remaining restricted sections in each of the detour transport routes, and obtaining the initial vehicle sets corresponding to each of the detour transport routes.

[0079] In actual applications, all vehicles can usually pass through non-restricted sections. Therefore, when obtaining vehicles that can pass through all sections in each detour transport path, the initial vehicle set corresponding to each detour transport path can be obtained based on the intersection of the sub-passable vehicle sets corresponding to the remaining restricted sections in the detour transport path.

[0080] S34, comparing each of the initial vehicle sets with the passing vehicle set, obtaining duplicate vehicles in each of the initial vehicle sets and in the passing vehicle set and deleting them, to obtain a detour vehicle set corresponding to each detour transport path.

[0081] When deduplicating the initial vehicle set, the initial vehicle set and the passing vehicle set may be compared, and then the vehicles in the initial vehicle set that are repeated in the passing vehicle set may be deleted for deduplication.

[0082] Through the above method, vehicles that can pass through all sections in each detour transport path can be obtained, so that when the number of vehicles corresponding to the shortest transport path is insufficient during subsequent vehicle scheduling, vehicles corresponding to the detour transport path with a shorter path can be selected first, thereby reducing the transportation distance of vehicle transportation accordingly and improving transportation efficiency.

[0083] S4, sorting the passing vehicle set and the detour vehicle set according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and screening the vehicles in the vehicle set sequence according to the vehicle screening strategy and the required transport volume to obtain a screened set.

[0084] When scheduling vehicles, this solution will first sort each vehicle set according to the path length, so that vehicles in the vehicle set with shorter paths can be prioritized during screening, reducing vehicle transportation time and improving transportation efficiency.

[0085] Based on the above embodiment, the specific implementation of step S4 may be:

[0086] S41, sequentially counting the first total load corresponding to each vehicle set in the vehicle set sequence, and stopping the acquisition of the vehicle sets until the first total load is greater than or equal to the required transportation volume, and taking the last vehicle set acquired as a first-category vehicle set, and taking all vehicle sets before the first-category vehicle set as second-category vehicle sets.

[0087] Specifically, when screening vehicles, this solution will first screen out a set of vehicles that meet the required transportation volume, and then further screen the vehicles in the screened set of vehicles.

[0088] For example, if the first total load capacity corresponding to the first vehicle set in the vehicle set meets the required transportation volume, then the acquisition of the vehicle set can be stopped and the vehicle set can be regarded as a first-class vehicle set. If the first total load capacity of the first two vehicle sets in the vehicle set meets the required transportation volume, then the acquisition of subsequent vehicle sets can be stopped and the first acquired vehicle set can be regarded as a second-class vehicle set, and the second acquired vehicle set can be regarded as a first-class vehicle set.

[0089] It is understandable that the reason why the acquired vehicle set is divided into a first-category vehicle set and a second-category vehicle set is to subsequently screen the vehicles in the first-category vehicle set and the second-category vehicle set in different ways.

[0090] S42, taking all vehicles in the second type of vehicle set as second target vehicles, counting the second total loads corresponding to all the second type of vehicle sets, and obtaining the remaining demand according to the difference between the demand transport volume and the second total loads.

[0091] It can be understood that since the vehicle sets in the vehicle set sequence are arranged from small to large according to the path length, the transportation path corresponding to the second type of vehicle set is smaller than the transportation path corresponding to the first type of vehicle set. Therefore, all the vehicles in the second type of vehicle set can be selected as target vehicles, and then the remaining demand is obtained based on the required transportation volume and the second total load, and the vehicles in the first type of vehicle set are selected based on the required remaining demand.

[0092] S43, taking the set of vehicles of the first category as candidate vehicles, receiving demand information input by a user, screening the candidate vehicles according to a vehicle screening strategy, the demand information and the remaining demand, obtaining a first target vehicle, and generating a screening set according to the first target vehicle and the second target vehicle.

[0093] It can be understood that since a type of vehicle set corresponds to a vehicle set with the longest path, it is not necessary to select all vehicles in the type of vehicle set, as long as the total load capacity of the selected first target vehicle and the second target vehicle is greater than or equal to the required transportation capacity, thereby reducing the waste of vehicle resources.

[0094] Specifically, in some embodiments, the specific implementation of "receiving the demand information input by the user, screening the candidate vehicles according to the vehicle screening strategy, the demand information and the remaining demand, and obtaining the first target vehicle" in step S4 may be:

[0095] A1. parse the demand information to obtain quantity screening information, obtain a first loading capacity of each candidate vehicle based on the quantity screening information, sort the candidate vehicles from large to small according to the first loading capacity, and obtain a first vehicle sequence.

[0096] In practical applications, vehicles in a class of vehicle sets can be screened in different ways based on different user needs. When the user's need is the number of vehicles, that is, quantity filtering information, the number of vehicles can be controlled within a smaller range during screening, so that the number of vehicles can be optimized.

[0097] Specifically, the first loading capacity of each candidate vehicle may be obtained first, and then the candidate vehicles may be sorted from large to small according to the first loading capacity to obtain a first vehicle sequence, and then the first vehicle sequence may be used to subsequently screen the target vehicles accordingly.

[0098] A2, obtain an alternative vehicle in the first vehicle sequence whose first load is greater than or equal to the remaining demand and whose first load is the smallest as the first vehicle, obtain a first remaining quantity according to the difference between the first load of the first vehicle and the remaining demand, and if the first remaining quantity is within a preset remaining quantity range, use the first vehicle as the first target vehicle.

[0099] It can be understood that if there is an alternative vehicle in the first vehicle sequence whose first loading capacity is greater than or equal to the remaining demand capacity, it means that the alternative vehicle can load all the remaining demand capacities at one time, and in order to reduce the waste of loading space, the alternative vehicle with the smallest loading capacity among these alternative vehicles can be obtained as the first vehicle. If the remaining loading capacity of the first vehicle after loading is also within a reasonable range, that is, the above-mentioned first remaining capacity is also within the preset remaining capacity range, it means that the loading space of the first vehicle will not be greatly wasted, and therefore the first vehicle can be selected as the first target vehicle.

[0100] A3. If the first vehicle does not exist in the first vehicle sequence, or the first remaining quantity is not within the preset remaining quantity range, an alternative vehicle in the first vehicle sequence whose first loading quantity is less than the remaining demand quantity and whose first loading quantity is the largest is obtained as the second vehicle, and the first vehicle sequence is intercepted based on the second vehicle to obtain a second vehicle sequence.

[0101] It can be understood that if the first vehicle does not exist in the first vehicle sequence, it means that there is no alternative vehicle in the first vehicle sequence that can load all the remaining demand at one time. In this case, multiple alternative vehicles in the first vehicle sequence can be combined, and the remaining demand can be loaded and transported through the combined vehicle set.

[0102] Or when the first remaining quantity is not within the preset remaining quantity range, it indicates that the loading space of the first vehicle may be greatly wasted. For example, if the loading capacity of the first vehicle is 20 tons, but the remaining demand is only 8 tons, it may cause a large waste of the loading space of the first vehicle. Therefore, in this case, multiple alternative vehicles in the first vehicle sequence may be combined, and the remaining demand may be loaded and transported through the combined vehicle collection.

[0103] When combining vehicles in the first vehicle sequence, an alternative vehicle whose first load capacity is less than the remaining demand and whose first load capacity is the largest can be first obtained as the second vehicle in the first vehicle sequence, and then the first vehicle sequence is intercepted by the second vehicle to obtain the second vehicle sequence, and then the first target vehicle is screened by the second vehicle sequence, so that the first load capacity of the alternative vehicles in the intercepted second vehicle sequence is less than the remaining demand, thereby reducing the waste of loading space when the vehicles are combined.

[0104] A4: Screen the second vehicle sequence according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles.

[0105] Specifically, step A4 includes steps A41 to A43:

[0106] A41, obtain the first alternative vehicle in the second vehicle sequence as the first selected vehicle, and obtain the second remaining quantity according to the difference between the remaining demand quantity and the first loading quantity of the first selected vehicle, obtain the alternative vehicle in the second vehicle sequence whose first loading quantity is greater than or equal to the second remaining quantity and whose first loading quantity is the smallest as the second selected vehicle, and take both the first selected vehicle and the second selected vehicle as the first target vehicles.

[0107] It can be understood that since the loading capacity of the first alternative vehicle in the second vehicle sequence is the largest and is less than the remaining demand, it can be selected as the first selected vehicle, so that the loading space of the first selected vehicle can be utilized to the maximum extent, and then the remaining alternative vehicles can be selected based on the second remaining quantity. If there is an alternative vehicle in the second vehicle sequence that can load the entire second remaining quantity, the alternative vehicle with the smallest loading capacity among these alternative vehicles can be selected as the second selected vehicle, and then the first selected vehicle and the second selected vehicle obtained can be both used as the first target vehicle. This can reduce the waste of loading space while ensuring that the number of combined vehicles is minimized.

[0108] A42: if the second selected vehicle does not exist in the second vehicle sequence, the first selected vehicle is deleted to obtain an updated second vehicle sequence, and the first candidate vehicle in the updated second vehicle sequence is continued to be obtained as the next first selected vehicle, and the updated second remaining quantity is obtained according to the difference between the second remaining quantity and the first loading quantity of the next first selected vehicle.

[0109] If there is no second selected vehicle in the second vehicle sequence, it means that there is no alternative vehicle in the second vehicle sequence that can load the entire second remaining quantity. In this case, the first selected vehicle can be deleted, and then the first alternative vehicle in the updated second vehicle sequence can be obtained as the next first selected vehicle. Since two first selected vehicles are obtained at this time, the corresponding second remaining quantity must also be updated accordingly.

[0110] A43, repeat the above steps until the total load capacity of all first selected vehicles and second selected vehicles meets the remaining demand, and stop the above steps, and use the obtained first selected vehicles and second selected vehicles as the first target vehicles.

[0111] Among them, the total load capacity of all the first selected vehicles and the second selected vehicles meets the remaining demand, which means that the total load capacity of all the first selected vehicles and the second selected vehicles is greater than or equal to the remaining demand.

[0112] Through the above method, the target vehicles can be acquired according to the quantity requirements of the users, thereby ensuring that the number of retrieved vehicles is small while reducing the waste of vehicle loading space.

[0113] In other embodiments, the specific implementation of "receiving the demand information input by the user, screening the candidate vehicles according to the vehicle screening strategy, the demand information and the remaining demand, and obtaining the first target vehicle" in step S4 may be:

[0114] B1, parsing the demand information to obtain cost screening information, obtaining the transportation cost of each candidate vehicle based on the cost screening information, and sorting the candidate vehicles in ascending order according to the transportation cost to obtain a third vehicle sequence.

[0115] When the user's demand is transportation cost, that is, cost screening information, the total transportation cost of the vehicle can be controlled within a smaller cost range during screening, so that the cost of vehicle transportation can be optimized.

[0116] It is worth mentioning that the above-mentioned transportation costs refer to the transportation costs per ton of goods corresponding to each spare vehicle. For example, if the spare vehicle costs 1,000 yuan to transport 5 tons of goods, and the transportation cost per ton of goods is 200 yuan, then the transportation cost of the spare vehicle is 200 yuan per ton.

[0117] Specifically, when the candidate vehicles are screened by the transportation cost, the candidate vehicles may be arranged in order of small to large according to the transportation cost to obtain a third vehicle sequence.

[0118] B2, sequentially counting the third total load of each candidate vehicle in the third vehicle sequence until the third total load is greater than or equal to the remaining demand, then stopping the acquisition of the candidate vehicles, and using all the acquired candidate vehicles as the first target vehicles.

[0119] After the third vehicle sequence is obtained, the third total loads of the vehicles in the third vehicle sequence may be counted in sequence, and then the acquisition of the first target vehicle may be stopped when the third total load is greater than or equal to the remaining demand.

[0120] Through the above method, the target vehicle can be obtained according to the user's transportation cost demand, so that the transportation cost of the obtained target vehicle can be optimized.

[0121] S5, counting the load capacities corresponding to all vehicles in the primary screening set to obtain a screening load capacities, screening the vehicles in the primary screening set according to the screening load capacities and the required transport volume to obtain a secondary screening set, and controlling the vehicles in the secondary screening set to complete the transport.

[0122] After obtaining the first screening set, this solution will also conduct a second screening on the first screening set based on the screening load and the required transportation volume, so as to eliminate the redundant vehicles in the first screening set and reduce the waste of requisitioning vehicles.

[0123] Based on the above embodiment, the specific implementation method of "screening the vehicles in the primary screening set according to the screening load and the required transportation volume to obtain the secondary screening set" in step S5 can be:

[0124] S51, obtaining the remaining load capacity according to the difference between the filtered load capacity and the required transport capacity, and if there is a target vehicle with a load capacity less than or equal to the remaining load capacity in the primary filtered set, obtaining the target vehicle with a load capacity less than or equal to the remaining load capacity in the primary filtered set as the vehicle to be deleted.

[0125] It can be understood that the screening load capacity refers to the total load capacity of all target vehicles, and the remaining load capacity refers to the remaining load capacity after all target vehicles have completed loading the required transport volume. If there is a target vehicle with a load capacity less than or equal to the remaining load capacity in a screening set, it means that after deleting the target vehicle, the total load capacity of the remaining vehicles may also meet the required transport volume. The target vehicle is likely to be an extra target vehicle, so it can be used as a vehicle to be deleted for subsequent deletion screening.

[0126] The reason why the selected vehicles to be deleted are not deleted directly is that there may be multiple vehicles to be deleted. If they are deleted at one time, the total loading capacity of the remaining vehicles may not meet the required transportation capacity.

[0127] S52, obtaining a vehicle to be deleted with the smallest load among the vehicles to be deleted as a target vehicle to be deleted, deleting the target vehicle to be deleted in the primary screening set, and obtaining an updated primary screening set.

[0128] In actual applications, there may be multiple vehicles to be deleted, and the load capacity of each vehicle to be deleted may be different, so the vehicle to be deleted with the smallest load capacity can be selected for deletion.

[0129] Among them, if there are multiple vehicles with the smallest load to be deleted, one of them can be randomly selected for deletion.

[0130] S53, counting the updated load quantities corresponding to all vehicles in the updated primary filtering set, and obtaining the updated remaining quantity according to the difference between the updated load quantity and the required transport quantity; if there is no target vehicle with a load quantity less than or equal to the updated remaining quantity in the updated primary filtering set, then stopping the updating of the primary filtering set, and using the updated primary filtering set as the secondary filtering set.

[0131] After deleting the vehicle to be deleted, you can continue to count the updated loading quantity in the first filtering set, and then continue to obtain the updated remaining quantity based on the difference between the updated loading quantity and the required transportation quantity. If there is no target vehicle with a loading quantity less than or equal to the updated remaining quantity in the updated first filtering set, it means that there are no additional target vehicles in the updated first filtering set. At this time, you can stop updating the first filtering set and use the updated first filtering set as the secondary filtering set for the final screening.

[0132] S54, if there is a target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, repeat the above steps until there is no target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, stop updating the primary filtering set, and use the updated primary filtering set as the secondary filtering set.

[0133] If there are target vehicles with a loading amount less than or equal to the updated remaining amount in the updated primary filtering set, it means that there may still be extra target vehicles in the updated primary filtering set. You can continue to repeat the above steps until there are no extra target vehicles in the updated primary filtering set. You can stop updating the primary filtering set and use the updated primary filtering set as the secondary filtering set that has been finally filtered out.

[0134] Through the above method, redundant target vehicles can be further screened out, thereby reducing the waste of vehicle resources.

[0135] On the basis of the above scheme, this scheme also includes the following embodiments:

[0136] S55, obtaining target vehicles with consistent transport paths in the secondary screening set to generate multiple vehicle collection sets, counting the total number of vehicles corresponding to each of the vehicle collection sets, and obtaining the interface proportion corresponding to each of the vehicle collection sets according to the ratio of the total number of vehicles.

[0137] It is understandable that in order to display the retrieved vehicles, the present solution will also generate a corresponding vehicle dispatch interface to display the vehicle dispatch status to the user.

[0138] Specifically, this solution will first merge vehicles with the same path together to generate a vehicle retrieval set, and then obtain the interface ratio corresponding to each vehicle retrieval set based on the total number of vehicles in each vehicle retrieval set, and then obtain the sub-display interface corresponding to each vehicle retrieval set through this interface ratio.

[0139] S56, calling up an initial display interface, dividing the initial display interface according to a preset division direction and the interface proportion, to obtain sub-display interfaces corresponding to each of the called vehicle sets.

[0140] See also Figure 2 , which is a schematic diagram of a vehicle dispatching interface provided by an embodiment of the present invention. The above-mentioned preset division direction can be as follows Figure 2 The preset division direction shown in is the same as the division direction from top to bottom. In other embodiments, it can also be other division directions set in advance by the user.

[0141] S57, retrieve the vehicle icons corresponding to each target vehicle in the retrieved vehicle set, arrange each of the vehicle icons in a corresponding sub-display interface according to a preset arrangement direction, obtain multiple sub-vehicle display interfaces, and display the transportation paths corresponding to each retrieved vehicle set in the corresponding sub-vehicle display interface to obtain a vehicle scheduling interface.

[0142] The above-mentioned vehicle icon may be an icon set in advance by the user for each vehicle. When the vehicle attributes such as the specification type of the vehicle are the same, the same vehicle icon may be set for the corresponding vehicles.

[0143] like Figure 2 As shown, the above preset arrangement direction can be as follows Figure 2 The preset arrangement direction is the same as that in the embodiment, which is from left to right. In other embodiments, the preset arrangement direction may also be other preset arrangement directions set in advance by the user.

[0144] Through the above method, the vehicle dispatching status can be displayed through the vehicle dispatching interface, so that the user can intuitively understand the vehicle dispatching status.

[0145] An embodiment of the present invention provides a transportation data processing device, the transportation data processing device comprising:

[0146] An attribute module is used to parse the transport task to obtain a transport starting point, a transport end point and a required transport volume, obtain the shortest transport path according to the transport starting point and the transport end point, and segment the shortest transport path based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include a license plate restriction attribute, a vehicle type restriction attribute, a height restriction attribute and a load attribute;

[0147] A traffic module is used to count idle vehicles and vehicle attributes, determine sub-traffic vehicle sets corresponding to each restricted road section and each non-restricted path according to the vehicle attributes, and obtain the intersection of multiple sub-traffic vehicle sets to obtain the traffic vehicle set corresponding to the shortest transportation path;

[0148] A detour module, for generating detour sections corresponding to each of the restricted sections according to the detour strategy, updating the shortest transport path based on each of the detour sections to obtain a detour transport path corresponding to each of the restricted sections, determining an initial vehicle set obtained by an intersection of sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths based on the idle vehicle set, and removing duplicates from each of the initial vehicle sets based on the passable vehicle set to obtain a detour vehicle set corresponding to each detour transport path;

[0149] A screening module, used for sorting the passing vehicle set and the detour vehicle set according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and screening the vehicles in the vehicle set sequence according to a vehicle screening strategy and the required transport volume to obtain a screening set;

[0150] The screening weight module is used to count the load capacities corresponding to all vehicles in the primary screening set to obtain the screening load capacities, screen the vehicles in the primary screening set according to the screening load capacities and the required transport capacity to obtain the secondary screening set, and control the vehicles in the secondary screening set to complete the transport.

[0151] The apparatus of the above embodiment can be used to perform Figure 1 The implementation principles and technical effects of the steps in the method embodiment shown are similar and will not be repeated here.

[0152] See also Figure 3 , is a schematic diagram of the hardware structure of an electronic device provided by an embodiment of the present invention, the electronic device 40 includes: a processor 41, a memory 42 and a computer program; wherein

[0153] The memory 42 is used to store the computer program, and the memory may also be a flash memory. The computer program is, for example, an application program, a functional module, etc. for implementing the above method.

[0154] The processor 41 is used to execute the computer program stored in the memory to implement each step performed by the device in the above method. For details, please refer to the relevant description in the above method embodiment.

[0155] Optionally, the memory 42 may be independent or integrated with the processor 41 .

[0156] When the memory 42 is a device independent of the processor 41, the device may further include:

[0157] The bus 43 is used to connect the memory 42 and the processor 41 .

[0158] The present invention also provides a readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, it is used to implement the methods provided by the various embodiments described above.

[0159] Among them, the readable storage medium can be a computer storage medium or a communication medium. The communication medium includes any medium that facilitates the transmission of a computer program from one place to another. The computer storage medium can be any available medium that can be accessed by a general-purpose or special-purpose computer. For example, a readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be a component of the processor. The processor and the readable storage medium can be located in an application-specific integrated circuit (Application Specific Integrated Circuits, referred to as: ASIC). In addition, the ASIC can be located in a user device. Of course, the processor and the readable storage medium can also exist in a communication device as discrete components. The readable storage medium can be a read-only memory (ROM), a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc.

[0160] The present invention also provides a program product, which includes an execution instruction, which is stored in a readable storage medium. At least one processor of a device can read the execution instruction from the readable storage medium, and at least one processor executes the execution instruction so that the device implements the methods provided in the above various embodiments.

[0161] In the embodiments of the above-mentioned devices, it should be understood that the processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the present invention may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0162] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for processing transportation data, characterized in that: include: The transport task is parsed to obtain a transport starting point, a transport end point and a required transport volume, the shortest transport path is obtained according to the transport starting point and the transport end point, and the shortest transport path is segmented based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include a license plate restriction attribute, a vehicle type restriction attribute, a height restriction attribute and a load attribute; Counting idle vehicles and vehicle attributes, determining sub-passable vehicle sets corresponding to each restricted road section and each non-restricted road section according to the vehicle attributes, and obtaining the intersection of multiple sub-passable vehicle sets to obtain the passable vehicle set corresponding to the shortest transportation path; Generate detour sections corresponding to the restricted sections according to the detour strategy, update the shortest transport path based on the detour sections to obtain detour transport paths corresponding to the restricted sections, determine the intersection of the sub-passable vehicle sets of the remaining restricted sections in the detour transport paths based on the idle vehicle set, obtain the initial vehicle set, remove duplicates from the initial vehicle sets based on the passable vehicle set, and obtain the detour vehicle set corresponding to the detour transport paths; The passing vehicle set and the detour vehicle set are sorted according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and the vehicles in the vehicle set sequence are screened according to the vehicle screening strategy and the required transport volume to obtain a screened set; Counting the loads corresponding to all vehicles in the primary screening set to obtain a screening load, screening the vehicles in the primary screening set according to the screening load and the required transport volume to obtain a secondary screening set, and controlling the vehicles in the secondary screening set to complete the transport; The passing vehicle set and the detour vehicle set are sorted according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and the vehicles in the vehicle set sequence are screened according to the vehicle screening strategy and the required transport volume to obtain a screening set, including: sequentially counting the first total load corresponding to each vehicle set in the vehicle set sequence until the first total load is greater than or equal to the required transport volume, then stopping acquiring the vehicle sets, and taking the last acquired vehicle set as a first-category vehicle set, and taking all vehicle sets before the first-category vehicle set as a second-category vehicle set; All vehicles in the second type of vehicle set are taken as second target vehicles, the second total load corresponding to all the second type of vehicle sets is counted, and the remaining demand is obtained according to the difference between the required transport volume and the second total load; The vehicle set of the first category is used as candidate vehicles, demand information input by a user is received, the candidate vehicles are screened according to a vehicle screening strategy, the demand information and the remaining demand to obtain a first target vehicle, and a screening set is generated according to the first target vehicle and the second target vehicle; Receiving demand information input by a user, screening the candidate vehicles according to a vehicle screening strategy, the demand information and the remaining demand, and obtaining a first target vehicle, including: Parsing the demand information to obtain quantity screening information, acquiring a first loading capacity of each candidate vehicle based on the quantity screening information, and sorting the candidate vehicles from large to small according to the first loading capacity to obtain a first vehicle sequence; Acquire a candidate vehicle in the first vehicle sequence whose first load is greater than or equal to the remaining demand and whose first load is the smallest as the first vehicle, obtain a first remaining quantity according to the difference between the first load and the remaining demand of the first vehicle, and if the first remaining quantity is within a preset remaining quantity range, take the first vehicle as the first target vehicle; If the first vehicle does not exist in the first vehicle sequence, or the first remaining quantity is not within a preset remaining quantity range, an alternative vehicle whose first loading quantity is less than the remaining required quantity and whose first loading quantity is the largest in the first vehicle sequence is obtained as a second vehicle, and the first vehicle sequence is intercepted based on the second vehicle to obtain a second vehicle sequence; The second vehicle sequence is screened according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles.

2. The method according to claim 1, characterized in that: Generating detour sections corresponding to the restricted sections according to the detour strategy, and updating the shortest transportation path based on the detour sections to obtain detour transportation paths corresponding to the restricted sections, including: Acquire two sections of non-restricted road sections and / or restricted road sections adjacent to each of the restricted road sections to obtain an adjacent road section set corresponding to each of the restricted road sections, acquire a plurality of preset position points corresponding to each of the non-restricted road sections and / or the restricted road sections in the adjacent road section set, and generate a plurality of candidate road sections that bypass the corresponding restricted road sections based on a one-to-one combination of the plurality of preset position points corresponding to the adjacent non-restricted road sections and / or restricted road sections; The alternative road section with the shortest path length among multiple alternative road sections is selected as the detour road section corresponding to the corresponding restricted road section, and the shortest transportation path is updated based on each of the detour road sections to obtain the detour transportation path corresponding to each restricted road section.

3. The method according to claim 2, characterized in that Determine the intersection of sub-passable vehicle sets of the remaining restricted road sections in each of the detour transport paths based on the idle vehicle set to obtain an initial vehicle set, and remove duplicates from each of the initial vehicle sets based on the passable vehicle set to obtain a detour vehicle set corresponding to each detour transport path, including: Obtaining the intersection of the sub-vehicle sets corresponding to the remaining restricted sections in each of the detour transport routes, and obtaining the initial vehicle sets corresponding to each of the detour transport routes; The initial vehicle sets are compared with the passing vehicle sets, and the vehicles in the initial vehicle sets that are repeated with the passing vehicle sets are obtained and deleted, so as to obtain the detour vehicle sets corresponding to each detour transport path.

4. The method according to claim 1, characterized in that: The second vehicle sequence is screened according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles, including: The first candidate vehicle in the second vehicle sequence is obtained as the first selected vehicle, and a second remaining quantity is obtained according to the difference between the remaining demand quantity and the first loading quantity of the first selected vehicle, and a candidate vehicle in the second vehicle sequence whose first loading quantity is greater than or equal to the second remaining quantity and whose first loading quantity is the smallest is obtained as the second selected vehicle, and both the first selected vehicle and the second selected vehicle are used as the first target vehicles; If the second selected vehicle does not exist in the second vehicle sequence, the first selected vehicle is deleted to obtain an updated second vehicle sequence, the first candidate vehicle in the updated second vehicle sequence is continuously obtained as the next first selected vehicle, and an updated second remaining quantity is obtained according to the difference between the second remaining quantity and the first loading quantity of the next first selected vehicle; Repeat the above steps until the total load capacity of all first selected vehicles and second selected vehicles meets the remaining demand, and stop the above steps, and use the obtained first selected vehicles and second selected vehicles as the first target vehicles.

5. The method according to claim 1, characterized in that The vehicles in the primary screening set are screened according to the screening load and the required transport volume to obtain a secondary screening set, including: Obtain the remaining load capacity according to the difference between the screening load capacity and the required transport capacity, and if there is a target vehicle with a load capacity less than or equal to the remaining load capacity in the primary screening set, obtain the target vehicle with a load capacity less than or equal to the remaining load capacity in the primary screening set as a vehicle to be deleted; Obtain a to-be-deleted vehicle with the smallest load in the to-be-deleted vehicles as a target to-be-deleted vehicle, delete the target to-be-deleted vehicle in the primary screening set, and obtain an updated primary screening set; Count the updated loads corresponding to all vehicles in the updated primary screening set, and obtain the updated remaining amount according to the difference between the updated load and the required transport amount. If there is no target vehicle with a load less than or equal to the updated remaining amount in the updated primary screening set, stop updating the primary screening set, and use the updated primary screening set as the secondary screening set. If there is a target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, repeat the above steps until there is no target vehicle with a load less than or equal to the updated remaining amount in the updated primary filtering set, stop updating the primary filtering set, and use the updated primary filtering set as the secondary filtering set.

6. The method according to claim 5, characterized in that Also includes: Obtain target vehicles with consistent transport paths in the secondary screening set to generate multiple vehicle collection sets, count the total number of vehicles corresponding to each of the vehicle collection sets, and obtain the interface proportion corresponding to each of the vehicle collection sets according to the ratio of the total number of vehicles; Retrieving an initial display interface, dividing the initial display interface according to a preset division direction and the interface proportion, and obtaining sub-display interfaces corresponding to each of the retrieved vehicle sets; Retrieve the vehicle icons corresponding to each target vehicle in the retrieved vehicle set, arrange each of the vehicle icons in a corresponding sub-display interface according to a preset arrangement direction, obtain a plurality of sub-vehicle display interfaces, and display the transportation paths corresponding to each retrieved vehicle set in the corresponding sub-vehicle display interface to obtain a vehicle dispatch interface.

7. A transportation data processing device, characterized in that: include: An attribute module is used to parse the transport task to obtain a transport starting point, a transport end point and a required transport volume, obtain the shortest transport path according to the transport starting point and the transport end point, and segment the shortest transport path based on restriction attributes to obtain restricted sections and non-restricted sections, wherein the restriction attributes at least include a license plate restriction attribute, a vehicle type restriction attribute, a height restriction attribute and a load attribute; A traffic module is used to count idle vehicles and vehicle attributes, determine sub-traffic vehicle sets corresponding to each restricted road section and each non-restricted road section according to the vehicle attributes, and obtain the intersection of multiple sub-traffic vehicle sets to obtain the traffic vehicle set corresponding to the shortest transportation path; A detour module, for generating detour sections corresponding to each of the restricted sections according to the detour strategy, updating the shortest transport path based on each of the detour sections to obtain a detour transport path corresponding to each of the restricted sections, determining an initial vehicle set obtained by an intersection of sub-passable vehicle sets of the remaining restricted sections in each of the detour transport paths based on the idle vehicle set, and removing duplicates from each of the initial vehicle sets based on the passable vehicle set to obtain a detour vehicle set corresponding to each detour transport path; A screening module, used for sorting the passing vehicle set and the detour vehicle set according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and screening the vehicles in the vehicle set sequence according to a vehicle screening strategy and the required transport volume to obtain a screening set; A screening weight module is used to count the loads corresponding to all vehicles in the primary screening set to obtain a screening load, screen the vehicles in the primary screening set according to the screening load and the required transportation volume to obtain a secondary screening set, and control the vehicles in the secondary screening set to complete transportation; The passing vehicle set and the detour vehicle set are sorted according to the path lengths of the shortest transport path and the detour transport path to obtain a vehicle set sequence, and the vehicles in the vehicle set sequence are screened according to the vehicle screening strategy and the required transport volume to obtain a screening set, including: sequentially counting the first total load corresponding to each vehicle set in the vehicle set sequence until the first total load is greater than or equal to the required transport volume, then stopping acquiring the vehicle sets, and taking the last acquired vehicle set as a first-category vehicle set, and taking all vehicle sets before the first-category vehicle set as a second-category vehicle set; All vehicles in the second type of vehicle set are taken as second target vehicles, the second total load corresponding to all the second type of vehicle sets is counted, and the remaining demand is obtained according to the difference between the required transport volume and the second total load; The vehicle set of the first category is used as candidate vehicles, demand information input by a user is received, the candidate vehicles are screened according to a vehicle screening strategy, the demand information and the remaining demand to obtain a first target vehicle, and a screening set is generated according to the first target vehicle and the second target vehicle; Receiving demand information input by a user, screening the candidate vehicles according to a vehicle screening strategy, the demand information and the remaining demand, and obtaining a first target vehicle, including: Parsing the demand information to obtain quantity screening information, acquiring a first loading capacity of each candidate vehicle based on the quantity screening information, and sorting the candidate vehicles from large to small according to the first loading capacity to obtain a first vehicle sequence; Acquire a candidate vehicle in the first vehicle sequence whose first load is greater than or equal to the remaining demand and whose first load is the smallest as the first vehicle, obtain a first remaining quantity according to the difference between the first load and the remaining demand of the first vehicle, and if the first remaining quantity is within a preset remaining quantity range, take the first vehicle as the first target vehicle; If the first vehicle does not exist in the first vehicle sequence, or the first remaining quantity is not within a preset remaining quantity range, an alternative vehicle whose first loading quantity is less than the remaining required quantity and whose first loading quantity is the largest in the first vehicle sequence is obtained as a second vehicle, and the first vehicle sequence is intercepted based on the second vehicle to obtain a second vehicle sequence; The second vehicle sequence is screened according to the remaining demand and the first loading capacity of each candidate vehicle in the second vehicle sequence to obtain a plurality of first target vehicles.