Fuzzy logic in the gravitational search algorithm enhanced using fuzzy logic with dynamic alpha parameter value adaptation for the optimization of modular neural networks in echocardiogram recognition

In this paper the main goal is to find the optimal architecture of modular neural networks, which means finding out the optimal number of modules, layers and nodes of the neural network. The fuzzy gravitational search algorithm with dynamic parameter adaptation is used for optimizing the modular neural network in a particular pattern recognition application. The proposed method is applied to medical images in echocardiogram recognition. One of the most common methods for detection and analysis of diseases in the human body, by physicians and specialists, is the use of medical images. Simulation results of the proposed approach in echocardiogram recognition show the advantages of using the fuzzy gravitational search in the optimization of modular neural networks. In this case the proposed approach provides a very good 99.49% echocardiogram recognition rate.     

Ant colony optimization with dynamic parameter adaptation based on interval type-2 fuzzy logic systems

A dynamic parameter adaptation methodology for Ant Colony Optimization (ACO) based on interval type-2 fuzzy systems is presented in this paper. The idea is to be able to apply this new ACO method with parameter adaptation to a wide variety of problems without the need of finding the best parameters for each particular problem. We developed several fuzzy systems for parameter adaptation and a comparison was made among them to decide on the best design. The use of fuzzy logic is to control the diversity of the solutions, and in this way controlling the exploration and exploitation abilities of ACO. The travelling salesman problem (TSP) and the design of a fuzzy controller for an autonomous mobile robot are the benchmark problems used to test the proposed methodology.     

A case study on using evolutionary algorithms to optimize bakery production planning

The production of bakery goods is strictly time sensitive due to the complex biochemical processes during dough fermentation, which leads to special requirements for production planning and scheduling. Instead of mathematical methods scheduling is often completely based on the practical experience of the responsible employees in bakeries. This sometimes inconsiderate scheduling approach often leads to sub-optimal performance of companies. This paper presents the modeling of the production in bakeries as a kind of no-wait hybrid flow-shop following the definitions in Scheduling Theory, concerning the constraints and frame conditions given by the employed processes properties. Particle Swarm Optimization and Ant Colony Optimization, two widely used evolutionary algorithms for solving scheduling problems, were adapted and used to analyse and optimize the production planning of an example bakery. In combination with the created model both algorithms proved capable to provide optimized results for the scheduling operation within a predefined runtime of 15 min.     

基于动态概率变异的Cauchy粒子群优化

介绍了标准粒子群优化（SPSO）算法,在两种粒子群改进算法Gaussian Swarm和Fuzzy PSO的基础上提出了Cauchy粒子群优化（CPSO）算法,并将遗传算法中的变异操作引入粒子群优化,形成了动态概率变异Cauchy粒子群优化（DMCPSO）算法。用3个基准函数进行实验,结果表明,DMCPSO算法性能优于SPSO和CPSO算法。     

An automated approach for the design of Mechanically Stabilized Earth Walls incorporating metaheuristic optimization algorithms

Considered as cost-efficient, reliable and aesthetic alternatives to the conventional retaining structures, Mechanically Stabilized Earth Walls (MSEWs) have been increasingly used in civil engineering practice over the previous decades. The design of these structures is conventionally based on engineering guidelines, requiring the use of trial and error approaches to determine the design variables. Therefore, the quality and cost effectiveness of the design is limited with the effort, intuition, and experience of the engineer while the process transpires to be time-consuming, both of which can be solved by developing automated approaches. In order to address these issues, the present study introduces a novel framework to optimize the (i) reinforcement type, (ii) length, and (iii) layout of MSEWs for minimum cost, integrating metaheuristic optimization algorithms in compliance with the Federal Highway Administration guidelines. The framework is conjoined with optimization algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), and Differential Evolution (DE) and tested with a set of benchmark design problems that incorporate various types of MSEWs with different heights. The results are comparatively evaluated to assess the most effective optimization algorithm and validated using a well-known MSEW analysis and design software. The outcomes indicate that the proposed framework, implemented with a powerful optimization algorithm, can effectively produce the optimum design in a matter of seconds. In this sense, DE algorithm is proposed based on the improved results over GA, PSO, and ABC.     

