Use of Support Vector Regression to Improve Computational Efficiency of Stochastic Time-Cost Trade-Off
Publication: Journal of Construction Engineering and Management
Volume 140, Issue 1
Abstract
Stochastic time-cost trade-off has been a popular object of investigation in past decades because there are uncertain factors that can be considered when determining the appropriate trade-off between project completion time and cost. Previous studies, however, have implemented a double loop procedure, which performs optimization in the outer loop and simulation in the inner loop. The double loop procedure is ponderous because it requires an unacceptably long computation time (taking hours or days), even for a small to medium project. The present study proposes an integrated system that converts the double loop to single loops,thereby dramatically reducing computation time. This is done by incorporating a support vector regression model to obtain a decision function, which will be used to replace the time-consuming Monte Carlo simulation to evaluate the objective function values for individual solutions. With the objective function values, a multiobjective particle swarm optimization algorithm is developed to search for the Pareto front composed of nondominated solutions. It has been empirically shown that the proposed system significantly outperforms the conventional double loop procedure because the former can consistently generate a better Pareto front (with a larger hyperarea ratio) hundreds of times faster by using much less computation time. The Student’s test is performed to validate the superiority of the proposed system. The contribution of the proposed system is multifold. First, improved computational efficiency is essential for the widespread acceptance of the stochastic time-cost trade-off analysis in practical applications. Second, with less computation time spent in simulation, efforts can be focused on the search for much better nondominated solutions. Third, the proposed system can incorporate the risk attitudes of the decision makers into the analysis by allowing them to specify the probability that they can tolerate for project duration (cost) to exceed a certain limit.
Get full access to this article
View all available purchase options and get full access to this article.
References
AbouRizk, S. M., and Halpin, D. W. (1991). “Visual interactive fitting of beta distributions.” J. Constr. Eng. Manage., 117(4), 589–605.
AbouRizk, S. M., and Halpin, D. W. (1992). “Statistical properties of construction duration data.” J. Constr. Eng. Manage., 118(3), 525–544.
Aghaie, A., and Mokhtari, H. (2009). “Ant colony optimization algorithm for stochastic project crashing problem in PERT networks using MC simulation.” Int. J. Adv. Manuf. Technol., 45(11–12), 1051–1067.
Ashuri, B., and Tavakolan, M. (2012). “Fuzzy enabled hybrid genetic algorithm-particle swarm optimization approach to solve time-cost-resource optimization (TCRO) problems in construction project planning.” J. Constr. Eng. Manage., 138(9), 1065–1074.
Back, W., Boles, W., and Fry, G. (2000). “Defining triangular probability distributions from historical cost data.” J. Constr. Eng. Manage., 126(1), 29–37.
Chang, C. C., and Lin, C. J. (2011). “LIBSVM: A library for support vector machines.” ACM Trans. Intell. Syst. Technol., 2(3), 27:1–27:27.
Chou, J. S., Yang, I. T., and Chong, W. K. (2009). “Probabilistic simulation for developing likelihood distribution of engineering project cost.” Autom. Constr., 18(5), 570–577.
Clerc, M., and Kennedy, J. (2002). “The particle swarm-explosion, stability and convergence in a multidimensional complex space.” IEEE Trans. Evol. Comput., 6(1), 58–73.
Coello Coello, C. A., Dhaenens, C., and Jourdan, L. (2010). “Multiobjective combinatorial optimization: problematic and context.” Advances in multi-objective nature inspired computing, Springer, Berlin, Germany.
Czyzak, P., and Jaszkiewicz, A. (1998). “Pareto simulated annealing—A metaheuristic technique for multiple-objective combinatorial optimization.” J. Multi-Criteria Decis. Anal., 7(1), 34–47.
De, P., Dunne, E. J., Ghosh, J. B., and Wells, C. E. (1997). “Complexity of the discrete time/cost trade-off problem for project networks.” Oper. Res., 45(2), 302–306.
Deb, K. (2001). Multi-objective optimization using evolutionary algorithms, Wiley, New York.
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002). “A fast and elitist multi-objective genetic algorithm: NSGA-II.” IEEE Trans. Evol. Comput., 6(2), 181–197.
Deineko, V. G., and Woeginger, G. J. (2001). “Hardness of approximation of the discrete time-cost tradeoff problem.” Oper. Res. Lett., 29(5), 207–210.
Demeulemeester, E., Herroelen, W., and Elmaghraby, S. E. (1996). “Optimal procedures for the discrete time/cost trade-off problem in project networks.” Eur. J. Oper. Res., 88(1), 50–68.
Drucker, H., Burges, C. J. C., Kaufman, L., Smola, A., and Vapnik, V. (1997). “Support vector regression machines.” Advances in neural information processing systems, Vol. 9, M. C. Mozer, M. I. Jordan, and T. Petsche, eds., MIT Press, Cambridge, 155–161.
Elbeltagi, E., Hegazy, T., and Grierson, D. (2005). “Comparison among five evolutionary-based optimization algorithms.” Adv. Eng. Inform., 19(1), 43–53.
Elkjaer, M. (2000). “Stochastic budget estimation.” Int. J. Proj. Manage., 18(2), 139–147.
El-Rayes, K., and Kandil, A. (2005). “Time-cost-quality trade-off analysis for highway construction.” J. Constr. Eng. Manage., 131(4), 477–486.
Eshtehardian, E., Afshar, A., and Abbasnia, R. (2008). “Time-cost optimization: Using GA and fuzzy sets theory for uncertainties in cost.” Constr. Manage. Econ., 26(7), 679–691.
Feng, C. W., Liu, L., and Burns, A. (1997). “Using genetic algorithms to solve construction time-cost trade-off problems.” J. Comput. Civ. Eng., 11(3), 184–189.
Feng, C. W., Liu, L., and Burns, S. (2000). “Stochastic construction time-cost trade-off analysis.” J. Comput. Civ. Eng., 14(2), 117–126.
Ghani, J. A., Choudhury, I. A., and Hasan, H. H. (2004). “Application of Taguchi method in optimization of end milling parameters.” J. Mater. Process Technol., 145(1), 84–92.
Graham, L. D., Smith, S. D., and Dunlop, P. (2005). “Lognormal distribution provides an optimum representation of the concrete delivery and placement process.” J. Constr. Eng. Manage., 131(2), 230–238.
Greffenstette, J. (1986). “Optimisation of control parameters for genetic algorithms.” IEEE Trans. Syst. Man Cybern., 16(1), 122–128.
Harris, R. B. (1978). Precedence and arrow networking techniques for construction, Wiley, New York.
Jun, D. H., and El-Rayes, K. (2011). “Fast and accurate risk evaluation for scheduling large-scale construction projects.” J. Comput. Civ. Eng., 25(5), 407–417.
Ke, H., Ma, W., and Chen, X. (2012). “Modeling stochastic project time–cost trade-offs with time-dependent activity durations.” Appl. Math. Comput., 218(18), 9462–9469.
Kelley, J. E. (1961). “Critical path planning and scheduling: Mathematical basis.” Oper. Res., 9(3), 296–320.
Leu, S. S., and Yang, C. H. (1999). “GA-based multicriteria optimal model for construction scheduling.” J. Constr. Eng. Manage., 125(6), 420–427.
Li, H., Cao, J. N., and Love, P. E. D. (1999). “Using machine learning and GA to solve time-cost tradeoff problems.” J. Constr. Eng. Manage., 125(5), 347–353.
Ng, S. T., and Zhang, Y. (2008). “Optimizing construction time and cost using Ant Colony Optimization approach.” J. Constr. Eng. Manage., 134(9), 721–728.
Platt, J. C. (1999). “Fast training of support vector machines using sequential minimal optimization.” Advances in kernel methods—Support vector learning, B. Scholkopf, C. J. C. Burges, and A. J. Smola, eds., MIT Press, Cambridge, MA, 185–208.
Ranjbar, M., and Kianfar, F. (2007). “Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms.” Appl. Math. Comput., 191(2), 451–456.
Russell, A. D., and Ranasinghe, M. (1992). “Analytical approach for economic risk quantification of large engineering projects.” Constr. Manage. Econ., 10(4), 277–301.
Shi, Y., and Eberhart, R. C. (1998). “Parameter selection in particle swarm optimization.” Evolutionary Programming VII: Proc., 7th Annual Conf. on Evolutionary Programming, V. Porto, N. Saravanan, D Waagen, and A. Eiben, eds., Springer, New York.
Skutella, M. (1998). “Approximation algorithms for the discrete time-cost tradeoff problem.” Math. Oper. Res., 23(4), 909–929.
Smola, A., and Scholkopf, B. (2004). “A tutorial on support vector regression.” Stat. Comput., 14(3), 199–222.
Touran, A., and Wiser, E. P. (1992). “Monte-Carlo technique with correlated random variables.” J. Constr. Eng. Manage., 118(2), 258–272.
Trelea, I. C. (2003). “The particle swarm optimization algorithm: Convergence analysis and parameter selection.” Inform. Process. Lett., 85(6), 317–325.
Vapnik, V. N. (2000). The nature of statistical learning theory, 2nd Ed., Springer-Verlag, New York.
Wall, D. M. (1997). “Distributions and correlations in Monte-Carlo simulation.” Constr. Manage. Econ., 15(3), 241–258.
Wang, W. C. (2002). “SIM-UTILITY: Model for project ceiling price determination.” J. Constr. Eng. Manage., 128(1), 76–84.
Yang, I. T. (2005). “Impact of budget uncertainty on project time-cost tradeoff.” IEEE Trans. Eng. Manage., 52(2), 167–174.
Yang, I. T. (2008). “Distribution-free Monte Carlo simulation: Premise and refinement.” J. Constr. Eng. Manage., 134(5), 352–360.
Yang, I. T. (2011). “Stochastic time-cost tradeoff analysis: A distribution-free approach with focus on correlation and stochastic dominance.” Autom. Constr., 20(7), 916–926.
Zahraie, B., and Tavakolan, M. (2009). “Stochastic time-cost-resource utilization optimization using nondominated sorting genetic algorithm and discrete fuzzy sets.” J. Constr. Eng. Manage., 135(11), 1162–1171.
Zitzler, E., and Thiele, L. (1999). “Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach.” IEEE Trans. Evol. Comput., 3(4), 257–271.
Information & Authors
Information
Published In
Copyright
© 2013 American Society of Civil Engineers.
History
Received: Sep 9, 2012
Accepted: Aug 9, 2013
Published online: Sep 9, 2013
Published in print: Jan 1, 2014
Discussion open until: Feb 9, 2014
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.