嵌入单纯形法的混合类电磁机制算法

针对类电磁机制算法存在局部搜索能力差的问题,提出一种基于单纯形法的混合类电磁机制算法。该混合算法首先利用反向学习策略构造初始种群以保证粒子均匀分布在搜索空间中。利用单纯形法对最优粒子进行局部搜索,增强了算法在最优点附近的局部搜索能力,以加快算法的收敛速度。四个基准测试函数的仿真实验结果表明,该算法具有更好的寻优性能。     

Comparison of nine meta-heuristic algorithms for optimal design of truss structures with frequency constraints

Structural optimization with frequency constraints is a challenging class of optimization problems characterized by highly non-linear and non-convex search spaces. When using a meta-heuristic algorithm to solve a problem of this kind, exploration/exploitation balance is a key feature to control the performance of the algorithm. An excessively exploitative algorithm might focus on certain areas of the search space ignoring the others. On the other hand, an algorithm that is too explorative overlooks high quality solutions as a result of not performing adequate local search.This paper compares nine multi-agent meta-heuristic algorithms for sizing and layout optimization of truss structures with frequency constraints. The variation of the diversity index during the optimization history is analyzed in order to inspect exploration/exploitation properties of each algorithm. It appears that there is a significant relationship between the algorithm efficiency and the evolution of the diversity index.     

Truss optimization with natural frequency constraints using generalized normal distribution optimization

The newly proposed Generalized Normal Distribution Optimization (GNDO) algorithm is used to design the truss structures with optimal weight. All trusses optimized have frequency constraints, which make them very challenging optimization problems. A large number of locally optimal solutions and non-convexity of search space make them difficult to solve, therefore, they are suitable for testing the performance of optimization algorithm. This work investigates whether the proposed algorithm is capable of coping with such problems. To evaluate the GNDO algorithm, three benchmark truss optimization problems are considered with frequency constraints. Numerical data show GNDO’s reliability, stability, and efficiency for structural optimization problems than other meta-heuristic algorithms. We thoroughly analyse and investigate the performance of GNDO in this engineering area for the first time in the literature.

     

An improved electromagnetism-like mechanism algorithm for constrained optimization

Many problems in scientific research and engineering applications can be decomposed into the constrained optimization problems. Most of them are the nonlinear programming problems which are very hard to be solved by the traditional methods. In this paper, an electromagnetism-like mechanism (EM) algorithm, which is a meta-heuristic algorithm, has been improved for these problems. Firstly, some modifications are made for improving the performance of EM algorithm. The process of calculating the total force is simplified and an improved total force formula is adopted to accelerate the searching for optimal solution. In order to improve the accuracy of EM algorithm, a parameter called as move probability is introduced into the move formula where an elitist strategy is also adopted. And then, to handle the constraints, the feasibility and dominance rules are introduced and the corresponding charge formula is used for biasing feasible solutions over infeasible ones. Finally, 13 classical functions, three engineering design problems and 22 benchmark functions in CEC’06 are tested to illustrate the performance of proposed algorithm. Numerical results show that, compared with other versions of EM algorithm and other state-of-art algorithms, the improved EM algorithm has the advantage of higher accuracy and efficiency for constrained optimization problems.     

A ground-structure-based representation with an element-removal algorithm for truss topology optimization

In this study, a new ground-structure-based representation for truss topology optimization is proposed. The proposed representation employs an algorithm that removes unwanted elements from trusses to obtain the final trusses. These unwanted elements include kinematically unstable elements and useless zero-force elements. Since the element-removal algorithm is used in the translation of representation codes into corresponding trusses, this results in more representation codes in the search space that are mapped into kinematically stable and efficient trusses. Since more representation codes in the search space represent stable and efficient trusses, the strategy increases meaningful competition among representation codes. This remapping strategy alleviates the problem of having large search spaces using ground structures, and encourages faster convergences. To test the effectiveness of the proposed representation, it is used with a simple multi-population particle swarm optimization algorithm to solve several truss topology optimization problems. It is found that the proposed representation can significantly improve the performance of the optimization process.     

Sizing and layout design of truss structures under dynamic and static constraints with an integrated particle swarm optimization algorithm

Natural frequencies offer useful knowledge on the dynamic response of the structures. It is possible to avoid from the destructive effects of dynamic loads on the structures by optimizing layout and size of their subject to constraints on natural frequencies. Since optimization problems including frequency constraints are highly nonlinear, this kind of problems forms a challenging area to test the performance of the different optimization techniques. This study tests the performance of an integrated particle swarm optimization algorithm (iPSO), a new particle swarm optimizer integrated with the improved fly-back mechanism and the weighted particle concept, in four weight minimization of truss structures with sizing and layout variables under multiple frequency constraints. Optimization results demonstrate that the new algorithm is competitive with other state-of-the-art metaheuristic algorithms in dynamic and static structural optimization problems.     

