A Hybrid Genetic Algorithm and Tabu Search for Construction Site Layout Planning Problem

Authors

  • Trieu Xuan Hoa Thai Nguyen University of Agriculture and Forestry, Vietnam
  • Tran Thanh Thuong International School, Thai Nguyen University, Vietnam

DOI:

https://doi.org/10.54554/jtec.2025.17.03.001

Keywords:

CSLP problem, GA, Tabu Search, GA-Tabu

Abstract

The construction site layout is widely acknowledged as a complex challenge in the field of construction management. However, it is crucial for nearly all construction projects, as the layout of site facilities can significantly impact on the project costs. This issue can be formulated as a Quadratic Assignment Problem, which is widely recognized to be NP-hard problem. While numerous methods have been proposed, most existing approaches either lack sufficient global search capabilities or struggle to escape local optima, leading to suboptimal solutions. To address these limitations, this study proposes a hybrid GA-Tabu algorithm that integrates the exploration strength of Genetic Algorithms with the exploitation efficiency of Tabu Search. This integration aims to achieve a better balance between global and local search processes, thereby enhancing the overall solution quality for the CSLP problem. The proposed algorithm has been subsequently tested with three case studies previously utilized in related research, effectively demonstrating its performance and applicability.

Downloads

Download data is not yet available.

Downloads

Published

2025-09-30

How to Cite

Trieu, X. H., & Tran, T. T. (2025). A Hybrid Genetic Algorithm and Tabu Search for Construction Site Layout Planning Problem. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 17(3), 1–6. https://doi.org/10.54554/jtec.2025.17.03.001