Smart Legion Lab

TSP Ecosystem

Exact Solvers Heuristic +25% Benchmark PCH Paradigm Open Source

TSP Ecosystem

The TSP ecosystem is a comprehensive suite of exact and heuristic solvers for the Traveling Salesman Problem — featuring Exact TSP Solver (Go) and Smart TSP Oracle (Python) for provably optimal solutions via branch-and-bound, Smart TSP Solver (Python) for large-scale heuristic routing with Dynamic Gravity and Angular-Radial algorithms, and Smart TSP Benchmark for professional algorithm testing — all grounded in the Position-Candidate-Hypothesis (PCH) paradigm for NP-complete problems.

Go Python Branch & Bound Heuristic Benchmark PCH

Related Research

Position‑Candidate‑Hypothesis

Structural-statistical approach to NP-complete problems — n hypotheses, n positions, n candidates.

Read more

Angular‑Radial & Dynamic Gravity

Spatial intelligence algorithms that improve TSP solutions by up to 25% on clustered and real-world data.

Explore algorithm

Related Ecosystems

Research Ecosystem

4 paradigms with DOI and Ecosystems.

Explore

Related Applications

CLI / Go
Exact TSP Solver

High-performance exact solver for TSP using intelligent Branch and Bound algorithm with adaptive thresholding. Finds globally optimal solution for small to medium instances.

GitHub
CLI / Python
Smart TSP Oracle

Exact solver for TSP implemented in Python. Uses intelligent Branch and Bound algorithm with adaptive thresholding for globally optimal solutions.

GitHub
Benchmark
Smart TSP Benchmark

Professional-grade testing infrastructure with configurable scenarios, detailed metrics, and comparative analysis for TSP algorithms.

GitHub

Related Libraries

Smart TSP Solver

High-performance Python library for solving TSP using novel heuristics. Outperforms classical methods by ~25% on real and clustered data using spatial intelligence.

GitHub
Back to Ecosystems

Connect & Collaborate

Alexander Suvorov Email GitHub PyPI