在模糊时间成本权衡问题中寻找网络关键路径的另一种方法

B. Abinaya, E. C. H. Amirtharaj
{"title":"在模糊时间成本权衡问题中寻找网络关键路径的另一种方法","authors":"B. Abinaya, E. C. H. Amirtharaj","doi":"10.17485/ijst/v17i10.3143","DOIUrl":null,"url":null,"abstract":"Background : The critical path approach is used to determine the network's longest path, according to historical records. This study examines a different approach to determining the construction network's longest path. Method: Here, the network is viewed as a directed acyclic graph, and the critical path of the network is found using the longest path algorithm of the network. To find the best answer for a building project, the longest path that was found was integrated into a linear programming issue. The triangle fuzzy variable defines all of the project's inputs. The 992 square foot building area is incorporated, and three project manager’s quotes are used as a triangular fuzzy variable. Findings : This work has the options of getting quotation from the project managers, convert them as the fuzzy variables such as triangular fuzzy variable, Trapezoidal fuzzy variable and pentagonal fuzzy variable. After the network is converted into a linear programming problem using the fully fuzzy mathematical model, the best possible solution is found. Novelty and applications : Alternative method for critical path of the network has been incorporated. It has been found that the proposed method reduces the time to find the critical path of the larger networks. Keywords: Directed Acyclic Graph, Longest Path Algorithm, Triangular Fuzzy Variable, Fuzzy Linear Programming Problem, Fully Fuzzy Mathematical Model","PeriodicalId":13296,"journal":{"name":"Indian journal of science and technology","volume":" 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Alternative Method for Finding the Critical Path of the Network in Fuzzy Time Cost Trade off Problem\",\"authors\":\"B. Abinaya, E. C. H. Amirtharaj\",\"doi\":\"10.17485/ijst/v17i10.3143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Background : The critical path approach is used to determine the network's longest path, according to historical records. This study examines a different approach to determining the construction network's longest path. Method: Here, the network is viewed as a directed acyclic graph, and the critical path of the network is found using the longest path algorithm of the network. To find the best answer for a building project, the longest path that was found was integrated into a linear programming issue. The triangle fuzzy variable defines all of the project's inputs. The 992 square foot building area is incorporated, and three project manager’s quotes are used as a triangular fuzzy variable. Findings : This work has the options of getting quotation from the project managers, convert them as the fuzzy variables such as triangular fuzzy variable, Trapezoidal fuzzy variable and pentagonal fuzzy variable. After the network is converted into a linear programming problem using the fully fuzzy mathematical model, the best possible solution is found. Novelty and applications : Alternative method for critical path of the network has been incorporated. It has been found that the proposed method reduces the time to find the critical path of the larger networks. Keywords: Directed Acyclic Graph, Longest Path Algorithm, Triangular Fuzzy Variable, Fuzzy Linear Programming Problem, Fully Fuzzy Mathematical Model\",\"PeriodicalId\":13296,\"journal\":{\"name\":\"Indian journal of science and technology\",\"volume\":\" 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indian journal of science and technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17485/ijst/v17i10.3143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indian journal of science and technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17485/ijst/v17i10.3143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

背景:根据历史记录,关键路径法用于确定网络的最长路径。本研究探讨了确定施工网络最长路径的不同方法。方法:在这里,网络被视为有向无环图,网络的关键路径使用网络的最长路径算法来确定。为了找到建筑项目的最佳答案,将找到的最长路径整合到线性规划问题中。三角形模糊变量定义了项目的所有输入。992 平方英尺的建筑面积被纳入其中,三个项目经理的报价被用作三角形模糊变量。研究结果:这项工作可以选择从项目经理处获取报价,并将其转换为三角模糊变量、梯形模糊变量和五边形模糊变量等模糊变量。在使用全模糊数学模型将网络转换为线性规划问题后,找到了最佳可能的解决方案。新颖性和应用 :采用了网络关键路径的替代方法。研究发现,所提出的方法缩短了寻找大型网络关键路径的时间。关键词有向无环图、最长路径算法、三角模糊变量、模糊线性规划问题、全模糊数学模型
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Alternative Method for Finding the Critical Path of the Network in Fuzzy Time Cost Trade off Problem
Background : The critical path approach is used to determine the network's longest path, according to historical records. This study examines a different approach to determining the construction network's longest path. Method: Here, the network is viewed as a directed acyclic graph, and the critical path of the network is found using the longest path algorithm of the network. To find the best answer for a building project, the longest path that was found was integrated into a linear programming issue. The triangle fuzzy variable defines all of the project's inputs. The 992 square foot building area is incorporated, and three project manager’s quotes are used as a triangular fuzzy variable. Findings : This work has the options of getting quotation from the project managers, convert them as the fuzzy variables such as triangular fuzzy variable, Trapezoidal fuzzy variable and pentagonal fuzzy variable. After the network is converted into a linear programming problem using the fully fuzzy mathematical model, the best possible solution is found. Novelty and applications : Alternative method for critical path of the network has been incorporated. It has been found that the proposed method reduces the time to find the critical path of the larger networks. Keywords: Directed Acyclic Graph, Longest Path Algorithm, Triangular Fuzzy Variable, Fuzzy Linear Programming Problem, Fully Fuzzy Mathematical Model
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信