Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1840
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJoshi Manohar
dc.date.accessioned2022-05-24T04:21:01Z-
dc.date.available2022-05-24T04:21:01Z-
dc.date.issued2020
dc.identifier.citationInternational Journal of Advanced Science and Technology
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1840-
dc.description.abstractTo model a most cost effective and reliable power system, the committing of generating units with least cost is done through proper selection of heuristic/meta-heuristic optimisation. For security constrained unit commitment (SCUC) problem, here the solution is formulated by defining both equality and inequality constraints of the considered system (minimum up- down times, power balance, spinning reserve etc.). In this paper, the solution is subjected to generate an optimal solution using Hybridised- BAT search algorithms for 10- unit systems. The reduced optimal cost values are compared with reviewed heuristic techniques using MATLAB platform, to assure the proposed technique’s effectiveness
dc.format.extent29
dc.language.isoen
dc.publisherScience and Engineering Research Support Society
dc.titleA Comparative and Novel Solution for Unit Commitment Problem Using Hybridised BAT Search Approach for 10-Unit System
dc.typeArticle
Appears in Collections:Electrical and electronics Department

Files in This Item:
File SizeFormat 
EEE-04.docx16.22 kBMicrosoft Word XMLView/Open


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