DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8664
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGrover, Jyotsana-
dc.date.accessioned2023-01-23T10:13:14Z-
dc.date.available2023-01-23T10:13:14Z-
dc.date.issued2018-03-
dc.identifier.urihttps://link.springer.com/article/10.1007/s10489-018-1154-x-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8664-
dc.description.abstractThis paper proposes a new evolutionary learning method without any algorithmic-specific parameters for solving optimization problems. The proposed method gets inspired from the information set concept that seeks to represent the uncertainty in an effort using an entropy function. This method termed as Human Effort For Achieving Goals (HEFAG) comprises two phases: Emulation and boosting phases. In the Emulation phase the outcome of the best achiever is emulated by each contender. The effort associated with the average outcome and best outcome are converted into information values based on the information set. In the Boosting phase the efforts of all contenders are boosted by adding the differential information values of any two randomly chosen contenders. The proposed method is tested on benchmark standard functions and it is found to outperform some well-known evolutionary methods based on the statistical analysis of the experimental results using the Kruskal-Wallis statistical test and Wilcoxon rank sum test.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectComputer Scienceen_US
dc.subjectHuman Effort For Achieving Goals (HEFAG)en_US
dc.subjectTeacher-Learner based Optimization (TLBO)en_US
dc.subjectBacterial Foraging Optimization (BFO)en_US
dc.titleNew evolutionary optimization method based on information setsen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.