Showing 3 results for Construction Site Layout Planning
A. Kaveh, Y. Vazirinia,
Volume 7, Issue 3 (7-2017)
Abstract
Tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. The tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. This problem has already been solved by linear programming, but meta-heuristic methods spend less time to solving the problem. Hence, in this paper three newly developed meta-heuristic algorithms called CBO, ECBO, and VPS have been used to solve the tower crane locating problem. Three scenarios are studied to show the applicability and performance of these meta-heuristics.
S. S. Shahebrahimi, A. Lork, D. Sedaghat Shayegan, A. A. Kardoust,
Volume 14, Issue 1 (1-2024)
Abstract
One of the important factors in the efficiency of construction operations is the proper replacement construction projects of the construction site layout planning (CSLP). That this would not be possible without oversight of the factors affecting it. Therefore, the study of factors affecting the replacement of construction site layout is considered vital in projects. Different factors are involved in the replacement of CSLP, which examine the economic dimension and the effects of changing costs and time during work. Due to the complexity of the subject, it is solved using hyper-innovative algorithms. This research is a linear programming model for optimizing the layout of equipment for Launcher/Receiver (L/R) stations. Due to the complexity of the problem, the invasive weed algorithm was used to achieve an optimal response. The goal is to minimize the total costs associated with transportation, relocation and relocation, and changes during implementation. The results of the calculations and output of the algorithm showed the variation of the answer in the optimal layout of the CSLP, which was obtained at the lowest distance and the most optimal mode. The results were presented in a similar scenario in the projects.
Mr. A. Alipour, Dr. D. Sedaghat Shayegan, Dr. A. A. Amirkardoust,
Volume 16, Issue 3 (7-2026)
Abstract
Deciding where to place temporary facilities on a construction site is one of the more consequential choices a project team makes, since that arrangement shapes how materials and people move around the site, how accessible different zones are, and how smoothly logistics run overall. This paper examines whether the Mouth Brooding Fish (MBF) algorithm can handle a standard construction site layout planning problem. The goal is to minimize the total distance that must be traveled between facilities that interact with each other. A well-known benchmark involving eleven facilities and eleven predetermined locations is solved with MBF and compared against Genetic Algorithm (GA), Ant Colony Optimization (ACO), Colliding Bodies Optimization (CBO), and Enhanced Colliding Bodies Optimization (ECBO). Fifty independent runs are performed, each with 200 iterations. The best solution obtained by MBF yields a total travel distance of 12,538, while the mean, worst, and standard deviation values are 12,608, 12,888, and 96, respectively. These figures place MBF in a competitive position relative to the other methods on this particular benchmark. The study does not claim direct field validation for oil and gas projects; rather, it demonstrates that the optimization framework works on a benchmark whose structure is relevant to industrial construction logistics. Further work that incorporates project-specific constraints and actual field data is recommended.
