Single-ticket freight transportation track processing method, system and device based on multi-source heterogeneous data

Abstract

The application relates to a single-ticket freight transport track processing method, system and equipment based on multi-source heterogeneous data, which comprises the following steps: acquiring basic data and transport process data of a single-ticket freight; according to a query instruction of a logistics waybill, a transport line is spliced according to a transport standard process; if a line track is missing in the splicing process, a track point corresponding to a missing track area is supplemented based on a preset space-time data intelligent supplement algorithm, a supplementary track corresponding to the missing track area is generated through a preset logistics priority path planning algorithm, and a complete transport track of the single-ticket freight is formed; and the complete transport track of the single-ticket freight is displayed on a visual track map. According to the scheme, the logistics track of the single-ticket freight can be obtained by integrating multi-source heterogeneous data, the missing track can be supplemented, and the complete transport track can be visually displayed, so that the transparency and traceability of logistics transport are improved, manual intervention is reduced, and the logistics management efficiency is improved.

Description

Technical Field

[0001] This application relates to the field of logistics data processing technology, and in particular to a method, system and equipment for processing single-shipment transportation trajectories based on multi-source heterogeneous data. Background Technology

[0002] Managing the entire process of a single shipment from dispatch to delivery typically relies on a segmented, modular management architecture. Order management systems, warehouse management systems, transportation management systems, and last-mile delivery systems, as independent functional units, are responsible for different stages of the logistics chain. These systems often synchronize basic information through limited, batch data interfaces, or rely more heavily on manual data entry and transmission between different platforms.

[0003] This technical architecture results in the fragmented recording and storage of the complete flow status of a single shipment across multiple heterogeneous systems. When it is necessary to trace the real-time location of goods or understand their current operational stage, operators have to log into different management systems sequentially for scattered queries, and then manually summarize and verify the fragmented information. This process is not only time-consuming, but also makes it difficult to guarantee the accuracy and timeliness of the information, thus restricting the transparency and traceability of the entire logistics process. In particular, the lack of a complete end-to-end logistics trajectory map for a single shipment makes it difficult for operators to promptly identify unreasonable trajectory segments in the transportation path, and data gaps often occur during transportation. For example, key information such as loading and unloading locations and timestamps are often incomplete at certain stages. The lack of an effective trajectory completion mechanism means that the transportation trajectory of a single shipment cannot be completed in real time, further affecting the quality and efficiency of logistics transportation. Summary of the Invention

[0004] To address or partially address the problems existing in related technologies, this application provides a method, system, and device for processing single-shipment transportation trajectories based on multi-source heterogeneous data. By integrating multi-source heterogeneous data, the logistics trajectory of a single shipment is obtained, and the missing trajectory can be intelligently completed and the complete transportation trajectory can be visualized. This achieves automatic integration and intelligent completion of single-shipment transportation trajectories, and displays different transportation links of the single-shipment transportation trajectory in different display formats, thereby improving the transparency and traceability of logistics transportation, reducing manual intervention, and improving logistics management efficiency.

[0005] The first aspect of this application provides a method for processing the transportation trajectory of a single shipment based on multi-source heterogeneous data. This method includes acquiring basic data and transportation process data for the single shipment. The transportation process data includes at least multi-source heterogeneous data generated at each stage of the single shipment's transportation, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation stage data includes at least pickup and delivery, trunk line transportation, charter / airport transfer, and agent transfer. Based on the query instructions of the logistics waybill, the transportation route is spliced ​​according to the standard transportation process. If a missing route trajectory occurs during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on a preset spatiotemporal data intelligent completion algorithm. A preset logistics priority path planning algorithm is then used to generate a supplementary trajectory corresponding to the missing trajectory area, forming the complete transportation trajectory of the single shipment. The complete transportation trajectory of the single shipment is then displayed on a visualized trajectory map.

[0006] The second aspect of this application provides a single-shipment cargo transportation trajectory processing system based on multi-source heterogeneous data, comprising: an acquisition module for acquiring basic data and transportation process data of a single shipment, wherein the transportation process data includes at least multi-source heterogeneous data generated by each transportation link of the single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data, and the transportation link data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer; a processing module for performing data cleaning and standard format conversion on the transportation process data of the single shipment; a generation module for splicing transportation routes according to the query instructions of the logistics waybill and in accordance with the standard transportation process, wherein if a trajectory is missing during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on a preset spatiotemporal data intelligent completion algorithm, and a supplementary trajectory corresponding to the missing trajectory area is generated through a preset logistics priority path planning algorithm to form the complete transportation trajectory of the single shipment; and a display module for displaying the complete transportation trajectory of the single shipment on a visualized trajectory map.

[0007] A third aspect of this application provides an electronic device, comprising:

[0008] Processor; and

[0009] A memory that stores executable code, which, when executed by the processor, causes the processor to perform the method described above.

[0010] The technical solution provided in this application may include the following beneficial effects:

[0011] This application discloses a method, system, and device for processing single-shipment transportation trajectories based on multi-source heterogeneous data. The method includes acquiring basic data and transportation process data for a single shipment. The transportation process data includes at least multi-source heterogeneous data generated at each stage of transportation for the single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation stage data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer. Based on the query instructions of the logistics waybill, the transportation route is spliced ​​according to the standard transportation process. If a missing route trajectory occurs during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on a preset spatiotemporal data intelligent completion algorithm. A preset logistics priority path planning algorithm is used to generate a supplementary trajectory corresponding to the missing trajectory area, forming a complete transportation trajectory for the single shipment. The complete transportation trajectory of the single shipment is displayed on a visualized trajectory map. This method integrates heterogeneous data from multiple sources to obtain the logistics trajectory of a single shipment, and can intelligently complete missing trajectories and visualize the complete transportation trajectory. It realizes the automatic integration and intelligent completion of the transportation trajectory of a single shipment, and displays different transportation links of the transportation trajectory of a single shipment in different display formats, thereby improving the transparency and traceability of logistics transportation, reducing manual intervention, and improving logistics management efficiency.

[0012] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0013] The above and other objects, features and advantages of this application will become more apparent from the more detailed description of exemplary embodiments thereof in conjunction with the accompanying drawings, wherein the same reference numerals generally represent the same components in the exemplary embodiments thereof.

