Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem

This article uses a hybrid optimization approach to solve the discrete facility layout problem (FLP), modelled as a quadratic assignment problem (QAP). The idea of this approach design is inspired by the ant colony meta-heuristic optimization method, combined with the extended great deluge (EGD) local search technique. Comparative computational experiments are carried out on benchmarks taken from the QAP-library and from real life problems. The performance of the proposed algorithm is compared to construction and improvement heuristics such as H63, HC63-66, CRAFT and Bubble Search, as well as other existing meta-heuristics developed in the literature based on simulated annealing (SA), tabu search and genetic algorithms (GAs). This algorithm is compared also to other ant colony implementations for QAP. The experimental results show that the proposed ant colony optimization/extended great deluge (ACO/EGD) performs significantly better than the existing construction and improvement algorithms. The experimental results indicate also that the ACO/EGD heuristic methodology offers advantages over other algorithms based on meta-heuristics in terms of solution quality.     

Truss optimization on shape and sizing with frequency constraints based on genetic algorithm

Truss optimization on shape and sizing with frequency constraints are highly nonlinear dynamic optimization problems. Coupling of two different types of design variables, nodal coordinates and cross-sectional areas, often lead to divergence while multiple frequency constraints often cause difficult dynamic sensitivity analysis. So optimal criteria method and mathematical programming, which need complex dynamic sensitivity and are easily trapped into the local optima, are difficult to solve the problems. To solve the truss shape and sizing optimization simply and effectively, a Niche Hybrid Genetic Algorithm (NHGA) is proposed. The objective of NHGA is to enhance the exploitation capacities while preventing the premature convergence simultaneously based on the new hybrid architecture. Niche techniques and adaptive parameter adjustment are used to maintain population diversity for preventing the premature convergence while simplex search is used to enhance the local search capacities of GAs. The proposed algorithm effectively alleviates premature convergence and improves weak exploitation capacities of GAs. Several typical truss optimization examples are employed to demonstrate the validity, availability and reliability of NHGA for solving shape and sizing optimization of trusses with multiple frequency constraints.     

蚁群算法在复杂系统可靠性优化中的应用

复杂系统可靠性优化问题为典型的NP-难问题.不考虑系统的具体连接形式,将每个部件视为一级,产生随机数作为网络节点, 把蚁群优化算法成功应用到复杂系统可靠性优化中,搜索到其他算法未能得到的最优解.仿真结果表明,蚁群优化算法可以在相对短的时间内较快地找到问题的最优解.蚁群优化算法与其他元启发式算法一样,可以有效克服求解组合优化的计算复杂度问题.     

A two-step optimization approach for technology selection

An efficient optimization approach for the technology selection problem is described. Technology selection is a crucial step in the aircraft design process, especially when the performance and econo-mic requirements are not fulfilled for any combination of the configuration design variables. In such a case, the designer must search efficiently within a set of technology options for the optimal combination that achieves the required improvements. When the set of available technologies is large, as is usually the case, a difficult combinatorial optimization problem ensues, resulting in significant time and computational expense. The objective of the new approach is to reduce the computational cost of technology selection by decomposing the process into two smaller sub-problems. The new approach attempts to exploit the structure of the technology compatibility matrix to improve the efficiency of the technology selection process. Results from an application problem are presented and valuable insights and observations are discussed.     

Value-at-Risk optimization using the difference of convex algorithm

Value-at-Risk (VaR) is an integral part of contemporary financial regulations. Therefore, the measurement of VaR and the design of VaR optimal portfolios are highly relevant problems for financial institutions. This paper treats a VaR constrained Markowitz style portfolio selection problem when the distribution of returns of the considered assets are given in the form of finitely many scenarios. The problem is a non-convex stochastic optimization problem and can be reformulated as a difference of convex (D.C.) program. We apply the difference of convex algorithm (DCA) to solve the problem. Numerical results comparing the solutions found by the DCA to the respective global optima for relatively small problems as well as numerical studies for large real-life problems are discussed.     

Sequential algorithms for structural design optimization under tolerance conditions

