Method and a device for maximizing the vehicle transportation load based on dijkstra algorithm
A technology of load capacity and vehicles, applied in the field of graph theory, can solve problems such as ineffective lifting of load capacity, and achieve the effect of increasing vehicle load capacity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0044] see Figure 1-3 .
[0045] Such as Figure 1-2 As shown, the method for maximizing the vehicle transport load based on the Dijkstra algorithm provided in this embodiment is suitable for execution in a computing device, and at least includes the following steps:
[0046] S101. Using a topology modeling method to model the load capacity of the vehicle to obtain a connected graph with weights.
[0047]Specifically, each location is set as a vertex of the graph, and each road between the locations is set as an edge connecting the vertices in the graph to obtain an initial connected graph. According to the load limit of each road on the vehicle, define the weight of the edge corresponding to each road in the initial connectivity graph, so as to obtain the connectivity graph with weights. For the convenience of calculation, it is assumed that each road between each location is a two-way road, and in addition, the weight limit of the same road in both directions is the same...
no. 2 example
[0065] see Figure 4 .
[0066] The modeling module 401 is used to model the load capacity of the vehicle using a topology modeling method to obtain a connected graph with weights.
[0067] Specifically, each location is set as a vertex of the graph, and each road between the locations is set as an edge connecting the vertices in the graph to obtain an initial connected graph. According to the load limit of each road on the vehicle, define the weight of the edge corresponding to each road in the initial connectivity graph, so as to obtain the connectivity graph with weights. For the convenience of calculation, it is assumed that each road between each location is a two-way road, and in addition, the weight limit of the same road in both directions is the same. Therefore, when the graph is established, it will be an undirected connected graph with weights.
[0068] Wherein, the connected graph is stored in the form of an adjacent linked list. Specifically, according to the c...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



