Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. The layout pro...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2002
|
| Online Access: | http://hdl.handle.net/10725/3533 https://doi.org/10.1061/(ASCE)0887-3801(2002)16:2(143) http://ascelibrary.org/doi/abs/10.1061/(ASCE)0887-3801(2002)16:2(143) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. The layout problem considered in this paper is characterized by affinity weights used to model transportation costs between facilities and by geometric constraints that limit their relative positions on site. The proposed genetic algorithm generates an initial population of layouts through a sequence of mutation operations and evolves the layouts of this population through a sequence of genetic operations aiming at finding an optimal layout. The paper concludes with examples illustrating the strength and limitations of the proposed algorithm in the cases of ~1! loosely versus tightly constrained layouts with equal levels of interaction between facilities; ~2! loosely versus tightly packed layouts with variable levels of interactions between facilities; and ~3! loosely versus tightly constrained layouts. In most problems considered where the total-objects-to-site-area ratio did not exceed 60%, the algorithm returned close to optimal solutions in a reasonable time. |
|---|