[0014] Figure 1 This is a schematic flowchart illustrating a single-ticket cargo transportation trajectory processing method based on multi-source heterogeneous data, as shown in an embodiment of this application.

[0015] Figure 2 This is a schematic diagram of the structure of a single-ticket cargo transportation trajectory processing system based on multi-source heterogeneous data, as shown in an embodiment of this application.

[0016] Figure 3 This is a schematic diagram of the structure of an electronic device shown in an embodiment of this application. Detailed Implementation

[0017] Embodiments of this application will now be described in more detail with reference to the accompanying drawings. While embodiments of this application are shown in the drawings, it should be understood that this application may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided to make this application more thorough and complete, and to fully convey the scope of this application to those skilled in the art.

[0018] The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The singular forms “a,” “the,” and “the” used in this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.

[0019] It should be understood that although the terms "first," "second," "third," etc., may be used in this application to describe various information, this information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this application, "multiple" means two or more, unless otherwise explicitly specified.

[0020] Managing the entire process of a single shipment from dispatch to delivery typically relies on a segmented, modular management architecture. Order management systems, warehouse management systems, transportation management systems, and last-mile delivery systems, as independent functional units, are responsible for different stages of the logistics chain. These systems often synchronize basic information through limited, batch data interfaces, or rely more heavily on manual data entry and transmission between different platforms.

[0021] This technical architecture results in the fragmented recording and storage of the complete flow status of a single shipment across multiple heterogeneous systems. When it is necessary to trace the real-time location of goods or understand their current operational stage, operators have to log into different management systems sequentially for scattered queries, and then manually summarize and verify the fragmented information. This process is not only time-consuming, but also makes it difficult to guarantee the accuracy and timeliness of the information, thus restricting the transparency and traceability of the entire logistics process. In particular, the lack of a complete end-to-end logistics trajectory map for a single shipment makes it difficult for operators to promptly identify unreasonable trajectory segments in the transportation path, and data gaps often occur during transportation. For example, key information such as loading and unloading locations and timestamps are often incomplete at certain stages. The lack of an effective trajectory completion mechanism means that the transportation trajectory of a single shipment cannot be completed in real time, further affecting the quality and efficiency of logistics transportation.

[0022] To address the aforementioned issues, this application provides a method, system, and device for processing single-shipment transportation trajectories based on multi-source heterogeneous data. By integrating multi-source heterogeneous data, the logistics trajectory of a single shipment is obtained. It can intelligently complete missing trajectories and visualize the complete transportation trajectory, achieving automatic integration and intelligent completion of single-shipment transportation trajectories. Different transportation links of the single-shipment transportation trajectory are displayed in different display formats, improving the transparency and traceability of logistics transportation, reducing manual intervention, and enhancing logistics management efficiency.

[0023] The technical solutions of the embodiments of this application are described in detail below with reference to the accompanying drawings.

[0024] Figure 1 This is a flowchart illustrating a single-ticket freight transport trajectory processing method based on multi-source heterogeneous data, as shown in an embodiment of this application.

[0025] See Figure 1 A method for processing single-ticket freight transport trajectories based on multi-source heterogeneous data, comprising:

[0026] S110: Obtain basic data and transportation process data for a single shipment. The transportation process data shall include at least multi-source heterogeneous data generated at each stage of transportation for a single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation stage data shall include at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer.

[0027] Specifically, a single shipment refers to a unit of goods involved in a complete transportation task from the shipper to the consignee during the logistics process. The multi-source heterogeneous data corresponding to a single shipment can exist in different systems and have different formats and structural characteristics. For example, different multi-source heterogeneous data can exist in pickup and delivery systems, trunk line scheduling systems, air / charter management platforms, agency business systems, etc. Multi-source heterogeneous data corresponding to a single shipment can be obtained from different systems. The basic data of a single shipment can include user information, address information, etc. Transportation process data is detailed information about each stage a single shipment experiences throughout the entire transportation process. This data includes at least loading location, unloading location, start time, end time, transportation mode, and cost data, which can be used to describe the status and attributes of goods at different transportation stages. Transportation link data refers to the various independent stages a single shipment experiences in the transportation process. For example, the pickup and delivery stage is responsible for the collection and final delivery of goods; the trunk line transportation stage is responsible for long-distance transportation of goods on major transportation routes; the charter / airport transfer stage involves the transfer of goods using specific vehicles or air transport; and the agency transfer stage refers to the handover of goods between different logistics service providers.

[0028] Specifically, after obtaining single-shipment data from different logistics systems, the transportation process data can be cleaned and converted to a standard format. For example, empty values ​​or duplicate records in the data can be identified and deleted, and all time fields can be uniformly converted to the "YYYY-MM-DD HH:MM:SS" format. Address text can be converted to a consistent province, city, district, and street format to integrate transportation process data from different logistics systems, so that the transportation process data of single shipments can be directly used to integrate transportation trajectories in the future.

[0029] S120: Based on the query instructions of the logistics waybill, the transportation route is spliced ​​according to the standard transportation process. If the route trajectory is missing during the splicing process, the trajectory points corresponding to the missing area are filled in based on the preset spatiotemporal data intelligent completion algorithm, and the supplementary trajectory corresponding to the missing area is generated through the preset logistics priority path planning algorithm to form a complete transportation trajectory for a single shipment.

[0030] Specifically, the standard transportation process can be a predefined transportation process for a single shipment. When splicing the transportation routes of a single shipment, the starting and ending positions of each transportation link can be connected in chronological order to form a continuous route. When a geographical break or temporal gap is found between the ending position of a link and the starting position of the next link, i.e., a missing route trajectory occurs during the splicing process, the trajectory points corresponding to the missing trajectory area can be filled in according to the preset spatiotemporal data intelligent completion algorithm. After the trajectory points are filled in, the corresponding supplementary trajectory for the missing trajectory area can be generated by the preset logistics priority path planning algorithm. This supplementary trajectory is a geographical path generated in the missing route trajectory area, and finally forms the complete geographical path of a single shipment from the starting point to the final destination, i.e., the complete transportation trajectory of a single shipment.

[0031] S130: Displays the complete transportation trajectory of a single shipment on a visualized trajectory map.

