A Comparative Study on Different Algorithms for finding Longest Route in a Project Network

Network techniques are often used in scheduling projects that contain many interrelated activities. One approach that has been widely used is the Critical Path Method(CPM), in which a network diagram depicts precedence among activities. In the CPM, such as three parameters earliest event time, latest event time andslack time are used to determine each of the critical activities. This paper also deals with the methodology to find the critical path using modified Dijkstra’s algorithm, Floyd Warshall’s algorithm and Bellman Ford algorithm. In addition to critical path problem formulated as a Linear Programming Problem (LPP), it wasalso solved using binary integer (0-1) programming formulation. Further, dual of the linear programming is used to determine the critical path as well as critical distance. Finally, these algorithms were executed using matlab software.