Ant Colony Optimization (ACO)

Solve dynamic job shop scheduling problem with ant colony optimization (ACO).
14K Downloads
Updated 29 Jun 2011

View License

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.

Cite As

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

MATLAB Release Compatibility
Created with R14SP1
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!
Version Published Release Notes
1.0.0.0