Dynamic Layout Planning Using a Hybrid Incremental Solution Method

Efficiently using site space to accommodate resources throughout the duration of a construction project is a critical problem. It is termed the “dynamic layout planning” problem. Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Zouein, Pierrette (author)
مؤلفون آخرون: Tommelein, I. (author)
التنسيق: article
منشور في: 1999
الوصول للمادة أونلاين:http://hdl.handle.net/10725/3121
http://dx.doi.org/10.1061/(ASCE)0733-9364(1999)125:6(400)
http://ascelibrary.org/doi/abs/10.1061/(ASCE)0733-9364(1999)125:6(400)
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513460144963584
author Zouein, Pierrette
author2 Tommelein, I.
author2_role author
author_facet Zouein, Pierrette
Tommelein, I.
author_role author
dc.creator.none.fl_str_mv Zouein, Pierrette
Tommelein, I.
dc.date.none.fl_str_mv 1999
2016-02-18T10:00:21Z
2016-02-18T10:00:21Z
2016-02-18
dc.identifier.none.fl_str_mv 0733-9364
http://hdl.handle.net/10725/3121
http://dx.doi.org/10.1061/(ASCE)0733-9364(1999)125:6(400)
Zouein, P. P., & Tommelein, I. D. (1999). Dynamic layout planning using a hybrid incremental solution method. Journal of construction engineering and management, 125(6), 400-408.
http://ascelibrary.org/doi/abs/10.1061/(ASCE)0733-9364(1999)125:6(400)
dc.relation.none.fl_str_mv Journal of Construction Engineering and Management
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.title.none.fl_str_mv Dynamic Layout Planning Using a Hybrid Incremental Solution Method
dc.type.none.fl_str_mv Article
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description Efficiently using site space to accommodate resources throughout the duration of a construction project is a critical problem. It is termed the “dynamic layout planning” problem. Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of their presence on site, their changing demand for space over time, constraints on their location, and costs for their relocation. A dynamic layout construction procedure is presented here. Construction resources, represented as rectangles, are subjected to two-dimensional geometric constraints on relative locations. The objective is to allow site space to all resources so that no spatial conflicts arise, while keeping distance-based adjacency and relocation costs minimal. The solution is constructed stepwise for consecutive time frames. For each resource, selected heuristically one at a time, constraint satisfaction is used to compute sets of feasible positions. Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. The resulting sequence of layouts is suboptimal in terms of the stated global objective, but the algorithm helps the layout planner explore better alternative solutions.
eu_rights_str_mv openAccess
format article
id LAURepo_9374aabb6a26cefbc58cd6035ffece2f
identifier_str_mv 0733-9364
Zouein, P. P., & Tommelein, I. D. (1999). Dynamic layout planning using a hybrid incremental solution method. Journal of construction engineering and management, 125(6), 400-408.
network_acronym_str LAURepo
network_name_str Lebanese American University repository
oai_identifier_str oai:laur.lau.edu.lb:10725/3121
publishDate 1999
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Dynamic Layout Planning Using a Hybrid Incremental Solution MethodZouein, PierretteTommelein, I.Efficiently using site space to accommodate resources throughout the duration of a construction project is a critical problem. It is termed the “dynamic layout planning” problem. Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of their presence on site, their changing demand for space over time, constraints on their location, and costs for their relocation. A dynamic layout construction procedure is presented here. Construction resources, represented as rectangles, are subjected to two-dimensional geometric constraints on relative locations. The objective is to allow site space to all resources so that no spatial conflicts arise, while keeping distance-based adjacency and relocation costs minimal. The solution is constructed stepwise for consecutive time frames. For each resource, selected heuristically one at a time, constraint satisfaction is used to compute sets of feasible positions. Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. The resulting sequence of layouts is suboptimal in terms of the stated global objective, but the algorithm helps the layout planner explore better alternative solutions.N/AN/A2016-02-18T10:00:21Z2016-02-18T10:00:21Z19992016-02-18Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article0733-9364http://hdl.handle.net/10725/3121http://dx.doi.org/10.1061/(ASCE)0733-9364(1999)125:6(400)Zouein, P. P., & Tommelein, I. D. (1999). Dynamic layout planning using a hybrid incremental solution method. Journal of construction engineering and management, 125(6), 400-408.http://ascelibrary.org/doi/abs/10.1061/(ASCE)0733-9364(1999)125:6(400)Journal of Construction Engineering and Managementinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/31212019-02-01T11:47:23Z
spellingShingle Dynamic Layout Planning Using a Hybrid Incremental Solution Method
Zouein, Pierrette
status_str publishedVersion
title Dynamic Layout Planning Using a Hybrid Incremental Solution Method
title_full Dynamic Layout Planning Using a Hybrid Incremental Solution Method
title_fullStr Dynamic Layout Planning Using a Hybrid Incremental Solution Method
title_full_unstemmed Dynamic Layout Planning Using a Hybrid Incremental Solution Method
title_short Dynamic Layout Planning Using a Hybrid Incremental Solution Method
title_sort Dynamic Layout Planning Using a Hybrid Incremental Solution Method
url http://hdl.handle.net/10725/3121
http://dx.doi.org/10.1061/(ASCE)0733-9364(1999)125:6(400)
http://ascelibrary.org/doi/abs/10.1061/(ASCE)0733-9364(1999)125:6(400)