Shape optimal design of arch dams including dam-water–foundation rock interaction using a grading strategy and approximation concepts

Optimal design of arch dams including dam-water–foundation rock interaction is achieved using the soft computing techniques. For this, linear dynamic behavior of arch dam-water–foundation rock system subjected to earthquake ground motion is simulated using the finite element method at first and then, to reduce the computational cost of optimization process, a wavelet back propagation neural network (WBPNN) is designed to predict the arch dam response instead of directly evaluating it by a time-consuming finite-element analysis (FEA). In order to enhance the performance generality of the neural network, a dam grading technique (DGT) is also introduced. To assess the computational efficiency of the proposed methodology for arch dam optimization, an actual arch dam is considered. The optimization is implemented via the simultaneous perturbation stochastic approximation (SPSA) algorithm for the various conditions of the interaction problem. Numerical results show the merits of the suggested techniques for arch dam optimization. It is also found that considering the dam-water–foundation rock interaction has an important role for safely designing an arch dam.     

Shape optimal design of arch dams using an adaptive neuro-fuzzy inference system and improved particle swarm optimization

An efficient methodology is proposed to find the optimal shape of arch dams including fluid–structure interaction subject to earthquake ground motion. In order to reduce the computational cost of optimization process, an adaptive neuro-fuzzy inference system (ANFIS) is built to predict the dam effective response instead of directly evaluating it by a time-consuming finite element analysis (FEA). The presented ANFIS is compared with a widespread neural network termed back propagation neural network (BPNN) and it appears a better performance generality for estimating the dam response. The optimization task is implemented using an improved version of particle swarm optimization (PSO) named here as IPSO. In order to assess the effectiveness of the proposed methodology, the optimization of a real world arch dam is performed via both IPSO–ANFIS and PSO–BPNN approaches. The numerical results demonstrate the computational advantages of the proposed IPSO–ANFIS for optimal design of arch dams when compared with the PSO–BPNN approach.     

A robustness approach to uncapacitated network design problems

In this paper, we address uncapacitated network design problems characterised by uncertainty in the input data. Network design choices have a determinant impact on the effectiveness of the system. Design decisions are frequently made with a great degree of uncertainty about the conditions under which the system will be required to operate. Instead of finding optimal designs for a given future scenario, designers often search for network configurations that are “good” for a variety of likely future scenarios. This approach is referred to as the “robustness” approach to system design. We present a formal definition of “robustness” for the uncapacitated network design problem, and develop algorithms aimed at finding robust network designs. These algorithms are adaptations of the Benders decomposition methodology that are tailored so they can efficiently identify robust network designs. We tested the proposed algorithms on a set of randomly generated problems. Our computational experiments showed two important properties. First, robust solutions are abundant in uncapacitated network design problems, and second, the proposed algorithms performance is satisfactory in terms of cost and number of robust network designs obtained.     

Sobre la necesidad de controlar el error de discretización de elementos finitos en optimización de forma estructural con algoritmos evolutivos

This work analyzes the influence of the discretization error contained in the Finite Element (FE) analyses of each design configuration proposed by the structural shape optimization algorithms over the behavior of the algorithm. The paper clearly shows that if FE analyses are not accurate enough, the final solution provided by the optimization algorithm will neither be optimal nor satisfy the constraints. The need for the use of adaptive FE analysis techniques in shape optimum design will be shown. The paper proposes the combination of two strategies to reduce the computational cost related to the use of mesh adaptivity in evolutionary optimization algorithms: (a) the use of the algorithm described by Bugeda et al. [1] which reduces the computational cost associated to the adaptive FE analysis of each geometrical configuration and, (b) the successive increase of the required accuracy of the FE analyses in order to obtain a considerable reduction of the computational cost in the early stages of the optimization process.     

Design of a motorcycle frame using neuroacceleration strategies in MOEAs

