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 |