A deterministic optimization usually ignores the effects of uncertainties in design variables or design parameters on the constraints. In practical applications, it is required that the optimum solution can endure some tolerance so that the constraints are still satisfied when the solution undergoes variations within the tolerance range. An optimization problem under tolerance conditions is formulated in this article. It is a kind of robust design and a special case of a generalized semi-infinite programming (GSIP) problem. To overcome the deficiency of directly solving the double loop optimization, two sequential algorithms are then proposed for obtaining the solution, i.e. the double loop optimization is solved by a sequence of cycles. In each cycle a deterministic optimization and a worst case analysis are performed in succession. In sequential algorithm 1 (SA1), a shifting factor is introduced to adjust the feasible region in the next cycle, while in sequential algorithm 2 (SA2), the shifting factor is replaced by a shifting vector. Several examples are presented to demonstrate the efficiency of the proposed methods. An optimal design result based on the presented method can endure certain variation of design variables without violating the constraints. For GSIP, it is shown that SA1 can obtain a solution with equivalent accuracy and efficiency to a local reduction method (LRM). Nevertheless, the LRM is not applicable to the tolerance design problem studied in this article.     

Genetic algorithms for the optimization of piecewise linear discriminants

The application of genetic algorithms (GAs) to the optimization of piecewise linear discriminants is described. Piecewise linear discriminant analysis (PLDA) is a supervised pattern recognition technique employed in this work for the automated classification of Fourier transform infrared (FTIR) remote sensing data. PLDA employs multiple linear discriminants to approximate a nonlinear separating surface between data categories defined in a vector space. The key to the successful implementation of PLDA is the positioning of the individual discriminants that comprise the piecewise linear discriminant. For the remote sensing application, the discriminant optimization is challenging due to the large number of input variables required and the corresponding tendency for local optima to occur on the response surface of the optimization. In this work, three implementations of GAs are configured and evaluated: a binary-coded GA (GAB), a real-coded GA (GAR), and a Simplex-GA hybrid (SGA). GA configurations are developed by use of experimental design studies, and piecewise linear discriminants for acetone, methanol, and sulfur hexafluoride are optimized (trained). The training and prediction classification results indicate that GAs area viable approach for discriminant optimization. On average, the best piecewise linear discriminant optimized by a GA is observed to classify 11% more analyte-active patterns correctly in prediction than an unoptimized piecewise linear discriminant. Discriminant optimization problems not used in the experimental design study are employed to test the stability of the GA configurations. For these cases, the best piecewise linear discriminant optimized by SGA is shown to classify 19% more analyte-active patterns correctly in prediction than an unoptimized discriminant. These results also demonstrate that the two real number coded GAs (GAR and SGA) perform better than the GAB. Real number coded GAs are also observed to execute faster and are simpler to implement.     

Lightweight design of bus frames from multi-material topology optimization to cross-sectional size optimization

A comprehensive solution for bus frame design is proposed to bridge multi-material topology optimization and cross-sectional size optimization. Three types of variables (material, topology and size) and two types of constraints (static stiffness and frequencies) are considered to promote this practical design. For multi-material topology optimization, an ordered solid isotropic material with penalization interpolation is used to transform the multi-material selection problem into a pure topology optimization problem, without introducing new design variables. Then, based on the previously optimal topology result, cross-sectional sizes of the bus frame are optimized to further seek the least mass. Sequential linear programming is preferred to solve the two structural optimization problems. Finally, an engineering example verifies the effectiveness of the presented method, which bridges the gap between topology optimization and size optimization, and achieves a more lightweight bus frame than traditional single-material topology optimization.     

Comparison between hybridized algorithm of GA–SA and ABC,GA, DE and PSO for vertical-handover in heterogeneous wireless networks

Genetic algorithms (GAs) and simulated annealing (SA) have emerged as leading methods for search and optimization problems in heterogeneous wireless networks. In this paradigm, various access technologies need to be interconnected; thus, vertical handovers are necessary for seamless mobility. In this paper, the hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithms that avoid slow and massive computations. This was to, specifically, solve two major problems in GA optimization, i.e. premature convergence and slow convergence rate, and the facilitation of simulated annealing in the merging populations phase of the search. The hybrid algorithm was expected to improve on the pure GA in two ways, i.e., improved solutions for a given number of evaluations, and more stability over many runs. This paper compares the formulation and results of four recent optimization algorithms: artificial bee colony (ABC), genetic algorithm (GA), differential evolution (DE), and particle swarm optimization (PSO). Moreover, a cost function is used to sustain the desired QoS during the transition between networks, which is measured in terms of the bandwidth, BER, ABR, SNR, and monetary cost. Simulation results indicated that choosing the SA rules would minimize the cost function and the GA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.     

脉冲暂态混沌神经网络在约束非线性规划中的应用

脉冲暂态混沌神经网络（PTCNN）是对暂态混沌神经网络的改进，呈现丰富的动力学性质，具有很强的跳出局部最小点的功能，在解决无约束非线性规划问题时，可以找到包括全局和局部最小值的尽量全面的最优解。当遇到带约束条件的非线性规划问题时，只有对约束条件进行合理处理，才能更有效地解决约束非线性规划问题。文章使用惩罚函数方法对含有约束条件的非线性规划问题进行处理，将其变成一个不含约束条件的非线性规划问题，进而用PTCNN求解，得到了令人满意的结果。     

