Prize-Collecting Traveling Salesman Problem with Time Windows
TSP is a classic optimization problem in computer science and operations research. In this essay, we playfully apply TSP to the case where Elon Musk, the visionary entrepreneur of SpaceX, wishes to visit all the planets of our solar system with minimum cost.
Free, intelligent routing for your logistics – now on Python.
Program proposing a solution to the traveler's problem
Given a network, equipped with a specific total and strict order, we get the minimal "round trip" traversal length. It always converges, at quadratic cost.
This project focuses on a variation of TSP known as the Multiple Traveling Salesman Problem (mTSP), where more than one traveling salesman is involved, each with a specific set of cities to visit.
Simulated annealing for solving the travelling salesman problem
Add a description, image, and links to the salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the salesman-problem topic, visit your repo's landing page and select "manage topics."