基于智能混合策略的测试集优化

利用基于粒子群和蚁群算法的智能混合优化策略,删除冗余测试向量以解决测试集的优化问题. 利用蚁群算法的并行搜索能力构造初始解集,通过粒子群优化算法将解集维数降低,确定每次迭代的个体最优解和全局最优解,并利用新粒子信息更新信息素,最终通过多次迭代找到一个或多个最优测试集. 通过多组数据实例分析可知: 该智能混合优化策略与蚁群算法等其他测试集优化算法相比,可得到多个可行性最优测试集;与蚁群算法相比可提高收敛速度,并降低蚁群算法参数选取对收敛结果的影响,从而避免次优解的出现.     

用于约束多目标优化问题的改进蚁群遗传算法

针对多目标蚁群遗传算法(MOAGA)解集边界分布不均的问题,提出改进算法,解决连续空间中带约束条件多目标优化问题.改进算法在基本MOAGA算法的基础上,在选择中引入一定比例的边界决策、单目标最优决策,并提高边界决策的交叉率.实验证明,改进算法解决了基本算法解集分布边界疏中间密的问题,并且能更快的获得散布性较好的Pareto最优解集.     

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

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

基于MOABCO的多目标测试用例优先级排序

为了提高回归测试的效率,提出了一种基于多目标人工蜂群优化(Multi-Objective Artificial Bee Colony Optimization, MOABCO)算法的多目标测试用例优先级排序(Multi-Objective Test Case Prioritization, MOTCP)方法.针对标准多目标人工蜂群(Multi-Objective Artificial Bee Colony, MOABC)算法容易陷入局部最优解的问题,将差分变异策略融入到新蜜源更新阶段,且基于信息熵改进新蜜源选择方法,以避免算法陷入局部最优并增强了全局搜索能力;然后,将代码覆盖率和测试用例有效执行时间作为优化目标,并用MOABCO算法求Pareto最优解集,以解决MOTCP问题.实验结果表明, MOABCO算法求得的Pareto最优解集在逼近性和分布均匀性上均优于MOABC算法;在解决MOTCP问题上,相对于NSGA-II算法具有更高的收敛速度和更高的缺陷检测率.     

基于遗传蚁群算法的测试用例集约简

为提高软件测试效率,节省回归测试成本,本文提出了一种新的约简测试用例集的算法.该算法是遗传算法和蚁群算法两种算法的结合,首先利用遗传算法的快速随机全局搜索能力,生成蚁群算法的初始信息素,然后利用蚁群算法的正反馈性,快速得到约简测试用例集的近似最优解.最后通过仿真实验验证了该算法的有效性.     

基于细菌觅食和蚁群算法的工艺路线优化

针对工艺路线规划中满足多重约束的最优方案选择问题,提出一种细菌觅食和蚁群优化（bacteria foraging ant colony optimization,BFACO）算法。首先,将工艺路线规划转化为对加工元顺序的优化问题,构造满足多种工艺准则的加工元拓扑优先顺序图,并构建了在缩短加工周期、提高加工质量和降低加工成本目标下的最低加工资源更换成本的目标函数;其次,设计加工元序列与加工资源两个搜索阶段的蚁群搜索,拓扑优先顺序图可弥补加工元序列搜索阶段信息素匮乏的缺点,而在加工资源搜索阶段引入细菌觅食优化算法的复制与趋向操作,可使加工元在多个可选加工资源的情况下获得加工资源更换成本最低的加工序列;最后,基于细菌觅食与蚁群算法的融合优化,完成多个加工元序列的信息素积累并输出最优解,解决蚁群算法局部收敛且计算速度慢的问题。将BFACO算法应用于实例并与其他优化算法的优化结果进行对比,结果显示BFACO算法在工艺路线优化方面较其他优化算法具有较高的计算效率,验证了BFACO算法的可行性与有效性。研究表明,BFACO算法可有效应用于同时考虑工艺约束与加工资源更换成本的工艺规划,为实际生产提供高效且灵活的工艺路线的优化选择。     

均分点蚁群算法在群集机器人任务规划中的应用与研究

提出了一种求解群集机器人协作任务规划问题的均分点蚁群算法(EDPACA).通过多组蚂蚁群相互协作搜索,构架了一种新蚁群算法的解结构,并设计了更合理的评估函数,使其在评价时充分考虑均衡任务点探测,最后利用2-opt技术解决了各子周游路径的交叉问题,获得了总代价最优的解.该算法将蚁群技术首次应用于集群机器人的任务调度规划中,成功解决了中大规模任务规划问题.仿真实验结果表明,均分点蚁群算法能提高群集机器人执行任务的效率,同时也是解决多旅行商问题的另种新思路.     

