Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA)
| Autor: | Mohmmad Anvar Adibhesami, Ahmad Ekhlassi, Ali Mohammad Mosadeghrad, Amirhossein Mohebifar |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: | |
| Zdroj: | International Journal of Industrial Engineering and Production Research, Vol 30, Iss 2, Pp 187-194 (2019) |
| Druh dokumentu: | article |
| ISSN: | 2008-4889 2345-363X 98980874 |
| Popis: | The CPM (critical path method) technique is to search out the longest path to try and do activities, so as to compress and cut back the time it takes for a project, which finally ends up inside the creation of an identical and intensive network of activities inside the targeted work. This formal random simulation study has been recognized as a remedy for the shortcomings that are inherent to the classic critical path technique (CPM) project analysis. Considering the importance of time, the cost of activities within the network, and rising the calculation of the critical path during this study, Critical Path technique has been applied to improve critical routing intelligence. This study, by simulating and analyzing dragonfly's splotched and regular patterns, has obtained the precise algorithm of attainable paths with the smallest amount cost and time for every activity. This has been done to put down the restrictions and enhance the computing potency of classic CPM analysis. The simulation results of using Dragonfly Algorithm (DA) in CPM, show the longest path in shortest time with the lowest cost. This new answer to CPM network analysis can provide project management with a convenient tool. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|