Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9092
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKaur, Arvinder-
dc.contributor.authorKumar, Yugal-
dc.date.accessioned2023-01-11T09:00:04Z-
dc.date.available2023-01-11T09:00:04Z-
dc.date.issued2021-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9092-
dc.description.abstractIn present time, meta-heuristic algorithms have been widely adopted for solving diverse classes of optimization problems. These procedures/algorithms have advantage over classical algorithms due to strong exploration and exploitation capabilities. In recent time, a Bat algorithm is developed on the basis of echolocation characteristics of bat. This algorithm has applicability to solve number of constrained and unconstrained optimization problems. The bat algorithm gives state of art results as compared to same class of metaheuristics. The objective of this paper is to explore bat algorithm in terms of modifications, improvements, search strategies and nature of problems being solved. Hence, this paper presents the mini review on bat algorithm. Further, the applicability of bat algorithm in diverse filed has been discussed.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectBat algorithmen_US
dc.subjectEcholocationen_US
dc.subjectMicrobats and Solutionen_US
dc.titleRecent Developments in Bat Algorithm: A Mini Reviewen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Recent Developments in Bat Algorithm A Mini Review.pdf687.46 kBAdobe PDFView/Open


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