TECHNICAL PAPERS
Jan 1, 2009

Hybrid Time-Cost Optimization of Nonserial Repetitive Construction Projects

Publication: Journal of Construction Engineering and Management
Volume 135, Issue 1

Abstract

Time-cost trade-off analysis represents a challenging task because the activity duration and cost have uncertainty associated with them, which should be considered when performing schedule optimization. This study proposes a hybrid technique that combines genetic algorithms (GAs) with dynamic programming to solve construction projects time-cost trade-off problems under uncertainty. The technique is formulated to apply to project schedules with repetitive nonserial subprojects that are common in the construction industry such as multiunit housing projects and retail network development projects. A generalized mathematical model is derived to account for factors affecting cost and duration relationships at both the activity and project levels. First, a genetic algorithm is utilized to find optimum and near optimum solutions from the complicated hyperplane formed by the coding system. Then, a dynamic programming procedure is utilized to search the vicinity of each of the near optima found by the GA, and converges on the global optima. The entire optimization process is conducted using a custom developed computer code. The validation and implementation of the proposed techniques is done over three axes. Mathematical correctness is validated through function optimization of test functions with known optima. Applicability to scheduling problems is validated through optimization of a 14 activity miniproject found in the literature for results comparison. Finally implementation to a case study is done over a gas station development program to produce optimum schedules and corresponding trade-off curves. Results show that genetic algorithms can be integrated with dynamic programming techniques to provide an effective means of solving for optimal project schedules in an enhanced realistic approach.

Get full access to this article

View all available purchase options and get full access to this article.

References

Adeli, H., and Karim, A. (1997). “Scheduling/cost optimization and neural dynamics model for construction.” J. Constr. Eng. Manage., 123(4), 450–458.
Adeli, H., and Karim, A. (1999). “CONSCOM: An OO construction scheduling and change management system.” J. Constr. Eng. Manage., 125(5), 368–376.
Betrsekas, D. P. (1987). Dynamic programming: Deterministic & stochastic models, Prentice-Hall, Englewood Cliffs, N.J.
Callahan, M. T., Quackenbush, D. G., and Rowing, J. (1992). Construction projects scheduling, McGraw-Hill, New York.
El Maghraby, S. E. (1977). Activity networks: Project planning and control by network models, Wiley-Interscience, New York.
El Rayes, K., and Moselhi, O. (2001). “Optimizing resource utilization for repetitive construction project.” J. Constr. Eng. Manage., 127(1), 18–27.
Feng, C.-W., and Liu, L. (2000). “Stochastic construction time-cost trade-off analysis.” J. Comput. Civ. Eng., 14(2), 117–126.
Goldberg, D. E. (1989). Genetic algorithms: In search, optimization, and machine learning, Addison-Wesley, Reading, Mass.
Hegazy, T. (1999). “Optimization of resources allocation and leveling using genetic algorithms.” J. Constr. Eng. Manage., 125(3), 167–175.
Hegazy, T. (2001). “Cost optimization in projects with repetitive non-serial activities.” J. Constr. Eng. Manage., 127(3), 183–191.
Holland, J. H. (2000). “Building blocks, cohort genetic algorithms, and hyperplane-defined functions.” Evol. Comput., 8(4), 373–391.
Karim, A., and Adeli, H. (1999). “OO information model for construction project management.” J. Constr. Eng. Manage., 125(5), 361–367.
Li, J. P., Balazs, M. E., and Paeks, G. T. (2002). “A species conserving genetic algorithm for multimodal function optimization.” Evol. Comput., 10(3), 207–237.
Lieberman, G., and Hillier, F. (1992). Introduction to operations research, McGraw-Hill, New York.
Lue, S.-S., and Hwang, S.-T. (2001). “Optimal repetitive model with sharable resource constraint.” J. Constr. Eng. Manage., 127(4), 270–280.
Que, B. C. (2002). “Incorporating practicability into genetic algorithms-based time-cost optimization.” J. Constr. Eng. Manage., 128(2), 139–143.
Senouci, A. B. (1996). “Dynamic programming approach to scheduling of non-serial linear project.” J. Comput. Civ. Eng., 10(2), 106–114.
Soliman, A. (2003). “A geno-dynamic hybrid approach for time cost optimization of non-serial repetitive construction project.” MS thesis American Univ. in Cairo, Cairo, Egypt.
Weng-Tat, C., and Chua, D. K. (1996). “Construction resource scheduling with genetic algorithms.” J. Constr. Eng. Manage., 122(2), 125–132.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 135Issue 1January 2009
Pages: 42 - 55

History

Received: Feb 16, 2006
Accepted: Jul 29, 2008
Published online: Jan 1, 2009
Published in print: Jan 2009

Permissions

Request permissions for this article.

Authors

Affiliations

A. Samer Ezeldin [email protected]
Professor, Dept. of Construction Engineering, American Univ. in Cairo, 113 Kasr El Aini St., P.O. Box 2511, Cairo 11511, Egypt (corresponding author). E-mail: [email protected]
Ahmed Soliman
Graduate Student, Dept. of Construction Engineering, American Univ. in Cairo, 113 Kasr El Aini St., P.O. Box 2511, Cairo 11511, Egypt.

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.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share