[0032] Specifically, after obtaining the complete transportation trajectory of a single shipment, all the stitched trajectory points can be directly loaded onto the map interface and connected to each other, allowing users to perform basic map zooming and panning operations. This processing method enables staff to more quickly grasp the real-time location and historical path of goods, thereby more rapidly identifying potential anomalies such as route detours and trajectory errors, ultimately improving the efficiency and management level of logistics operations.

[0033] For example, if a single shipment is from location A to location B, its transportation process includes three core stages: pickup and delivery, trunk transportation, and delivery. The pickup and delivery management system can be used to obtain the loading location (location A), unloading location (distribution center X), start time, end time, and transportation mode (e.g., van) for the pickup stage. Simultaneously, the trunk transportation system can be used to obtain the loading location (distribution center X), unloading location (distribution center Y), start time, end time, and transportation mode (e.g., heavy truck) for the trunk transportation stage, and the delivery management system can be used to obtain the loading location (distribution center Y), unloading location (location B), start time, end time, and transportation mode (e.g., electric tricycle) for the delivery stage. Then, this acquired transportation process data undergoes data cleaning and standard format conversion. Redundant records caused by repeated uploads in the trunk transportation data are identified and removed. The timestamps of all stages are uniformly converted to the standard format "YYYY-MM-DD HH:MM:SS," and all address descriptions (such as "location A" and "distribution center X") are converted to a unified latitude and longitude coordinate representation. Then, based on the query instructions of the logistics waybill, the transportation route is spliced ​​according to the preset standard transportation process. First, the trajectory of the pickup stage (from location A to distribution center X) is connected with the trajectory of the trunk transportation stage (from distribution center X to distribution center Y). During the splicing process, a missing route trajectory between distribution center X and distribution center Y is detected in the trunk transportation stage. At this time, a shortest driving route from distribution center X to distribution center Y is generated as a supplementary trajectory based on the preset spatiotemporal data intelligent completion algorithm, with distribution center X as the starting point and distribution center Y as the ending point, by calling the path planning interface of the basic map service. Subsequently, the supplementary trajectory is inserted into the trunk transportation process and connected with the delivery trajectory (from distribution center Y to location B) to obtain the complete transportation trajectory of the single shipment from location A to location B. Finally, the complete transportation trajectory of the single shipment is displayed on a visualized trajectory map. Users can see the pickup trajectory from location A to distribution center X, the trunk transportation trajectory from distribution center X to distribution center Y (including the path completed by the algorithm), and the delivery trajectory from distribution center Y to location B on the map. The trajectory segments can be displayed in different styles, and users can view the overall path using the map's zoom and pan functions.

[0034] In one possible implementation, the spatiotemporal data intelligent completion algorithm includes: if the trajectory end position of the previous transportation link is missing in the trajectory missing area, and the spatial distance between the trajectory start position of the next transportation link and the trajectory end position of the previous transportation link is less than a preset distance threshold and the time interval is less than a preset time threshold, then the trajectory end position of the previous transportation link is completed using the trajectory start position of the next transportation link, and a supplementary trajectory corresponding to the trajectory interruption area is generated; if the trajectory end position of the final transportation link is missing in the trajectory missing area, then historical shipment data of the target customer corresponding to a single shipment is obtained, and the trajectory end position of the final transportation link is completed based on the commonly used delivery address of the historical shipment data and the basic data of the single shipment, and a supplementary trajectory corresponding to the trajectory interruption area is generated; if the transportation link only includes text address information, then the address parsing engine is called to parse the text address information, convert the text address information into standard latitude and longitude coordinates, obtain the trajectory start position and trajectory end position of the transportation link, and generate a supplementary trajectory corresponding to the trajectory interruption area.

[0035] Specifically, preset distance and time thresholds can be set in advance, for example, a preset distance threshold of 5 kilometers and a preset time threshold of 2 hours. This allows monitoring of trajectory data in adjacent transportation stages. If the end position of the previous stage is missing and the preset spatial distance and time interval thresholds are met, trajectory completion is performed. If the delivery address in the final delivery stage of a single shipment is unclear, it can be supplemented using the user's historical shipment data. Historical shipment data and frequently used delivery addresses are the customer's past transportation records and frequently used delivery location information. For example, the customer's historical delivery address records can be obtained from the Customer Relationship Management System (CRM) or Order Management System (OMS). When the end position of the final trajectory is missing, the customer's historical frequently used address is matched first. If the original data only contains text descriptions of address information, the address parsing API provided by a third-party map service can be called to convert the text address into latitude and longitude coordinates to obtain the trajectory start and end positions corresponding to the transportation stage. Through the above trajectory completion methods, various complex and ever-changing trajectory missing scenarios can be effectively dealt with, ensuring that the generated complete transportation trajectory of a single shipment has higher accuracy and completeness, and significantly improving the usability of trajectory data.

