Amirkabir University of Technology Amirkabir Journal of Civil Engineering 2588-297X 57 8 2025 10 31 Solving the Problem of Locating Construction Sites Based on a Combination of Weeding Algorithm and Forbidden Search Algorithm Solving the Problem of Locating Construction Sites Based on a Combination of Weeding Algorithm and Forbidden Search Algorithm 1365 1382 5878 10.22060/ceej.2025.23469.8168 FA Davood Sedaghat Shayegan Department of Civil Engineering, Roudehen Branch, Islamic Azad University, Roudehen, Iran Mehdi Mashayekhi Department of Civil Engineering, Roudehen Branch, Islamic Azad University, Roudehen, Iran Journal Article 2024 08 26 In this research, the problem of planning the layout of construction sites was solved based on the combination of weed algorithm and forbidden search algorithm. The research problem was considered in a dynamic state and was optimized based on the layout and cost. For this purpose, two categories of fixed and mobile equipment were included so that the moving capacity of mobile equipment is considered in different intervals of the project planning horizon. The combination of weed algorithm and forbidden search algorithm was used to solve the research problem in large and real dimensions with dynamic conditions. The method of allocating and arranging the equipment in three stages for each of the answers in each stage was presented below. Solving the problem was done through ten iterations in the GEMS software for the weed algorithm and the forbidden search algorithm in order to determine the optimal value that has the lowest cost. According to the results of the weed algorithm, the cost values decreased from 1.99 thousand dollars to 1.89 thousand dollars. In the implementation of the forbidden search algorithm, the cost was reduced from 1.99 thousand dollars to 1.93 thousand dollars. Regarding the position of the optimal arrangement, the responses of each algorithm were determined in three stages to determine the optimal arrangement In this research, the problem of planning the layout of construction sites was solved based on the combination of weed algorithm and forbidden search algorithm. The research problem was considered in a dynamic state and was optimized based on the layout and cost. For this purpose, two categories of fixed and mobile equipment were included so that the moving capacity of mobile equipment is considered in different intervals of the project planning horizon. The combination of weed algorithm and forbidden search algorithm was used to solve the research problem in large and real dimensions with dynamic conditions. The method of allocating and arranging the equipment in three stages for each of the answers in each stage was presented below. Solving the problem was done through ten iterations in the GEMS software for the weed algorithm and the forbidden search algorithm in order to determine the optimal value that has the lowest cost. According to the results of the weed algorithm, the cost values decreased from 1.99 thousand dollars to 1.89 thousand dollars. In the implementation of the forbidden search algorithm, the cost was reduced from 1.99 thousand dollars to 1.93 thousand dollars. Regarding the position of the optimal arrangement, the responses of each algorithm were determined in three stages to determine the optimal arrangement https://ceej.aut.ac.ir/article_5878_e0ae4561193dbf6e4cf7e8f4006948e3.pdf