Solving Construction Site Layout Planning as a Quadratic Assignment Problem Using the Advanced Jaya Algorithm

Construction site layout planning (CSLP) plays a pivotal role in determining the overall efficiency and cost-effectiveness of construction projects. Material handling operations, which constitute a significant portion of indirect project costs, heavily depend on the spatial arrangement of temporary facilities such as site offices, storage yards, and equipment zones. Poorly planned layouts can lead to excessive travel distances, increased material handling times, and operational delays, all of which contribute to inflated costs and reduced productivity. Therefore, optimizing the layout of construction sites to minimize transportation distances and enhance workflow is a critical task for project managers, contractors, and other stakeholders. The challenge in CSLP lies in the complexity of simultaneously satisfying multiple, often conflicting, requirements such as space constraints, safety regulations, and functional proximities. This complexity is compounded by the dynamic nature of construction activities and the presence of numerous facilities to be allocated within limited and irregularly shaped site boundaries. Mathematically, this problem can be formulated as a Quadratic Assignment Problem (QAP), a well-known NP-hard combinatorial optimization problem. The QAP seeks to assign a set of facilities to specific locations in a manner that minimizes the total cost, typically modeled as the sum of products of flows (e.g., material movement) and distances between assigned locations. However, due to the computational complexity of QAP, exact solutions become impractical for medium to large-scale site layouts. In recent years, metaheuristic algorithms have gained traction for effectively tackling such complex optimization problems. Among these, the Advanced Jaya Algorithm (A-JA), a recent population-based metaheuristic, stands out for its simplicity, parameter-free nature, and robust search capabilities. This study applies the A-JA to solve the CSLP modeled as a QAP, aiming to minimize the total weighted travel distance of material handling within the site. The algorithm’s performance is validated through two realistic case studies, showcasing its strong search capabilities and competitive results compared to traditional optimization methods. This promising approach offers a valuable decision-support tool for construction managers seeking to enhance site operational efficiency.