Skip to content

Đồ án môn học Cấu Trúc Dữ Liệu và Giải Thuật (22C1INF50900702) - Ứng dụng thuật toán Dijkstra để tối ưu hoá chi phí vận tải - UEH

Notifications You must be signed in to change notification settings

quocviethere/DSA-Project-Dijkstra-Algorithm

Repository files navigation

Optimal Transport using Dijkstra Algorithm: A Case Study in Southern Vietnam

A project for 22C1INF50900702: Data Structures and Algorithms at University of Economics Ho Chi Minh City

Members/Authors


Acknowledgement

To our teacher of the course,

We'd want to thank you for your efforts this semester, particularly in this course. We have no idea where we would be without you. We truly noticed all of the occasions you went above and beyond for us.

This lesson was difficult at times, but there was benefit to being exposed to the content. And this project is quite difficult. But we did it with all of our efforts, collaborative spirit, and your help.

We would like to thank our instructors at University of Economics Ho Chi Minh City for their assistance with this research. Special thanks to our University of Economics Ho Chi Minh City seniors for giving ideas and skills that enabled us to complete this project.

Last but not least, thanks to our teammates, we did it. Together.


References

  • A. Bozyig ̆it, G. Alankus ̧, and E. Nasibog ̆lu. Public transport route planning: Modified Dijkstra’s algorithm. In 2017 International Conference on Computer Science and Engineering (UBMK), pages 502–505. IEEE, 2017.
  • Y.-z. Chen, S.-f. Shen, T. Chen, and R. Yang. Path optimization study for vehicles evacuation based on Dijkstra algorithm. Procedia Engineering, 71:159–165, 2014.
  • Y. Deng, Y. Chen, Y. Zhang, and S. Mahadevan. Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Applied Soft Computing, 12(3):1231–1237, 2012.
  • E. W. Dijkstra. A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: His Life, Work, and Legacy, pages 287–290. 2022.
  • P. L. Frana and T. J. Misa. An interview with Edsger W. Dijkstra. Communications of the ACM, 53 (8):41–47, 2010.
  • A. Javaid. Understanding dijkstra’s algorithm. Available at SSRN 2340905, 2013.
  • D. R. Lanning, G. K. Harrell, and J. Wang. Dijkstra’s algorithm and google maps. In Proceedings of the 2014 ACM Southeast Regional Conference, pages 1–3, 2014.
  • N. Makariye. Towards shortest path computation using dijkstra algorithm. In 2017 International Conference on IoT and Application (ICIOT), pages 1–3. IEEE, 2017.
  • M. J. Price. C# 9 and. NET 5–Modern Cross-Platform Development: Build intelligent apps, websites, and services with Blazor, ASP. NET Core, and Entity Framework Core using Visual Studio Code. Packt Publishing Ltd, 2020.
  • F. Schulz, D. Wagner, and K. Weihe. Dijkstra’s algorithm on-line: An empirical case study from public railroad transport. Journal of Experimental Algorithmics (JEA), 5:12–es, 2000.
  • R. Sedgewick. Algorithms in C, part 5: Graph Algorithms. Pearson Education, 2001.

About

Đồ án môn học Cấu Trúc Dữ Liệu và Giải Thuật (22C1INF50900702) - Ứng dụng thuật toán Dijkstra để tối ưu hoá chi phí vận tải - UEH

Topics

Resources

Stars

Watchers

Forks

Contributors 4

  •  
  •  
  •  
  •