This project is an implementation of the Ant colony optimization algorithm.
This project had as an objective to use it to optimize a route to travel through Grand Britain pubs.
To use it, you need the CSV file containing the data on kaggle.com .
Here are the environement variables available
| variable name | is required | default value | description |
|---|---|---|---|
| CSV_FILENAME | no | open_pubs.csv | path to the csv to load on startup |
| GOOGLE_API_TOKEN | yes | API key used ( need to be authorised for geocoding and Javascript ) | |
| NUMBER_NODES | no | 150 | Number of nodes to use on our graph ( no limitation if less or equal to 0 ) |
| MAP_CENTER | no | True | Center the camera on the HTML output page. |
| USE_MILES_UNIT | no | False | Display the distance in Miles, else it would be in Kilometers |
When the application opens a HTML page, this means that the application has finished the optimization. You can no use several controls to navigate through the points:
- n => move to the next point
- p => move to the previous point
- g => display a prompt to access to a specific point
- h => display the help
This is only a school project, soooo, don't use this in production ^^.