Improving Time-Cost Balance in Critical Path Method (CPM) using Dragonfly Algorithm (DA)

The CPM (Critical Path Method) technique is used to search out the longest path to do required activities for compressing and cutting 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 the rising calculation of the critical path during this study, CPM has been applied to improve critical routing intelligence. By simulating and analyzingdragonfly s splotched and regular patterns, this study has obtained a precise algorithm of attainable paths with the smallest amount of cost and time for every activity. This has been done to reduce 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 the shortest amount of time with the lowest cost. This new answer to CPM network analysis can provide project management with a convenient tool.

کلیدواژه ها:

CPM ، Dragonfly algorithm ، Simulation ، The least cost and time