利用T-S模糊自适应PSO算法优化PID参数

针对微粒群优化算法存在的早熟问题,提出了一种基于T-S模型的模糊自适应PSO算法（T-SPSO算法）。算法依据种群当前最优性能指标和惯性权重值所制定T-S规则,动态自适应惯性权重取值,改善了PSO算法的收敛性。将该算法应用于PID控制器的参数整定,可得到更优的控制器参数。仿真结果验证了所提出算法的有效性和所设计控制器的优越性。     

基于群智能混合算法的物流配送路径研究

针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了一种双种群蚁群算法,在蚁群的基础上引入差分进化(DE)和粒子群算法(PSO)。通过在PSOAS种群和DEAS种群之间建立一种信息交流机制,使信息能够在两个种群中传递,以免某一方因错误的信息判断而陷入局部最优点。通过matlab仿真实验测试,表明该群智能混合算法可以较好地解决TSP的问题。     

蚁群与粒子群混合算法求解TSP问题

旅行商问题（TSP）是最古老而且研究最广泛的组合优化问题。针对TSP问题,提出一种蚁群与粒子群混合算法（HAPA）。HAPA首先将蚁群划分成多个蚂蚁子群,然后把蚂蚁子群的参数作为粒子,通过粒子群算法来优化蚂蚁子群的参数,并在蚂蚁子群中引入了信息素交换操作。实验结果表明,HAPA在求解TSP问题中比传统算法和同类算法更具优越性。     

一种新型求解多序列比对问题的方法

多序列比对问题是生物信息科学中一个非常重要且具挑战性的课题,并已经被证明属于问题.为了克服以往算法中的求解速度慢的缺点,本文提出了一种基于遗传算法和蚁群算法的算法来求解的新方法,在单独使用遗传算法的基础上再使用蚁群算法来进行局部搜索以便更快速地求得解.实验结果表明,遗传-蚁群算法能有效地求解多序列比对问题.     

遗传算法和蚁群算法在求解TSP问题上的对比分析

遗传算法(Generation Algorithm, GA)和蚁群算法(Ant Colony Optimization, ACO)都是解决组合优化问题的强有力算法。特别是近几年的研究表明,蚁群算法具有极强的鲁棒性和求最优解的能力。本文在分析这两种算法的特点基础上,通过实例验证它们在解决TSP问题上各自的优缺点,并给出做进一步研究的建议。     

A survey: Ant Colony Optimization based recent research and implementation on several engineering domain

Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms.     

A survey of dynamic parameter setting methods for nature-inspired swarm intelligence algorithms

Neural Computing and Applications - Parameter settings for nature-inspired optimization algorithms are essential for their effective performance. Evolutionary algorithms and swarm intelligence...     

A new approach for dynamic fuzzy logic parameter tuning in Ant Colony Optimization and its application in fuzzy control of a mobile robot

Ant Colony Optimization is a population-based meta-heuristic that exploits a form of past performance memory that is inspired by the foraging behavior of real ants. The behavior of the Ant Colony Optimization algorithm is highly dependent on the values defined for its parameters. Adaptation and parameter control are recurring themes in the field of bio-inspired optimization algorithms. The present paper explores a new fuzzy approach for diversity control in Ant Colony Optimization. The main idea is to avoid or slow down full convergence through the dynamic variation of a particular parameter. The performance of different variants of the Ant Colony Optimization algorithm is analyzed to choose one as the basis to the proposed approach. A convergence fuzzy logic controller with the objective of maintaining diversity at some level to avoid premature convergence is created. Encouraging results on several traveling salesman problem instances and its application to the design of fuzzy controllers, in particular the optimization of membership functions for a unicycle mobile robot trajectory control are presented with the proposed method.     

