TECHNICAL PAPERS
Jun 15, 2009

Nondominated Archiving Multicolony Ant Algorithm in Time–Cost Trade-Off Optimization

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

Abstract

Time–cost trade-off analysis is addressed as an important aspect of any construction project planning and control. Nonexistence of a unique solution makes the time–cost trade-off problems very difficult to tackle. As a combinatorial optimization problem one may apply heuristics or mathematical programming techniques to solve time–cost trade-off problems. In this paper, a new multicolony ant algorithm is developed and used to solve the time–cost multiobjective optimization problem. Pareto archiving together with innovative solution exchange strategy are introduced which are highly efficient in developing the Pareto front and set of nondominated solutions in a time–cost optimization problem. An 18-activity time–cost problem is used to evaluate the performance of the proposed algorithm. Results show that the proposed algorithm outperforms the well-known weighted method to develop the nondominated solutions in a combinatorial optimization problem. The paper is more relevant to researchers who are interested in developing new quantitative methods and/or algorithms for managing construction projects.

Get full access to this article

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

References

Doerner, K., Hartl, R. F., and Reimann, M. (2001). “Cooperative ant colonies for optimizing resource allocation in transportation.” Applications of Evolutionary Computing: Proc., EvoWorkshops 2001, E. J. W. Boers et al., eds., LNCS, Vol. 2037, Springer, Berlin, 70–79.
Doerner, K., Hartl, R. F., and Reimann, M. (2003). “Competent for problem solving: The case of full truckload transportation.” Cent. Eur. J. Oper. Res., 11(2), 115–141.
Dorigo, M. (1992). “Optimization, learning and natural algorithms.” Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (in Italian).
Dorigo, M., and Stützle, T. (2004). Ant colony optimization, MIT Press, Cambridge, Mass.
El-Rayes, K., and Kandil, A. (2005). “Time-cost-quality trade-off analysis for highway construction.” J. Constr. Eng. Manage., 131(4), 477–486.
Feng, C. W., Liu, L., and Burns, S. A. (1997). “Using genetic algorithms to solve construction time-cost trade-off problems.” J. Comput. Civ. Eng., 11(3), 184–189.
Gambardella, L. M., Taillard, E. D., and Agazzi, G. (1999). “MACS-VRPT: A multiple ant colony system for vehicle routing problems with time windows.” New ideas in optimization, D. Corne, M. Dorigo, and F. Glover, eds., McGraw-Hill, New York, 63–76.
Gravel, M., Price, W. L., and Gagne, C. (2002). “Scheduling continuous casting of aluminum using a multiple objective optimization metaheuristic.” Eur. J. Oper. Res., 143(1), 218–229.
Hegazy, T. (1999). “Optimization of construction time-cost trade-off analysis using genetic algorithms.” Can. J. Civ. Eng., 26(6), 685–697.
Kasaeian, A., and Afshar, A. (2006). “Time-cost trade-off analysis using multi-colony ant algorithm.” Research Rep., Hydroinformatics Research Center, Iran Univ. of Science & Technology, Tehran, Iran.
Li, H., and Love, P. (1997). “Using improved genetic algorithms to facilitate time-cost optimization.” J. Constr. Eng. Manage., 123(3), 233–237.
Lopez, M., Paquete, L., and Stutzle, T. (2004). “On the design of ACO for the biobjective quadratic assignment problem.” ANTS 2004, M. Dorigo et al., eds., LNCS, Vol. 3172, Springer, Berlin, Germany, 214–225.
Ng, S. T., Deng, M. Z. M., Skitmore, R. M., and Lam, K. C. (2000). “A conceptual case-based decision module for mitigating construction delays.” Int. J. Constr. Inf. Technol., 8(2), 1–20.
Que, B. C. (2002). “Incorporating practicability into genetic algorithm-based time-cost optimization.” J. Constr. Eng. Manage., 128(2), 139–143.
T’Kindt, V., Monmarche, N., Tercinet, F., and Laugt, D. (2002). “An ant colony optimization algorithm to solve a two-machine bicriteria flowshop scheduling problem.” Eur. J. Oper. Res., 142(2), 250–257.
Ya-ping, K., and Ying, X. (2006). “Construction time-cost trade-off analysis using ant colony optimization algorithm.” Int. Conf. on Management Science and Engineering, ICMSE, 2039–2044.
Zadeh, L. A. (1965). “Fuzzy sets.” Inf. Control., 8(3), 338–353.
Zheng, D. X. M., Ng, T. S. T., and Kumaraswamy, M. M. (2005). “Applying Pareto ranking and niche formation to genetic algorithm-based multiobjective time–cost optimization.” J. Constr. Eng. Manage., 131(1), 81–91.
Zio, E., and Zille, V. (2006). “Multiobjective optimization of network systems by using ANT algorithms.” Qual. Technol. Quant. Manage., 4(2), 211–224.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 135Issue 7July 2009
Pages: 668 - 674

History

Received: Jul 9, 2007
Accepted: Feb 13, 2009
Published online: Jun 15, 2009
Published in print: Jul 2009

Permissions

Request permissions for this article.

Authors

Affiliations

Professor, Civil Engineering Dept., Iran Univ. of Science & Technology, Tehran, Iran (corresponding author). E-mail: [email protected]
A. Kasaeian Ziaraty [email protected]
Graduate Student, Civil Engineering Dept., Iran Univ. of Science & Technology, Tehran, Iran. E-mail: [email protected]
Professor, Civil Engineering Dept., Iran Univ. of Science & Technology, Tehran, Iran. E-mail: [email protected]
Ph.D. Student, Civil Engineering Dept., Iran Univ. of Science & Technology, Tehran, Iran. E-mail: [email protected]

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