An algorithm for optimization of non-linear shell structures

An algorithm for optimal design of non-linear shell structures is presented. The algorithm uses numerical optimization techniques and nonlinear finite element analysis to find a minimum weight structure subject to equilibrium conditions, stability constraints and displacement constraints. A barrier transformation is used to treat an apparent non-smoothness arising from posing the stability constraints in terms of the eigenvalues of the Hessian of the potential energy of the structure. A sequential quadratic programming strategy is used to solve the resulting non-linear optimization problem. Matrix sparsity in the constraint Jacobian is exploited because of the large number of variables. The usefulness of the proposed algorithm is demonstrated by minimizing the weight of a number of stiffened thin shell structures.     

Biogeography-based particle swarm optimization with fuzzy elitism and its applications to constrained engineering problems

In evolutionary algorithms, elites are crucial to maintain good features in solutions. However, too many elites can make the evolutionary process stagnate and cannot enhance the performance. This article employs particle swarm optimization (PSO) and biogeography-based optimization (BBO) to propose a hybrid algorithm termed biogeography-based particle swarm optimization (BPSO) which could make a large number of elites effective in searching optima. In this algorithm, the whole population is split into several subgroups; BBO is employed to search within each subgroup and PSO for the global search. Since not all the population is used in PSO, this structure overcomes the premature convergence in the original PSO. Time complexity analysis shows that the novel algorithm does not increase the time consumption. Fourteen numerical benchmarks and four engineering problems with constraints are used to test the BPSO. To better deal with constraints, a fuzzy strategy for the number of elites is investigated. The simulation results validate the feasibility and effectiveness of the proposed algorithm.     

Optimal Scheduling of Casting Sequence Using Genetic Algorithms

Scheduling a casting sequence involving a number of orders with different casting weights and satisfying due dates of is an important optimization problem often encountered in foundries. In this article, we attempt to solve this complex, multi-variable, and multi-constraint optimization problem by using different implementations of genetic algorithms (GAs). In comparison with a mixed-integer linear programming solver, GAs with problem-specific operators are found to provide faster (with a subquadratic computational time complexity) and more reliable solutions to very large (more than 1 million integer variables) casting sequence optimization problems. In addition to solving the particular problem, the study demonstrates how problem-specific information can be introduced in a GA for solving complex real-world problems.     

OPTIMAL STRUCTURAL DESIGN BY ANT COLONY OPTIMIZATION

Ant colony optimization (ACO) is a relatively new heuristic combinatorial optimization algorithm in which the search process is a stochastic procedure that incorporates positive feedback of accumulated information. The positive feedback (;i.e., autocatalysis) facility is a feature of ACO which gives an emergent search procedure such that the (common) problem of algorithm termination at local optima may be avoided and search for a global optimum is possible.

The ACO algorithm is motivated by analogy with natural phenomena, in particular, the ability of a colony of ants to ‘optimize’ their collective endeavours. In this paper the biological background for ACO is explained and its computational implementation is presented in a structural design context. The particular implementation of ACO makes use of a tabu search (TS) local improvement phase to give a computationally enhanced algorithm (ACOTS).

In this paper ACOTS is applied to the optimal structural design, in terms of weight minimization, of a 25-bar space truss. The design variables are the cross-sectional areas of the bars, which take discrete values. Numerical investigation of the 25-bar space truss gave the best (i.e., lowest to-date) minimum weight value. This example provides evidence that ACOTS is a useful and technically viable optimization technique for discrete-variable optimal structural design.     

基于ACO的瓦楞纸高浓磨浆过程多目标优化

目的在确保磨浆质量的前提下,提高磨浆产量、降低磨浆能耗,进而提高瓦楞纸的产量,降低生产能耗。方法在分析并建立高浓磨浆过程数学模型的基础上,针对该数学模型多目标、非线性的特点,提出一种采用编程简单、鲁棒性强的ACO(蚁群算法)对该多目标优化问题进行求解的新方法。结果 Matlab仿真结果表明,ACO在求解高浓磨浆过程多目标优化问题时,能够快速地找到符合生产工艺要求的最优解。结论基于ACO的多目标优化不仅提高了瓦楞纸制浆产量,而且降低了生产能耗。同罚函数相比,更好地实现了优质、高产、低能耗的生产目标。     

An enhanced genetic algorithm for structural topology optimization

