Hi ArnoldF,
First, thank you for the excellent work on “Efficiently solving very large-scale routing problems.” It’s been really insightful, and the engineering behind KLGSXXL is impressive.
In your paper, the alpha-nearness and 1-tree components appear to contribute to performance. Could you point me to where these are implemented in the KLGSXXL codebase? Files, modules, or key functions would be great.
Thanks again for making this work available!
Best wishes,
ShunyuYao6
Hi ArnoldF,
First, thank you for the excellent work on “Efficiently solving very large-scale routing problems.” It’s been really insightful, and the engineering behind KLGSXXL is impressive.
In your paper, the alpha-nearness and 1-tree components appear to contribute to performance. Could you point me to where these are implemented in the KLGSXXL codebase? Files, modules, or key functions would be great.
Thanks again for making this work available!
Best wishes,
ShunyuYao6