Charged System Search and Magnetic Charged System Search Algorithms for Construction Site Layout Planning Optimization

Construction site layout planning can be considered as an effort to place different temporary facilities in available site locations such that multiple objectives are satisfied as much as possible. With the extension of high-rise building construction and construction activities besides the lack of available spaces in construction sites, proper utilization of this resource has been highlighted because of its significant positive influences on direct cost, safety, and security of the site which consequently affects the total cost and schedule of the project. Thus the construction site layout planning is considered as one of the essential and important phases in construction projects. Site layout planning problem is an NP-Hard problem from the viewpoint of complexity. In this research, two prominent meta-heuristic algorithms, namely Charged System Search (CSS) and Magnetic Charged System Search (MCSS) are utilized to optimize the site layout planning problem. The obtained results of implementing these two algorithms for two different types of site space modeling are compared with the results of the Particle Swarm Optimization (PSO) algorithm and also those of the previous studies. The results illustrate the capability of the CSS and MCSS algorithms in solving the present problem

Using Biological Knowledge for Layout Optimization of Construction Site Temporary Facilities: A Case Study

In recent years, a number of studies have successfully transformed various models for biological collective behavior into intelligent optimization algorithms. These bio-inspired optimization techniques have been developed to provide better solutions than traditional methods to a variety of engineering problems. This paper attempts to apply and compare recent bio-inspired algorithms for determining the best layout of construction temporary facilities. To validate the performance of the proposed techniques, an actual building construction project was used as a test problem. Based on the obtained results, the performance of each bio-inspired algorithm is highlighted and discussed. This paper presents beneficial insights to decision-makers in the construction industry that are involved in handling optimization problems

Genetic algorithm optimization for dynamic construction site layout planning

The dynamic construction site layout planning (DCSLP) problem refers to the efficient placement and relocation of temporary construction facilities within a dynamically changing construction site environment considering the characteristics of facilities and work interrelationships, the shape and topography of the construction site, and the time-varying project needs. A multi-objective dynamic optimization model is developed for this problem that considers construction and relocation costs of facilities, transportation costs of resources moving from one facility to another or to workplaces, as well as safety and environmental considerations resulting from facilities’ operations and interconnections. The latter considerations are taken into account in the form of preferences or constraints regarding the proximity or remoteness of particular facilities to other facilities or work areas. The analysis of multiple project phases and the dynamic facility relocation from phase to phase highly increases the problem size, which, even in its static form, falls within the NP (for Nondeterministic Polynomial time)- hard class of combinatorial optimization problems. For this reason, a genetic algorithm has been implemented for the solution due to its capability to robustly search within a large solution space. Several case studies and operational scenarios have been implemented through the Palisade’s Evolver software for model testing and evaluation. The results indicate satisfactory model response to time-varying input data in terms of solution quality and computation time. The model can provide decision support to site managers, allowing them to examine alternative scenarios and fine-tune optimal solutions according to their experience by introducing desirable preferences or constraints in the decision process

Particle Bee Algorithm for Tower Crane Layout with Material Quantity Supply and Demand Optimization.

The tower crane layout (TCL) problem, a typical construction site layout (CSL) problem, is currently used in a wide range of construction projects and site conditions. The tower crane is a key facility used in the vertical and horizontal transportation of materials, particularly heavy prefabrication units such as steel beams, readymixed concrete, prefabricated elements, and large-panel formwork. Matching the location of tower cranes to material supply and engineering demands is a combinatorial optimization issue within the TCL problem that is difficult to resolve. Swarm intelligence (SI) is a popular artificial intelligence technique that is used widely to resolve complex optimization problems. Various SI-based algorithms have been developed that emulate the collective behavior of animals such as honey bees (bee algorithm, BA) and birds (particle swarm optimization, PSO). This study applies the particle bee algorithm (PBA), a hybrid swarm algorithm that integrates the respective advantages of honey bee and bird swarms, to the TCL problem. The performances of PBA, BA, and PSO are compared in terms of their effectiveness in resolving a practical TCL problem in construction engineering. Results show that the PBA performs better than both the BA and PSO algorithms

A Novel Implementation of Nature-inspired Optimization for Civil Engineering: A Comparative Study of Symbiotic Organisms Search

The increasing numbers of design variables and constraints have made many civil engineering problems significantly more complex and difficult for engineers to resolve in a timely manner. Various optimization models have been developed to address this problem. The present paper introduces Symbiotic Organisms Search (SOS), a new nature-inspired algorithm for solving civil engineering problems. SOS simulates mutualism, commensalism, and parasitism, which are the symbiotic interaction mechanisms that organisms often adopt for survival in the ecosystem. The proposed algorithm is compared with other algorithms recently developed with regard to their respective effectiveness in solving benchmark problems and three civil engineering problems. Simulation results demonstrate that the proposed SOS algorithm is significantly more effective and efficient than the other algorithms tested. The proposed model is a promising tool for assisting civil engineers to make decisions to minimize the expenditure of material and financial resources

Recent tendencies in the use of optimization techniques in geotechnics:a review

The use of optimization methods in geotechnics dates back to the 1950s. They were used in slope stability analysis (Bishop) and evolved to a wide range of applications in ground engineering. We present here a non-exhaustive review of recent publications that relate to the use of different optimization techniques in geotechnical engineering. Metaheuristic methods are present in almost all the problems in geotechnics that deal with optimization. In a number of cases, they are used as single techniques, in others in combination with other approaches, and in a number of situations as hybrids. Different results are discussed showing the advantages and issues of the techniques used. Computational time is one of the issues, as well as the assumptions those methods are based on. The article can be read as an update regarding the recent tendencies in the use of optimization techniques in geotechnics

