-
Notifications
You must be signed in to change notification settings - Fork 3
/
Instructions.txt
34 lines (16 loc) · 1.67 KB
/
Instructions.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
''''''''''Installation guide''''''''''
Step 1) Follow the link to install and setup Visual Studio Code for Python : https://code.visualstudio.com/docs/languages/python
**You may even use any another text editor of your choice
Step 2) Download the files
Step 3) Edit the AIFA.xlsx with your specific data. Now extract the data into two csvs named EV.csv and Nodes.csv .
**Do check the column headings for the units
Step 4) At lines 5,6,7 change the values of noCar, noCity and maxDepth where maxDepth stands for the relative depth you want to pursue the state space for. Note: We are initially generating all the possible routes from source to destination of a vehicle. From this set the best 'maxDepth' number of routes are taken on the basis of minimum distance.
Step 5) Change the address to the csv files in the Paths_Final.py code at lines 38 and 42.
Step 6) Run the program to get the output.
''''''''''Output Intrepretation''''''''''
Path Taken : Each element 'i' corresponds to the path taken by the vehicle 'i' to reach it's destination.
Battery Charge Matrix : The percentage of battery charged of vehicle 'i' at node 'j'.
Time charging Starts ... : Each element [i][j] represents the time when vehicle 'i' starts getting charged at node 'j'.
Time charging Ends ... : Each element [i][j] represents the time when vehicle 'i' end getting charged at node 'j'.
Time when Car i... : For each element list, the individuals time stamps stands for the time when vehicle 'i' leaves node 'j'. For destination leave time denotes the arrival time since no charging or waiting happens.
Maximum of the time : Time by which all cars reach their destinations.