Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kengen1/ev-charging-network
C++ application that simulates travel routes and charging costs for electric vehicles driving in the Sydney Metropolitan area.
https://github.com/kengen1/ev-charging-network
Last synced: about 1 month ago
JSON representation
C++ application that simulates travel routes and charging costs for electric vehicles driving in the Sydney Metropolitan area.
- Host: GitHub
- URL: https://github.com/kengen1/ev-charging-network
- Owner: kengen1
- Created: 2023-11-02T07:21:30.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-11-08T07:48:24.000Z (about 1 month ago)
- Last Synced: 2024-11-08T08:34:23.567Z (about 1 month ago)
- Language: C++
- Homepage:
- Size: 138 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# EV Charging Network Simulation
- A terminal-based application that simulates travel routes of electric vehicles (EVs) in the Sydney metropolitan area.
- This application provides solutions for various EV charging challenges, including finding the nearest or cheapest charging stations and planning optimal travel routes.
- It serves as a practical exercise on the Traveling Salesman Problem (TSP) for EV charging networks, utilizing algorithms like Dijkstra’s for shortest path calculations.
## Road network of Sydney metropolitan area
### Map Representation
The Sydney road network is represented as a **weighted graph**. This graph structure includes:
- **Nodes (Locations)**: Each location, whether it has a charging station or not, is a node in the graph.
- **Edges (Roads)**: Roads connecting locations are represented as edges between nodes.
- **Adjacency Matrix with Weights**: The distances between directly connected locations are stored in an adjacency matrix. Each entry in this matrix represents the travel cost (or weight) between two locations. If there is no direct connection, the entry is either empty or set to infinity.
The graph is implemented in the `WeightedGraph` class, enabling efficient route planning and cost calculations through algorithms like Dijkstra’s.
## Features
1. Print location information
2. Print adjacency matrix
3. List all charging stations in ascending order of charging price
4. List adjacent charging stations
5. Find the adjacent charging station with the lowest travel & charging cost
6. Find the nearest charging station
7. Find the cheapest charging station other than the current location
8. Find cheapest station between origin and destination: Finds the single charging station along a route that minimizes combined travel and charging costs.
9. Find the best way of charging: Calculates the most cost-effective sequence of charging stops for a trip from start to destination.
## Installation and Usage
### 1. Clone the Repository
```
git clone https://github.com/kengen1/EV-Charging-Network.git
cd EV-Charging-Network
```
### 2. Run the Application
**Option 1**: Compile and run
```
mkdir build
cd build
cmake ..
make
./ev_charging_network
```
**Option 2**: Run the provided executable file
```
./ev_charging_network.exe
```