Dynamic Predictionof Project Success Using Artificial Intelligence
Dynamic Predictionof Project Success Using Artificial Intelligence
net/publication/245283775
CITATIONS READS
47 2,681
2 authors:
All content following this page was uploaded by Min-Yuan Cheng on 12 May 2014.
Abstract: The purpose of construction management is to successfully accomplish projects, which requires a continuous monitoring and
control procedure. To dynamically predict project success, this research proposes an evolutionary project success prediction model
共EPSPM兲. The model is developed based on a hybrid approach that fuses genetic algorithms 共GAs兲, fuzzy logic 共FL兲, and neural networks
共NNs兲. In EPSPM, GAs are primarily used for optimization, FL for approximate reasoning, and NNs for input-output mapping. Further-
more, the model integrates the process of continuous assessment of project performance to dynamically select factors that influence
project success. The validation results show that the proposed EPSPM, driven by a hybrid artificial intelligence technique, could be used
as an intelligent decision support system, for project managers, to control projects in a real time base.
DOI: 10.1061/共ASCE兲0733-9364共2007兲133:4共316兲
CE Database subject headings: Project management; Predictions; Fuzzy sets; Neural networks; Evolutionary computation; Artificial
intelligence.
Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]
Fig. 1. EFNIM architecture
Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]
Fig. 3. EPSPM architecture
Model Architecture
Project success can be predicted at different points in time with
their corresponding factors while it is progressing. In the begin-
ning of a project, the procurement of material and equipment
effects the outcome of the project. By contrast, in the construction
phase, project success can be predicted by the factor of owner
expenditures. Previous projects provide patterns for analyzing
those factors and project success. The architecture of EPSPM
shown in Fig. 3 contains four components: The project database,
factors of project success, adaptation engine, and predictive solu-
tion. The project database contains previous cases of projects
that serve as patterns for analysis. The element of the factors
of a project’s success determines which factors are effective for
Fig. 4. EPSPM adaptation structure predicting the project outcome at a specific point in time. Com-
Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]
Table 1. Time-Dependant Variables Analyzed by CAPP Initialize Population
Sign. The first step of the adaptation process is to randomly generate a
Variable name level set of initial solutions. Each solution encodes model variables into
Actual design % complete 0.03 a binary string to simulate a natural chromosome. Every string is
Actual owner expenditures 0.00 comprised of two segments: MF substring and NN substring. Two
Cost of contractor project commitments 0.01 codification methods—summit and width representation method
Cost of owner project commitments 0.04 共SWRM兲 and block representation method 共BRM兲—proposed by
Actual owner effort hours 0.03 Ko 共2002兲 are employed to encode MFs and NNs into substrings.
Recordable incident rate 共by period兲 0.01
Actual overtime work 0.02 Evaluate Individuals
Cost of change orders 0.08
The aim of the adaptation process is to obtain a predictive model
Quantity of change orders 0.02 with high accuracy and good generalization properties. The model
Days lost to weather 共gross working days兲 0.08 accuracy on input patterns, acquired from the project’s database,
Note: Significance level below 0.10 represents a statistical difference can be improved by increasing the network complexity. However,
between successful and less-than-successful. Variable names are defined an accurate model fit to input patterns does not mean that the
in Russel et al. 共1996兲. overall problem behaviors are captured well. A large network size
has higher computational cost. Also, in general, it suffers from an
overfitting of the data in the input patterns and deterioration of
generalization properties 共Maier et al. 2000兲. Thus, the objective
plex relationships between the factors and the project outcome are of the adaptation engine is to preserve the acceptable prediction
automatically identified through previous patterns, using an adap- accuracy—using the fittest shapes of MFs with the minimum NN
tation engine. Finally, the derived solution can be used as a pre- topology and optimum NN parameters, which is posed as an op-
dictive model for forecasting a project’s outcome in a real-time timization problem. The objective function of the model, f ob, is a
base. combination of the model accuracy and model complexity, as
given in Eq. 共1兲
Model Adaptation Process f ob = caw ⫻ ser + ccw ⫻ mc 共1兲
The adaptation engine is driven by EFNIM through GAs. The where c ⫽accuracy weighting coefficient; s ⫽prediction error
aw er
adaptation process is shown in Fig. 4. In the process, P共t兲 denotes between actual output and desired output; ccw⫽complexity
a population at generation t, Po共t兲 is an offspring population at weighting coefficient; and mc is the model complexity, which is
generation t, and Pm共t兲 indicates a mutation population at genera- simply formulated by the number of active connections in the
tion t. Each procedure is defined in the next sections. network.
Table 2. Patterns for Dynamic Prediction of Project Success 共Shown and Reused CAPP Database with CII’s Kind Permission兲
Input patterns
Input Output
Pattern
number 共1兲 共2兲 共3兲 共4兲 共5兲 共6兲 共7兲 共8兲 共9兲 共10兲 共11兲
1 0.0000 0.9700 0.5322 0.9253 0.0000 0.7555 0.0000 0.0000 0.7877 0.7719 1.0000
2 0.0000 1.0000 0.5625 0.0000 0.9372 0.6954 0.3103 0.0000 0.0000 0.0000 1.0000
3 0.3125 1.0000 0.0000 0.7581 0.0000 0.0000 0.0000 0.0000 1.0000 1.0000 0.0000
4 0.0000 0.9950 0.0000 0.9555 0.0000 0.0000 0.0000 0.0000 0.8665 0.6304 1.0000
5 0.0000 0.0000 0.4694 0.6044 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.6667
6 0.0000 0.0000 0.0000 0.7098 0.0000 0.0000 0.0000 0.3102 0.0000 0.0000 0.0000
7 0.5897 0.9767 0.0000 0.0000 0.9598 0.7708 0.0000 0.0000 0.0000 0.0000 1.0000
8 0.0000 0.9592 0.0000 0.8629 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1.0000
9 0.0000 0.9150 0.8931 0.9170 0.9960 0.0000 0.0000 0.0000 0.0000 0.0000 0.6667
10 0.0000 1.0000 0.3808 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1.0000
11 0.7647 0.0000 0.4137 0.0000 0.5522 0.5869 0.0000 0.1507 0.0000 0.0000 1.0000
12 0.0000 0.0000 0.8654 0.0000 0.9813 0.7909 0.0000 0.0000 0.0000 0.0000 0.3333
Test patterns
13 0.0000 1.0000 0.0000 0.7472 1.0000 0.0000 1.0000 0.0000 0.9612 0.9348 0.0000
14 0.0000 1.0000 0.0000 0.9537 1.0000 0.0000 0.0000 0.1448 0.0000 0.0000 0.6667
15 0.0000 0.0000 0.0000 0.8574 0.8396 0.0000 0.0000 0.0000 0.5000 0.5000 1.0000
Note: The captions of the above columns are: 共1兲 actual design % complete; 共2兲 actual owner expenditures; 共3兲 cost of contractor project commitments;
共4兲 cost of owner project commitments; 共5兲 actual owner effort hours; 共6兲 recordable incident rate; 共7兲 actual overtime work; 共8兲 cost of change orders; 共9兲
quantity of change orders; 共10兲 day lost to weather; and 共11兲 project performance.
Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]
Fig. 6. EPSPM management module
where vfik and vobk⫽fitness and objective values of chromosome Model Application Process
k.
Specific processes and methods used to implement EPSPM are
summarized in Fig. 5. Referring to Fig. 5, the blocks on the left-
Perform Crossover hand side are the procedures used to implement the model. The
The crossover repeatedly exchanges high performance notations blocks on the right-hand side are the detailed methods and at-
in the search for better and better performances. The adaptation tributes concerned with the execution of the tasks on the left-hand
engine uses one-cut-point crossover and exchanges the right parts side.
of their parents. After crossover, the summit positions of MFs,
widths of MFs, hidden layers, hidden neurons, interconnections, Calculate Project Completion
biases, and activation slopes of parents are exchanged. To analyze the factors of success in the next step, progress is
converted to a project completion. Time is normalized such that 0
percent and 100 percent can correspond to a specific date. A ratio
Perform Mutation of to-date to planned is used in this investigation. For example, a
The purpose of mutation is to adjust the value of summits and ratio of 100 days passed the date of the beginning to a duration of
widths of MFs, interconnections, weights, biases, and activation 1000 days is 10% completion.
slopes for better performance. It alters one or more genes with a
probability 共pge兲, which is smaller than or equal to mutation rate Analyze Influencing Factors
共pmu兲. Mutation operation compares the gene’s pge with pmu bit by The factors of success, at a specific completion, are analyzed
bit. If pge ⱕ pmu, then the value of the gene will be altered. using CAPP software. Hypothesis tests with student’s t distribu-
Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]
tion are used to identify influencing factors, whose value of alpha 共1996兲兲. Using the CAPP software, 10 of 76 time-dependent vari-
共type I error兲 less than or equal to 0.10 are selected. In statistical ables whose significance level below 0.1 at 67% completion were
research, an alpha equal to 0.1 is frequently used to reject the null identified, as summarized in Table 1.
hypothesis. CAPP software analyzes 76 continuous variables The original patterns are acquired from CAPP system database
based on 54 construction projects. with CII’s kind permission. The database contains 54 projects,
which are the same data used to analyze the significance level.
Collect Training and Test Patterns This study selects 15 of 54 available projects from the database
Training and test patterns are collected from CAPP database that where construction type is process plant projects, designer con-
contains 54 construction projects. These projects are real data tractor type is lump sum construction contract, and the stability of
collected by Russell et al. 共1996兲 from the 16 representative Con- projects is at the completed stage. In AI field, 80% available
struction Industry Institute 共CII兲 member companies. patterns for training purpose, and 20% for test purpose are fre-
quently used. The 12 of them 共80%兲 are, thus, treated as input
Search for Predictive Solution patterns for evolvement, and the other three projects 共20%兲 are
A predictive model 共i.e., fuzzy neural network model兲 is adopted selected as test patterns. Since this validation attempts to predict
using EFNIM according to the identified factors of success with a the project outcomes at 67% completion, values of time-
54 projects database. The model is specifically generated to pre- dependent variables at 67% completion are collected. The nor-
dict project outcomes at current project progress 共project com- malized data of 15 projects are shown in Table 2. In the table,
plete兲. More details about the application of EFNIM can be found four categories of project performance defined by CAPP software,
in Ko and Cheng 共2003兲. namely successful, on time, or on budget, less-than-successful,
and disastrous are linearly represented using 0, 0.3333, 0.6667,
and 1, respectively.
Model Validation EPSPM provides three modules for application: Adaptation
module, inference module, and management module. The 15 se-
Model Implementation lected projects, with 10 identified factors of success, are entered
into EPSPM through management module 共see Fig. 6兲. Adapta-
Performance of the proposed EPSPM is validated using a 67% tion module shown in Fig. 7 is then used to evolve a predictive
completion project. The 67% completion is targeted to coincide model for 67% project completion. To preserve the acceptable
with those examples previously explained in the CAPP related prediction accuracy without suffering overfitting of data, a policy
literatures 共Russell et al. 共1996兲; Russell et al. 共1997兲; CII that reduces model complexity without deteriorating prediction
View publication stats Downloaded 14 Nov 2008 to [Link]. Redistribution subject to ASCE license or copyright; see [Link]