DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/9889
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMishra, Puneet-
dc.date.accessioned2023-03-22T05:55:14Z-
dc.date.available2023-03-22T05:55:14Z-
dc.date.issued2016-
dc.identifier.urihttps://ieeexplore.ieee.org/document/7724277-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9889-
dc.description.abstractFlower Pollination Algorithm (FPA) is one of the latest evolutionary algorithms (EAs) inspired by the natural process of pollination of flowers. This Paper addresses the development of FPA toolkit in LabVIEW™, a versatile platform provided by National Instruments for test, measurement and control applications. It may be noted that LabVIEW™ has provided only one EA based optimization technique which is Differential Evolution (DE) algorithm named as Global Optimization.vi in its standard package. Since, several new and efficient techniques are available for optimization there is always a need to implement the best optimization technique in LabVIEW™ environment for the benefit of measurement and control engineers. The developed FPA toolkit has been tested on several benchmark test functions and its comparison is also carried out with the standard DE toolkit. Based on the investigations, it has been inferred that FPA toolkit results are better than DE toolkit in terms of convergence rate particularly for higher dimensional optimization problems.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectEvolutionary Algorithmsen_US
dc.subjectFlower Pollination Algorithmen_US
dc.subjectMeta-heuristicen_US
dc.subjectOptimizationen_US
dc.subjectVirtual Instrumentsen_US
dc.titleDevelopment of a Flower Pollination Algorithm toolkit in LabVIEW™en_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

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.