Find the best routes
Increase your sales efficiency with our Logistic Algorithms. Cut costs, spend less time and close more deals.
Get Started for Free ->Main Features
Proprietary Algorithm
We do not use AI, just code and creativity. Our algorithm fits perfectly in problems that require a travel around connected points and return to the origin in just one visit per point
TSPLIB Tested
TSPLIB is a reference about the kind of problem that we solve, this is why we tested and solved many problems from this library and share our results HERE
Simple I/O
During this test phase you can test many graphs using excel sheets. Soon we will provide a google maps building to construct routes. We generate the results as a pdf file
About Us
"Nobody knows if P = NP, but Traveling Salesman Problem (TSP) isn't NP anymore!"
We are an Startup that born after many tries of our creator that never belived that the TSP was NP, so he tried by himself create an algorithm that solve the TSP in polynomial time, and he devised it. After improviments and many tests he created this first betha version to community test it. The logistic service we want offer in future is based in some kind of problem called TSP. until now it wasn't solvable in polynomial time, but our creator saw a way to turn it polynomial. Enjoy and welcome to the logistic's future where everyone can find the best route almost instantently.
Contact Us
Fill out the form below to get in touch with our team.