---

The objective of this paper is to present an optimal design for single-layer barrel vault frames via improved magnetic charged system search (IMCSS) and open application programming interface (OAPI). The IMCSS algorithm is utilized as the optimization algorithm and the OAPI is used as an interface tool between analysis software and the programming language. In the proposed algorithm, magnetic charged system search (MCSS) and improved harmony search (IHS) are utilized to achieve a good convergence and good solutions especially in final iterations. The results confirm the efficiency of OAPI as a powerful interface tool in the analysis process of barrel vault structures and also the ability of IMCSS algorithm in fast convergence and achieving optimal results.

---

This article presents a comprehensive review of chaos embedded meta-heuristic optimization algorithms and describes the evolution of this algorithms along with some improvements, their combination with various methods as well as their applications. The reported results indicate that chaos embedded algorithms may handle engineering design problems efficiently in terms of precision and convergence and, in most cases they outperform the results presented in the previous works. The main goal of this paper is to providing useful references to fundamental concepts accessible to the broad community of optimization practitioners.

---

A charged system search algorithm (CSS) is applied to the optimal cost design of water distribution networks. This algorithm is inspired by the Coulomb and Gauss’s laws of electrostatics in physics. The CSS utilizes a number of charged particles which influence each other based on their fitness values and their separation distances considering the governing law of Coulomb. The well-known benchmark instances, Hanoi network, double Hanoi network, and New York City tunnel problem, are utilized as the case studies to evaluate the optimization performance of CSS. Comparison of the results of the CSS with some other meta-heuristic algorithms indicates the performance of the new algorithm.

---

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was not possible, first their Laplacian matrices are transformed into single block diagonal forms and then using the concept of determinant, the calculations are performed.

---

This paper describes the application of the recently developed metaheuristic algorithm for simultaneous analysis, design and optimization of Water Distribution Systems (WDSs). In this method, analysis is carried out using Colliding Bodies Optimization algorithm (CBO). The CBO is a population-based search approach that imitates nature’s ongoing search for better solutions. Also, design and cost optimization of WDSs are performed simultaneous with analysis process using a new objective function in order to satisfying the analysis criteria, design constraints and cost optimization. A number of practical examples of WDSs are selected to demonstrate the efficiency of the presented algorithm. Comparison of obtained results clearly signifies the efficiency of the CBO method in reducing the WDSs construction cost and computational time of the analysis.

---

Colliding bodies optimization (CBO) is a new population-based stochastic optimization algorithm based on the governing laws of one dimensional collision between two bodies from the physics. Each agent is modeled as a body with a specified mass and velocity. A collision occurs between pairs of objects to find the global or near-global solutions. Enhanced colliding bodies optimization (ECBO) uses memory to save some best solutions and utilizes a mechanism to escape from local optima. The performances of the CBO and ECBO are shown through truss and frame design optimization problems. The codes of these methods are presented in MATLAB and C++.

---

Simplified Dolphin Echolocation (SDE) optimization is an improved version of the Dolphin Echolocation optimization. The dolphin echolocation (DE) is a recently proposed metaheuristic algorithm, which was imitated dolphin’s hunting process. The global or near global optimum solution modeled as dolphin’s bait, dolphins send sound in different directions to discover the best bait among their search space. This paper introduced a new optimization method called SDE for weight optimization of steel truss structures problems. SDE applies some new approaches for generating new solutions. These improvements enhance the accuracy and convergence rate of the DE SDE does not depend on any empirical parameter. The results of the SDE for mathematical and engineering optimization problems are compared to those of the standard DE and some popular metaheuristic algorithms. The results show that SDE is competitive with other algorithms.

---

In this paper, optimal design of arch dams is performed under frequency limitations. Colliding Bodies Optimization (CBO), a recently developed meta-heuristic optimization method, which has been successfully applied to several structural problems, is revised and utilized for finding the best feasible shape of arch dams. The formulation of CBO is derived from one-dimensional collisions between bodies, where each agent solution is considered as the massed object or body. The design procedure aims to obtain minimum weight of arch dams subjected to natural frequencies, stability and geometrical limitations. Two arch dam examples from the literature are examined to verify the suitability of the design procedure and to demonstrate the effectiveness and robustness of the CBO in creating optimal design for arch dams. The results of the examples show that CBO is a powerful method for optimal design of arch dams.

---

---

Runway length is usually a critical point in an airport system so, a great interest has been created for optimal use of this runway length. The most important factors in modeling of aircraft landing problem are time and cost while, the costs imposed on the system because of moving away from target times have different performances in terms of impact. In this paper, firstly, aircraft landing problem (ALP) and the works conducted in subject literature are briefly reviewed and presented. Then, this problem is formulated and proposed as a three-objective mathematical modeling which leads to more applicable formulation. Following this, the model introduced to solve this problem is solved for two groups including 20 and 50 aircrafts using the second version of NSGA and the results and recommendations will be provided.

---

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in engineering. The proposed algorithms are tested on six complete graphs and eight complete bipartite graphs and their results are compared with some existing methods.

---