Heuristics and Metaheuristics Approaches for Facility Layout Problems: A Survey

Facility Layout Problem (FLP) is a NP-hard problem concerned with the arrangement of facilities as to minimize the distance travelled between all pairs of facilities. Many exact and approximate approaches have been proposed with an extensive applicability to deal with this problem. This paper studies the fundamentals of some well-known heuristics and metaheuristics used in solving the FLPs. It is hoped that this paper will trigger researchers for in-depth studies in FLPs looking into more specific interest such as equal or unequal FLPs

Single Tower Crane Allocation Models Using Ant Colony Optimization

The construction industry greatly benefits from the utilization of heavy machines and equipment to accomplish successful projects. Tower cranes, in specific, have a crucial role in the transportation of material loads across the site. Because these machines are fixed to the ground, it is essential for planners and managers to position them in a location that provides the most efficient transfer of materials possible. This is commonly known as the tower crane allocation problem, and many researchers have attempted to optimize the tower crane location using mathematical, artificial intelligence, and simulation approaches. However, many works from the literature contain critical errors which make the models infeasible. This research presents the application of ant colony optimization (ACO) and an ACO variation to tower crane allocation models. Results show that the approaches presented in this work are up to par with even the most powerful methodologies used to solve the problem

Dynamic Facility Layout for Cellular and Reconfigurable Manufacturing using Dynamic Programming and Multi-Objective Metaheuristics

The facility layout problem is one of the most classical yet influential problems in the planning of production systems. A well-designed layout minimizes the material handling costs (MHC), personnel flow distances, work in process, and improves the performance of these systems in terms of operating costs and time. Because of this importance, facility layout has a rich literature in industrial engineering and operations research. Facility layout problems (FLPs) are generally concerned with positioning a set of facilities to satisfy some criteria or objectives under certain constraints. Traditional FLPs try to put facilities with the high material flow as close as possible to minimize the MHC. In static facility layout problems (SFLP), the product demands and mixes are considered deterministic parameters with constant values. The material flow between facilities is fixed over the planning horizon. However, in today’s market, manufacturing systems are constantly facing changes in product demands and mixes. These changes make it necessary to change the layout from one period to the other to be adapted to the changes. Consequently, there is a need for dynamic approaches of FLP that aim to generate layouts with high adaptation concerning changes in product demand and mix. This thesis focuses on studying the layout problems, with an emphasis on the changing environment of manufacturing systems. Despite the fact that designing layouts within the dynamic environment context is more realistic, the SFLP is observed to have been remained worthy to be analyzed. Hence, a math-heuristic approach is developed to solve an SFLP. To this aim, first, the facilities are grouped into many possible vertical clusters, second, the best combination of the generated clusters to be in the final layout are selected by solving a linear programming model, and finally, the selected clusters are sequenced within the shop floor. Although the presented math-heuristic approach is effective in solving SFLP, applying approaches to cope with the changing manufacturing environment is required. One of the most well-known approaches to deal with the changing manufacturing environment is the dynamic facility layout problem (DFLP). DFLP suits reconfigurable manufacturing systems since their machinery and material handling devices are reconfigurable to encounter the new necessities for the variations of product mix and demand. In DFLP, the planning horizon is divided into some periods. The goal is to find a layout for each period to minimize the total MHC for all periods and the total rearrangement costs between the periods. Dynamic programming (DP) has been known as one of the effective methods to optimize DFLP. In the DP method, all the possible layouts for every single period are generated and given to DP as its state-space. However, by increasing the number of facilities, it is impossible to give all the possible layouts to DP and only a restricted number of layouts should be fed to DP. This leads to ignoring some layouts and losing the optimality; to deal with this difficulty, an improved DP approach is proposed. It uses a hybrid metaheuristic algorithm to select the initial layouts for DP that lead to the best solution of DP for DFLP. The proposed approach includes two phases. In the first phase, a large set of layouts are generated through a heuristic method. In the second phase, a genetic algorithm (GA) is applied to search for the best subset of layouts to be given to DP. DP, improved by starting with the most promising initial layouts, is applied to find the multi-period layout. Finally, a tabu search algorithm is utilized for further improvement of the solution obtained by improved DP. Computational experiments show that improved DP provides more efficient solutions than DP approaches in the literature. The improved DP can efficiently solve DFLP and find the best layout for each period considering both material handling and layout rearrangement costs. However, rearrangement costs may include some unpredictable costs concerning interruption in production or moving of facilities. Therefore, in some cases, managerial decisions tend to avoid any rearrangements. To this aim, a semi-robust approach is developed to optimize an FLP in a cellular manufacturing system (CMS). In this approach, the pick-up/drop-off (P/D) points of the cells are changed to adapt the layout with changes in product demand and mix. This approach suits more a cellular flexible manufacturing system or a conventional system. A multi-objective nonlinear mixed-integer programming model is proposed to simultaneously search for the optimum number of cells, optimum allocation of facilities to cells, optimum intra- and inter-cellular layout design, and the optimum locations of the P/D points of the cells in each period. A modified non-dominated sorting genetic algorithm (MNSGA-II) enhanced by an improved non-dominated sorting strategy and a modified dynamic crowding distance procedure is used to find Pareto-optimal solutions. The computational experiments are carried out to show the effectiveness of the proposed MNSGA-II against other popular metaheuristic algorithms