Cheapest algorithm in memory consumption terms


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 ?


For map matching I’ve not done tests but bidirectional A* should be the best IMO, maybe use the new hybrid mode to improve this further. To avoid the error you can increase the memory e.g. via JAVA_OPTS="-Xmx5g Xms5g"

1 Like