[0036] For example, if the transportation trajectory of a single shipment is missing from the trunk line to the final delivery point: First, if it is detected that the end position of the trunk line transportation trajectory is not recorded, but the spatial distance between the starting position of the subsequent final delivery trajectory and the last known position of the trunk line transportation is less than a preset distance threshold and the time interval is less than a preset time threshold, then the starting position of the delivery trajectory can be used to complete the end position of the trunk line transportation trajectory, and a supplementary trajectory for the interrupted area can be generated; if the end position of the final delivery trajectory (i.e., the final delivery address) is also missing, then the historical shipment data of the receiving customer can be queried to find that the customer frequently receives goods at a specific address, and that address is consistent with the current shipment. If the basic data of the shipment (such as the recipient's name and contact information) matches, the end position of the trajectory in the final transportation link can be completed based on the commonly used delivery address. If, in a certain transportation link, the original data only provides text address information such as "Zhongguancun Software Park, Haidian District, Beijing" without specific latitude and longitude coordinates, the address parsing engine will be called to parse the text address into precise latitude and longitude coordinates, thereby obtaining the start or end position of the trajectory in that transportation link, and generating the corresponding trajectory segment accordingly. In these ways, missing trajectory information can be corrected to generate a coherent and complete single shipment transportation trajectory.

[0037] In one possible implementation, a pre-defined logistics priority path planning algorithm is used to generate supplementary trajectories for areas with missing trajectories. This includes: determining the end position of the previous transportation trajectory as the planning start point and the start position of the next transportation trajectory as the planning end point; performing a graph search algorithm constrained by transportation costs on the planning start point and the planning end point to obtain one or more feasible paths from the planning start point to the planning end point; wherein the graph search algorithm prioritizes searching for feasible paths with the highest overlap with historical paths; selecting the shortest first feasible path, the second feasible path with the most calls, and the third feasible path with the shortest time from the feasible paths; calculating the transportation costs corresponding to the first feasible path, the second feasible path, and the third feasible path, respectively; and determining the feasible path with the lowest transportation cost and a transportation time within a pre-defined time range as the supplementary trajectory.

[0038] Specifically, graph search algorithms are computational methods for finding paths in graph-structured data, such as Dijkstra's algorithm. Nodes in a graph can represent logistics hubs, road intersections, or geographical locations, while edges represent roads or transportation routes connecting these nodes. Edge weights can incorporate factors such as distance, time, and cost. Constrained by transportation costs, the algorithm considers the potential transportation cost of each path during the search process, excluding paths with excessively high costs and prioritizing feasible paths with the highest overlap with historical paths. For example, in graph search, edges or nodes overlapping with historical paths are assigned higher weights or lower costs, guiding the algorithm to prioritize these paths and selecting the first, second, and third feasible paths. Three feasible routes are identified, and the transportation costs corresponding to the first, second, and third feasible routes are calculated separately. Transportation costs may include fuel consumption, toll fees, labor costs, vehicle depreciation, and cargo insurance. Different cost accounting methods exist for different modes of transportation. For example, land transportation costs may be related to mileage, vehicle type, load capacity, and fuel prices; air transportation costs may be related to cargo weight, volume, and flight route. The feasible route with the lowest cost and delivery time meeting the preset time range is determined. The preset time range can be set according to the type of goods, customer service level, and contractual agreements. For example, the time range can be set more narrowly for fresh goods and more leniently for general goods.

[0039] In one possible implementation, a preset logistics priority path planning algorithm is used to generate supplementary trajectories for missing areas by using the end position of the previous transportation trajectory as the planning start point and the end position of the next transportation trajectory as the planning end point. Specifically, this includes: obtaining the throughput, transportation frequency, and weight values ​​of logistics parks, distribution stations, and points; selecting weight nodes with weights greater than a preset weight threshold for actual logistics operation network planning; applying path constraints based on the characteristics of different transportation modes, including land and air transportation; and optimizing the supplementary path using real-time traffic data constraints, including real-time congestion index and traffic accidents.

[0040] Specifically, throughput and transportation frequency are parameters reflecting the processing capacity of logistics nodes. By assigning weights to these parameters, nodes with strong processing capacity and high transportation frequency can be prioritized in route planning, thereby improving logistics efficiency and reliability. Logistics stations with high throughput or high transportation frequency can be given higher weights. Different basic weights can be preset for different types of logistics nodes, and then dynamically adjusted in combination with real-time throughput and transportation frequency. This allows for the selection of nodes with high importance or processing capacity in the logistics network for route planning. Different transportation modes have different timeliness, costs, capacity limitations, and applicable scopes, so more realistic logistics routes can be selected during planning. For example, before route planning, available combinations of transportation modes can be pre-selected based on the characteristics of the goods and customer needs, and then route planning can be performed. In addition, the route can be optimized by combining real-time traffic data. For example, real-time traffic data can be obtained by calling third-party map service APIs to increase the travel time cost of congested road sections or mark road sections where traffic accidents have occurred as impassable.

[0041] For example, when calculating the weight values ​​of different logistics nodes, the throughput of logistics parks, distribution stations, and points can be converted into standard cargo tonnage and classified according to the average monthly transportation frequency (e.g., a coefficient of 1.2 for a level A node). The static basic weight of the location is calculated using the algorithm of "node level coefficient × throughput equivalent". This ensures that different logistics nodes are comparable on the same scale, providing a stable network framework for route planning. "Timeliness urgency" and "operational status" are introduced as dynamic adjustment factors. When a logistics node experiences overload, congestion, or decreased efficiency, the system automatically lowers its dynamic weight, preventing the logistics priority route planning algorithm from blindly guiding vehicles into high-load nodes and providing accurate input for subsequent route planning. Route constraints can include basic traffic constraints and transportation mode constraints. Basic traffic constraints can use physical and regulatory constraints such as height restrictions, weight restrictions, truck traffic restrictions during certain times, and road grades as pre-filters for route planning. Any supplementary route (landside link of land or air transport) is eliminated during the algorithm search phase to ensure the physical feasibility of the route. The transportation mode constraints include land transport supplementary route methods and air transport supplementary route methods. The land transport supplementary route method can, under the premise of meeting basic traffic constraints, plan the route to move closer to highway entrances and exits and national and provincial trunk road hub nodes to form a "trunk line attraction" effect to improve the efficiency of land trunk line transportation. The air transport supplementary route method can concretize "proximity to airport cargo channels" into time window constraints. When planning, it is combined with the flight cut-off time to ensure that the ground supplementary route enters the airport cargo terminal geofence within the specified time to achieve seamless land and air connection. This route constraint can upgrade the difference between transportation modes from "passive avoidance" to "active adaptation", which not only ensures the compliance of the route, but also improves the connection efficiency in multimodal transport scenarios. Real-time traffic data constraints can acquire real-time traffic conditions, such as traffic big data, accident information, and traffic control notices from multiple sources. Congestion index and accident handling time are converted into dynamic edge costs. Then, the delays caused by real-time traffic conditions are converted into node weight decay coefficients. When a critical road segment leading to a high-weight node experiences severe congestion or an accident, the system dynamically reduces the real-time weight of that node to proactively detour that road, avoiding the situation of "knowingly going through congestion." A sliding time window mechanism is adopted to rescan the traffic conditions of untraveled road segments every 5-10 minutes. If a sudden congestion occurs ahead, a detour plan is automatically calculated. When the total time after the detour is better than the remaining time of the original path and the difference exceeds a set threshold (which can be preset, for example, 10 minutes), dynamic path replanning is performed.

[0042] For example, the trunk transportation trajectory of a single shipment is missing in a certain area. The trajectory of the previous transportation link ends at distribution station A, and the trajectory of the next transportation link ends at distribution station B. In this case, a preset logistics priority path planning algorithm can be used to evaluate the throughput and transportation frequency of all potential intermediate logistics nodes (such as logistics park C and transfer point D) between distribution stations A and B. Based on preset weight thresholds, nodes with strong processing capacity and high transportation frequency, such as logistics park C, are prioritized. Since this segment of transportation is trunk land transportation, the algorithm will apply land transportation-related path constraints, such as considering highway networks and truck restrictions. At the same time, real-time traffic data for all feasible paths between distribution station A and distribution station B is acquired, including highway congestion index and whether there are any traffic accident reports. If a route is expected to take too long due to congestion, or is impassable due to an accident, the route will be automatically adjusted to select the most optimized alternative route that best meets the logistics timeliness requirements. For example, it may avoid the congested GXX Expressway, choose SXX Provincial Highway, and pass through the high-throughput C Logistics Park, ultimately generating a supplementary trajectory from distribution station A to distribution station B.

[0043] In one possible implementation, the method further includes: if the transportation process includes at least two unloading locations, obtaining several candidate trajectories between the loading location and each unloading location in the transportation process; sorting the transportation times of the candidate trajectories in reverse chronological order, and selecting the candidate trajectory with the shortest time as the target trajectory between the trajectory start location and the trajectory end location; if there are at least two candidate trajectories with the shortest time, calculating the logistics cost corresponding to the candidate trajectories, and selecting the candidate trajectory with the lowest logistics cost as the target trajectory; and displaying the target trajectory on a visual trajectory map with a preset special identifier.

[0044] Specifically, when generating transportation trajectories, if there are multiple unloading points in the transportation process, candidate trajectories from the loading location to each unloading location can be generated from the loading location and all known unloading locations. From multiple candidate trajectories, a preliminary screening is performed based on the principle of time efficiency to determine the actual transportation route. If a unique target trajectory cannot be determined in terms of time, the more economical route is selected. For example, the logistics cost of each trajectory can be calculated based on a preset cost model (e.g., considering factors such as mileage, fuel consumption, toll fees, and labor costs), and the trajectory with the lowest cost can be selected. Then, the target transportation trajectory determined after screening is distinguished from other possible trajectories. For example, on a visualized trajectory map, the target trajectory is displayed with a specific color and line type (e.g., a thick solid line).

[0045] For example, when a single shipment is loaded at location A and needs to be delivered to three unloading locations at locations B, C, and D, a Geographic Information System (GIS) service can be used to obtain all possible transportation routes between A and B, A and C, and A and D. For instance, there may be multiple highways or national roads from A to B, and multiple routes from A to C; these will all be considered as candidate routes. Next, real-time traffic data and historical average path speeds can be used to estimate the estimated transportation time for each candidate route. For example, route 1 from A to B is estimated to take 3 hours, route 2 is estimated to take 3.5 hours; route 3 from A to C is estimated to take 2.8 hours, route 4 is estimated to take 3 hours; and route 5 from A to D is estimated to take 4 hours. These candidate routes are then sorted according to their estimated transportation time; for example, route 3 (2.8 hours) is the shortest, and thus route 3 is initially selected as the target route. If both route 3 (A to C) and route 6 (A to D) are estimated to take 2.8 hours, the system will further calculate the logistics costs of these two routes. For example, route 3 might have a total cost of 200 yuan for fuel and tolls, while route 6 might have a total cost of 220 yuan. The system will then select route 3, which has the lower logistics cost, as the final target route. Finally, on the visualized route map, the target route (e.g., route 3 from A to C) will be displayed as a thick red solid line, while other unselected candidate routes will be either not displayed or displayed as gray dashed lines, clearly indicating the optimal route for that transportation segment.

[0046] In one possible implementation, the method further includes: in response to a first preset operation on any transport trajectory in the visualized trajectory map, displaying first information associated with the transport trajectory, the first information including at least the start and end times, transport distance, or cost information of the transport trajectory; in response to a second preset operation on any trajectory node in the visualized trajectory map, displaying second information associated with the trajectory node, the second information including at least the name of the trajectory node, the dwell time at the node, or personnel information; in response to a third preset operation on the visualized trajectory map targeting a target area, displaying third information of all transport trajectories within the target area, the third information including at least the total mileage or average speed of the transport trajectories; in response to a fourth preset operation on the visualized trajectory map, adjusting the display format of the visualized trajectory map; wherein the fourth preset operation includes a 2D / 3D map switching operation, a zoom operation, and a pan operation; and in response to a fifth preset operation on the timeline in the visualized trajectory map, playing the transport trajectory of a single shipment on the visualized map according to the timeline.

[0047] Specifically, the first and second preset operations can be mouse clicks and hovering, while the third preset operation can be a selection operation. When a user performs the first preset operation on a transportation trajectory, detailed data related to the selected trajectory can be displayed, such as the start and end times of the trajectory segment, the actual transportation distance, the transportation costs incurred, carrier information, or the type of transportation used. When a user performs the second preset operation on a trajectory node, the specific name of the node, the dwell time at the node, the personnel responsible for operating the node, or the facility type and capacity of the node can be displayed. Users can drag and drop a rectangle to select an area, where the total mileage, average speed, freight volume passing through the area, or average transportation time within the area can be displayed. The fourth preset operation allows users to adjust the display method of the visualized trajectory map, including 2D / 3D map switching, zooming, and panning. The 2D / 3D map switching operation allows users to switch between planar and stereoscopic views to observe the trajectory from different dimensions. The zoom operation allows users to zoom in or out of the map view to view finer details or a wider area. The pan operation allows users to move the center point of the map to browse the trajectory of different geographical areas. The fifth preset operation allows users to interact with actions through timeline controls, such as dragging the time slider, clicking the play button, or selecting a specific time period. Playing the transportation trajectory of a single shipment on the timeline means that the system dynamically displays the evolution of the transportation trajectory of a single shipment on a visualized trajectory map according to the timeline indication, simulating the actual passage of time in transportation, thus intuitively presenting the transportation process.

[0048] In one possible implementation, displaying the complete transportation trajectory of a single shipment on a visualized trajectory map includes: rendering the transportation trajectory without missing trajectory points in the complete transportation trajectory as a solid line of a first preset style; rendering the supplementary trajectory in the complete transportation trajectory as a dashed line of a second preset style; rendering the transportation trajectory of outsourced transportation links in the complete transportation trajectory as a dashed line of a third preset style; and rendering the sorting nodes in the complete transportation trajectory as a graphic of a fourth preset style; wherein the rendering layers and rendering colors of the transportation trajectories corresponding to different transportation links in the complete transportation trajectory are different.

[0049] Specifically, for a transportation track without missing track points in the complete transportation track, it can be rendered as a solid line in the first preset style. This solid line style can clearly represent the transportation path segment without any completion processing. For example, it can be set as a blue solid line with a line width of 2 pixels; for the supplementary track in the complete transportation track, it can be rendered as a gray thin dashed line (line width 1px, dashed line interval 2px); the external transportation link refers to the transportation part executed by a third-party logistics company or an external carrier. For the transportation track of the external transportation link in the complete transportation track, it can be rendered as an orange thick dashed line (line width 3px, dashed line interval 5px); for the sorting node in the complete transportation track, the sorting node can be rendered as a specific icon on the map. For example, a circular mark with the character "sort" or a red fork icon. Moreover, for different transportation links such as pickup and delivery, trunk transportation, chartered vehicle / airport transfer, and agency transfer, their tracks can be displayed in different styles and colors and placed on different rendering layers. For example, an independent rendering layer can be assigned to each transportation link in the map rendering engine, and different default colors can be set for each layer (such as light blue for pickup and delivery, dark green for trunk transportation, orange for chartered vehicle / airport transfer, and gray for agency transfer). Users can choose to display or hide specific layers as needed, enabling users to clearly identify the source of the track (original data or completed data), the executor (internal or external), and the key logistics operation points (sorting nodes) on the visual track map, enhancing the visual hierarchy and information differentiation.

[0050] In a possible implementation manner, it further includes: if the path length of the logistics track is greater than a preset multiple of the preset optimal path length, it is determined that the logistics track is an abnormal track; if the distance between adjacent track points in the complete transportation track is greater than the first distance and the transportation duration between adjacent track points is less than the preset duration, it is determined that there is an abnormal track in the initial waybill track; if the distance between the delivery end point of the complete transportation track and the customer address of the logistics waybill is greater than the second distance, it is determined that there is an abnormal track in the target waybill track; if there is an abnormal track, an abnormal warning message is generated.

[0051] Specifically, the first and second distances can be preset. The path length of the transportation trajectory refers to the actual distance traveled by a single shipment from the starting point to the destination during actual transportation. The preset optimal path length can be obtained from historical paths, and the preset multiple can be set preferentially to measure the degree of deviation between the actual path and the optimal path. For example, it can be set to 1.2 times or 1.5 times. If the actual path length exceeds 20% or 50% of the optimal path length, it is considered an abnormal path. The initial waybill trajectory refers to the original transportation trajectory data that has not been supplemented or corrected. If the straight-line distance between two consecutively recorded trajectory points is greater than the first distance, and the transportation time between these distances is less than the preset time, it can be considered that an unreasonable long-distance movement has occurred in a short period of time, and there is an abnormal trajectory. The delivery destination refers to the unloading position finally recorded in the logistics trajectory during the delivery process. The customer address of the logistics waybill refers to the recipient's address clearly recorded on the waybill. If the distance between the delivery destination and the customer address is greater than the second distance, it can be considered that there is a deviation between the delivery destination and the customer address, and there is an abnormal trajectory in the target waybill trajectory. When an abnormal trajectory exists in the target waybill trajectory, an abnormal warning message can be generated. For example, the abnormal trajectory segment can be marked with a conspicuous color or icon on the visual trajectory map.

[0052] This application discloses a method for processing single-shipment transportation trajectories based on multi-source heterogeneous data. The method includes acquiring basic data and transportation process data for a single shipment. The transportation process data includes at least multi-source heterogeneous data generated at each stage of transportation for the single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation stage data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer. The method involves cleaning and standard format conversion of the single-shipment transportation process data. Based on the query instructions of the logistics waybill, the transportation route is spliced ​​according to the standard transportation process. If a missing route trajectory occurs during splicing, a preset spatiotemporal data intelligent completion algorithm is used to complete the trajectory points corresponding to the missing areas. A preset logistics priority path planning algorithm is used to generate supplementary trajectories corresponding to the missing areas, forming a complete transportation trajectory for the single shipment. The complete transportation trajectory of the single shipment is then displayed on a visualized trajectory map. This method integrates heterogeneous data from multiple sources to obtain the logistics trajectory of a single shipment, and can intelligently complete missing trajectories and visualize the complete transportation trajectory. It realizes the automatic integration and intelligent completion of the transportation trajectory of a single shipment, and displays different transportation links of the transportation trajectory of a single shipment in different display formats, thereby improving the transparency and traceability of logistics transportation, reducing manual intervention, and improving logistics management efficiency.

[0053] Corresponding to the aforementioned application function implementation method embodiments, this application also provides a single-ticket cargo transportation trajectory processing system, electronic device, and corresponding embodiments based on multi-source heterogeneous data.

[0054] Figure 2 This is a schematic diagram of the structure of a single-ticket cargo transportation trajectory processing system based on multi-source heterogeneous data, as shown in an embodiment of this application.

[0055] See Figure 2 A single-ticket freight transportation trajectory processing system 200 based on multi-source heterogeneous data includes:

[0056] The acquisition module 210 is used to acquire basic data and transportation process data for a single shipment. The transportation process data includes at least multi-source heterogeneous data generated by each transportation link of a single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation link data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer.

[0057] The generation module 220 is used to splice the transportation route according to the query instruction of the logistics waybill and the transportation standard process. If the route trajectory is missing during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on the preset spatiotemporal data intelligent completion algorithm, and the supplementary trajectory corresponding to the missing trajectory area is generated through the preset logistics priority path planning algorithm to form a complete transportation trajectory for a single shipment.

[0058] Display module 230 is used to display the complete transportation trajectory of a single shipment on a visualized trajectory map.

[0059] This application discloses a single-shipment cargo transportation trajectory processing system based on multi-source heterogeneous data, comprising: an acquisition module for acquiring basic data and transportation process data of a single shipment; the transportation process data including at least multi-source heterogeneous data generated at each stage of transportation of the single shipment, such as loading location, unloading location, start time, end time, transportation mode, and cost data; and transportation stage data including at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer; a generation module for splicing transportation routes according to the query instructions of the logistics waybill and following the standard transportation process; if a trajectory is missing during the splicing process, the system uses a preset spatiotemporal data intelligent completion algorithm to complete the trajectory points corresponding to the missing areas, and uses a preset logistics priority path planning algorithm to generate supplementary trajectories corresponding to the missing areas, forming a complete transportation trajectory for the single shipment; and a display module for displaying the complete transportation trajectory of the single shipment on a visualized trajectory map. This method integrates heterogeneous data from multiple sources to obtain the logistics trajectory of a single shipment, and can intelligently complete missing trajectories and visualize the complete transportation trajectory. It realizes the automatic integration and intelligent completion of the transportation trajectory of a single shipment, and displays different transportation links of the transportation trajectory of a single shipment in different display formats, thereby improving the transparency and traceability of logistics transportation, reducing manual intervention, and improving logistics management efficiency.

[0060] Regarding the system in the above embodiments, the specific ways in which each module performs operations have been described in detail in the embodiments related to the method, and will not be elaborated further here.

[0061] This application also provides an electronic device. Figure 3 This is a schematic diagram of the hardware structure of an embodiment of the electronic device of this application. The electronic device includes a memory 320 and at least one processor 310. The memory 320 is electrically connected to the at least one processor 310. The memory 320 stores instructions. The at least one processor 310 calls the instructions in the memory 320, causing the electronic device to execute the single-ticket cargo transportation trajectory processing method based on multi-source heterogeneous data according to any of the foregoing embodiments of this application.

[0062] Specifically, the processor 310 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this application.

[0063] Memory 320 may include a mass storage device for data or instructions. For example, and not limitingly, memory 320 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 320 may include removable or non-removable (or fixed) media. Where appropriate, memory 320 may be internal or external to the integrated gateway disaster recovery device. In a particular embodiment, memory 320 is non-volatile solid-state memory. In a particular embodiment, memory 320 includes read-only memory (ROM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM), or flash memory, or a combination of two or more of these.

[0064] In one example, the control device may also include a communication interface 330 and a bus 330. The processor 310, memory 320, and communication interface 330 are connected via the bus 330 and communicate with each other.

[0065] The communication interface 330 is mainly used to realize communication between various modules, units and / or devices in the embodiments of this application.

[0066] Bus 330 includes hardware, software, or both, that couples components of an online data traffic metering device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a Memory 320 bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 330 may include one or more buses. Although specific buses are described and illustrated in embodiments of this application, any suitable bus or interconnect is contemplated herein.

[0067] Furthermore, in conjunction with the single-shipment cargo transportation trajectory processing method based on multi-source heterogeneous data in the above embodiments, this application embodiment can provide a computer-readable storage medium for implementation. This computer-readable storage medium stores instructions that, when executed by a processor, implement any of the single-shipment cargo transportation trajectory processing methods based on multi-source heterogeneous data in the above embodiments.

[0068] This application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this application is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0069] The functional blocks shown in the above block diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0070] It should also be noted that the exemplary embodiments mentioned in this application describe methods or systems based on a series of steps or apparatus. However, this application is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0071] Alternatively, this application also provides a computer program product capable of implementing some or all of the steps of the methods in the above embodiments. The computer program product includes a computer program / instruction that, when executed by a processor, implements some or all of the steps of the methods in the above embodiments.

