Is it possible to get a map with an optimized route, where regardless of the order of coordinate pairs in the array of coordinates, all places are visited under a certain criteria, for example the shortest time possible.
Sure, with some effort;)
We’re in the process of evaluating a suitable library, but can’t give any ETA here, nor the prospect of it every happening.
But you can take a look here for a Python solution with ORS and ortools from Google:
https://openrouteservice.org/example-optimize-pub-crawl-with-ors/
Not entirely sure though if that’s still working as it should. If you try, pls share some feedback.