Designing a low-budget lightweight motorcycle frame with superior dynamic and mechanical properties is a complex engineering problem. This complexity is due in part to the presence of multiple design objectives—mass, structural stress and rigidity—, the high computational cost of the finite element (FE) simulations used to evaluate the objectives, and the nature of the design variables in the frame’s geometry (discrete and continuous). Therefore, this paper presents a neuroacceleration strategy for multiobjective evolutionary algorithms (MOEAs) based on the combined use of real (FE simulations) and approximate fitness function evaluations. The proposed approach accelerates convergence to the Pareto optimal front (POF) comprised of nondominated frame designs. The proposed MOEA uses a mixed genotype to encode discrete and continuous design variables, and a set of genetic operators applied according to the type of variable. The results show that the proposed neuro-accelerated MOEAs, NN-NSGA II and NN-MicroGA, improve upon the performance of their original counterparts, NSGA II and MicroGA. Thus, this neuroacceleration strategy is shown to be effective and probably applicable to other FE-based engineering design problems.     

A robust and efficient algorithm for planar competitive location problems

In this paper we empirically analyze several algorithms for solving a Huff-like competitive location and design model for profit maximization in the plane. In particular, an exact interval branch-and-bound method and a multistart heuristic already proposed in the literature are compared with uego (Universal Evolutionary Global Optimizer), a recent evolutionary algorithm. Both the multistart heuristic and uego use a Weiszfeld-like algorithm as local search procedure. The computational study shows that uego is superior to the multistart heuristic, and that by properly fine-tuning its parameters it usually (in the computational study, always) find the global optimal solution, and this in much less time than the interval branch-and-bound method. Furthermore, uego can solve much larger problems than the interval method.     

Tabu search and GRASP for the maximum diversity problem

In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NP-hard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although proposed in seminal tabu search papers, memory-based constructions have often been implemented in naïve ways that disregard important elements of the fundamental tabu search proposals. We will compare our tabu search construction with a memory-less design and with previous algorithms recently developed for this problem. The constructive method can be coupled with a local search procedure or a short-term tabu search for improved outcomes. Extensive computational experiments with medium and large instances show that the proposed procedure outperforms the best heuristics reported in the literature within short computational times.     

Optimal dynamic multi-attribute hashing for range queries

This paper examines a partial match retrieval scheme which supports range queries for highly dynamic databases. The scheme relies on order preserving multi-attribute hashing. In general, designing optimal indexes is NP-hard. Greedy algorithms used to determine the optimal indexes for simple partial match queries are not directly applicable because there are a larger number of queries to consider in determining the optimal indexes. In this paper we present heuristic algorithms which provide near-optimal solutions. The optimisation scheme we propose can be used to design other dynamic file structures such as the grid file, BANG file and multilevel grid file to further enhance their retrieval performance taking into consideration the query distribution.     

Current grid-generation strategies and future requirements in hypersonic vehicle design,analysis and testing

Recent advances in computational power enable computational fluid dynamic modeling of increasingly complex configurations. A review of grid-generation methodologies implemented in support of the computational work performed for the X-38 (Experimental Crew Return Vehicle) and X-33 hypersonic vehicles are presented. In strategizing topological constructs and blocking structures, the factors considered are geometric configuration, optimal grid size, numerical algorithms, accuracy requirements, physics of the problem at hand, computational expense and available computer hardware. Also addressed are grid-refinement strategies, the effect of wall spacing and convergence. The significance of grids is demonstrated through a comparison of computational and experimental results of the aeroheating environment experienced by the X-38 vehicle. Special topics on grid-generation strategies are also addressed to model control surface deflections and material mapping.     

A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks

Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. In this paper, we enlarge the application of these types of algorithms by presenting a multi-population hybrid genetic algorithm to another communication design problem. This new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characteristic of flows. All nodes, except for the root node, have a nonnegative flow requirement. In addition to the fixed charge costs, nonlinear flow dependent costs are also considered. This problem is an extension of the well know NP-hard hop-constrained Minimum Spanning Tree problem and we have termed it hop-constrained minimum cost flow spanning tree problem. The efficiency and effectiveness of the proposed method can be seen from the computational results reported.     

