Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/11531/33161
Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.authorAbdi, Hamdies-ES
dc.contributor.authorFattahi, Hamides-ES
dc.contributor.authorLumbreras Sancho, Saraes-ES
dc.date.accessioned2018-11-13T04:13:41Z-
dc.date.available2018-11-13T04:13:41Z-
dc.date.issued2018-12-01es_ES
dc.identifier.issn0948-7921es_ES
dc.identifier.urihttps:doi.org10.1007s00202-018-0750-4es_ES
dc.descriptionArtículos en revistases_ES
dc.description.abstractes-ES
dc.description.abstractThe economic dispatch (ED) is one of the most important short-term problems in power systems, and solving it quickly is essential. However, classical optimization tools are often too computationally demanding to be considered satisfactory. This has motivated the application of metaheuristic methods, which offer a good compromise in terms of solution quality and computation time. However, these methods have been applied in an isolated way and on different problem definitions and case studies, so that there were no clear insights on how they compared to each other. This paper fills this gap by performing an objective comparison of six metaheuristics solving the ED in several case studies under different conditions. Although mixed-integer programming performs best for small case studies, our results confirm that metaheuristics are able to efficiently solve the ED problem. Genetic algorithms emerge as the best performers in terms of solution quality and computation time, followed by PSO and TLBO.en-GB
dc.format.mimetypeapplication/pdfes_ES
dc.language.isoen-GBes_ES
dc.rightses_ES
dc.rights.uries_ES
dc.sourceRevista: Electrical Engineering, Periodo: 1, Volumen: online, Número: 4, Página inicial: 2825, Página final: 2837es_ES
dc.subject.otherInstituto de Investigación Tecnológica (IIT)es_ES
dc.titleWhat metaheuristic solves the economic dispatch faster? A comparative case studyes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.description.versioninfo:eu-repo/semantics/publishedVersiones_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccesses_ES
dc.keywordses-ES
dc.keywordsEconomic dispatch; Heuristic algorithms; Evolutionary computation; Genetic algorithms; Particle swarm optimizationen-GB
Aparece en las colecciones: Artículos

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
IIT-18-125A.pdf707,45 kBAdobe PDFVisualizar/Abrir     Request a copy


Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.