All Categories → No Category → traveling-salesman-problem

Top 6 traveling-salesman-problem open source projects

AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

optapy

OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.

✭ 167

python java javascript artificial-intelligence np-hard np-complete vehicle-routing-problem local-search simulated-annealing tabu-search metaheuristics employee-rostering task-assignment traveling-salesman-problem mathematical-optimization

tsplib95

Library for working with TSPLIB files.

✭ 48

python fortran c Makefile pypi networkx tsp networkx-graph traveling-salesman-problem tsplib tsplib-format

VeRyPy

A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.

✭ 166

python bing-maps nearest-neighbor vehicle-routing-problem heuristics tsp classical cvrp tsp-solver maximum-matching generalized-assignment-problem sweep-algorithm savings-algorithm traveling-salesman-problem lagrangian-relaxation gurobipy local-search-algoirthms insertion-algorithms parallel-savings

TravelingSalesmanHeuristics.jl

Julia package for simple traveling salesman problem heuristics

✭ 46

julia traveling-salesman heuristic tsp traveling-salesman-problem

tsp-essay

A fun study of some heuristics for the Travelling Salesman Problem.

1-6 of 6 traveling-salesman-problem projects