z-logo
open-access-imgOpen Access
AN ANT COLONY SYSTEM BASED DECISION SUPPORT SYSTEM FOR CONSTRUCTION TIME-COST OPTIMIZATION
Author(s) -
Yanshuai Zhang,
S. Thomas Ng
Publication year - 2012
Publication title -
journal of civil engineering and management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.529
H-Index - 47
eISSN - 1822-3605
pISSN - 1392-3730
DOI - 10.3846/13923730.2012.704164
Subject(s) - ant colony optimization algorithms , ant colony , computer science , profit (economics) , operations research , mathematical optimization , total cost , duration (music) , engineering , artificial intelligence , art , mathematics , literature , economics , microeconomics
Time and cost are the two most important factors to be considered in every construction project. In order to maximize the profit, both the client and contractor would strive to minimize the project duration and cost concurrently. In the past, most of the research studies related to construction time and cost assumed time to be constant, leaving the analyses based purely on a single objective of cost. Acknowledging this limitation, an evolutionary-based optimization algorithm known as an ant colony system is applied in this study to solve the multi-objective time-cost optimization problems. In this paper, a model is developed using Visual Basic for Application which is integrated with Microsoft Project. Through a test study, the performance of the proposed model is compared against other analytical methods previously used for time-cost modeling. The results show that the model based on the ant colony system techniques can generate better solutions without utilizing excessive computational resources. The model, therefore, provides an efficient means to support planners and managers in making better time-cost decisions efficiently. © 2012 Copyright Vilnius Gediminas Technical University (VGTU) Press Technika.link_to_subscribed_fulltex

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here