[0072] The above description is merely a specific implementation of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the protection scope of this application.

Claims

1. A method for processing single-ticket freight transport trajectories based on multi-source heterogeneous data, characterized in that, include: Acquire basic data and transportation process data for a single shipment. The transportation process data includes at least multi-source heterogeneous data generated at each stage of transportation for a single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation stage data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer. According to the query instructions of the logistics waybill, the transportation route is spliced ​​according to the standard transportation process. If the route trajectory is missing during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on the preset spatiotemporal data intelligent completion algorithm, and the supplementary trajectory corresponding to the missing trajectory area is generated through the preset logistics priority path planning algorithm to form the complete transportation trajectory of the single shipment. The complete transportation trajectory of the single shipment is displayed on a visualized trajectory map; If the trajectory end position of the previous transportation link is missing in the missing trajectory area, and the spatial distance between the trajectory start position of the next transportation link and the trajectory end position of the previous transportation link is less than a preset distance threshold and the time interval is less than a preset time threshold, then the trajectory end position of the previous transportation link is completed by the trajectory start position of the next transportation link. If the end position of the last-mile transportation link is missing in the missing area of ​​the trajectory, the historical shipment data of the target customer corresponding to the single shipment is obtained, and the end position of the trajectory of the last-mile transportation link is completed according to the common delivery address of the historical shipment data and the basic data of the single shipment. If the transportation link only includes text address information, then the address parsing engine is called to parse the text address information and convert it into standard latitude and longitude coordinates to obtain the starting position and ending position of the trajectory of the transportation link. The step of generating supplementary trajectories for the missing trajectory areas using a preset logistics priority path planning algorithm includes: The starting point of the planning is determined by the end position of the previous transportation trajectory, and the starting point of the planning is determined by the end position of the next transportation trajectory. A graph search algorithm constrained by transportation costs is executed on the planning start point and the planning end point to obtain one or more feasible paths from the planning start point to the planning end point; wherein, the graph search algorithm prioritizes searching for feasible paths with the highest overlap with historical paths; The first feasible path with the shortest path, the second feasible path with the most calls, and the third feasible path with the shortest time are selected from the feasible paths. Calculate the transportation costs corresponding to the first feasible path, the second feasible path, and the third feasible path, respectively; The feasible path with the lowest transportation cost and a transportation time within a preset time range is determined as the supplementary trajectory.

