首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper suggests novel hybrid learning algorithm with stable learning laws for adaptive network based fuzzy inference system (ANFIS) as a system identifier and studies the stability of this algorithm. The new hybrid learning algorithm is based on particle swarm optimization (PSO) for training the antecedent part and gradient descent (GD) for training the conclusion part. Lyapunov stability theory is used to study the stability of the proposed algorithm. This paper, studies the stability of PSO as an optimizer in training the identifier, for the first time. Stable learning algorithms for the antecedent and consequent parts of fuzzy rules are proposed. Some constraints are obtained and simulation results are given to validate the results. It is shown that instability will not occur for the leaning rate and PSO factors in the presence of constraints. The learning rate can be calculated on-line and will provide an adaptive learning rate for the ANFIS structure. This new learning scheme employs adaptive learning rate that is determined by input–output data.  相似文献   

2.
In supply chain management (SCM), multi-product and multi-period models are usually used to select the suppliers. In the real world of SCM, however, there are normally several echelons which need to be integrated into inventory management. This paper presents a hybrid intelligent algorithm, based on the push SCM, which uses a fuzzy neural network and a genetic algorithm to forecast the rate of demand, determine the material planning and select the optimal supplier. We test the proposed algorithm in a case study conducted in Iran.  相似文献   

3.
In this study, we propose an Adaptive and Hybrid Artificial Bee Colony (aABC) algorithm to train ANFIS. Unlike the standard ABC algorithm, two new parameters are utilized in the solution search equation. These are arithmetic crossover rate and adaptivity coefficient. aABC algorithm gains the rapid convergence feature with the usage of arithmetic crossover and it is applied on two different problem groups and its performance is measured. Firstly, it is performed over 10 numerical ‘benchmark functions’. The results show that aABC algorithm is more efficient than standard ABC algorithm. Secondly, ANFIS is trained by using aABC algorithm to identify the nonlinear dynamic systems. Each application begins with the randomly selected initial population and then average RMSE is obtained. For four examples considered in ANFIS training, train error values are respectively computed as 0.0344, 0.0232, 0.0152 and 0.0205. Also, test error values for these examples are respectively found as 0.0255, 0.0202, 0.0146 and 0.0295. Although it varies according to the examples, performance increase between 4.51% and 33.33% occurs. Additionally, it is seen that aABC algorithm converges bettter than ABC algorithm in the all examples. The obtained results are compared with the neuro-fuzzy based approaches which are commonly used in the literature and it is seen that the proposed ABC variant can be efficiently used for ANFIS training.  相似文献   

4.
王磊  贾砚池 《计算机应用》2014,34(11):3245-3249
针对生物地理优化(BBO)算法探索能力不强、收敛速度慢的缺点,提出一种基于混合二次对立学习的生物地理优化算法--HQBBO。首先,定义一种启发式的混合二次对立点,并从理论上证明其搜索效率优势;然后,提出混合二次对立学习算子,增强算法的全局探索能力,提高收敛速度;此外,还采用搜索域动态缩放策略和精英保留策略进一步提高寻优效率。对8个基准测试函数的仿真实验结果表明,所提算法在寻优精度和收敛速度上优于基本BBO算法和对立BBO算法(OBBO),表明其采用的混合二次对立学习算法对于其高收敛速度和全局探索能力是非常有效的。  相似文献   

5.
Neural Computing and Applications - The aim of this study is to establish a hybrid model for epileptic seizure detection with genetic algorithm (GA) and particle swarm optimization (PSO) to...  相似文献   

6.
In order to model fuzzy decentralized decision-making problem, fuzzy expected value multilevel programming and chance-constrained multilevel programming are introduced. Furthermore, fuzzy simulation, neural network, and genetic algorithm are integrated to produce a hybrid intelligent algorithm for finding the Stackelberg-Nash equilibrium. Finally, two numerical examples are provided to illustrate the effectiveness of the hybrid intelligent algorithm.  相似文献   

7.
Multimedia Tools and Applications - Traditional Chinese Medicine (TCM) illustrates that the physique determines the susceptibility of human to certain diseases and treatment programs for illness....  相似文献   

8.
求解随机机会约束规划的混合智能算法   总被引:4,自引:0,他引:4       下载免费PDF全文
随机机会约束规划是一类有着广泛应用背景的随机规划问题,采用随机仿真产生样本训练BP网络以逼近随机函数,然后在微粒群算法中利用神经网络计算适应值和实现检验解的可行性,从而提出了一种求解随机机会约束规划的混合智能算法。最后通过两个实例的仿真结果说明了算法的正确性和有效性。  相似文献   

9.
The Journal of Supercomputing - Time series prediction is a challenging predictive modeling case. It is essential to have a prediction model that can adapt to dynamic data. Air quality data show a...  相似文献   

10.
Neural Computing and Applications - Atmospheric pressure (AP), which is an indicator of weather events, plays an important role in climatology, agriculture, meteorology, atmospheric and...  相似文献   

