发布求助
文献互助 智能选刊 最新文献

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)最新文献

筛选
英文 中文
Incorporating a Genetic Algorithm to improve the performance of Variable Neighborhood Search 结合遗传算法提高变邻域搜索性能
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402253
N. MohammadR.Raeesi, Ziad Kobti
{"title":"Incorporating a Genetic Algorithm to improve the performance of Variable Neighborhood Search","authors":"N. MohammadR.Raeesi, Ziad Kobti","doi":"10.1109/NaBIC.2012.6402253","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402253","url":null,"abstract":"Variable Neighborhood Search (VNS) is an efficient metaheuristics in solving optimization problems. Although VNS has been successfully applied on various problem domains, it suffers from its inefficient search exploration. To improve this limitation, VNS can be joined with a population-based search to benefit from its search exploration. In this article, a Memetic Algorithm (MA) is proposed which is based on a Genetic Algorithm (GA) incorporating VNS as a local search method. To evaluate the proposed method, it has been applied on the classical Job Shop Scheduling Problem (JSSP) as a well-known optimization problem. The experimental results show that the proposed MA outperforms the VNS method. Furthermore, compared to the state-of-the-art Evolutionary Algorithms (EAs) proposed to solve JSSP, the proposed method offers competitive solutions.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117864","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}
引用次数: 4
Computational application of semiotic principles in intensive care units 重症监护病房中符号学原理的计算应用
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402237
P. H. Oliveira, Fernando Buarque de Lima-Neto, R. Melo
{"title":"Computational application of semiotic principles in intensive care units","authors":"P. H. Oliveira, Fernando Buarque de Lima-Neto, R. Melo","doi":"10.1109/NaBIC.2012.6402237","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402237","url":null,"abstract":"Intensive care units (ICU's) are places where full-time vigilance is required for patients. Sometimes, the attention and the medical care of the staff are not adequately distributed to all beds. The eventual lack of attention can be due to fatigue, stress, bad judgment and inadequacy of the alerts arriving from multi-parametric monitors. Since the monitors do not analyze the clinical context of the patient and their alarms do not consider the relationships between various parameters, it would be necessary to provide a computational mean able to cross information from the clinical history of the patients and the monitored vital signs, to help providing good therapeutic. To address this issue, a computational interface semiotic-based was implemented to construct knowledge from the patient records. After, it uses the constructed knowledge to try predicting clinical events. The results show that the interface was capable to identify relationships between parameters and clinical events.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355603","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}
引用次数: 0
Nature optimization applied to design a type-2 fuzzy controller for an autonomous mobile robot 应用自然优化方法设计自主移动机器人的二类模糊控制器
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402264
Leslie Astudillo, P. Melin, O. Castillo
{"title":"Nature optimization applied to design a type-2 fuzzy controller for an autonomous mobile robot","authors":"Leslie Astudillo, P. Melin, O. Castillo","doi":"10.1109/NaBIC.2012.6402264","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402264","url":null,"abstract":"In this paper, we apply an optimization method inspired on the chemical reactions to find the gain constants involved in the tracking controller for the dynamic model of an unicycle mobile robot. This tracking controller integrates a kinematic and a torque controller based on fuzzy logic theory. The search of these constants was made previously using genetic algorithms. The objective of this paper is to introduce the new optimization algorithm based on the chemical paradigm and compare it with the results obtained by previous optimization techniques.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872361","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}
引用次数: 11
Diffusion of innovation in organizations: Simulation using evolutionary computation 组织中创新的扩散:使用进化计算的模拟
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402235
L. Sampaio, J. Varajão, E. Pires, Paulo Moura Oliveira
{"title":"Diffusion of innovation in organizations: Simulation using evolutionary computation","authors":"L. Sampaio, J. Varajão, E. Pires, Paulo Moura Oliveira","doi":"10.1109/NaBIC.2012.6402235","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402235","url":null,"abstract":"Diffusion of innovation is a research topic which has been subject to several works in the last years. The diffusion of innovation theory aims to explain how new ideas and practices are disseminated between the members of a social system. A significant part of the existing models are based on the use of parameters which determine the process of innovation adoption, and rely on simple mathematical functions centered in the observation and description of diffusion patterns. This models enable a more explicit diffusion process study, but its use involves the estimation of diffusion coefficients, usually obtained from historical data or chronological series. This raises some problems, for instance when there is no data or it is insufficient. This paper proposes the use of evolutionary computation is an alternative approach for the simulation of innovation diffusion within organizations, in order to overcome some of the problems inherent to the existing models.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129249637","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}
引用次数: 2
A vertical transfer algorithm for the School Bus Routing Problem 校车路线问题的垂直转移算法
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402241
O. Díaz-Parra, J. Ruiz-Vanoye, M. Arias, F. Cocón
{"title":"A vertical transfer algorithm for the School Bus Routing Problem","authors":"O. Díaz-Parra, J. Ruiz-Vanoye, M. Arias, F. Cocón","doi":"10.1109/NaBIC.2012.6402241","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402241","url":null,"abstract":"In this paper is a solution to the School Bus Routing Problem by the application of a bio-inspired algorithm in the vertical transfer of genetic material to offspring or the inheritance of genes by subsequent generations. The vertical transfer algorithm or Genetic algorithm uses the clusterization population pre-selection operator, tournament selection, crossover-k operator and an intelligent mutation operator called mutation-S. The use of the bio-inspired algorithm to solve SBRP instances show good results about Total Bus Travel Distance and the Number of Buses with the Routes.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131583153","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}
引用次数: 23
Degree-constrained minimum spanning tree problem using genetic algorithm 基于遗传算法的度约束最小生成树问题
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402214
Keke Liu, Zhenxiang Chen, A. Abraham, Wenjie Cao, Shan Jing
{"title":"Degree-constrained minimum spanning tree problem using genetic algorithm","authors":"Keke Liu, Zhenxiang Chen, A. Abraham, Wenjie Cao, Shan Jing","doi":"10.1109/NaBIC.2012.6402214","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402214","url":null,"abstract":"Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic. The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem. We measure the multicast capability of each node through the degree-constraint for each node and discuss the problem of multicast in the case of degree-constraint, which has an important significance in the communication network. Limiting the capacity of each node during the replication process of information transmission can improve the speed of the network, which has an important significance in real-time service. In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution. At the same time, we improve the generating random tree and replace the variation by the combination of the two variations. On one hand, we improve the efficiency of generating random tree and on the other hand, we can control the mutation of different variations in a more flexible manner.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860478","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}
引用次数: 8
Optimization of type-2 fuzzy reactive controllers for an autonomous mobile robot 自主移动机器人2型模糊反应控制器的优化
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402263
A. Melendez, O. Castillo
{"title":"Optimization of type-2 fuzzy reactive controllers for an autonomous mobile robot","authors":"A. Melendez, O. Castillo","doi":"10.1109/NaBIC.2012.6402263","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402263","url":null,"abstract":"This paper describes an evolutionary algorithm approach for the optimization of a type-2 fuzzy reactive controller applied to mobile robot navigation. We compare the type-2 fuzzy reactive controller against a type-1, to verify the advantage of type-2 fuzzy logic in control. In this kind of applications.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127380270","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}
引用次数: 19
Parallel particle swarm optimization clustering algorithm based on MapReduce methodology 基于MapReduce方法的并行粒子群优化聚类算法
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402247
Ibrahim Aljarah, Simone A. Ludwig
{"title":"Parallel particle swarm optimization clustering algorithm based on MapReduce methodology","authors":"Ibrahim Aljarah, Simone A. Ludwig","doi":"10.1109/NaBIC.2012.6402247","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402247","url":null,"abstract":"Large scale data sets are difficult to manage. Difficulties include capture, storage, search, analysis, and visualization of large data. In particular, clustering of large scale data has received considerable attention in the last few years and many application areas such as bioinformatics and social networking are in urgent need of scalable approaches. The new techniques need to make use of parallel computing concepts in order to be able to scale with increasing data set sizes. In this paper, we propose a parallel particle swarm optimization clustering (MR-CPSO) algorithm that is based on MapReduce. The experimental results reveal that MR-CPSO scales very well with increasing data set sizes and achieves a very close to the linear speedup while maintaining the clustering quality. The results also demonstrate that the proposed MR-CPSO algorithm can efficiently process large data sets on commodity hardware.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123292609","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}
引用次数: 90
Dendritic lattice associative memories for pattern classification 树突点阵联想记忆模式分类
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402259
G. Urcid, G. Ritter, J. Valdiviezo-N.
{"title":"Dendritic lattice associative memories for pattern classification","authors":"G. Urcid, G. Ritter, J. Valdiviezo-N.","doi":"10.1109/NaBIC.2012.6402259","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402259","url":null,"abstract":"We present a two layer dendritic hetero-associative memory that gives high percentages of correct classification for typical pattern recognition problems. The memory is a feedforward dendritic network based on lattice algebra operations and can be used with multivalued real inputs. A major consequence of this approach shows the inherent capability of prototype-class pattern associations to realize classification tasks in a direct and fast way without any convergence problems.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122453903","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}
引用次数: 3
A comparison of genetic algorithms and genetic programming in solving the school timetabling problem 遗传算法与遗传规划在解决学校课程表问题中的比较
2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402246
Rushil Raghavjee, N. Pillay
{"title":"A comparison of genetic algorithms and genetic programming in solving the school timetabling problem","authors":"Rushil Raghavjee, N. Pillay","doi":"10.1109/NaBIC.2012.6402246","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402246","url":null,"abstract":"In this paper we compare the performance of genetic algorithms and genetic programming in solving a set of hard school timetabling problems. Genetic algorithms search a solution space whereas genetic programming explores a program space. While previous work has examined the use of genetic algorithms in solving the school timetabling problem, there has not been any research on the use of genetic programming for this domain. The GA explores a space of timetables to find an optimal timetable. GP on the other hand searches for an optimal program which when executed will produce a solution. Each program is comprised of operators for timetable construction. The GA and GP were tested on the Abramson set of school timetabling problems. Genetic programming proved to be more effective than genetic algorithms in solving this set of problems. Furthermore, the results produced by both the GA and GP were found to be comparative to methods applied to the same set of problems.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127808997","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}
引用次数: 22
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信