Differential Evolution with Wavelet Mutation in Digital Finite Impulse Response Filter Design

This paper proposes one novel algorithm called differential evolution with wavelet mutation for the optimal design of linear phase finite impulse response filters. For comparative performance study, the Parks–McClellan algorithm and some evolutionary algorithms like the real coded genetic algorithm, conventional particle swarm optimization, and conventional differential evolution have also been applied.     

Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures

This paper considers a multi-supplier economic lot-sizing problem in which the retailer replenishes his inventory from several suppliers. Each supplier is characterized by one of three types of order cost structures: incremental quantity discount cost structure, multiple set-ups cost structure and all-unit quantity discount cost structure. The problem is challenging due to the mix of different cost structures. For all cases of the problem where each supplier is characterized by one of the first two cost structures, some optimality properties are proposed and optimal algorithms based on dynamic programming are designed. For the case where all suppliers are characterized by all-unit quantity discount cost structures, it is hard to design a polynomial time algorithm by the analyzed optimal properties. However, it is proved that one of its special cases can be solved in polynomial time.     

Wavelet-Based Estimation of Anisotropic Spatiotemporal Long-Range Dependence

In this article, the estimation of spatiotemporal long-range dependence is formulated in the spectral wavelet domain. Sample information is provided by functional spectral data. Their high local singularity at the origin is captured by the wavelet transform. Weak consistency of the spectral wavelet estimators proposed is derived. Two functional estimation algorithms are implemented. A simulation study is developed to illustrate the efficiency of the computational methods derived. An approximation to the empirical convergence rate of the spectral wavelet periodogram is computed in some simulated examples.     

Two-level evolutionary approach to the survivable mesh-based transport network topological design

The complete topology design problem of survivable mesh-based transport networks is to address simultaneously design of network topology, working path routing, and spare capacity allocation based on span-restoration. Each constituent problem in the complete design problem could be formulated as an Integer Programming (IP) and is proved to be NP\mathcal{NP} -hard. Due to a large amount of decision variables and constraints involved in the IP formulation, to solve the problem directly by exact algorithms (e.g. branch-and-bound) would be impractical if not impossible. In this paper, we present a two-level evolutionary approach to address the complete topology design problem. In the low-level, two parameterized greedy heuristics are developed to jointly construct feasible solutions (i.e., closed graph topologies satisfying all the mesh-based network survivable constraints) of the complete problem. Unlike existing “zoom-in”-based heuristics in which subsets of the constraints are considered, the proposed heuristics take all constraints into account. An estimation of distribution algorithm works on the top of the heuristics to tune the control parameters. As a result, optimal solution to the considered problem is more likely to be constructed from the heuristics with the optimal control parameters. The proposed algorithm is evaluated experimentally in comparison with the latest heuristics based on the IP software CPLEX, and the “zoom-in”-based approach on 28 test networks problems. The experimental results demonstrate that the proposed algorithm is more effective in finding high-quality topologies than the IP-based heuristic algorithm in 21 out of 28 test instances with much less computational costs, and performs significantly better than the “zoom-in”-based approach in 19 instances with the same computational costs.     

On the Seismic Disturbance Rejection of Structures*

Using results of disturbance rejection in optimal control and computational mechanics' techniques, a new approach for the design of robust structural control systems for aseismic design applications is presented. A shear-type frame structure is used to outline the proposed methodology.     

On a high-dimensional objective genetic algorithm and its nonlinear dynamic properties

The revival of multi-objective optimization is mainly resulted from the recent development of multi-objective evolutionary optimization that allows the generation of the overall Pareto front. This paper presents an algorithm called HOGA (High-dimensional Objective Genetic Algorithm) for high-dimensional objective optimization on the basis of evolutionary computing. It adopts the principle of Shannon entropy to calculate the weight for each object since the well-known multi-objective evolutionary algorithms work poorly on the high-dimensional optimization problem. To further discuss the nonlinear dynamic property of HOGA, a martingale analysis approach is then employed; some mathematical derivations of the convergent theorems are obtained. The obtained results indicate that this new algorithm is indeed capable of achieving convergence and the suggested martingale analysis approach provides a new methodology for nonlinear dynamic analysis of evolutionary algorithms.     

