Skip to content
#

traveling-salesman-problem

Here are 236 public repositories matching this topic...

This project applies Simulated Annealing to solve the Traveling Salesman Problem using Peru's departments as nodes. Through iterative refinement, it finds the shortest route visiting each department once. Visual feedback enhances understanding and debugging, resulting in an optimal solution displayed with total distance.

  • Updated May 24, 2024
  • Python

TravelPathOptimizer for trucking logistics is a software tool that boosts efficiency by determining optimal routes through algorithms. It accounts for traffic, weather, load, and timing, dynamically adjusting for delays. This reduces costs, ensures prompt deliveries, and enhances service, boosting trucking productivity and sustainability.

  • Updated May 22, 2024
  • Go

Optimize specific transports (single depot location, customer locations with pickups and deliveries) and displays the optimal routes for each of your vehicles on the map.

  • Updated May 22, 2024
  • JavaScript

Improve this page

Add a description, image, and links to the traveling-salesman-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the traveling-salesman-problem topic, visit your repo's landing page and select "manage topics."

Learn more