基于粒子群算法的数据库查询优化

查询优化是数据库系统设计和实现所采用的一项重要技术,也是影响数据库系统性能的一个重要因素.本文把一种新的演化计算模型＂粒子群算法＂引入查询优化模型中来,在查询策略的状态空间上构造了粒子群算法的一个原型,利用粒子群算法对连接操作进行优化.     

群智能在知识发现中的实现方法对比研究

群智能方法是新兴的模拟计算技术,在求解复杂的优化问题中表现出良好的性能。对比讨论了群智能的两个重要组成方面（蚁群算法和微粒群算法）在知识发现中的实现方法,阐述了算法的原理和特性,并提出了一些在将来需要解决的问题。     

模糊环境下的差异作业单机批调度优化问题的研究*

针对现实生产制造系统中存在的时间参数模糊化问题,本文用梯形模糊数表征时间参数,给出了一种具有模糊加工时间和模糊批次间隔的、以最小化制造跨度为目标的模糊差异作业单机批调度问题模型。在对模糊差异作业单机批调度问题进行有效求解方面,针对基本粒子群算法容易陷入局部最优的问题,本文给出了一种基于遗传操作的混合粒子群算法,利用遗传算法思想对粒子进行交叉、变异操作,增强了算法跳出局部最优的能力。仿真实验验证了该算法具有可行性和有效性。     

基于粒子群优化算法的模糊聚类分析

提出一种基于模糊C-均值算法和粒子群优化算法的混合聚类算法,该算法利用粒子群优化算法全局寻优的特点,有效地克服了模糊C-均值算法对初始值敏感、易陷入局部最优的缺点.实验表明,该算法具备良好的聚类效果.     

Search based algorithms for test sequence generation in functional testing

ContextThe generation of dynamic test sequences from a formal specification, complementing traditional testing methods in order to find errors in the source code.ObjectiveIn this paper we extend one specific combinatorial test approach, the Classification Tree Method (CTM), with transition information to generate test sequences. Although we use CTM, this extension is also possible for any combinatorial testing method.MethodThe generation of minimal test sequences that fulfill the demanded coverage criteria is an NP-hard problem. Therefore, search-based approaches are required to find such (near) optimal test sequences.ResultsThe experimental analysis compares the search-based technique with a greedy algorithm on a set of 12 hierarchical concurrent models of programs extracted from the literature. Our proposed search-based approaches (GTSG and ACOts) are able to generate test sequences by finding the shortest valid path to achieve full class (state) and transition coverage.ConclusionThe extended classification tree is useful for generating of test sequences. Moreover, the experimental analysis reveals that our search-based approaches are better than the greedy deterministic approach, especially in the most complex instances. All presented algorithms are actually integrated into a professional tool for functional testing.     

基于文化量子粒子群的模糊神经网络参数优化

模糊神经网络参数学习是一个函数优化问题。针对已有优化方法收敛精度不高的缺点,提出基于文化量子粒子群算法的模糊神经网络参数优化,并将其应用于混沌时间序列预测。仿真实例结果证实了该算法的优越性。     

改进蚁群算法在SVM参数优化研究中的应用

支持向量机参数的选择决定着支持向量机的分类精度和泛化能力,而其参数优化缺乏理论指导,在此背景下提出了ACO-SVM模型。该模型将SVM分类预测准确率作为目标函数,对蚁群算法进行改进,引入有向搜索和基于时变函数更新的信息素更新原则,利用蚁群算法的并行性、正反馈机制和较强的鲁棒性,以求得最优目标并得到SVM的最优参数组合。数值实验结果表明,改进蚁群算法在SVM参数优化选取中具有更好的寻优性能,具有较高的分类准确率;该方法具有较好的并行性和较强的全局寻优能力。