New Heuristic Method of Section Network Compression Process for Large-Scale Networks
Publication: Construction Research Congress 2022
ABSTRACT
The discrete time-cost trade-off (DTCT) problem has been solved or nearly solved using exact, heuristic, or meta-heuristic methods. However, the existing current methods have a certain level of limitations in optimizing the DTCT problem in terms of either computational time or accuracy as efficiently as is beneficial for large project networks in the construction industry. For this reason, further research into new methods for solving DTCT problems and improvements to the methods in practical use is required. The study in this paper presents a new heuristic method of sectional network compression to solve DTCT problems in practical computational time while promising the accuracy of time-cost trade-off results. The case study demonstrated that the section network compression process controlled the time-cost trade-off operation at the acceptable level of cost and duration accuracy. The section network compression process is the novelty introduced to the heuristic method to advance its time-cost trade-off operation performance.
Get full access to this article
View all available purchase options and get full access to this chapter.
REFERENCES
Agdas, D., Warne, D. J., Osio‐Norgaard, J., and Masters, F. J. (2018). “Utility of genetic algorithms for solving large‐scale construction time‐cost trade‐off problems.” Journal of Computing in Civil Engineering, 32(1), 04017072.
Akkan, C., Drexl, A., and Kimms, A. (2005). “Network decomposition‐based benchmark results for the discrete time–cost trade-off problem.” European Journal of Operational Research, 165(2), 339–358.
Bansal, V. K., and Pal, M. (2011). “Construction projects scheduling using GIS tools.” International Journal of Construction Management, 11(1), 1–18.
Barber, T. J., and Boardman, J. T. (1988). “Knowledge‐based project control employing heuristic optimisation.” IEE Proceedings A Physical Science, Measurement and Instrumentation, Management and Education, Reviews, 135(8), 529.
Bettemir, Ö. H., and Talat Birgönül, M. (2017). “Network analysis algorithm for the solution of discrete time‐cost trade‐off problem.” KSCE Journal of Civil Engineering, 21(4), 1047–1058.
Chassiakos, A. P., and Sakellaropoulos, S. P. (2005). “Time‐cost optimization of construction projects with generalized activity constraints.” Journal of Construction Engineering and Management, 131(10), 1115–1124.
De, P., James Dunne, E., Ghosh, J. B., and Wells, C. E. (1995). “The discrete time‐cost trade-off problem revisited.” European Journal of Operational Research, 81(2), 225–238.
Değirmenci, G., and Azizoğlu, M. (2013). “Branch and bound based solution algorithms for the budget constrained discrete time/cost trade‐off problem.” Journal of the Operational Research Society, 64(10), 1474–1484.
Elbeltagi, E., Hegazy, T., and Grierson, D. (2005). “Comparison among five evolutionary‐based optimization algorithms.” Advanced Engineering Informatics, 19(1), 43–53.
Feng, C.‐W., Liu, L., and Burns, S. A. (1997). “Using genetic algorithms to solve construction time‐cost trade‐off problems.” Journal of Computing in Civil Engineering, 11(3), 184–189.
Goyal, S. K. (1996). “A simple time‐cost trade-off algorithm.” Production Planning & Control, 7(1), 104–106.
Hafızoğlu, A. B., and Azizoğlu, M. (2010). “Linear programming based approaches for the discrete time/cost trade‐off problem in project networks.” Journal of the Operational Research Society, 61(4), 676–685.
Hazır, Ö., Haouari, M., and Erel, E. (2010). “Discrete time/cost trade‐off problem: A decomposition‐based solution algorithm for the budget version.” Computers & Operations Research, 37(4), 649–655.
Hegazy, T. (1999). “Optimization of resource allocation and leveling using genetic algorithms.” Journal of Construction Engineering and Management, 125(3), 167–175.
Huang, Y., Zou, X., and Zhang, L. (2016). “Genetic algorithm–based method for the deadline problem in repetitive construction projects considering soft logic.” Journal of Management in Engineering, 32(4), 04016002.
Kaimann, R. A. (1974). “Coefficient of Network Complexity.” Management Science, 21(2), 172–177.
Kosztyán, Z. T., and Szalkai, I. (2018). “Hybrid time‐quality‐cost trade‐off problems.” Operations Research Perspectives, 5, 306–318.
Kuyumcu, A., and Garcia‐Diaz, A. (1994). “A decomposition approach to project compression with concave activity cost functions.” IIE Transactions, 26(6), 63–73.
Li, C., and Wang, K. (2009). “The risk element transmission theory research of multi‐objective risk‐time‐ cost trade‐off.” Computers & Mathematics with Applications, 57(11–12), 1792–1799.
Lu, Y., Luo, L., Wang, H., Le, Y., and Shi, Q. (2015). Measurement model of project complexity for large-scale projects from task and organization perspective. International journal of project management, 33(3), 610–622.
Moselhi, O. (1993). “Schedule compression using the direct stiffness method.” Canadian Journal of Civil Engineering, 20(1), 65–72.
Rudolph, G. (1994). “Convergence analysis of canonical genetic algorithms.” IEEE Transactions on Neural Networks, 5(1), 96–101.
Siemens, N. (1971). “A simple CPM time‐cost tradeoff algorithm.” Management Science, 17(6), B‐354‐B‐ 363.
Sonmez, R., and Bettemir, Ö. H. (2012). “A hybrid genetic algorithm for the discrete time–cost trade‐off problem.” Expert Systems with Applications, 39(13), 11428–11434.
Zheng, D. X. M., and Ng, S. T. (2005). “Stochastic time–cost optimization model incorporating fuzzy sets theory and nonreplaceable front.” Journal of Construction Engineering and Management, 131(2), 176–186.
Zheng, D. X. M., Ng, S. T., and Kumaraswamy, M. M. (2004). “Applying a genetic algorithm‐based multiobjective approach for time‐cost optimization.” Journal of Construction Engineering and Management, 130(2), 168–176.
Information & Authors
Information
Published In
Construction Research Congress 2022
Pages: 943 - 953
History
Published online: Mar 7, 2022
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.