Skip to content

About

An algorithm that organizes deliveries by required deadlines, distances, and routes. The algorithm is optimized to find an efficient solution to a version of the Traveling Salesman Problem, an NP-Hard problem.

Stars

0 stars

Watchers

1 watching

Forks

About

An algorithm that organizes deliveries by required deadlines, distances, and routes. The algorithm is optimized to find an efficient solution to a version of the Traveling Salesman Problem, an NP-Hard problem.

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages