Path optimization method and path optimization system based on Dijkstra

A path optimization and path technology, applied in the direction of instruments, data processing applications, prediction, etc., can solve problems such as restricting calculation speed

Inactive Publication Date: 2016-11-09
深圳市TCL高新技术开发有限公司
View PDF0 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] In view of the deficiencies in the above-mentioned prior art, the object of the present invention is to provide a Dijkstra-based path optimization method and system thereof, aiming to solve the problem that the Dijkstra algorithm in the prior art uses an adjacency matrix storage graph to store a large number of invalid matrices. storage, and every time the shortest path node is selected, all unmarked nodes must be scanned once, which restricts the calculation speed when the number of nodes is large

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Path optimization method and path optimization system based on Dijkstra
  • Path optimization method and path optimization system based on Dijkstra
  • Path optimization method and path optimization system based on Dijkstra

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention provides a Dijkstra-based path optimization method and its system. In order to make the purpose, technical solution and effect of the present invention clearer and clearer, the present invention will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0045] Please refer to figure 1 , which is a flowchart of a preferred embodiment of the Dijkstra-based route optimization method of the present invention. Such as figure 1 As shown, the Dijkstra-based path optimization method includes the following steps:

[0046] Step S100, obtaining a directed graph of the shortest path according to multiple nodes and path weights between nodes;

[0047] Step S200, initializing the adjacent point set, the marked vertex set for which the shortest path has been obtained,...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a path optimization method and a path optimization system based on Dijkstra. The method comprises the following steps: getting a shortest path directed graph according to multiple nodes and the path weights between the nodes; initializing an adjacency point set, a marked vertex set of acquired shortest paths, and sorting nodes to be stored; getting a min heap through heap sorting, taking the heap top node of the min heap as an intermediate node, correcting the length of the shortest path from the start node to each node in the complementary set of the marked vertex set via the intermediate node through the intermediate node, performing repeated iteration until all the nodes in the adjacency point set are added to the marked vertex set, and getting the length of the shortest path from the start node to any other node in the nodes. Storage space is saved through data storage in an adjacency table, the running performance of the algorithm is improved through heap sorting, and the processing efficiency is improved.

Description

technical field [0001] The invention relates to the technical field of path planning, in particular to a Dijkstra-based path optimization method and system thereof. Background technique [0002] With the development of e-commerce, online shopping has become the mainstream of shopping in today's society. Therefore, the demand and efficiency requirements for the logistics distribution of enterprises that provide online shopping methods are also getting higher and higher. The vehicle routing problem is the most critical problem in the logistics distribution system. The vehicle routing problem is a classic combination optimization scheduling problem. It mainly studies the vehicle scheduling scheme satisfying the constraints and the optimal vehicle routing scheme. The logistics distribution path optimization problem can be described as: Starting from the logistics center, there are a series of delivery points and / or receiving points. It is required to form an appropriate driving...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06Q10/08G06Q50/28
CPCG06Q10/047G06Q10/083G06Q50/28
Inventor 马庆龙
Owner 深圳市TCL高新技术开发有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap