Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/11641
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jhankal, Nitin Kuma | |
dc.contributor.author | Adhyaru, D. M. | |
dc.date.accessioned | 2023-04-20T11:06:31Z | - |
dc.date.available | 2023-04-20T11:06:31Z | - |
dc.date.issued | 2011-12-08 | |
dc.identifier.citation | 2nd International Conference on Current Trends in Technology, NUiCONE-2011, Institute of Technology, Nirma University, December 8-10, 2011 | en_US |
dc.identifier.isbn | 9788192304908 | |
dc.identifier.uri | http://10.1.7.181:1900/jspui/123456789/3081 | |
dc.identifier.uri | http://10.1.7.192:80/jspui/handle/123456789/11641 | - |
dc.description.abstract | Bacterial foraging optimization algorithm (BFOA) has been widely accepted as a global optimization algorithm of current interest for optimization and control. BFOA is inspired by the social foraging behaviour of Escherichia coli. BFOA has already drawn the attention of researchers because of its efficiency in solving real-world optimization problems arising in several application domains. In present paper, a detailed explanation of this algorithm is given. Comparative analysis of BFOA with Genetic Algorithm (GA) is presented. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | ITFIC002-11 | en_US |
dc.subject | BFOA | en_US |
dc.subject | Genetic Algorithm (GA) | en_US |
dc.subject | IC Faculty Paper | en_US |
dc.subject | Faculty Paper | en_US |
dc.subject | ITFIC002 | en_US |
dc.subject | 10MICC08 | en_US |
dc.subject | NUiCONE | en_US |
dc.subject | NUiCONE-2011 | en_US |
dc.title | Bacterial Foraging Optimization Algorithm: A Derivative Free Technique | en_US |
dc.type | Faculty Papers | en_US |
Appears in Collections: | Faculty Papers, E&I |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ITFIC002-11.pdf | ITFIC002-11 | 744.01 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.