Hi,
I have encountered some “java.lang.OutOfMemoryError: GC overhead limit exceeded” problems while mapmatching a set of travels with the bidirectional A* algorithm. It is the first time I use this algorithm, so I wonder if there’s a difference of memory consumption between the different available algorithms, and if so, which one is the the cheapest one in terms of memory ?
Thanks,
José