Improving Dijkstra’s algorithm for Estimating Project Characteristics and Critical Path

Author:

Siripurapu Adilakshmi1,Shankar Nowpada Ravi2,Srinivasa Rao K.3

Affiliation:

1. Dept. of Basic Science and Humanities, Vignan’s Institute of Information Technology (A)

2. Dept. of Mathematics, Institute of Science, GITAM (Deemed to be University)

3. Dept. of Operations, GITAM school of Business, GITAM (Deemed to be University)

Abstract

Developing a project planning structure for all industries is a technological challenge involving evaluating several restrictions for each activity’s respective task and its planning tools. Any restriction affects the completion time, operating costs, and overall project performance. Programme Evaluation Review Technique (PERT) and Critical Path Method (CPM) processes made many researchers study the possible ways of finding the critical paths and activities in the network. The advancement of the CPM and PERT towards a probabilistic environment is still a long way off. However, Artificial intelligence approaches such as the Genetic Algorithm, Dijkstra’s algorithm, and others are utilized for network analysis within the project management framework. This study is to help the project manager plan schedule for a construction project to determine the expected completion time. In this research paper, we describe a method for obtaining the earliest and latest times of a critical path using modified Dijkstra’s algorithm with triangular fuzzy numbers. Forward pass and backward pass algorithms are designed to find the optimal path for the proposed method. Numerical examples are also illustrated for the same. Simulation results are included by the use of the “C” program. Finally, a comparison is made with the traditional method PERT.

Publisher

Journal Dependability

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3