Show simple item record

contributor authorChung-Wei Feng
contributor authorLiang Liu
contributor authorScott A. Burns
date accessioned2017-05-08T21:12:40Z
date available2017-05-08T21:12:40Z
date copyrightJuly 1997
date issued1997
identifier other%28asce%290887-3801%281997%2911%3A3%28184%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/42911
description abstractTime-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 GAs for construction time-cost trade-off optimization; and (2) a computer program that can execute the algorithm efficiently.
publisherAmerican Society of Civil Engineers
titleUsing Genetic Algorithms to Solve Construction Time-Cost Trade-Off Problems
typeJournal Paper
journal volume11
journal issue3
journal titleJournal of Computing in Civil Engineering
identifier doi10.1061/(ASCE)0887-3801(1997)11:3(184)
treeJournal of Computing in Civil Engineering:;1997:;Volume ( 011 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record