Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling
In large and complex project schedule networks, existing algorithms to determine the critical path are considerably slow. Therefore, an algorithm with a faster convergence is needed to improve the efficiency of the critical path computation. The ant colony algorithm was first applied to the travelli...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9930113 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|