Fork of the Concorde TSP solver with an easier build procedure
-
Updated
Mar 17, 2024 - C
Fork of the Concorde TSP solver with an easier build procedure
This repository lists 4 problems solved using C. Each problem has its own serial and parallel implementations. For the latter, the OpenMP API was utilized.
Parallel genetic algorithm for solving the travelling salesman problem.
A Travelling Salesman Problem solver written in C implementing Genetic Algorithms.
This is a bus ticket booking system created using C program 🚌.
An efficient dynamic programming approach to solve travelling salesman problem
Projekt P1 - Levering af pakker
Applied Genetic Algorithm to solve the Travelling salesman problem, and parallelized it using openmp.
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
ECOM 031 - Instituto de Computação UFAL
A project in AI to generate an efficient solution for a TSP(max. 500 nodes). TL: 5 minutes
C program that applies metaheuristic simulated annealing to the Travelling Salesman problem.
Travelling Salesman Problem solved using MPI and DFS
Operational Research 2 - PROJECT
Tarkvara projekt, mille eesmärk on ära lahendada proovireisija ülesanne.
Resolução do problema do caixeiro viajante (Traveling Salesman Problem)
Travelling Salesman Problem utilizando uma MST (Minimum Spanning Tree) - Tópicos de Busca e Ordenação, Ufes.
TSP optimization, Operations Research 2 project, UniPD 2022/23
Search and Sorting Algorithms (SSA, a.k.a TBO)
Add a description, image, and links to the travelling-salesman-problem topic page so that developers can more easily learn about it.
To associate your repository with the travelling-salesman-problem topic, visit your repo's landing page and select "manage topics."