2. The method for processing single-ticket freight transport trajectory according to claim 1, characterized in that, The step of generating supplementary trajectories for the missing areas of the previous transportation trajectory by using a preset logistics priority path planning algorithm, with the end position of the previous transportation trajectory as the planning start point and the end position of the next transportation trajectory as the planning end point, specifically includes: Obtain the throughput, transportation frequency, and weight values ​​of logistics parks, distribution centers, and points; Select weight nodes with weights greater than the preset weight threshold for actual logistics operation network planning; Path constraints are applied based on the characteristics of different modes of transportation, including land and air transport, and real-time traffic data constraints, including real-time congestion index and traffic accidents, are used to optimize the supplementary route.

3. The method for processing single-ticket freight transport trajectory according to claim 1, characterized in that, Also includes: If the transportation process includes at least two unloading locations, then obtain several candidate trajectories between the loading location and each unloading location in the transportation process; The transportation times of the candidate trajectories are sorted in reverse chronological order, and the candidate trajectory with the shortest time is selected as the target trajectory between the trajectory start position and the trajectory end position. If there are at least two candidate trajectories with the shortest time, the logistics cost corresponding to the candidate trajectory is calculated, and the candidate trajectory with the lowest logistics cost is taken as the target trajectory. The target trajectory is displayed on the visualized trajectory map with a preset special identifier.