交叉变异的连续蚁群优化算法

研究了应用于连续空间优化问题的蚁群算法,给出了信息素的留存方式以及搜索策略.另外,针对蚁群算法易陷入局部最优的缺点,在最优蚂蚁周围进行了精细搜索,并加入了自适应的交叉变异算子,从而改进了蚁群算法的全局优化性能.数值仿真结果表明,该算法是一种有效的优化算法.     

动力吸振器的多目标优化和多属性决策研究

在结构振动控制中,为了最大限度发挥吸振器的耗能减振作用.需要寻找吸振器的最优参数,即最优频率比、最优阻尼比和最优质量比,使得结构在不同的频率激励下获得最好的减振效果.本文将基于进化算法的多目标优化技术与多属性决策方法联合运用,针对主系统存在阻尼的减振系统,研究了动力吸振器的优化和决策同题.对于多目标优化问题,采用改进的非支配解排序的多目标进化算法(NSGA Ⅱ),求出Pareto最优解,由这些Pareto最优解构成决策矩阵,使用客观赋权的信息熵方法对最优解的属性进行权值计算.然后用逼近理想解的排序方法(TOPSIS)进行多属性决策(MADM)研究,对Pareto最优解给出排序.文中给出了4个设计参数、3个目标函数的动力吸振器优化设计算例.     

改进蚁群算法设计拉式膜片弹簧

 通过对拉式膜片弹簧载荷-变形特性的综合分析,考虑各种约束条件,提出了一种新的多目标优化设计数学模型．该模型以在摩擦片磨损极限范围内,弹簧压紧力变化的平均值最小及驾驶员作用在分离轴承装置上的分离操纵力的平均值最小为共同优化目标,使离合器后备系数稳定,离合器分离力的平均作用力较小．蚁群算法是一种新型的元启发式优化算法,该算法具有较强的发现较好解的能力,但同时也存在一些缺点,如容易出现停滞现象、收敛速度慢等．将遗传算法和蚁群算法结合起来,在蚁群算法的每一次迭代中,首先根据信息量选择解分量的初值,然后使用变异操作来确定解的值．最后,通过实例与其他优化方法的结果进行比较．结果表明,该算法有较好的收敛速度及稳定性．     

A multi-objective approach for multi-material topology and shape optimization

An automated multi-material approach that integrates multi-objective Topology Optimization (TO) and multi-objective shape optimization is presented. A new ant colony optimization algorithm is presented and applied to solving the TO problem, estimating a trade-off set of initial topologies or distributions of material. The solutions found usually present irregular boundaries, which are not desirable in applications. Thus, shape parameterization of the internal boundaries of the design region, and subsequent shape optimization, is performed to improve the quality of the estimated Pareto-optimal solutions. The selection of solutions for shape optimization is done by using the PROMETHEE II decision-making method. The parameterization process involves identifying the boundaries of different materials and describing these boundaries by non-uniform rational B-spline curves. The proposed approach is applied to the optimization of a C-core magnetic actuator, with two objectives: the maximization of the attractive force on the armature and the minimization of the volume of permanent magnet material.     

Displacement back analysis for underground engineering based on immunized continuous ant colony optimization

The objective function of displacement back analysis for rock parameters in underground engineering is a very complicated nonlinear multiple hump function. The global optimization method can solve this problem very well. However, many numerical simulations must be performed during the optimization process, which is very time consuming. Therefore, it is important to improve the computational efficiency of optimization back analysis. To improve optimization back analysis, a new global optimization, immunized continuous ant colony optimization, is proposed. This is an improved continuous ant colony optimization using the basic principles of an artificial immune system and evolutionary algorithm. Based on this new global optimization, a new displacement optimization back analysis for rock parameters is proposed. The computational performance of the new back analysis is verified through a numerical example and a real engineering example. The results show that this new method can be used to obtain suitable parameters of rock mass with higher accuracy and less effort than previous methods. Moreover, the new back analysis is very robust.     

基于自适应蚁群优化的Volterra核辨识算法研究

提出了一种基于自适应蚁群优化(AACO)的Volterra核辨识方法。该方法将蚁群算法应用于Volterra时域核的辨识,并能够随着进化次数的增加,自适应调整基本蚁群算法的参数。同时,与相应的基于蚁群优化(ACO)的Volterra核辨识方法进行了对比分析。仿真结果表明,本文提出的方法与蚁群优化辨识方法不论在无噪声环境下,还是在有噪声干扰下,都能得到很好的辨识精度、收敛稳定性和较强的鲁棒抗噪性能,然而,在收敛速度方面,本文提出的方法优于蚁群优化辨识方法。     

