Int. J. Artif. Intell. Soft Comput.最新文献_第4页

Power law-based local search in artificial bee colony 基于幂律的人工蜂群局部搜索

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062814

Harish Sharma, Jagdish Chand Bansal, K. V. Arya

{"title":"Power law-based local search in artificial bee colony","authors":"Harish Sharma, Jagdish Chand Bansal, K. V. Arya","doi":"10.1504/IJAISC.2014.062814","DOIUrl":"https://doi.org/10.1504/IJAISC.2014.062814","url":null,"abstract":"Artificial bee colony ABC optimisation algorithm is relatively a simple and recent population-based probabilistic approach for global optimisation. ABC has been outperformed over some nature inspired algorithms NIAs when tested over benchmark as well as real world optimisation problems. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the solution search equation of ABC, there is an enough chance to skip the true solution due to large step sizes. In order to balance the diversity and convergence capability of the ABC, in this paper, a power law-based local search strategy is proposed and integrated with ABC. The proposed strategy is named as power law-based local search in ABC PLABC. In the PLABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Further, to improve the exploration capability, numbers of scout bees are increased. The experiments on 24 test problems of different complexities show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest guided ABC GABC, best-so-far ABC BSFABC and modified ABC in most of the experiments.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121086933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Implementing a neuro fuzzy expert system for optimising the performance of chemical recovery boiler 应用神经模糊专家系统对化工回收锅炉进行性能优化

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062822

S. Anand, T. Raman, S. Subramanian

{"title":"Implementing a neuro fuzzy expert system for optimising the performance of chemical recovery boiler","authors":"S. Anand, T. Raman, S. Subramanian","doi":"10.1504/IJAISC.2014.062822","DOIUrl":"https://doi.org/10.1504/IJAISC.2014.062822","url":null,"abstract":"In chemical recovery boilers of paper mills, main steam outlet temperature control cannot be solved by straight forward automation control. As prior knowledge of the mechanism to maximise steam generation without affecting steam main temperature is unknown, a backpropogation supervisory neural network has been designed which exhibits a good degree of reinforcement learning. Various parameters considered encompassing concentration, composition and firing load of black liquor solids may not have ideal fixed values. Hence, a type 2 fuzzy logic model has been designed which in turn monitors the parameters and predicts the results. Errors are fed back iteratively through the backpropogation network, until the network learns the model. Fuzzy C-means clustering technique has been used to find coherent clusters. Then sensitivity analysis has been done to identify the parameters playing a significant role in obtaining the results. As it can be observed that the behaviour is stochastic, particle swarm optimisation has been implemented to optimise the combined effect of all parameters. Through this tool connecting steam attemperation control and smart soot blowing, clean heating surface is ensured resulting in enhanced green energy output and availability.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123343221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

A nature inspired adaptive inertia weight in particle swarm optimisation 粒子群优化中自然启发的自适应惯性权重

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062816

Madhuri Arya, Kusum Deep, Jagdish Chand Bansal

引用次数: 5

Channel allocation scheme for cellular networks using evolutionary computing 基于进化计算的蜂窝网络信道分配方案

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062827

Narendran Rajagopalan, C. Mala

引用次数: 1

Fixed structure constrained preview control design using enhanced PSO approach 基于改进粒子群算法的固定结构约束预览控制设计

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062828

N. Birla, A. Swarup

引用次数: 0

Effect of stop word removal on the performance of naïve Bayesian methods for text classification in the Kannada language 停止词去除对naïve贝叶斯方法在卡纳达语文本分类性能的影响

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062824

R. Jayashree, K. S. Murthy, B. Anami

引用次数: 2

Efficiency determination of induction motor and its sensitivity analysis towards parameter variation 感应电动机效率确定及其对参数变化的敏感性分析

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-06-01 DOI: 10.1504/IJAISC.2014.062826

S. Chandrakanth, T. Chelliah, S. P. Srivastava

引用次数: 3

Extraction process optimisation using particle swarm algorithm 基于粒子群算法的提取过程优化

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-02-01 DOI: 10.1504/IJAISC.2014.059282

Madhuri Arya, Kusum Deep

引用次数: 0

Analysing mutation schemes for real-parameter genetic algorithms 分析实参数遗传算法的突变方案

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-02-01 DOI: 10.1504/IJAISC.2014.059280

K. Deb, Debayan Deb

{"title":"Analysing mutation schemes for real-parameter genetic algorithms","authors":"K. Deb, Debayan Deb","doi":"10.1504/IJAISC.2014.059280","DOIUrl":"https://doi.org/10.1504/IJAISC.2014.059280","url":null,"abstract":"Mutation is an important operator in genetic algorithms GAs, as it ensures maintenance of diversity in evolving populations of GAs. Real-parameter GAs RGAs handle real-valued variables directly without going to a binary string representation of variables. Although RGAs were first suggested in early '90s, the mutation operator is still implemented variable-wise - in a manner that is independent to each variable. In this paper, we investigate the effect of five different mutation schemes for RGAs using two different mutation operators - polynomial and Gaussian mutation operators. Based on extensive simulation studies, it is observed that a mutation clock implementation is computationally quick and also efficient in finding a solution close to the optimum on four different problems used in this study for both mutation operators. Moreover, parametric studies with their associated parameters reveal suitable working ranges of the parameters. Interestingly, both mutation operators with their respective optimal parameter settings are found to possess a similar inherent probability of offspring creation, a matter that is believed to be the reason for their superior working. This study signifies that the long suggested mutation clock operator should be considered as a valuable mutation operator for RGAs.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125534283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 221

Euler-based new solution method for fuzzy initial value problems 基于欧拉的模糊初值问题求解新方法

Int. J. Artif. Intell. Soft Comput. Pub Date : 2014-02-01 DOI: 10.1504/IJAISC.2014.059288

S. Tapaswini, S. Chakraverty

引用次数: 34