Hello Dear sumo-dev,
First of all, excuse me if I am missing something or doing it wrong, it is the first time that I contribute to an open-source project, but of course not the first time that I use SUMO,
In fact, I had worked during the six last years with SUMO and Veins, and I really appreciate these tools, 2 years ago I was looking for a solution to my problem, and I realised that It was impossible with an old version of SUMO, so I switched to a solution based on Python, SumoLib and Networkx API.
Now lets me explain the problem, and how I think that is possible to solve it (I will appreciate any help in this sense, to guide me for my first contribution)
Problem: Say for instance that you have a VehX that follows a specific route that is passing by multiple junctions (e.g: Junctions: A, B, C, D), what I want is to identify the closest one relative to another junction Z that is not in the current route of the vehicle. I asked the question two years ago here:
https://sourceforge.net/p/sumo/mailman/message/35079189/
- Identifying the junctions in a current route of VehX
- Computing the driving distance (or air distance if needed) between junctions (A,Z), (B,Z), (C,Z) & (D,Z)
- Returning the junction with the shortest distance among the 4 junctions
So, any advice on how I can do it ? from where can I start?
Thank you very much for your time,
Best Regards,
Arslane HAMZA-CHERIF