用并行编程扫描输出空间求解源分析问题

IF 0.8 4区 工程技术 Q4 ENGINEERING, CIVIL
Önder Halis Bettemi̇r, Tuğba Erzurum
{"title":"用并行编程扫描输出空间求解源分析问题","authors":"Önder Halis Bettemi̇r, Tuğba Erzurum","doi":"10.18400/tekderg.595238","DOIUrl":null,"url":null,"abstract":"Exact Solution of Resource Leveling Problem by Exhaustive Enumeration with Parallel Programming Resource Leveling Problem (RLP) is solved by heuristic, meta-heuristic, and mathematical methods. However, the aforementioned methods cannot guarantee the exact solution for large size problems. In this study, number of feasible schedules which can be obtained by delaying the non-critical activities without violating the precedence relationships and elongating the project completion time are computed. All of the feasible schedules which can be defined as the search domain are enumerated and the guaranteed optimum solution for the RLP is obtained by a different method from the existing methods. Exponential equation between the search domain and the number of activities on serial path is derived and the insolvability of large RLP in a reasonable time by one central processing unit is verified. Partitioning of the problem into equal sizes is provided by parallel programming so that each particle contains the same number of enumeration. In this study, four RLP in which the largest problem has 36 activities are solved by exhaustive enumeration within reasonable solution time and it is proved that the proposed method is applicable. Exact solutions of larger problems can also be obtained by the proposed method if the problem is partitioned into smaller sizes.","PeriodicalId":49442,"journal":{"name":"Teknik Dergi","volume":" ","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Kaynak Dengeleme Probleminin Arama Uzayını Paralel Programlama ile Tarayarak Kesin Çözümü\",\"authors\":\"Önder Halis Bettemi̇r, Tuğba Erzurum\",\"doi\":\"10.18400/tekderg.595238\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exact Solution of Resource Leveling Problem by Exhaustive Enumeration with Parallel Programming Resource Leveling Problem (RLP) is solved by heuristic, meta-heuristic, and mathematical methods. However, the aforementioned methods cannot guarantee the exact solution for large size problems. In this study, number of feasible schedules which can be obtained by delaying the non-critical activities without violating the precedence relationships and elongating the project completion time are computed. All of the feasible schedules which can be defined as the search domain are enumerated and the guaranteed optimum solution for the RLP is obtained by a different method from the existing methods. Exponential equation between the search domain and the number of activities on serial path is derived and the insolvability of large RLP in a reasonable time by one central processing unit is verified. Partitioning of the problem into equal sizes is provided by parallel programming so that each particle contains the same number of enumeration. In this study, four RLP in which the largest problem has 36 activities are solved by exhaustive enumeration within reasonable solution time and it is proved that the proposed method is applicable. Exact solutions of larger problems can also be obtained by the proposed method if the problem is partitioned into smaller sizes.\",\"PeriodicalId\":49442,\"journal\":{\"name\":\"Teknik Dergi\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Teknik Dergi\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.18400/tekderg.595238\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, CIVIL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Teknik Dergi","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.18400/tekderg.595238","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 3

摘要

资源均衡问题采用启发式、元启发式和数学方法求解。然而,上述方法不能保证大尺寸问题的精确解决。本文计算了在不违反优先关系和延长项目完成时间的情况下,延迟非关键活动所能获得的可行进度数。列举了可定义为搜索域的所有可行调度,并采用不同于现有方法的方法获得了RLP的保证最优解。推导了搜索域与序列路径上的活动数之间的指数方程,并验证了大型RLP在合理时间内的不可解性。并行编程提供了将问题划分为相等大小的方法,以便每个粒子包含相同数量的枚举。在本研究中,通过穷举枚举在合理的求解时间内求解了最大问题有36个活动的4个RLP,并证明了所提方法的适用性。如果将较大的问题划分为较小的问题,该方法也可以得到精确解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Kaynak Dengeleme Probleminin Arama Uzayını Paralel Programlama ile Tarayarak Kesin Çözümü
Exact Solution of Resource Leveling Problem by Exhaustive Enumeration with Parallel Programming Resource Leveling Problem (RLP) is solved by heuristic, meta-heuristic, and mathematical methods. However, the aforementioned methods cannot guarantee the exact solution for large size problems. In this study, number of feasible schedules which can be obtained by delaying the non-critical activities without violating the precedence relationships and elongating the project completion time are computed. All of the feasible schedules which can be defined as the search domain are enumerated and the guaranteed optimum solution for the RLP is obtained by a different method from the existing methods. Exponential equation between the search domain and the number of activities on serial path is derived and the insolvability of large RLP in a reasonable time by one central processing unit is verified. Partitioning of the problem into equal sizes is provided by parallel programming so that each particle contains the same number of enumeration. In this study, four RLP in which the largest problem has 36 activities are solved by exhaustive enumeration within reasonable solution time and it is proved that the proposed method is applicable. Exact solutions of larger problems can also be obtained by the proposed method if the problem is partitioned into smaller sizes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Teknik Dergi
Teknik Dergi 工程技术-工程:土木
自引率
30.80%
发文量
65
审稿时长
>12 weeks
期刊介绍: The scope of Teknik Dergi is naturally confined with the subjects falling in the area of civil engineering. However, the area of civil engineering has recently been significantly enlarged, even the definition of civil engineering has somewhat changed. Half a century ago, engineering was simply defined as “the art of using and converting the natural resources for the benefit of the mankind”. Today, the same objective is expected to be realised (i) by complying with the desire and expectations of the people concerned and (ii) without wasting the resources and within the sustainability principles. This change has required an interaction between engineering and social and administrative sciences. Some subjects at the borderline between civil engineering and social and administrative sciences have consequently been included in the area of civil engineering. Teknik Dergi defines its scope in line with this understanding. However, it requires the papers falling in the borderline to have a significant component of civil engineering.
×
引用
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学术官方微信