Parallel NACO for TSP
(ACO) method combined with the Neighbour Joining method (NJ) in a parallel model
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
this code is going to structure a hybrid algorithm that consists of the (ACO) method combined with the Neighbour Joining method (NJ) to solve traviling salesman problem . This method is called a Neighbour joining Ant Colony Optimization method (NACO) that applied to get accurate and efficient results in the hybrid model
Cite As
Warif Badir (2026). Parallel NACO for TSP (https://in.mathworks.com/matlabcentral/fileexchange/79131-parallel-naco-for-tsp), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.1 (69 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.1 |
