Research Article  Open Access
Ming Li, Guangdong Wu, "Robust Optimization for TimeCost Tradeoff Problem in Construction Projects", Abstract and Applied Analysis, vol. 2014, Article ID 926913, 7 pages, 2014. https://doi.org/10.1155/2014/926913
Robust Optimization for TimeCost Tradeoff Problem in Construction Projects
Abstract
Construction projects are generally subject to uncertainty, which influences the realization of timecost tradeoff in project management. This paper addresses a timecost tradeoff problem under uncertainty, in which activities in projects can be executed in different construction modes corresponding to specified time and cost with interval uncertainty. Based on multiobjective robust optimization method, a robust optimization model for timecost tradeoff problem is developed. In order to illustrate the robust model, nondominated sorting genetic algorithmII (NSGAII) is modified to solve the project example. The results show that, by means of adjusting the time and cost robust coefficients, the robust Pareto sets for timecost tradeoff can be obtained according to different acceptable risk level, from which the decision maker could choose the preferred construction alternative.
1. Introduction
Widespread uncertainty in projects will directly affect the achievement of the project schedule and cost management goals. Some studies also discuss the project timecost tradeoff problem and relevant resource constrained project scheduling problem under conditions of uncertainty for the duration [1, 2].
Under random conditions of uncertainty, most studies are based on known activity period and cost parameters probability distribution. Azaron and TavakkoliMoghaddam [3] researched the timecost tradeoff problem of activity period when it exhibits exponential and generalized Erlang distribution. The study constructed a Markov chain to calculate probability distribution of time of completion and got a multiobjective tradeoff model. Bruni et al. [4] studied project scheduling problem of activity period when it was normal distribution. The paper established and compared three robust scheduling models. Wu et al. [5] proposed a heuristic approach for solving project scheduling problem, when activity period was an independent random variable and renewable resources were a determined value. Klerides and Hadjiconstantinou [6] researched timecost tradeoff problem of activity period when it was a discrete random variable and proposed a twostage stochastic integer programming approach based on path. Wiesemann et al. [7] studied project scheduling problem when activity period and cash flow were discrete random variables and ensured the scheduling strategy in pursuit of the project’s biggest net present value. Shou and Wang [8] studied project scheduling problem when activity period was a discrete random variable. They proposed robust optimization model and designed the genetic algorithms for the model. Wang [9] researched project scheduling problem when time and cost are discrete random variables. He proposed DSPSP model in pursuit of the biggest expected value of net present value and solved two instances to confirm the superiority of the model by simulated annealing algorithm. However, due to the oneoff characteristics of projects, in most cases, it is difficult to get the accurate information on the probability distributions of these parameters [10].
Under circumstances without accurate probability distributions, some researches also use nominal values and their variation ranges to indicate random parameters, giving parameters interval uncertainty [11]. Janak et al. [12] studied the activity period intervals with project scheduling problem of uncertainty. Robust optimization model containing certain parameters only was obtained by introducing a few auxiliary variables and constraints. Given the uncertain parameters, feasibility of the tolerance interval, and reliability standards, the model can produce optimal solutions under the worst conditions. Hazir et al. [13] studied the project equilibrium problems of activity cost which has interval uncertainty under BOT model. The research established and compared three different robust optimization models of timecost tradeoff problems and explored exact and heuristic algorithms for those models. However, these studies only considered the situations of uncertainty in activity time or cost without taking into account the uncertainties of both time and cost in the project [14, 15]. Therefore, it is necessary to research time and cost tradeoff problems with uncertainties of both time and cost.
Discrete timecost tradeoff problem (DTCTP) is the classic timecost equilibrium problem [16, 17] in the project. This paper researched the DTCTP problem with uncertainties of both time and cost and used multiobjective robust optimization to build robust model of time and cost and at last employed NSGAII to analyze engineering example.
2. Multiobjective Robust Optimization
A multiobjective optimization model is shown below: where refers to the objective function of number , . stands for constraint function of number , . is decision vector, and is parameter vector. As is uncertain, its value range can be shown as tolerance region. The solid black spots in tolerance region are nominal value , which is the most likely value. When , the value range of functional vector can be shown as objective sensitivity region (OSR) in , and solid black spot is nominal value . Vector specifies acceptable objective variation region (AOVR) of in the space. If OSR of is in the acceptable target change area, is the robust solution.
In the sensitivity analysis of the objective function, worstcase objective sensitivity region (WCOSR) can be used to estimate the target sensitive areas. WCOSR of is through sensitive area of the target objective function corresponding to the maximum point and the straight line parallel to the axis of the enclosed area. If WCOSR of is in the acceptable target change areas, OSR of must be also in its acceptable target change areas. So is the robust solution of the model and vice versa [18, 19] (see Figure 1).
3. Robust Model for TimeCost Tradeoff Problem
DTCTP issues involve a project network , where is the set of all activities of the project and is a collection of logical relationships among activities. Each activity in the network can work in a different construction model, and each construction model has its corresponding time and cost. Decisionmaker can choose different construction schemes, that is, distribute different construction models to different activities, in order to achieve different timecost equilibrium in projects. However, there are many uncertainties in the process of implementing the project. These factors make the activity time and cost uncertain and bring difficulties in the project’s time and cost. For the DTCTP problems with interval of uncertainty in the activity time and cost, the paper uses multiobjective robust optimization method to analyze the problems and construct model to achieve timecost tradeoff robust optimization model. The equations are showed as follows:
In the model, the nominal time of the project is sum of each activity nominal time in the critical path for the network. Nominal project cost is sum of each activity nominal cost in the network. and are nominal duration and cost under model of activity . The variable is used to determine whether activity is on the path . If is on the path, it is 1, otherwise 0. , a decision variable, is 1 if activity is in m mode execution, and 0 otherwise. Formula (4) ensures that each activity has one construction model only. Equations (5) and (6) are robust constraints, where and are duration and cost robust coefficients, respectively. They reflect the level of risk which decisionmaker can accept. and specify an acceptable change area of project duration and cost of scheduling scheme in multiobjective function space. If the project duration and cost sensitive areas under the worstcase conditions fall within the acceptable varied target areas, that is, (10) are satisfied simultaneously, the scheme is robust: In formula (10), and are the duration and cost upper limit change value of activity in the pattern . Simplifying (10) can get robust constraints (5) and (6).
4. Modified NSGAII Algorithm
NSGAII algorithm is the modified version of nondominated sorting genetic algorithm. Because of its excellent property, this algorithm has been used widely and gradually became a reference multiobjective algorithm [20, 21]. This paper modified the simulated binary intersection and the polynomial mutation so as to assure the feasibility of construction plans denoted by chromosomes after intersections and mutations. By the modified algorithm, the durationcost equilibrium robust model under specific example was solved in the next parts.
The main steps of modified NSGAII algorithm are as follows.
Population Initialization. The initial population of size is generated randomly where . Individuals are encoded by real numbers and the chromosome length is equal to the number of activities in the project. The genes at different locations indicate different construction modes. For instance, if an individual’s gene at location 3 is 2, that is, , it means the construction mode of activity 3 is 2.
Filial generation is produced through dual tournament that mainly consists of noninferior sorting and crowding distance calculating for individuals of the parent generation . The noninferior sorting works as(a)finding out noninferior solutions from and putting them into noninferior class where ;(b)ending sorting if the number of rest individuals is 0 and going to (c) otherwise;(c)continuing to find out noninferior solutions from the rest of the and putting them into noninferior class where and going to (b).
The crowding distance indicates the density of target function area. Sorting individuals that belong to the same noninferior class according to their target values and calculating the average length of sides of the cube constructed by two adjacent individuals, the crowding distance can be obtained as the sum of the average length of sides under different target values. When the objective function value of some individual reaches the maximum or the minimum, CD is defined as Inf.
After that, two randomly chosen individuals are compared. If they fall into different noninferior classes, the one within higher class remains in the filial generation . Otherwise, the individual with bigger crowding distance keeps in the filial generation . The process continues until the size of the filial generation reaches the designed requirement.
Onepoint intersection is practiced with the intersection probability of . Two parent individuals of are chosen and they exchange their genes at random location of (), thus producing two filial individuals.
Uniform mutation would occur on individuals of with the mutation probability of . One individual is chosen and its genes will be changed with a small probability.
Population Aggregation. A new population can be got by aggregating the parent and filial generations (). In , individuals are sorted by their noninferior classes first. Given the same noninferior class, they will be sorted by crowding distance then. The best m individuals are chosen to form the next population .
Ending Judgment. In this paper, when the designed number of generations is reached, the calculation ends and results will be printed. Otherwise, calculation goes to step with .
5. Example Analysis
5.1. Engineering Example
A project is shown as in Table 1.

