RoutingSolver is an efficient solver for routing problems. Developed during my PhD, it uses local search and problem-knowledge to compute high-quality solutions in a short time.


Optimal or close to optimal solutions can be computed in a few minutes, while competing with the best algorithms in the field.


Good solutions for extremely large problems with 10.000 and more customers can be computed.



The efficiency and simple structure of the solver allows to embed it in simulation studies and solve supply chain problems.