飞机总体设计中的一种多目标鲁棒优化方法

 提出一种基于灵敏度的多目标鲁棒优化方法。针对各维设计变量存在扰动的情况,在原约束多目标优化模型上,附加偏差目标函数,并采用最差估计法对约束条件进行鲁棒可行性调整。采用全局敏度方程方法来计算目标函数和约束函数对设计变量的敏度,进而采用Pareto遗传算法搜索约束多目标优化问题的非劣解集,设计者可以根据不同的设计准则从中选择合适的设计点。将上述方法用于飞机总体参数优化设计,并与采用常规优化方法所得的优化结果进行了分析和比较。     

Conceptual design optimization of rectilinear building frames: A knapsack problem approach

This article presents an automated technique for preliminary layout (conceptual design) optimization of rectilinear, orthogonal building frames in which the shape of the building plan, the number of bays and the size of unsupported spans are variables. It adopts the knapsack problem as the applied combinatorial optimization problem, and describes how the conceptual design optimization problem can be generally modelled as the unbounded multi-constraint multiple knapsack problem. It discusses some special cases, which can be modelled more efficiently as the single knapsack problem, the multiple-choice knapsack problem or the multiple knapsack problem. A knapsack contains sub-rectangles that define the floor plan and the location of columns. Particular conditions or preferences for the conceptual design can be incorporated as constraints on the knapsacks and/or sub-rectangles. A bi-objective knapsack problem is defined with the aim of obtaining a conceptual design having minimum cost and maximum plan regularity (minimum structural eccentricity). A multi-objective ant colony algorithm is formulated to solve the combinatorial optimization problem. A numerical example is included to demonstrate the application of the present method and the robustness of the algorithm.     

Multi-objective optimization of combined Brayton and inverse Brayton cycles using advanced optimization algorithms

This study explores the use of teaching-learning-based optimization (TLBO) and artificial bee colony (ABC) algorithms for determining the optimum operating conditions of combined Brayton and inverse Brayton cycles. Maximization of thermal efficiency and specific work of the system are considered as the objective functions and are treated simultaneously for multi-objective optimization. Upper cycle pressure ratio and bottom cycle expansion pressure of the system are considered as design variables for the multi-objective optimization. An application example is presented to demonstrate the effectiveness and accuracy of the proposed algorithms. The results of optimization using the proposed algorithms are validated by comparing with those obtained by using the genetic algorithm (GA) and particle swarm optimization (PSO) on the same example. Improvement in the results is obtained by the proposed algorithms. The results of effect of variation of the algorithm parameters on the convergence and fitness values of the objective functions are reported.     

Multi-objective optimization of engineering systems using game theory and particle swarm optimization

This study proposes particle swarm optimization (PSO) based algorithms to solve multi-objective engineering optimization problems involving continuous, discrete and/or mixed design variables. The original PSO algorithm is modified to include dynamic maximum velocity function and bounce method to enhance the computational efficiency and solution accuracy. The algorithm uses a closest discrete approach (CDA) to solve optimization problems with discrete design variables. A modified game theory (MGT) approach, coupled with the modified PSO, is used to solve multi-objective optimization problems. A dynamic penalty function is used to handle constraints in the optimization problem. The methodologies proposed are illustrated by several engineering applications and the results obtained are compared with those reported in the literature.     

霍夫变换耦合蚁群优化图像边缘提取算法

目的为解决图像边缘提取方法中由于噪声浸染导致边缘定位精确度降低、边缘信息丢失和虚假边缘等不足,提出基于霍夫变换(HT)耦合蚁群优化(ACO)图像边缘的提取方法。方法对输入图像进行霍夫变换,消除噪声和线段间隔对图像边缘的影响;计算图像像素梯度和像素圆形邻域统计均值的差值,构建二者之间的权重函数,并作为蚁群的信息素和启发信息;利用蚁群优化算法,引导蚁群搜索图像边缘,完成图像边缘提取。结果实验表明,与当前边缘提取技术相比,文中算法具有更高的提取精度与效率,可获取完整、细节丰富的边缘,有效地降低了噪声影响。结论所提算法具有较强的抗噪性能,能进一步改善边缘提取精度,能够较好地用于包装条码识别与图像处理领域。