Solving TSP using A star, RBFS, and Hill-climbing algorithms

Version 1.0.2 (2.45 MB) by Hamdi Altaheri
Solving Travelling Salesman Problem TSP using A* (star), Recursive Best First Search RBFS, and Hill-climbing Search algorithms
5.0
(1)
332 Downloads
Updated 15 Nov 2022
View License on GitHub
Design algorithms to solve the TSP problem based on the A*, Recursive Best First Search RBFS, and Hill-climbing search algorithms. The Pseudocode, performance analysis, and experiment results of these algorithms are included in a document.

Cite As

Hamdi Altaheri (2026). Solving TSP using A star, RBFS, and Hill-climbing algorithms (https://github.com/Altaheri/TSP-Travelling-Salesman-Problem/releases/tag/v1.0.2), GitHub. Retrieved .

MATLAB Release Compatibility
Created with R2018b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

codes

Version Published Release Notes
1.0.2

See release notes for this release on GitHub: https://github.com/Altaheri/TSP-Travelling-Salesman-Problem/releases/tag/v1.0.2
1.0.1

Update Website and GitHub links
1.0.0

To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.