https://github.com/ejw-data/algo-optimum-path

Exploring algorithms used for finding routes
https://github.com/ejw-data/algo-optimum-path

graph networkx python

Last synced: about 2 months ago
JSON representation

Exploring algorithms used for finding routes

• Host: GitHub
• URL: https://github.com/ejw-data/algo-optimum-path
• Owner: ejw-data
• Created: 2023-06-28T04:32:16.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2023-07-19T17:03:12.000Z (almost 3 years ago)
• Last Synced: 2025-01-22T06:47:10.821Z (over 1 year ago)
• Topics: graph, networkx, python
• Language: Jupyter Notebook
• Homepage:
• Size: 2.61 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# algo-optimum-path

Author:  Erin James Wills, ejw.data@gmail.com  

![Optimum Route](./images/routes-algorithms.png)  

Photo by GeoJango Maps on Unsplash




## Overview  

  

This repo explores algorithms that can help identify optimum paths.  Initially, I will include only distance as my optimizing criteria but I will continue to add features for improving the calculation such as population based optimization, minimum distance between cities or total cities visited per trip.  Initially I will only calculate the routes based on a crude method (search of all options) but I intend to use more optimized methods like Dijkstra's Algorithm in the future.


## Status  

1.  Currently have a basic model working that finds shortest distance - need utilize haversine distance instead of euclidean

1.  Need to optimize for greatest population and allow for distance to vary but set limit for the maximum number of cities visited

1.  Don't think the basic model will find optimum for more complicated problems since it is finding the next minimum distance instead of looking at the total trip distance.  A crude model that finds all combinations could find the best solution but this would be very processing heavy.  Need to use an algorithm like Dijkstra or A*

1.  Simple Dijkstra example is working but customizations are in progress

## Flow diagram of NetworkX Code

- The text needs updating - difficult to write this flow chart without subscripts  

![NetworkX flow diagram](./images/path-flow-diagram.png)