Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Network Analysis Algorithm for the Solution of Discrete Time-Cost Trade-off Problem
Date
2017-05-01
Author
BETTEMİR, ÖNDER HALİS
Birgönül, Mustafa Talat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
171
views
0
downloads
Cite This
Optimum 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.
Subject Keywords
Network analysis algorithm
,
Project planning
,
optimization
,
Time-cost trade-off
URI
https://hdl.handle.net/11511/41898
Journal
KSCE JOURNAL OF CIVIL ENGINEERING
DOI
https://doi.org/10.1007/s12205-016-1615-x
Collections
Department of Civil Engineering, Article
Suggestions
OpenMETU
Core
Pareto Front Particle Swarm Optimizer for Discrete Time-Cost Trade-Off Problem
Aminbakhsh, Saman; Sönmez, Rifat (2017-01-01)
Intensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem for medium and large-scale projects. This paper presents a new particle swarm optimization method to achieve an advancement in the Pareto front optimization of medium and large-scale construction projects. The proposed Pareto front particle swarm optimizer (PFPSO) is based on a multiobjectiv...
Resource investment problem with time/resource trade-offs
Çolak, Erdem; Azizoğlu, Meral; Department of Industrial Engineering (2011)
In this study, we consider a resource investment problem with time/resource trade-offs in project environments. We assume each mode of an activity is characterized by its processing time and resource requirement and there is a single renewable resource. Our aim is to minimize the maximum resource usage, hence the total amount invested for the single resource. We formulate the problem as a mixed integer linear model and find optimal solutions for small sized problem instances. We propose several lower boundi...
STOCHASTIC MODELING OF STOP-LOSS REINSURANCE AND EXPOSURE CURVES UNDER TIME DEPENDENT STRUCTURE
Mert, Özenç Murat; Kestel, Sevtap Ayşe; Department of Financial Mathematics (2022-12-2)
Insurance markets play an essential role in the economy of the world and its structure requires reinsurance policies due to the growth in populations, extreme (catastrophic) events, political and economical perspectives. In this thesis, stop-loss contracts, one of the reinsurance policy types, are covered for two different contract types: (i) contracts with retention and (ii) contracts with both retention and cap (maximum). This thesis covers two different methodologies, distributional and stochastic behavi...
SUSTAINABLE DESIGN CONSIDERATIONS FOR EMOTIONAL DURABILITY AND PRODUCT LONGEVITY THROUGH PRODUCT CARE ACTIVITIES BY REPAIR ENTHUSIASTS
Yazirlıoğlu, Lilyana; Doğan, Çağla; Department of Industrial Design (2021-8-02)
Take-make-dispose behaviours as the basis of the linear economy model are challenged by the sustainable modes of consumption that aim to minimise the use of raw materials and waste production. The most prominent among these is the circular economy model, which resembles the production and consumption cycles to a living system, and proposes alternative systems where there is no such thing as waste but only food for another within the system (Ellen MacArthur Foundation, 2015). Therefore, the aim is to protect...
Development of high performance heuristic and meta-heuristic methods for resource optimization of large scale construction projects
Abbasi Iranagh, Mahdi; Sönmez, Rifat; Department of Civil Engineering (2015)
Despite the importance of resource optimization in construction scheduling, very little success has been achieved in solving the resource leveling problem (RLP) and resource constrained discrete time-cost trade-off problem (RCDTCTP), especially for large-scale projects. The major objective of this thesis is to design and develop new heuristic and meta-heuristic methods to achieve fast and high quality solutions for the large-scale RLP and RCDTCTP. Two different methods are presented in this thesis for the R...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. H. BETTEMİR and M. T. Birgönül, “Network Analysis Algorithm for the Solution of Discrete Time-Cost Trade-off Problem,”
KSCE JOURNAL OF CIVIL ENGINEERING
, pp. 1047–1058, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41898.