4. The method for processing single-ticket freight transport trajectory according to claim 1, characterized in that, Also includes: In response to a first preset operation for any transportation trajectory in the visualized trajectory map, first information associated with the transportation trajectory is displayed, the first information including at least the start and end time of the transportation trajectory, transportation distance or cost information; In response to a second preset operation for any trajectory node in the visualized trajectory map, second information associated with the trajectory node is displayed, the second information including at least the name of the trajectory node, the time spent at the node, or personnel information; In response to a third preset operation on the visualized trajectory map for a target area, third information of all transportation trajectories within the target area is displayed, the third information including at least the total mileage or average speed of the transportation trajectories; In response to a fourth preset operation on the visualized trajectory map, the display format of the visualized trajectory map is adjusted; wherein, the fourth preset operation includes a 2D / 3D map switching operation, a zoom operation, and a pan operation; In response to a fifth preset operation on the timeline in the visualized trajectory map, the transportation trajectory of the single shipment is played on the visualized trajectory map according to the timeline.

5. The method for processing single-ticket freight transport trajectory according to claim 1, characterized in that, The process of displaying the complete transportation trajectory of a single shipment on a visualized trajectory map includes: For transportation trajectories that do not have any missing trajectory points in the complete transportation trajectory, they are rendered as solid lines of a first preset style; For the supplementary trajectories in the complete transportation trajectory, they are rendered as dashed lines of a second preset style; For the transportation trajectory of the outsourced transportation link in the complete transportation trajectory, the dashed line of the third preset style is rendered; For the sorting nodes in the complete transportation trajectory, the graphics are rendered using a fourth preset style. The rendering layers and colors of the transportation trajectories corresponding to different transportation links in the complete transportation trajectory are different.

