Using Genetic Algorithms to Solve Construction Time-Cost Trade-Off Problems
- 1 July 1997
- journal article
- research article
- Published by American Society of Civil Engineers (ASCE) in Journal of Computing in Civil Engineering
- Vol. 11 (3) , 184-189
- https://doi.org/10.1061/(asce)0887-3801(1997)11:3(184)
Abstract
Time-cost trade-off analysis is one of the most important aspects of construction project planning and control. There are trade-offs between time and cost to complete the activities of a project; in general, the less expensive the resources used, the longer it takes to complete an activity. Using critical path method (CPM), the overall project cost can be reduced by using less expensive resources for noncritical activities without impacting the project duration. Existing methods for time-cost trade-off analysis focus on using heuristics or mathematical programming. These methods, however, are not efficient enough to solve large-scale CPM networks (hundreds of activities or more). Analogous to natural selection and genetics in reproduction, genetic algorithms (GAs) have been successfully adopted to solve many science and engineering problems and have proven to be an efficient means for searching optimal solutions in a large problem domain. This paper presents: (1) an algorithm based on the principles of GA...Keywords
This publication has 11 references indexed in Scilit:
- The LP/IP hybrid method for construction time-cost trade-off analysisConstruction Management and Economics, 1996
- The discrete time-cost tradeoff problem revisitedEuropean Journal of Operational Research, 1995
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic AlgorithmsEvolutionary Computation, 1994
- Schedule compression using the direct stiffness methodCanadian Journal of Civil Engineering, 1993
- Resource allocation via dynamic programming in activity networksEuropean Journal of Operational Research, 1993
- Multicriteria Optimization Techniques for Highly Accurate Focusing SystemsPublished by Springer Nature ,1988
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPMManagement Science, 1975
- A Horizon-Varying, Zero-One Approach to Project SchedulingManagement Science, 1974
- A Simple CPM Time-Cost Tradeoff AlgorithmManagement Science, 1971
- A Structural Method of Computing Project Cost PolygonsManagement Science, 1963