• English
    • español
  • español 
    • English
    • español
  • Login
Ver ítem 
  •   DSpace Principal
  • 2.- Investigación
  • Artículos
  • Ver ítem
  •   DSpace Principal
  • 2.- Investigación
  • Artículos
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

What metaheuristic solves the economic dispatch faster? A comparative case study

Thumbnail
Ver/
IIT-18-125A.pdf (707.4Kb)
IIT-18-125A_preview (2.760Kb)
IIT-18-125A_preview.pdf (2.760Kb)
Fecha
2018-12-01
Autor
Abdi, Hamdi
Fattahi, Hamid
Lumbreras Sancho, Sara
Estado
info:eu-repo/semantics/publishedVersion
Metadatos
Mostrar el registro completo del ítem
Mostrar METS del ítem
Ver registro en CKH

Refworks Export

Resumen
The 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.
 
The 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.
 
URI
https://doi.org/10.1007/s00202-018-0750-4
What metaheuristic solves the economic dispatch faster? A comparative case study
Tipo de Actividad
Artículos en revistas
ISSN
0948-7921
Materias/ categorías / ODS
Instituto de Investigación Tecnológica (IIT)
Palabras Clave
Economic dispatch; Heuristic algorithms; Evolutionary computation; Genetic algorithms; Particle swarm optimization
Economic dispatch; Heuristic algorithms; Evolutionary computation; Genetic algorithms; Particle swarm optimization
Colecciones
  • Artículos

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contacto | Sugerencias
 

 

Búsqueda semántica (CKH Explorer)


Listar

Todo DSpaceComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosMateriasPor DirectorPor tipoEsta colecciónPor fecha de publicaciónAutoresTítulosMateriasPor DirectorPor tipo

Mi cuenta

AccederRegistro

Repositorio de la Universidad Pontificia Comillas copyright © 2015  Desarrollado con DSpace Software
Contacto | Sugerencias