Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.

Login

Algorithms

  1. Home
  2. Algorithms
  3. Report

tsp_solver

Users: 1 - Average Rating: 3.00

This library provides an algorithm for searching sub-optimal solutions to the Travelling Salesman Problem.
Scientific Area:
Python
Language/Environments:
Learning, Optimization
Target Group:
Basic
Link:
https://pypi.org/project/tsp-solver2/
Cite as:
Shintyakov, D., 2017. Tsp-solver2: Greedy, suboptimal solver for the Travelling Salesman Problem. PyPI. Available at: https://pypi.org/project/tsp-solver2/. [Acessed 17 November 2022]
Author of the review:
Gabriel Amaral
IPB


Reviews

You have to login to leave a comment. If you are not registered click here

Eligius Hendrix


We are talking about one of the most investigated mathematical problems which is a base for vehicle routing problems. Just to take into account that pi is not the fastest way to generate solutions.
Back to the Algorithms List