Ant Colony Optimization (ACO)
版本 1.0.0.0 (56.3 KB) 作者:
Dimas Aryo
Solve dynamic job shop scheduling problem with ant colony optimization (ACO).
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.
引用格式
Dimas Aryo (2024). Ant Colony Optimization (ACO) (https://www.mathworks.com/matlabcentral/fileexchange/32009-ant-colony-optimization-aco), MATLAB Central File Exchange. 检索时间: .
MATLAB 版本兼容性
创建方式
R14SP1
兼容任何版本
平台兼容性
Windows macOS Linux类别
- Mathematics and Optimization > Global Optimization Toolbox > Particle Swarm >
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Solver-Based Linear Programming >
在 Help Center 和 MATLAB Answers 中查找有关 Particle Swarm 的更多信息
标签
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!ACO on JSSP/
版本 | 已发布 | 发行说明 | |
---|---|---|---|
1.0.0.0 |