Streamlit app to demonstrate a Genetic Algorithm to solve the Traveling Salesman Problem.

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.

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.

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!

Implementations performed in the study of heuristics and meta heuristics

A super simple Python wrapper for the constrained traveling salesman and vehicle routing problem solver LKH-3.

A Genetic Algorithm project for solving The Traveling Salesman Problem "TSP"using Roulette Wheel Selection, Ordered Crossover (OX) and Mutation Swap Mutation

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.

The Traveling Salesman Problem (TSP) aims for the most efficient route across cities. This Python project, employing Tkinter and the Model-View-Controller (MVC) architecture, visualizes TSP solutions. It generates random cities, utilizes the nearest neighbor algorithm, and presents the optimal path with a Tkinter-based GUI.

Evolutionary Computation labs @ PUT.

The Lin-Kernighan Heuristic implemented in python

I developed this project to delve into Genetic Algorithms and their application to optimization problems. Feel free to explore the code, run the algorithm, and share your feedback.

Harmony Search (HS) Travelling Salesman Problem (TSP) with Python

Simple app to solve Traveling Salesperson Problems with pure Python code

Resolve TSP problem with GA and more crossover.