Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/986
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineering-
dc.creatorChau, KW-
dc.date.accessioned2014-12-11T08:25:26Z-
dc.date.available2014-12-11T08:25:26Z-
dc.identifier.issn0926-5805-
dc.identifier.urihttp://hdl.handle.net/10397/986-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsAutomation in Construction © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectConstruction facilitiesen_US
dc.subjectDynamic resources allocationen_US
dc.subjectGenetic algorithmen_US
dc.subjectMixed-integer programen_US
dc.subjectSite planningen_US
dc.subjectTwo-stage formulationen_US
dc.titleA two-stage dynamic model on allocation of construction facilities with genetic algorithmen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: K. W. Chauen_US
dc.identifier.spage481-
dc.identifier.epage490-
dc.identifier.volume13-
dc.identifier.issue4-
dc.identifier.doi10.1016/j.autcon.2004.02.001-
dcterms.abstractBy 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationAutomation in construction, July 2004, v. 13, no. 4, p. 481-490-
dcterms.isPartOfAutomation in construction-
dcterms.issued2004-07-
dc.identifier.isiWOS:000222464600004-
dc.identifier.scopus2-s2.0-2642577642-
dc.identifier.eissn1872-7891-
dc.identifier.rosgroupidr17811-
dc.description.ros2003-2004 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
AIC3.pdfPre-published version146.91 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

90
Last Week
0
Last month
Citations as of Oct 1, 2023

Downloads

208
Citations as of Oct 1, 2023

SCOPUSTM   
Citations

44
Last Week
1
Last month
1
Citations as of Sep 28, 2023

WEB OF SCIENCETM
Citations

36
Last Week
0
Last month
2
Citations as of Sep 28, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.