i am to model the distribution of drug to eight region in Ghana using dynamic programming and Dijkstra algorithm. the model will be dynamic programming and use Dijkstra algorithm matrix to find the shortest rout from the drug storage center.
Dear Opoku Antwi,
I mean your problem can be viewed as the Traveling Salesman Problem (TSP) or the Multiple TSP (mTSP). In this problem can be used: dynamic programming and Dijkstra algorithm and a variant of linear programming. Your task involves what is known as the longest path problem (LPP). See my literature sources.
Best wishes
Anatol Badach
https://en.wikipedia.org/wiki/Travelling_salesman_problem
Understanding the Travelling Salesman Problem (TSP)
https://blog.routific.com/travelling-salesman-problem
Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)
https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/
Distribution Networks/Services within of smart cities
http://eaton.math.rpi.edu/faculty/Mitchell/courses/matp4700/notesMATP4700/lecture26/26D_longestpath.pdf
Teguh Narwadi and Subiyanto: An Application of Traveling Salesman Problem Using the Improved Genetic Algorithm on Android Google Map https://aip.scitation.org/doi/pdf/10.1063/1.4976899
Liu Hui, Chen Min: Company’s Logistics under Internet of Things Based on Traveling Salesman Problem Solution
https://dl.acm.org/doi/abs/10.1515/cait-2016-0054
For simple examples of solving problems using dynamic programming, see:
https://www.researchgate.net/publication/312033832_Dynamic_Programming
- Badges
- Science topic
- Similar topics
- Chemistry
- Pharmacology
- Pharmaceuticals
- Drugs