article · 2019

A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path

Kaicong Wei, Ying Gao, Wei Zhang, Sheng Lin

Cited by 34Abstract and details only

Abstract

Path optimization is especially useful for improving freight efficiency, and the problem of finding the maximum load path is an important issue in path optimization. Although the problem of finding the shortest path is similar to the problem of finding the maximum load path, the Dijkstra's algorithm for solving the problem of finding the shortest path is not suitable for solving the problem of finding the maximum load path. In this paper, the Dijkstra's algorithm for solving the problem of finding the shortest path is introduced, and the Dijkstra's algorithm is modified to solve the problem of finding the maximum load path. Finally, the running process of the modified Dijkstra's algorithm is described by an example.

Cite this paper

APA 7

Wei, K., Gao, Y., Zhang, W., & Lin, S. (2019). A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path. https://doi.org/10.1109/infoct.2019.8711024

MLA 9

Wei, Kaicong, et al. “A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path.” 2019, pp. 10–13, https://doi.org/10.1109/infoct.2019.8711024.

Chicago

Wei, Kaicong, Ying Gao, Wei Zhang, and Sheng Lin. 2019. “A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path.” https://doi.org/10.1109/infoct.2019.8711024.

Harvard

Wei, K. et al. (2019) ‘A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path’. Available at: https://doi.org/10.1109/infoct.2019.8711024.

BibTeX

@article{wei2019modified,
  title = {{A Modified Dijkstra’s Algorithm for Solving the Problem of Finding the Maximum Load Path}},
  author = {Wei, Kaicong and Gao, Ying and Zhang, Wei and Lin, Sheng},
  pages = {10--13},
  year = {2019},
  doi = {10.1109/infoct.2019.8711024}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.