Electromagnetism-like algorithms for optimized tool path planning in 5-axis flank machining

Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality.     

A new experiential learning electromagnetism-like mechanism for numerical optimization

The Electromagnetism-like Mechanism algorithm (EM) is a population-based search algorithm which has shown good achievements in solving various types of complex numerical optimization problems so far. To date, the study on experience-based local search mechanism is relatively limited, and there is no study in the literature to integrate experience-based features into the EM. This work introduces an experience-learning feature into the EM for the first time. A new Experiential Learning Electromagnetism-like Mechanism algorithm (ELEM) is proposed in this paper. The ELEM is integrated with two new components. The first component is the particle memory concept which allows the particles to remember the details of their past search experience. The second component is the experience analysing and decision making mechanisms which enables the particles to adjust the settings for the coming iterations. Combining the advantages of this strong exploitation strategy and the powerful exploration mechanism of the EM, the proposed ELEM strikes a good balance in providing well diversified solutions with high accuracy. The results from extensive numerical experiments carried out using 21 challenging test functions show that ELEM is able to provide very competitive solutions and significantly outperforms other optimization techniques. It can thus be concluded from the results that the proposed ELEM performs well in solving high dimensional numerical optimization problems.     

An efficient memory-based electromagnetism-like mechanism for the redundancy allocation problem

Meta-heuristic algorithms have been successfully applied to solve the redundancy allocation problem in recent years. Among these algorithms, the electromagnetism-like mechanism (EM) is a powerful population-based algorithm designed for continuous decision spaces. This paper presents an efficient memory-based electromagnetism-like mechanism called MBEM to solve the redundancy allocation problem. The proposed algorithm employs a memory matrix in local search to save the features of good solutions and feed it back to the algorithm. This would make the search process more efficient. To verify the good performance of MBEM, various test problems, especially the 33 well-known benchmark instances in the literature, are examined. The experimental results show that not only optimal solutions of all benchmark instances are obtained within a reasonable computer execution time, but also MBEM outperforms EM in terms of the quality of the solutions obtained, even for large-size problems.     

Branch pipe routing based on 3D connection graph and concurrent ant colony optimization algorithm

Pipe routing, in particular branch pipes with multiple terminals, has an important influence on product performance and reliability. This paper develops a new rectilinear branch pipe routing approach for automatic generation of the optimal rectilinear branch pipe routes in constrained spaces. Firstly, this paper presents a new 3D connection graph, which is constructed by extending a new 2D connection graph. The new 2D connection graph is constructed according to five criteria in discrete Manhattan spaces. The 3D connection graph can model the 3D constrained layout space efficiently. The length of pipelines and the number of bends are modeled as the optimal design goal considering the number of branch points and three types of engineering constraints. Three types of engineering constraints are modeled by this 3D graph and potential value. Secondly, a new concurrent Max–Min Ant System optimization algorithm, which adopts concurrent search strategy and dynamic update mechanism, is used to solve Rectilinear Branch Pipe Routing optimization problem. This algorithm can improve the search efficiency in 3D constrained layout space. Numerical comparisons with other current approaches in literatures demonstrate the efficiency and effectiveness of the proposed approach. Finally, a case study of pipe routing for aero-engines is conducted to validate this approach.     

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

Truss shape and sizing optimization under frequency constraints is extremely useful when improving the dynamic performance of structures. However, coupling of two different types of design variables, nodal coordinates and cross-sectional areas, often lead to slow convergence or even divergence. Because shape and sizing variables coupled increase the number of design variables and the changes of shape and sizing variables are of widely different orders of magnitude. Otherwise, multiple frequency constraints often cause difficult dynamic sensitivity analysis. Thus optimal criteria and mathematical programming methods have considerable limitations on solving the problems because of needing complex dynamic sensitivity analysis and being easily trapped into the local optima. Genetic Algorithms (GAs) show great potentials to solve the truss shape and sizing optimization problems. Since GAs adopt global probabilistic population search techniques and require no gradient information. The improved genetic algorithms can effectively increase the solution quality. However, the serial GA is computationally expensive and is limited on gaining higher quality solutions. To solve the truss shape and sizing optimization problems with frequency constraints more effectively and efficiently, a Niche Hybrid Parallel Genetic Algorithm (NHPGA) is proposed to significantly reduce the computational cost and to further improve solution quality. The NHPGA is to blend the advantages of parallel computing, simplex search and genetic algorithm with niche technique. Several typical truss optimization examples demonstrate that NHPGA can significantly reduce computing time and attain higher quality solutions. It also suggests that the NHPGA provide a potential algorithm architecture, which effectively combines the robust and global search characteristics of genetic algorithm, strong exploitation ability of simplex search and computational speedup property of parallel computing.     

一种多目标不等面积设施布局问题的启发式算法

