An evolutionary algorithm for solving the geometrically constrained site layout problem
Construction site layout has been recognized as an important activity in construction site planning by field practitioners and researchers alike. This problem involves coordinating the use of limited space to accommodate temporary facilities (such as fabrication shops, trailers, materials or equipme...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5630 http://dx.doi.org/10.1061/40513(279)188 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ascelibrary.org/doi/pdf/10.1061/40513%28279%29188 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Construction site layout has been recognized as an important activity in construction site planning by field practitioners and researchers alike. This problem involves coordinating the use of limited space to accommodate temporary facilities (such as fabrication shops, trailers, materials or equipment) so that transportation costs of resources are minimized. The layout problem considered in this paper is a static layout problem characterized by affinity weights used to model transportation costs between facilities and by geometric constraints between relative positions of facilities on site. This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. The paper concludes with a number of examples illustrating the strength and limitations of the proposed approach |
|---|