The travelling salesman problem is a np-hard problem with application in supply chain and computer science
Project description
The code uses PuLP module to formulate the problem and CPLEX, GUROBI, COIN_CMD, and PULP_solver to find the exact solution of the TSP. The module also includes heuristics and metaheuristics functions that can be used for large instances. More functions will be added. If you find an error or want to solve problems together write to me @shamikpushkar92@gmail.com.
The module has two parts:
1. Exact Solution tsp_exact uses PuLP module to formulate the problem and CPLEX, GUROBI, COIN_CMD, and PULP_solver to find the exact solution of the TSP. To setup an external solver follow this link.
2. Heuristics & Metaheuristics heuristics & metaheuristic functions are local search algorithms that can be used for large instances.
Dependencies include pulp, numpy, pandas, scipy, and copy.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for tsp_solutions-0.0.2-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c010eb31ed801d96a47256adba5b788576a2bf77c19b1ea96f770d0f5d7dbfc2 |
|
| MD5 | 40162eb1ca3865401d386fc08d9abbb1 |
|
| BLAKE2b-256 | cbf4df893206b578326a8a85586792e558f960a8acbc1408f9d39353f6d84f5a |