多目标不等面积设施布局问题（UA-FLP）是将一些不等面积设施放置在车间内进行布局,要求优化多个目标并满足一定的限制条件。以物料搬运成本最小和非物流关系强度最大来建立生产车间的多目标优化模型,并提出一种启发式算法进行求解。算法采用启发式布局更新策略更新构型,通过结合基于自适应步长梯度法的局部搜索机制和启发式设施变形策略来处理设施之间的干涉性约束。为了得到问题的Pareto最优解集,提出了基于Pareto优化的局部搜索和基于小生境技术的全局优化方法。通过两个典型算例对算法性能进行测试,实验结果表明,所提出的启发式算法是求解多目标UA-FLP的有效方法。     

A revised electromagnetism-like mechanism for layout design of reconfigurable manufacturing system

The layout design problem is one of the most important issues for manufacturing system design and control. A revised electromagnetism-like mechanism (REM) is proposed in this paper for the layout design of reconfigurable manufacturing systems utilizing automated guided vehicle. First, the formal model considering both loaded and empty flows is given. Then the REM is developed to solve the proposed model. In the REM, particles are encoded discretely. The charge of a particle is calculated according the total material handling cost of the particle. In the local search procedure, variable neighbourhood search strategy based on Hamming distance is adopted. In the moving procedure, the particles are moved according to the ordering of each element. To verify the effect of the proposed method, several computation cases are carried out. The computation results show that the proposed method is able to get optimal solutions for small scale problems and near optimal solutions within limited computation time for large scale problems. This indicates that the proposed method is effective and efficient.     

基于混合类电磁机制算法的混沌系统控制与同步

混沌系统控制与同步可通过优化方法设计控制律引导混沌系统轨道来实现．类电磁机制优化算法（EM）是模拟电磁场带电粒子间吸引一排斥行为机制的一种启发式搜索方法,目前还尚未在混沌系统控制与同步问题中得到应用．本文提出一种混合类电磁机制优化算法（HEM）用于求解该优化问题,该方法采用修改的类电磁机制算法（REM）与差分进化算法（DE）相融合平衡算法对解空间的全局探索和局部开发能力,基准函数测试表明混合算法改善了全局搜索能力及求解可靠性．在此基础上,采用HEM算法引导混沌系统的轨道,搜索施加于系统的小扰动使其轨迹在短时间内跟踪到目标区域;再将混沌系统的同步问题转化为在线轨道导引问题,采用HEM优化算法解决．通过典型离散Henon映射为例,数值仿真结果表明了该方法是解决混沌系统控制与同步的一种有效方法．     

Modified symbiotic organisms search for structural optimization

The structural dynamic response predominantly depends upon natural frequencies which fabricate these as a controlling parameter for dynamic response of the truss. However, truss optimization problems subjected to multiple fundamental frequency constraints with shape and size variables are more arduous due to its characteristics like non-convexity, non-linearity, and implicit with respect to design variables. In addition, mass minimization with frequency constraints are conflicting in nature which intricate optimization problem. Using meta-heuristic for such kind of problem requires harmony between exploration and exploitation to regulate the performance of the algorithm. This paper proposes a modification of a nature inspired Symbiotic Organisms Search (SOS) algorithm called a Modified SOS (MSOS) algorithm to enhance its efficacy of accuracy in search (exploitation) together with exploration by introducing an adaptive benefit factor and modified parasitism vector. These modifications improved search efficiency of the algorithm with a good balance between exploration and exploitation, which has been partially investigated so far. The feasibility and effectiveness of proposed algorithm is studied with six truss design problems. The results of benchmark planar/space trusses are compared with other meta-heuristics. Complementarily the feasibility and effectiveness of the proposed algorithms are investigated by three unimodal functions, thirteen multimodal functions, and six hybrid functions of the CEC2014 test suit. The experimental results show that MSOS is more reliable and efficient as compared to the basis SOS algorithm and other state-of-the-art algorithms. Moreover, the MSOS algorithm provides competitive results compared to the existing meta-heuristics in the literature.

     

船舶三维管路智能布局优化算法

针对船舶在三维环境下管路布局约束多，工程规则难以量化，难以确定合适的优化评价函数等问题，提出一种新的船舶管路自动布局方法。首先，采用轴平行包围盒法（AABB）对船体和船内设备进行简化，将其离散成空间节点并赋予初始信息素和能量值，对空间障碍物进行标记，并对主要的敷管规则给出了具体的量化形式；其次，将快速扩展随机树（RRT）算法和蚁群优化（ACO）算法进行结合，引入方向选择策略、避障策略和变步长策略，提升了算法搜索效率和成功率，通过建立优化评价函数，利用ACO对路径进行循环迭代优化，以期得到满足工程规则的综合最优解；最后，采用计算机模拟的船舱空间布局环境进行管路自动敷设仿真实验，验证了所提方法的有效性和实用性。     