11.
A new numerical method, based on hybrid of Block-pulse and Legendre polynomials for numerical evaluation of Hankel transform is proposed in this paper. Hybrid of Block-pulse and Legendre polynomials are used as a basis to expand a part of the integrand, rf(r), appearing in the Hankel transform integral. Thus transforming the integral into a Fourier-Bessel series. Truncating the series, an efficient algorithm is obtained for the numerical evaluations of the Hankel transforms of order ν>−1. The method is quite accurate and stable, as illustrated by given numerical examples with varying degree of random noise terms εθi added to the data function f(r), where θi is a uniform random variable with values in [−1,1]. Finally, an application of the proposed method is given in solving the heat equation in an infinite cylinder with a radiation condition.  相似文献   

12.
为解决差分进化算法后期收敛易陷入局部最优和早熟收敛的问题,提出一种群体智能优化算法,即协同智能的蝙蝠差分混合算法。利用蝙蝠个体脉冲回声定位的特点,与差分种群相互协作,在当前最优解gbest附近进行一次详细搜索,有效增加种群的多样性,跳出局部最优。通过蝙蝠种群和差分种群两个种群的相互协作,较好平衡全局搜索和局部开发之间的能力。为验证算法有效性,选用9个常用的基准测试函数和5个0-1背包问题,与标准粒子群算法、带高斯扰动的粒子群算法、蝙蝠算法、差分算法、烟花算法相对比,仿真实验表明,所提算法总体性能优于其它5种算法。  相似文献   

13.
The GSD team-level service climate is one of the key determinants to achieve the outcome of global software development (GSD) projects from the software service outsourcing perspective. The main aim of this study is to evaluate the GSD team-level service climate and GSD project outcome relationship based on adaptive neuro-fuzzy inference system (ANFIS) with the genetic learning algorithm. For measuring the team-level service climate, the Hybrid Taguchi-Genetic Learning Algorithm (HTGLA) is adopted in the ANFIS, which is more appropriate to determine the optimal premise and consequent constructs by reducing the root-mean-square-error (RMSE) of service climate criteria. For measuring the GSD team-level service climate, synthesizing the literature reviews and consistent with the earlier studies on IT service climate which is classified into three main criterion: managerial practices (deliver quality of service), global service climate (measure overall perceptions), service leadership (goal setting, work planning, and coordination) which comprises 25 GSD team-level service climate attributes. The experimental results show that the optimal prediction error is obtained by the HTGLA-based ANFIS approach is 3.26%, which outperforms the earlier result that is the optimal prediction errors 4.41% and 5.75% determined, respectively, by ANFIS and statistical methods.  相似文献   

14.
Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In the present work, the process planning is divided into preliminary planning, and secondary/detailed planning. In the preliminary stage, based on the analysis of order and clustering constraints as a compulsive constraint aggregation in operation sequencing and using an intelligent searching strategy, the feasible sequences are generated. Then, in the detailed planning stage, using the genetic algorithm which prunes the initial feasible sequences, the optimized operation sequence and the optimized selection of the machine, cutting tool and TAD for each operation based on optimization constraints as an additive constraint aggregation are obtained. The main contribution of this work is the optimization of sequence of the operations of the part, and optimization of machine selection, cutting tool and TAD for each operation using the intelligent search and genetic algorithm simultaneously.  相似文献   

15.
In this paper, we designed novel methods for Neural Network (NN) and Radial Basis function Neural Networks (RBFNN) training using Shuffled Frog-Leaping Algorithm (SFLA). This paper basically deals with the problem of multi-processor scheduling in a grid environment. We, in this paper, introduce three novel approaches for the task scheduling problem using a recently proposed Shuffled Frog-Leaping Algorithm (SFLA). In a first attempt, the scheduling problem is structured as a problem of optimization and solved by SFLA. Next, this paper makes use of SFLA trained Artificial Neural Network (ANN) and Radial Basis function Neural Networks (RBFNN) for the problem of task scheduling. Interestingly, the proposed methods yield better performance than contemporary algorithms as evidenced by simulation results.  相似文献   

16.
Multimedia Tools and Applications - In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is the use of threshold selection,...  相似文献   

17.
Hou  Quanhua  Zhang  Xuan  Li  Bo  Zhang  Xiaoqing  Wang  Wenhui 《Neural computing & applications》2019,31(9):4703-4713
Neural Computing and Applications - In the future, big data will become an efficient and useful means for improving urban planning, and machine learning can take city as a simplified and efficient...  相似文献   

18.
In certain classification problems, input patterns are not distributed in a clustering manner but distributed uniformly in an input space and there exist certain critical hyperplanes called decision boundaries. Since learning vector quantization (LVQ) classifies an input vector based on the nearest neighbor, the codebook vectors away from the decision boundaries are redundant. This paper presents an alternative algorithm called boundary search algorithm (BSA) for the purpose of solving this redundancy problem. The BSA finds a fixed number of codebook vectors near decision boundaries by selecting appropriate training vectors. It is found to be more efficient compared with LVQ and its validity is demonstrated with satisfaction in the transient stability analysis of a power system.  相似文献   

19.
International Journal of Information Security - The intrusion detection system (IDS) plays an important role in extracting and analysing the network traffics to detect aberrant activity. However,...  相似文献   

20.
Knowledge and Information Systems - Decomposition hybrid structure learning algorithms (DHSLAs), which combine the idea of divide and conquer with hybrid algorithms to reduce the computational...  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号