Hi Rocawabe,
I’ve asked a similar question trying to optimize the creation of a cost matrix but no one ever responds here. I guess it is due to it being a paid feature of graphhopper, the answer anyhows.
I’ve produced a 1000+ point matrix file in about 5 minutes through brute forcing it. This is by removing any unnecessary processing like hints etc from graphhopper.
The other thought I had was to split the task into individual threads in java to process the task simultaneously. I haven’t had time to try this though.
There are online comments around caching each result and checking the cache before calculating, but in my head I’m not sure how that works if you are doing a “One to all” matrix.
I wonder if graphhopper caches each individual instruction instead of “complete paths”. I’m unsure how to implement something like that.
Keen to hear if you have any insight or solutions of how to do this efficiently.
Open door logistics completes the task somewhat quickly for a 1000 point problem using forwards / backwards searching.