Ant Colony Optimization (ACO)

Solve dynamic job shop scheduling problem with ant colony optimization (ACO).
14K descargas
Actualizado 29 jun 2011

Ver licencia

Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination point. One solution that can be used is with the ant colony optimization algorithm. There are three method to input the job : xls file, matriks, and atrractive dialog.

Citar como

Dimas Aryo (2024). Ant Colony Optimization (ACO) (https://www.mathworks.com/matlabcentral/fileexchange/32009-ant-colony-optimization-aco), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R14SP1
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Versión Publicado Notas de la versión
1.0.0.0