Dear All,
Any Idea on How to implement Ant Colony Optimization with SUMO + Traci?
I stuck badly. Please help me to save my life.
Following is the python package for ACO.
https://pypi.org/project/ACO-Pants/
You can modify as per your requirement.
You can try this as well: https://github.com/pjmattingly/ant-colony-optimization
The latest release is multi threaded to solve combinatoric optimization problems (like the Traveling Salesman Problem, or the Knapsack Problem). Simply feed the constructor a dict mapping your node names to coordinates of those nodes and give it a distance function call back that can take the coordinates and it will solve it using the ACO algorithm as described.
An effort has been made to initialize the algorithm's variables (alpha, beta, Q, etc) to sensible defaults. But your TSP problem may differ significantly from the testing set (see test directory) and may perform more poorly than optimal.
The latest release is multithreaded.
A full description of the behavior of the algorithm can be found here: https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms#Example_pseudo-code_and_formula
Note: Tests that implement finding actual optimal paths may fail occasionally, as this algorithm is semi-random. The default configuration should make this a rare occurrence.
https://www.youtube.com/watch?v=tPD9duy7PzM
Thanks for answer Seyed Yahya Moradi Sir,
But i need solution for finding shortest path. I am using SUMO + TRACI.
Is it possible to solve problem of finding shortest path using this?
Please note that here I have converted Geo map to Graph. and traversing a graph is using either NetwrokX or SumoLib.
Dhaval Varia , if you are looking for shortest path then rather use the functionality of the NetworkX package....
https://networkx.github.io/documentation/networkx1.10/reference/algorithms.shortest_paths.html
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Programming Languages
- Python