Dynamic Construction Site Layout Planning: An Application of Branch and Bond Algorithm

Purpose: This paper develops a platform that can be used to determine how to effectively and efficiently deal with a large number of temporary facilities under a constrained site condition(s). The ultimate goal is to reduce the material handling costs between transformation phases of construction works occurring during the project’s development period. Design/ Methodology/ approach: Empirical and deductive research is first adopted to mathematically model dynamic site layout planning using the branch and bond algorithm (B&B). Second, a real-life construction project is examined to illustrate how dynamic site layout planning (using the aforementioned B&B algorithm and a computer software programme called LINGO) can reduce the material handling costs. The application of the proposed methodology is then showcased against a case study that utilises a comparative analysis between the ‘dynamic’ and ‘statistic site planning approaches. Findings: By dividing the construction period into different phases, the developed model is shown to be capable of optimizing the material handling costs between the phases of transformation during construction works. Optimal costs are also considered using the site boundary and unit cost for moving construction materials between two facilities. The comparative analysis results illustrate that the B&B algorithm reduces material handling costs by 33%. Implications: The proposed model offers an effective planning algorithm for the site layout and location of temporary facilities. More specifically, it can make a substantial improvement in reducing the travel time and material handling cost between the temporary facilities in the construction sites. Originality: This study is the first to successfully deal with the ‘unequal area problem’ of incorporating temporary site facilities onto site using the concept of dynamic site layout planning.