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 リリースの互換性
プラットフォームの互換性
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 >
タグ
謝辞
ヒントを与えたファイル: job_shop_scheduling_Cross_over, Algoritmo de Colonia de Hormigas
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 |