A program to explore Combinatorics using a Genetic Algorithm to solve the TSP (Travelling Salesman Problem)

A program written in Rust to explore Combinatorics using a Brute Force Algorithm to solve the TSP (Travelling Salesman Problem)

Solve vehicle routing problems with Google Optimization AI Cloud Fleet Routing

TSP - Ant Colony Optimization

This Python package provides implementations of three metaheuristic algorithms to solve the Traveling Salesman Problem (TSP): Steepest Ascent Hill Climbing, Simulated Annealing, and Ant Colony Optimization.

https://go.multiroute.de/

An application that uses the ant algorithm to solve the traveling salesman problem (TSP), written in PHP 8.3, Symfony 7.0 and Angular.

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.

This "Travel Route Planner" project optimizes travel plan within budget and distance constraints. Using Knapsack & Greedy Method for budget allocation and dynamic programming for TSP, it offers efficient routes. With geocoding & mapping, it tailors plans for satisfying travel experiences.

Ant colony optimization workshop for solving a travelling salesman problem

This project aims to show capabilities of Alteryx software on the Kaggle data named "Superstore". The project includes creation of an analytic application, spatial analysis, creating report visualisations, exploratory data analysis, and a unique Alteryx approach to the traveling salesman problem.

code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem

https://tour.multiroute.de/

The implementation of the ant colony optimization algorithm. Allows to solve Travelling Salesman Problem , Shortest path problem, etc.

This repository is created for educational purposes as part of the Intelligent Systems Lab Assignment. It aims to foster understanding of evolutionary computation techniques and encourage experimentation with genetic algorithms in solving combinatorial optimization problems.

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.

Traveling Salesman Problem (TSP) "resolved" with Python Genetic Algorithm.

A Python repository containing code to approximate a solution for the Traveling Salesman Problem (TSP) using a genetic algorithm. The genetic algorithm optimizes the route for visiting a set of cities exactly once, minimizing the total distance traveled.

An interactive tool for exploring Hopfield networks, showcasing neural dynamics, pattern recognition, and TSP optimization.

Efficient TSP solver using Simulated Annealing for Iran's provincial centers. Python code for route optimization and visualization. Explore shortest routes!