https://github.com/centuriontheman/travellingsalesmanproblem

Few implementations of algorithms solving Travelling Salesman Problem
https://github.com/centuriontheman/travellingsalesmanproblem

Last synced: about 7 hours ago
JSON representation

Few implementations of algorithms solving Travelling Salesman Problem

• Host: GitHub
• URL: https://github.com/centuriontheman/travellingsalesmanproblem
• Owner: CenturionTheMan
• License: mit
• Created: 2023-10-08T17:16:28.000Z (over 1 year ago)
• Default Branch: master
• Last Pushed: 2024-01-14T11:34:53.000Z (about 1 year ago)
• Last Synced: 2024-01-15T07:26:58.746Z (about 1 year ago)
• Language: C#
• Size: 354 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.txt

Awesome Lists containing this project

README

        
# Travelling Salesman Problem

## Overview

This repository contains an implementation of a few algorithms for the Travelling Salesman Problem (TSP) in WinForms/C#. The TSP is a classic problem in the field of optimization and graph theory, where the goal is to find the shortest possible route that visits once all vertices and returns to the original vertex (minimal Hamilton cycle).



## Features

- C# implementation of the TSP solver.

- Supports multiple algorithms for solving TSP, such as:

  - Brute Force

  - Dynamic Programming

  - Branch And Bounds

  - Simulated Annealing

  - Genetic Algorithm

 ## Loading files

Application can create random adjeancy matrix or load one from [TSPLIB](http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/index.html) (.xml, .atsp).

## License

This project is licensed under the MIT License. You are free to use, modify, and distribute the code as per the terms of the license.