Genetic algorithms (GAs) have become a popular optimization tool for many areas of research and topology optimization an effective design tool for obtaining efficient and lighter structures. In this paper, a versatile, robust and enhanced GA is proposed for structural topology optimization by using problem‐specific knowledge. The original discrete black‐and‐white (0–1) problem is directly solved by using a bit‐array representation method. To address the related pronounced connectivity issue effectively, the four‐neighbourhood connectivity is used to suppress the occurrence of checkerboard patterns. A simpler version of the perimeter control approach is developed to obtain a well‐posed problem and the total number of hinges of each individual is explicitly penalized to achieve a hinge‐free design. To handle the problem of representation degeneracy effectively, a recessive gene technique is applied to viable topologies while unusable topologies are penalized in a hierarchical manner. An efficient FEM‐based function evaluation method is developed to reduce the computational cost. A dynamic penalty method is presented for the GA to convert the constrained optimization problem into an unconstrained problem without the possible degeneracy. With all these enhancements and appropriate choice of the GA operators, the present GA can achieve significant improvements in evolving into near‐optimum solutions and viable topologies with checkerboard free, mesh independent and hinge‐free characteristics. Numerical results show that the present GA can be more efficient and robust than the conventional GAs in solving the structural topology optimization problems of minimum compliance design, minimum weight design and optimal compliant mechanisms design. It is suggested that the present enhanced GA using problem‐specific knowledge can be a powerful global search tool for structural topology optimization. Copyright © 2005 John Wiley & Sons, Ltd.     

Stochastic programming technique for portfolio optimization with minimax risk and bounded parameters

In this paper a portfolio optimization problem with bounded parameters is proposed taking into consideration the minimax risk measure, in which liquidity of the stocks is allied with selection of the portfolio. Interval uncertainty of the model is dealt with through a fusion between interval and random variable. As a result of this, the interval inequalities are converted to chance constraints. A solution methodology is developed using this concept to obtain an efficient portfolio. The theoretical developments are illustrated on a large data set taken from National Stock Exchange, India.     

A deterministic global approach for mixed-discrete structural optimization

This study proposes a novel approach for finding the exact global optimum of a mixed-discrete structural optimization problem. Although many approaches have been developed to solve the mixed-discrete structural optimization problem, they cannot guarantee finding a global solution or they adopt too many extra binary variables and constraints in reformulating the problem. The proposed deterministic method uses convexification strategies and linearization techniques to convert a structural optimization problem into a convex mixed-integer nonlinear programming problem solvable to obtain a global optimum. To enhance the computational efficiency in treating complicated problems, the range reduction technique is also applied to tighten variable bounds. Several numerical experiments drawn from practical structural design problems are presented to demonstrate the effectiveness of the proposed method.     

Response surface approximations for structural optimization

Response surface methodology can be used to construct global and midrange approximations to functions in structural optimization. Since structural optimization requires expensive function evaluations, it is important to construct accurate function approximations so that rapid convergence may be achieved. In this paper techniques to find the region of interest containing the optimal design, and techniques for finding more accurate approximations are reviewed and investigated. Aspects considered are experimental design techniques, the selection of the ‘best’ regression equation, intermediate response functions and the location and size of the region of interest. Standard examples in structural optimization are used to show that the accuracy is largely dependent on the choice of the approximating function with its associated subregion size, while the selection of a larger number of points is not necessarily cost-effective. In a further attempt to improve efficiency, different regression models were investigated. The results indicate that the use of the two methods investigated does not significantly improve the results. Finding an accurate global approximation is challenging, and sufficient accuracy could only be achieved in the example problems by considering a smaller region of the design space. © 1998 John Wiley & Sons, Ltd.     

Applying tabu search and simulated annealing to the optimal design of sewer networks

Optimizations of sewer network designs create complicated and highly nonlinear problems wherein conventional optimization techniques often get easily bogged down in local optima and cannot successfully address such problems. In the past decades, heuristic algorithms possessing robust and efficient global search capabilities have helped to solve continuous and discrete optimization problems and have demonstrated considerable promise. This study applied tabu search (TS) and simulated annealing (SA) to the optimization of sewer network designs. For a case study, this article used the sewer network design of a central Taiwan township, which contains significantly varied elevations, and the optimal designs from TS and SA were compared with the original official design. The results show that, in contrast with the original design's failure to satisfy the minimum flow-velocity requirements, both TS and SA achieved least-cost solutions that also fulfilled all the constraints of the design criteria. According to the average performance of 200 trials, SA outperformed TS in both robustness and efficiency for solving sewer network optimization problems.