Tsp Python Packages | PyPI Stats

asn1crypto

Python ASN.1 library with a focus on performance and a pythonic API

149.6M 359 146

pyqrackising

Fast MAXCUT, TSP, and sampling heuristics from near-ideal transverse field Ising model (TFIM)

43K 8 1

tsplib95

Library for working with TSPLIB files.

35K 83 21

vrplib

Python package to read and write vehicle routing problem instances.

25K 124 16

alns

Adaptive large neighbourhood search (and more!) in Python.

5K 622 144

rl4co

A PyTorch library for all things Reinforcement Learning (RL) for Combinatorial Optimization (CO)

4K 867 146

moptipyapps

Applications of Metaheuristic Optimization in Python

3K 5 1

py2opt

How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.

1K 34 10

sko

Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)

939 7K 1K

swarmlib

This repository implements several swarm optimization algorithms and visualizes them. Implemented algorithms: Particle Swarm Optimization (PSO), Firefly Algorithm (FA), Cuckoo Search (CS), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), Grey Wolf Optimizer (GWO) and Whale Optimization Algorithm (WOA)

869 575 111

tsp-framework

Framework de algoritmos para resolver el Problema del Vendedor Viajero

700 2 0

acopy

Ant Colony Optimization for Tthe Traveling Salesman Problem.

693 98 31

landscapes

A dependency free library of standardized optimization test functions written in pure Python.

650 62 15

tsp-client

An IETF Time-Stamp Protocol (TSP) (RFC 3161) client

582 8 2

smart-tsp-benchmark

Smart TSP Benchmark is a professional algorithm testing infrastructure with customizable scenarios and detailed metrics.

562 4 2

asn1crypto-tests

Test suite for asn1crypto, separated due to file size

549 359 146

smart-tsp-solver

A high-performance Python library for solving the Traveling Salesman Problem (TSP) using novel heuristic approaches. Features advanced algorithms that outperform classical methods by ~25% on real-world clustered data while maintaining practical computational efficiency.

509 5 2