Multi-objective time–cost trade-off optimization for the construction scheduling with Rao algorithms

ArticleAçık Erişim

Özet

Determining the time and cost of activities is one of the most important stages of construction project planning. Measures taken to shorten the time, such as the need for more or more qualified employees, equipment and machinery, increase project direct cost. The process of deciding which option to use in activities with more than one time–cost option has revealed the time–cost trade-off problem which is discrete optimization. Within the scope of this study, the non-dominant sorting (NDS) method is integrated into the Rao-1 and Rao-2 algorithms and applied to small and medium-scale problems. The numerical results show that the NDS-Rao-2 algorithm has found a better result with a significant number of function evaluations compared to algorithms such as PSO, ACO, GA and TLBO used in previous studies. In addition, the NDS-based Rao-2 algorithm not only find optimal /near results, but also suggest more than one pareto result to the decision maker for time–cost trade-off problem. For this reason, the developed multi-objective Rao-2 algorithm can be considered as a very good alternative for time–cost trade-off problems which are combinatorial problems. © 2023 Institution of Structural Engineers

Anahtar Kelimeler

RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/ebyu/12037Resmi atıflarda kullanılan kalıcı adres
Tam Kayıt
AlanDeğerDil
dc.contributor.authorYılmaz, Mehmet
dc.contributor.authorDede, Tayfun
dc.date.accessioned2026-10-18T20:26:59.745059432Z
dc.date.available2026-10-18T20:26:59.745059432Z
dc.date.issued2023
dc.description.abstractDetermining the time and cost of activities is one of the most important stages of construction project planning. Measures taken to shorten the time, such as the need for more or more qualified employees, equipment and machinery, increase project direct cost. The process of deciding which option to use in activities with more than one time–cost option has revealed the time–cost trade-off problem which is discrete optimization. Within the scope of this study, the non-dominant sorting (NDS) method is integrated into the Rao-1 and Rao-2 algorithms and applied to small and medium-scale problems. The numerical results show that the NDS-Rao-2 algorithm has found a better result with a significant number of function evaluations compared to algorithms such as PSO, ACO, GA and TLBO used in previous studies. In addition, the NDS-based Rao-2 algorithm not only find optimal /near results, but also suggest more than one pareto result to the decision maker for time–cost trade-off problem. For this reason, the developed multi-objective Rao-2 algorithm can be considered as a very good alternative for time–cost trade-off problems which are combinatorial problems. © 2023 Institution of Structural Engineers
dc.identifier.doi10.1016/j.istruc.2023.01.006
dc.identifier.endpage808
dc.identifier.issn2352-0124
dc.identifier.scopus2-s2.0-85146018978
dc.identifier.startpage798
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/ebyu/12037
dc.identifier.volume48
dc.identifier.wosWOS:000923395900001
dc.language.isoen
dc.publisherElsevier Ltd
dc.relation.ispartofStructures
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectDecision making
dc.subjectMulti objective discrete optimization
dc.subjectTime–cost trade-off
dc.titleMulti-objective time–cost trade-off optimization for the construction scheduling with Rao algorithms
dc.typeArticle
dspace.entity.typePublication
rdl.citation.scopus52
rdl.citation.wos40
rdl.source.indexSCOPUS
rdl.source.indexWOS
rdl.wos.indexScience Citation Index Expanded (SCI-EXPANDED)