5.2. Result and Discussion
This paper uses NSGAII algorithm and the above example to solve timecost robust tradeoff model. In the algorithm parameters, we define the size of the population of algorithm , evolving algebra , crossover probability , and mutation probability . Table 2 is Pareto solutions which are calculated under different sums. When RT and RC are not 0.3 at the same time, the solutions are robust Pareto. When RT and RC are 0.3 at the same time, the solution is Pareto.

As Table 2 shows, when RC is 0.3, although Pareto front porch has intersection in different RT, the number of Pareto solutions is increasing with RT increasing from 0.1 to 0.3. So relevant Pareto front porch area is extending. And, as RT increases, robust Pareto frontier constantly moves left gradually approaching the nominal Pareto frontier.
In Figure 3, when RT is 0.2, there is intersection between robust Pareto front porch and nominal Pareto. Similar to Figure 2, when RT increases from 0.3 to 0.1, the number of Pareto solutions is increasing, and the corresponding Pareto front porch area also is expanding and moving to the bottom left gradually approaching the nominal Pareto frontier.
To sum up, increasing duration or cost robust coefficient will obtain more alternative scheduling plans within certain ranges, including some better ones with higher risks. Decisionmaker needs to make a tradeoff between the optimization of alternative scheduling plan and the acceptable level of risk. By adjusting the robust coefficient of the model, we can obtain robust Pareto solutions of timecost tradeoff under different acceptable risk levels in order to help decisionmaker choose better construction plans.
6. Conclusions
This paper studies the timecost tradeoff problems where activity duration and cost present interval uncertainties under multimodel in the project. We build timecost tradeoff robust model based on multiobjective robust optimization and apply the improved NSGAII algorithm to solve the model under specific engineering examples. The results showed that increasing time robust coefficient RT or cost robust coefficient RC offers more alternative scheduling plans within certain ranges, including some better options with higher risks. Decisionmaker needs to make a tradeoff between the optimization of alternative scheduling plan and the acceptable risk levels. By adjusting the robust coefficient of the model, we can obtain robust Pareto solutions of timecost tradeoff under different acceptable risk levels in order to help decisionmaker choose better construction plans. In the future, researches will consider the effect of resource constraints on this basis and go on to study timecost tradeoff problems of resource constraint under uncertain conditions. At the same time, we will make better intelligent algorithms to improve model solving efficiency.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work was supported by the National Natural Science Funds of China (Grant no. 71301065), University Social Sciences and Humanities Funds of Jiangxi Province (Grant no. JC1309), and Scientific and Technological Research Funds of Department of Education of Jiangxi Province (Grant no. GJJ14341).
References
 W. Zhang, Q. Zhang, and G. Wu, “Interorganizational knowledge division decision model based on cooperative innovation of supply chain system,” Abstract and Applied Analysis, vol. 2014, Article ID 418104, 9 pages, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 S. Yin, S. X. Ding, A. H. A. Sari, and H. Hao, “Datadriven monitoring for stochastic systems and its application on batch process,” International Journal of Systems Science, vol. 44, no. 7, pp. 1366–1376, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 A. Azaron and R. TavakkoliMoghaddam, “A multiobjective resource allocation problem in dynamic PERT networks,” Applied Mathematics and Computation, vol. 181, no. 1, pp. 163–174, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 M. E. Bruni, P. Beraldi, F. Guerriero, and E. Pinto, “A heuristic approach for resource constrained project scheduling with uncertain activity durations,” Computers and Operations Research, vol. 38, no. 9, pp. 1305–1318, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 C. W. Wu, K. N. Brown, and J. C. Beck, “Scheduling with uncertain durations: modeling βrobust scheduling with constraints,” Computers and Operations Research, vol. 36, no. 8, pp. 2348–2356, 2009. View at: Publisher Site  Google Scholar
 E. Klerides and E. Hadjiconstantinou, “A decompositionbased stochastic programming approach for the project scheduling problem under time/cost tradeoff settings and uncertain durations,” Computers and Operations Research, vol. 37, no. 12, pp. 2131–2140, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 W. Wiesemann, D. Kuhn, and B. Rustem, “Maximizing the net present value of a project under uncertainty,” European Journal of Operational Research, vol. 202, no. 2, pp. 356–367, 2010. View at: Publisher Site  Google Scholar  MathSciNet
 Y. Shou and W. Wang, “Project scheduling strategy genetic algorithm based on robust optimization model,” Journal of Industrial Engineering and Engineering Management, vol. 23, no. 4, pp. 148–152, 2009. View at: Google Scholar
 J. Wang, “Uncertainty of the time and cost optimization schedule,” Systems Engineeringtheory & Practice, vol. 19, no. 1, pp. 93–98, 2002. View at: Google Scholar
 S. Yin, H. Luo, and S. Ding, “Realtime implementation of faulttolerant control systems with performance optimization,” IEEE Transactions on Industrial Electronics, vol. 64, no. 5, pp. 2402–2411, 2014. View at: Google Scholar
 S. Yin, G. Wang, and H. Karimi, “Datadriven design of robust fault detection system for wind turbines,” Mechatronics, vol. 24, no. 4, pp. 298–306, 2014. View at: Publisher Site  Google Scholar
 S. L. Janak, X. Lin, and C. A. Floudas, “A new robust optimization approach for scheduling under uncertainty. II. Uncertainty with known probability distribution,” Computers and Chemical Engineering, vol. 31, no. 3, pp. 171–195, 2007. View at: Publisher Site  Google Scholar
 Ö. Hazir, E. Erel, and Y. Gnalay, “Robust optimization models for the discrete time/cost tradeoff problem,” International Journal of Production Economics, vol. 130, no. 1, pp. 87–95, 2011. View at: Publisher Site  Google Scholar
 S. Yin, X. Yang, and H. R. Karimi, “Datadriven adaptive observer for fault diagnosis,” Mathematical Problems in Engineering, vol. 2012, Article ID 832836, 21 pages, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 W. Zhang, Q. Zhang, and H. Karimi, “Seeking the important nodes of complex networks in product R&D team based on fuzzy AHP and TOPSIS,” Mathematical Problems in Engineering, vol. 2013, Article ID 327592, 9 pages, 2013. View at: Publisher Site  Google Scholar
 D. Prabuddha, E. James Dunne, J. B. Ghosh, and C. E. Wells, “The discrete timecost tradeoff problem revisited,” European Journal of Operational Research, vol. 81, no. 2, pp. 225–238, 1995. View at: Publisher Site  Google Scholar
 S. Yin, S. X. Ding, A. Haghani, H. Hao, and P. Zhang, “A comparison study of basic datadriven fault diagnosis and process monitoring methods on the benchmark Tennessee Eastman process,” Journal of Process Control, vol. 22, no. 9, pp. 1567–1581, 2012. View at: Publisher Site  Google Scholar
 S. Gunawan and S. Azarm, “Multiobjective robust optimization using a sensitivity region concept,” Structural and Multidisciplinary Optimization, vol. 29, no. 3, pp. 50–60, 2005. View at: Publisher Site  Google Scholar
 W. M. Wang, Y. H. Peng, J. Hu, and Z. M. Cao, “Collaborative robust optimization under uncertainty based on generalized dynamic constraints network,” Structural and Multidisciplinary Optimization, vol. 38, no. 2, pp. 159–170, 2009. View at: Publisher Site  Google Scholar
 E. G. Bekele and J. W. Nicklow, “Multiobjective automatic calibration of SWAT using NSGAII,” Journal of Hydrology, vol. 341, no. 34, pp. 165–176, 2007. View at: Publisher Site  Google Scholar
 P. Murugan, S. Kannan, and S. Baskar, “NSGAII algorithm for multiobjective generation expansion planning problem,” Electric Power Systems Research, vol. 79, no. 4, pp. 622–628, 2009. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Ming Li and Guangdong Wu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.