bike-stations

This project aims to determine the optimal placement of bike stations for a given city, using a graph-based modeling approach.

We use the network data for Anaheim (1992) available on GitHub.

Name		Name	Last commit message	Last commit date
Latest commit History 41 Commits
.vscode		.vscode
Data		Data
Images		Images
__pycache__		__pycache__
pytrans		pytrans
src		src
.gitignore		.gitignore
Best 4_avg measures.csv		Best 4_avg measures.csv
Implementation method 1 - Sioux Falls & Anaheim.ipynb		Implementation method 1 - Sioux Falls & Anaheim.ipynb
README.md		README.md
Worst 4_avg measures.csv		Worst 4_avg measures.csv
bike_functions.py		bike_functions.py
optimal_station_Equilibrium.ipynb		optimal_station_Equilibrium.ipynb
optimal_station_placement.py		optimal_station_placement.py
output.svg		output.svg
real commutes.csv		real commutes.csv
real trips.py		real trips.py
station_cost_centrality.csv		station_cost_centrality.csv
station_cost_centrality_capacity.csv		station_cost_centrality_capacity.csv
station_df method I.csv		station_df method I.csv
trips.txt		trips.txt

Provide feedback