Network Analysis Algorithm for the Solution of Discrete Time-Cost Trade-off Problem

Basit Öğe Kaydı
dc.authoridBettemir, Önder/0000-0002-5692-7708
dc.authorwosidBirgonul, M.Talat/ABA-1501-2020
dc.authorwosidBettemir, Önder/ABG-8533-2020
dc.contributor.authorBettemir, Onder Halis
dc.contributor.authorBirgonul, M. Talat
dc.date.accessioned2024-08-04T20:42:33Z
dc.date.available2024-08-04T20:42:33Z
dc.date.issued2017
dc.departmentİnönü Üniversitesien_US
dc.description.abstractOptimum solution of time-cost trade-off problem has significant importance since it provides the highest profit opportunity. For this reason, exact, heuristic, and meta-heuristic algorithms are adapted to obtain the optimum or near-optimum solution. However, heuristic algorithms may not always converge into the global optimum, while meta-heuristic algorithms require significant computation to converge into global optimum and exact methods are complex for construction planners to implement. Therefore, minimum cost-slope based fast converging network analysis algorithm, which provides optimum or near-optimum solutions, is proposed for discrete time-cost trade-off problem. The algorithm searches the global optimum through the feasible crashing options. Number of feasible crashing options increase tremendously in large projects. Therefore, an elimination algorithm is embedded to reduce the number of crashing options. The crashing option with the lowest unit crashing cost is executed and global optimum is searched by stepwise crashing. Tests on 18 and 63-Activity projects revealed that the network analysis algorithm converges to optimum or near-optimum solution by only one percent of the computational demand of meta-heuristic algorithms. Consequently, the proposed heuristic algorithm is a convenient optimization method for the solution of time-cost trade-off problem.en_US
dc.identifier.doi10.1007/s12205-016-1615-x
dc.identifier.endpage1058en_US
dc.identifier.issn1226-7988
dc.identifier.issn1976-3808
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-84979246840en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage1047en_US
dc.identifier.urihttps://doi.org/10.1007/s12205-016-1615-x
dc.identifier.urihttps://hdl.handle.net/11616/97441
dc.identifier.volume21en_US
dc.identifier.wosWOS:000399805000002en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherKorean Society Of Civil Engineers-Ksceen_US
dc.relation.ispartofKsce Journal of Civil Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjecttime-cost trade-offen_US
dc.subjectoptimizationen_US
dc.subjectproject planningen_US
dc.subjectnetwork analysis algorithmen_US
dc.titleNetwork Analysis Algorithm for the Solution of Discrete Time-Cost Trade-off Problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu