Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA)
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 ran...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran University of Science & Technology
2019-06-01
|
| Series: | International Journal of Industrial Engineering and Production Research |
| Subjects: | |
| Online Access: | http://ijiepr.iust.ac.ir/article-1-883-en.html |
| _version_ | 1818723498635296768 |
|---|---|
| author | Mohmmad Anvar Adibhesami Ahmad Ekhlassi Ali Mohammad Mosadeghrad Amirhossein Mohebifar |
| author_facet | Mohmmad Anvar Adibhesami Ahmad Ekhlassi Ali Mohammad Mosadeghrad Amirhossein Mohebifar |
| author_sort | Mohmmad Anvar Adibhesami |
| collection | DOAJ |
| description | 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 dragonflychr('39')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. |
| first_indexed | 2024-12-17T21:11:29Z |
| format | Article |
| id | doaj.art-d0b48a50aa3b4fbcb67d7a7f71003397 |
| institution | Directory Open Access Journal |
| issn | 2008-4889 2345-363X |
| language | English |
| last_indexed | 2024-12-17T21:11:29Z |
| publishDate | 2019-06-01 |
| publisher | Iran University of Science & Technology |
| record_format | Article |
| series | International Journal of Industrial Engineering and Production Research |
| spelling | doaj.art-d0b48a50aa3b4fbcb67d7a7f710033972022-12-21T21:32:27ZengIran University of Science & TechnologyInternational Journal of Industrial Engineering and Production Research2008-48892345-363X2019-06-01302187194Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA)Mohmmad Anvar Adibhesami0Ahmad Ekhlassi1Ali Mohammad Mosadeghrad2Amirhossein Mohebifar3 Iran University of Science and Technology, Narmak Avenue, 16846-13114, Tehran, Iran Iran University of Science and Technology, Narmak Avenue, 16846-13114, Tehran, Iran Tehran University of Medical Sciences University Tarbiat Modares 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 dragonflychr('39')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.http://ijiepr.iust.ac.ir/article-1-883-en.htmlcpmdragonfly algorithmsimulationthe least cost and time. |
| spellingShingle | Mohmmad Anvar Adibhesami Ahmad Ekhlassi Ali Mohammad Mosadeghrad Amirhossein Mohebifar Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) International Journal of Industrial Engineering and Production Research cpm dragonfly algorithm simulation the least cost and time. |
| title | Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) |
| title_full | Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) |
| title_fullStr | Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) |
| title_full_unstemmed | Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) |
| title_short | Improving Time-Cost Balance in Critical Path Method (CPM) Using Dragonfly Algorithm (DA) |
| title_sort | improving time cost balance in critical path method cpm using dragonfly algorithm da |
| topic | cpm dragonfly algorithm simulation the least cost and time. |
| url | http://ijiepr.iust.ac.ir/article-1-883-en.html |
| work_keys_str_mv | AT mohmmadanvaradibhesami improvingtimecostbalanceincriticalpathmethodcpmusingdragonflyalgorithmda AT ahmadekhlassi improvingtimecostbalanceincriticalpathmethodcpmusingdragonflyalgorithmda AT alimohammadmosadeghrad improvingtimecostbalanceincriticalpathmethodcpmusingdragonflyalgorithmda AT amirhosseinmohebifar improvingtimecostbalanceincriticalpathmethodcpmusingdragonflyalgorithmda |