6. The method for processing single-ticket freight transport trajectory according to claim 1, characterized in that, Also includes: If the path length of the transportation trajectory is greater than a preset multiple of the preset optimal path length, then the transportation trajectory is determined to be an abnormal trajectory. If the distance between adjacent trajectory points in the complete transportation trajectory is greater than a first distance and the transportation time between adjacent trajectory points is less than a preset time, then it is determined that there is an abnormal trajectory in the complete transportation trajectory. If the distance between the delivery destination of the complete transportation trajectory and the customer address of the logistics waybill is greater than the second distance, then it is determined that there is an abnormal trajectory in the complete transportation trajectory. If the abnormal trajectory exists, an abnormal warning message will be generated.

7. A single-ticket freight transportation trajectory processing system based on multi-source heterogeneous data, characterized in that, include: The acquisition module is used to acquire basic data and transportation process data for a single shipment. The transportation process data includes at least multi-source heterogeneous data generated by each transportation link of a single shipment, including loading location, unloading location, start time, end time, transportation mode, and cost data. The transportation link data includes at least pickup and delivery, trunk transportation, charter / airport transfer, and agent transfer. The generation module is used to splice the transportation route according to the query instructions of the logistics waybill and the standard transportation process. If the route trajectory is missing during the splicing process, the trajectory points corresponding to the missing trajectory area are filled in based on the preset spatiotemporal data intelligent completion algorithm, and the corresponding supplementary trajectory is generated through the preset logistics priority path planning algorithm to form the complete transportation trajectory of the single shipment. Among them, if the trajectory end position of the previous transportation link is missing in the trajectory missing area, and the spatial distance between the trajectory start position of the next transportation link and the trajectory end position of the previous transportation link is less than a preset distance threshold and the time interval is less than a preset time threshold, the trajectory end position of the previous transportation link is filled in by the trajectory start position of the next transportation link. If the end position of the last-mile transportation link is missing in the missing area of ​​the trajectory, the historical shipment data of the target customer corresponding to the single shipment is obtained, and the end position of the trajectory of the last-mile transportation link is completed according to the common delivery address of the historical shipment data and the basic data of the single shipment. If the transportation link only includes text address information, then the address parsing engine is called to parse the text address information and convert it into standard latitude and longitude coordinates to obtain the starting position and ending position of the trajectory of the transportation link. The step of generating supplementary trajectories for the missing trajectory areas using a preset logistics priority path planning algorithm includes: The starting point of the planning is determined by the end position of the previous transportation trajectory, and the starting point of the planning is determined by the end position of the next transportation trajectory. A graph search algorithm constrained by transportation costs is executed on the planning start point and the planning end point to obtain one or more feasible paths from the planning start point to the planning end point; wherein, the graph search algorithm prioritizes searching for feasible paths with the highest overlap with historical paths; The first feasible path with the shortest path, the second feasible path with the most calls, and the third feasible path with the shortest time are selected from the feasible paths. Calculate the transportation costs corresponding to the first feasible path, the second feasible path, and the third feasible path, respectively; The feasible path with the lowest transportation cost and transportation time within the preset time range is determined as the supplementary trajectory; The display module is used to display the complete transportation trajectory of the single shipment on a visualized trajectory map.

8. An electronic device, characterized in that, include: processor; as well as A memory having executable code stored thereon, which, when executed by the processor, causes the processor to perform the method as described in any one of claims 1-6.

Images