As you might know, the VRP and many of its variants are NP-Complete
problems. So one could solve an instance of these problems by generating
an ILP instance(https://en.wikipedia.org/wiki/Vehicle_routing_problem).
There are many academic publications about how to find a sub-optimal
solution in polynomial time (just search scholar.google.com).
It looks like Wikipedia listed a couple of open source/free software
for solving this problem.
Amir
On 07/22/2016 06:14 AM, Dimitrios Chr. Ioannidis wrote:
Hi,
does anyone knows any object pascal or c ( not c++, java, lisp ... )
library that can solve the Vehicle Routing Problem with Time Windows,
open source or not ? Searched but couldn't find any ...
regards,
_______________________________________________
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
