Algoritmo de Colonia de hormigas simple
Version 1.0.0 (27 KB) by
Andres Herrera Roman
Se presenta la aplicación de una colonia de hormigas para encontrar el camino mas corto entre dos puntos de una red simple.
Es la solución al camino mas corto de una red de nodos con peso, para ello se hizo uso de un sistema elitista de hormigas.
Cite As
Andres Herrera Roman (2024). Algoritmo de Colonia de hormigas simple (https://www.mathworks.com/matlabcentral/fileexchange/72857-algoritmo-de-colonia-de-hormigas-simple), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2019a
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
Find more on Traveling Salesman (TSP) in Help Center and MATLAB Answers
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0 |