The failure probability of the structures is one of the challenging problems in structural engineering. To obtain the reliability index introduced by Hasofer and Lind, one needs to solve a nonlinear equality constrained optimization problem. In this study, four of the most recent metaheuristic algorithms are utilized for finding the design point and the failure probability of problems with continuous random variables. These algorithms consist of Improved Ray Optimization, Democratic Particle Swarm Optimization, Colliding Bodies Optimization, and Enhanced Colliding Bodies Optimization. The performance of these algorithms is tested on nineteen engineering optimization problems

---

Deterring the optimum design of large-scale structures is a difficult task. Great number of design variables, largeness of the search space and controlling great number of design constraints are major preventive factors in performing optimum design of large-scale truss structures in a reasonable time. Meta-heuristic algorithms are known as one of the useful tools to deal with these problems. This paper presents an improved bat algorithm for optimizing large-scale structures. The capability of the algorithm is examined by comparing the resulting design parameters and structural weight with those of other methods from literature.

---

The main functional purpose of a water distribution network is to transport water from a source to several domestic and industrial units while at the same time satisfying various requirements on hydraulic response. All the water distribution networks perform two basic operations: firstly the water network needs to deliver adequate amounts of water to meet specific requirements, and secondly the water network needs to be reliable therefore, the required amount of water needs to be continuously available 24 hours a day and 365 days per year. Due to the inevitable failures of some components such as pump stations, reservoirs and/or pipelines in a large-scale water distribution network, in designing a reliable network, the topological structure with low vulnerability must be achieved. Consequently, the study of connectivity, which is the key graph-theoretical notion, becomes crucial. This paper highlights some fundamental concepts from graph theory for vulnerability assessment of water distribution networks, addresses the mathematical properties of the link and node-deletion problems, and outlines some well-established results on the deterministic measures to assess the fault tolerance of networks.

---

The main object of this research is to optimize an end-filled castellated beam. In order to support high shear forces close to the connections, sometimes it becomes necessary to fill certain holes in web opening beam. This is done by inserting steel plates and welding from both sides. Optimization of these beams is carried out using three meta-heuristic methods involves CSS, CBO, and CBO-PSO algorithms. To compare the performance of these algorithms, the minimum cost of the beam is taken as the design objective function. Also, in this study, two common types of laterally supported castellated beams are considered as design problems: beams with hexagonal openings and beams with circular openings. A number of design examples are considered to solve in this case. Comparison of the optimal solution of these methods demonstrates that the hexagonal beams have less cost than cellular beams. It is observed that optimization results obtained by the CBO-PSO for more design examples have less cost in comparison to the results of the other methods.

---

This study presents shape optimization of a gravity dam imposing stability and principal stress constraints. A gravity dam is a large scale hydraulic structure consisting of huge amount of concrete material. Hence, an optimum design gives a cost-benefit structure due to the fact that small changes in shape of dam cross-section leads to large saving of concrete volume. Three recently developed meta-heuristics are utilized for optimizing the structure. These algorithms are charged system search (CSS), colliding bodies optimization (CBO) and its enhanced edition (ECBO). This article also provides useful formulations for stability analysis of gravity dams which can be extended to further researches.

---

In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple frames, and meta-heuristic algorithms are the best choice for larger frame structures. In this paper, the Colliding Bodies Optimization (CBO) and its enhanced variant (ECBO) are employed to optimize the process of finding an upper bound for the collapse load factor of the planar frames. The efficiency of these algorithms is compared to that of the Particle Swarm Optimization (PSO) algorithm through four numerical examples form multi-bay multi-story frames and pitched roof frames.

---

Grillages are widely used in various structures. In this research, the Colliding Bodies Optimization (CBO) and Enhanced Colliding Bodies Optimization (ECBO) algorithms are used to obtain the optimum design of irregular grillage systems. The purpose of this research is to minimize the weight of the structure while satisfying the design constraints. The design variables are considered to be the cross-sectional properties of the beams and the design constraints are employed from LRFD-AISC. In addition, optimum design of grillages is performed for two cases: (i) without considering the warping effect, and (ii) with considering the warping effect. Also, several examples are presented to show the effect of different spacing and various boundary conditions. Finally, the results show that warping effect, beam spacing and boundary conditions have significant effects on the optimum design of grillages.

---

In  this  paper,  a  method  is  presented  for  damage  detection  of  bridges  using  the  Enhanced Colliding Bodies Optimization (ECBO)  utilizing time-domain responses. The finite element modeling of the structure is based on  the equation of motion under the moving load, and the flexural stiffness of the structure is determined by the acceleration responses obtained via sensors placed in different places. Damage detection problem presented in this research is an inverse  problem,  which  is  optimized  by  the  ECBO  algorithm,  and  the  damages  in  the structures  are  fully  detected.  Furthermore,  for  simulating  the  real  situation,  the  effect  of measured noises is considered on the structure, to obtain more accurate results.

---

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) and Enhanced Colliding Bodies Optimization (ECBO) are two recently developed continuous optimization algorithms which have been applied to some structural optimization problems. The main goal of this paper is to provide a useful comparison between capabilities of these two algorithms in solving p-median problems. Comparison of the obtained results shows the validity and robustness of these two new meta-heuristic algorithms for p-median problem.