Please use this identifier to cite or link to this item:
Title: A two-stage dynamic model on allocation of construction facilities with genetic algorithm
Authors: Chau, Kwok-wing
Subjects: Construction facilities
Dynamic resources allocation
Genetic algorithm
Mixed-integer program
Site planning
Two-stage formulation
Issue Date: Jul-2004
Publisher: Elsevier B.V.
Source: Automation in construction, July 2004, v. 13, no. 4, p. 481-490.
Abstract: By their very nature, activities within the construction site are generally highly dynamic and complex. Hence, it is highly desirable to be able to formulate the optimal strategy for allocating site-level facilities at different times of the project. The principal objective is to minimize the total cost, which comprises the transportation, handling, capital, and operating costs at potential intermediate transfer centers of various plant and material resources over the entire project duration. The problem can be formulated as a mixed integer program, which entails enormous computational effort for the solution, in particular when the problem size is large. In this paper, a two-stage dynamic model is developed to assist construction planners to formulate the optimal strategy for establishing potential intermediate transfer centers for site-level facilities such as batch plants, lay-down yards, receiving warehouses, various workshops, etc. Under this approach, the solution of the problem is split into two stages, namely, a lower-level stage and an upper-level stage. The former can be solved by a standard linear programming method, whereas the latter is solved by a genetic algorithm. The efficiency of the proposed algorithm is demonstrated through case examples.
Rights: Automation in Construction © 2004 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.autcon.2004.02.001
ISSN: 0926-5805
Appears in Collections:CEE Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
AIC3.pdfPre-published version146.91 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.