You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
- A Directed Graph class which consists of `Nodes` and `Edges`.
90
90
- The `evaporation_rate` is initialized here.
91
91
92
92
### Node
93
-
(`aco_routing.utils.graph.Node`)
93
+
`aco_routing.utils.graph.Node`
94
94
- A `Node` class which represents a node in the Graph and consists of various outgoing edges.
95
95
96
96
### Edge
97
-
(`aco_routing.utils.graph.Edge`)
97
+
`aco_routing.utils.graph.Edge`
98
98
- An `Edge` class which represents a link between 2 nodes in the Graph.
99
99
- Each `Edge` has 2 parameters:
100
100
-`travel_time`: The amount of time it takes to traverse the edge. A high value indicates more traffic.
101
101
-`pheromones`: A heuristic parameter i.e., the pheromone values deposited by the ants.
102
102
103
103
### Dijkstra
104
-
(`aco_routing.dijkstra.Dijkstra`)
104
+
`aco_routing.dijkstra.Dijkstra`
105
105
- The baseline algorithm to compare the results of the candidate algorithm with.
106
106
- The Dijkstra's algorithm ([source](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)) returns the shortest path between any 2 nodes in a graph.
107
107
108
108
### Ant
109
-
(`aco_routing.utils.ant.Ant`)
109
+
`aco_routing.utils.ant.Ant`
110
110
- The `Ant` class representing an ant that traverses the graph.
111
111
112
112
### ACO
113
-
(`aco_routing.aco.ACO`)
113
+
`aco_routing.aco.ACO`
114
114
- The traditional Ant Colony Optimization algorithm that spawns various ants at random nodes and tries to find the shortest path between the specified source and destination.
115
115
116
116
### Simulator
117
-
(`aco_routing.utils.simulator.Simulator`)
117
+
`aco_routing.utils.simulator.Simulator`
118
118
- The simulator class is used to simulate and evaluate the performance of the candidate algorithm (ACO) with a baseline Dijkstra's Algorithm.
119
119
- It simulates a real-life city, where the traffic conditions change every episode in a conditionally stochastic manner.
120
120
- The ants continue to find the shortest path even after the traffic conditions change.
0 commit comments