The application of optimal control methodology to nonlinear programming problems

Dynamic programming techniques have proven to be more successful than alternative nonlinear programming algorithms for solving many discrete-time optimal control problems. The reason for this is that, because of the stagewise decomposition which characterizes dynamic programming, the computational burden grows approximately linearly with the numbern of decision times, whereas the burden for other methods tends to grow faster (e.g.,n ³ for Newton's method). The idea motivating the present study is that the advantages of dynamic programming can be brought to bear on classical nonlinear programming problems if only they can somehow be rephrased as optimal control problems.As shown herein, it is indeed the case that many prominent problems in the nonlinear programming literature can be viewed as optimal control problems, and for these problems, modern dynamic programming methodology is competitive with respect to processing time. The mechanism behind this success is that such methodology achieves quadratic convergence without requiring solution of large systems of linear equations.     

Partially Observable Markov Decision Processes incorporating epistemic uncertainties

The use of Markov Decision Processes for Inspection Maintenance and Rehabilitation of civil engineering structures relies on the use of several transition matrices related to the stochastic degradation process, maintenance actions and imperfect inspections. Point estimators for these matrices are usually used and they are evaluated using statistical inference methods and/or expert evaluation methods. Thus, considerable epistemic uncertainty often veils the true values of these matrices. Our contribution through this paper is threefold. First, we present a methodology for incorporating epistemic uncertainties in dynamic programming algorithms used to solve finite horizon Markov Decision Processes (which may be partially observable). Second, we propose a methodology based on the use of Dirichlet distributions which answers, in our sense, much of the controversy found in the literature about estimating Markov transition matrices. Third, we show how the complexity resulting from the use of Monte-Carlo simulations for the transition matrices can be greatly overcome in the framework of dynamic programming. The proposed model is applied to concrete bridge under degradation, in order to provide the optimal strategy for inspection and maintenance. The influence of epistemic uncertainties on the optimal solution is underlined through sensitivity analysis regarding the input data.     

Approximation of kernel matrices by circulant matrices and its application in kernel selection methods

This paper focuses on developing fast numerical algorithms for selection of a kernel optimal for a given training data set. The optimal kernel is obtained by minimizing a cost functional over a prescribed set of kernels. The cost functional is defined in terms of a positive semi-definite matrix determined completely by a given kernel and the given sampled input data. Fast computational algorithms are developed by approximating the positive semi-definite matrix by a related circulant matrix so that the fast Fourier transform can apply to achieve a linear or quasi-linear computational complexity for finding the optimal kernel. We establish convergence of the approximation method. Numerical examples are presented to demonstrate the approximation accuracy and computational efficiency of the proposed methods.     

Optimal design of double layer scallop domes using genetic algorithm

An efficient methodology is proposed for optimal design of large-scale domes with various topologies and dimensions in plan. The major concern with the optimal design of large domes is the difficulties arising from plurality of design variables, i.e., size and shape variables. This complexity has propounded the optimal design problem of large scale domes as a great challenge over the years. Thus, in current study, extending the novel idea of using parametric mathematical functions, design variables are correlated to the geometrical properties of domes through a new point of view. Additionally, a modified sizing approach is taken up while treating with element sections. In this way, the number of design variables is decreased. Consequently, fewer numbers of these variables provides an impressive condition that considerably takes down the computational efforts needed to explore the design space for finding the solution of optimization problem. Optimization task is performed by the robust technique of genetic algorithm. The presented approach is applicable to a wide variety of enormous domes with outsized number of nodes and members. However, to show applicability as well as computational advantages of the presented algorithm, a numerical example of scallop domes is investigated.