A new energy landscape paving heuristic for satellite module layouts

This article describes a study of the satellite module layout problem (SMLP), which is a three-dimensional (3D) layout optimization problem with performance constraints that has proved to be non-deterministic polynomial-time hard (NP-hard). To deal with this problem, we convert it into an unconstrained optimization problem using a quasi-physical strategy and the penalty function method. The energy landscape paving (ELP) method is a class of Monte-Carlo-based global optimization algorithm that has been successfully applied to solve many optimization problems. ELP can search for low-energy layouts via a random walk in complex energy landscapes. However, when ELP falls into the narrow and deep valleys of an energy landscape, it is difficult to escape. By putting forward a new update mechanism of the histogram function in ELP, we obtain an improved ELP method which can overcome this drawback. By incorporating the gradient method with local search into the improved ELP method, a new global search optimization method, nELP, is proposed for SMLP. Two representative instances from the literature are tested. Computational results show that the proposed nELP algorithm is an effective method for solving SMLP with performance constraints.     

Discrete sizing/layout/topology optimization of truss structures with an advanced Jaya algorithm

Discrete optimization of truss structures is a hard computing problem with many local minima. Metaheuristic algorithms are naturally suited for discrete optimization problems as they do not require gradient information. A recently developed method called Jaya algorithm (JA) has proven itself very efficient in continuous engineering problems. Remarkably, JA has a very simple formulation and does not utilize algorithm-specific parameters. This study presents a novel JA formulation for discrete optimization of truss structures under stress and displacement constraints. The new algorithm, denoted as discrete advanced JA (DAJA), implements efficient search mechanisms for generating new trial designs including discrete sizing, layout and topology optimization variables. Besides the JA’s basic concept of moving towards the best design of the population and moving away from the worst design, DAJA tries to form a set of descent directions in the neighborhood of each candidate designs thus generating high quality trial designs that are very likely to improve current population. Results collected in seven benchmark problems clearly demonstrate the superiority of DAJA over other state-of-the-art metaheuristic algorithms and multi-stage continuous–discrete optimization formulations.     

Optimal design of truss structures for size and shape with frequency constraints using a collaborative optimization strategy

A new metaheuristic strategy is proposed for size and shape optimization problems with frequency constraints. These optimization problems are considered to be highly non-linear and non-convex. The proposed strategy extends the idea of using a single optimization process to a series of collaborative optimization processes. In this study, a modified teaching-learning-based optimization (TLBO), which is a relatively simple algorithm with no intrinsic parameters controlling its performance, is utilized in a collaborative framework and introduced as a higher-level TLBO algorithm called school-based optimization (SBO). SBO considers a school with multiple independent classrooms and multiple teachers with inter-classroom collaboration where teachers are reassigned to classrooms based on their fitness. SBO significantly improves the both exploration and exploitation capabilities of TLBO without increasing the algorithm's complexity. In addition, since the SBO algorithm uses multiple independent classrooms with interchanging teachers, the algorithm is less likely to be influenced by local optima. A parametric study is conducted to investigate the effects of the number of classes and the class size, which are the only parameters of SBO. The SBO algorithm is applied to five benchmark truss optimization problems with frequency constraints and the statistical results are compared to other optimization techniques in the literature. The quality and robustness of the results indicate the efficiency of the proposed SBO algorithm.     

带静不平衡约束的矩形装填问题的启发式算法

卫星舱布局问题不仅是一个复杂的耦合系统设计问题,也是一个特殊的优化问题,具有NP难度性。解决这类问题最大的挑战在于需要优化的目标函数具有大量的被高能势垒分隔开的局部极小值点。Wang-Landau（WL）抽样算法是一种改进的蒙特卡罗方法,已经被成功地运用蛋白质结构预测等优化问题。本文以卫星舱布局优化问题为背景,首次将WL抽样算法引入矩形装填问题的求解。针对矩形装填物的特点,提出了启发式格局更新策略,以引导抽样算法在解空间中进行有效行走。为了加速搜索全局最优解,每次蒙特卡罗扫描生成新的布局时,便执行梯度法进行局部搜索。通过将局部搜索机制、启发式格局更新策略与WL抽样算法相结合,提出了一种用于解决带静不平衡约束的任意矩形装填问题的启发式布局算法。在布局优化过程中,通过在挤压弹性势能的基础上增加静不平衡量惩罚项并采用质心平移的方法,使布局系统的静不平衡量达到约束要求。另外,为了改进算法的搜索效率,提出了改进的有限圆族法用于装填物之间的干涉性判断和干涉量计算。通过对文献中两组共10个有代表性的算例进行实算,计算结果表明,所提出的装填算法是一种求解带静不平衡性能约束的任意矩形装填问题的有效算法。