Developing a Genetic Optimizer for Capacitated Multiple Depot Vehicle Routing Problems (NP-Hard)

Hey everyone,

currently I am developing a genetic optimizer for solving large-scale instances of the capacitated multiple-depot vehicle routing problem, which is a generalization of the famous traveling salesman problem (TSP). The package is called vrpoptima and is hosted here:

I am looking for people who might be interested in combinatorial optimization and R in order to test and extend the package as currently R does not support solutions for this type of NP-hard problems, while the OR-Tools in Python does provide similar functionality. In case anyone is interested, please let me know.


This topic was automatically closed 21 days after the last reply. New replies are no longer allowed.

If you have a query related to it or one of the replies, start a new topic and refer back with a link.