A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads

Detalhes bibliográficos
Autor(a) principal: Soares, João
Data de Publicação: 2015
Outros Autores: Ghazvini, Mohammad Ali Fotouhi, Vale, Zita, Oliveira, P.B. de Moura
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10400.22/9392
Resumo: In this paper, a multi-objective framework is proposed for the daily operation of a Smart Grid (SG) with high penetration of sensitive loads. The Virtual Power Player (VPP) manages the day-ahead energy resource scheduling in the smart grid, considering the intensive use of Distributed Generation (DG) and Vehicle-To-Grid (V2G), while maintaining a highly reliable power for the sensitive loads. This work considers high penetration of sensitive loads, i.e. loads such as some industrial processes that require high power quality, high reliability and few interruptions. The weighted-sum approach is used with the distributed and parallel computing techniques to efficiently solve the multi-objective problem. A two-stage optimization method is proposed using a Particle Swarm Optimization (PSO) and a determin-istic technique based on Mixed-Integer Linear Programming (MILP). A realistic mathematical formulation considering the electric network constraints for the day-ahead scheduling model is described. The execu-tion time of the large-scale problem can be reduced by using a parallel and distributed computing plat-form. A Pareto front algorithm is applied to determine the set of non-dominated solutions. The maximization of the minimum available reserve is incorporated in the mathematical formulation in addi-tion to the cost minimization, to take into account the reliability requirements of sensitive and vulnerable loads. A case study with a 180-bus distribution network and a fleet of 1000 gridable Electric Vehicles (EVs) is used to illustrate the performance of the proposed method. The execution time to solve the opti-mization problem is reduced by using distributed computing.
id RCAP_61fb0af18e48447279d1f9cc8895e479
oai_identifier_str oai:recipp.ipp.pt:10400.22/9392
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loadsElectric vehiclesMulti-objective optimizationParallel computingPareto frontParticle swarm optimizationSmart gridIn this paper, a multi-objective framework is proposed for the daily operation of a Smart Grid (SG) with high penetration of sensitive loads. The Virtual Power Player (VPP) manages the day-ahead energy resource scheduling in the smart grid, considering the intensive use of Distributed Generation (DG) and Vehicle-To-Grid (V2G), while maintaining a highly reliable power for the sensitive loads. This work considers high penetration of sensitive loads, i.e. loads such as some industrial processes that require high power quality, high reliability and few interruptions. The weighted-sum approach is used with the distributed and parallel computing techniques to efficiently solve the multi-objective problem. A two-stage optimization method is proposed using a Particle Swarm Optimization (PSO) and a determin-istic technique based on Mixed-Integer Linear Programming (MILP). A realistic mathematical formulation considering the electric network constraints for the day-ahead scheduling model is described. The execu-tion time of the large-scale problem can be reduced by using a parallel and distributed computing plat-form. A Pareto front algorithm is applied to determine the set of non-dominated solutions. The maximization of the minimum available reserve is incorporated in the mathematical formulation in addi-tion to the cost minimization, to take into account the reliability requirements of sensitive and vulnerable loads. A case study with a 180-bus distribution network and a fleet of 1000 gridable Electric Vehicles (EVs) is used to illustrate the performance of the proposed method. The execution time to solve the opti-mization problem is reduced by using distributed computing.ElsevierRepositório Científico do Instituto Politécnico do PortoSoares, JoãoGhazvini, Mohammad Ali FotouhiVale, ZitaOliveira, P.B. de Moura20152015-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/9392eng10.1016/j.apenergy.2015.10.181info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-13T12:50:45Zoai:recipp.ipp.pt:10400.22/9392Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:29:59.409436Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
title A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
spellingShingle A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
Soares, João
Electric vehicles
Multi-objective optimization
Parallel computing
Pareto front
Particle swarm optimization
Smart grid
title_short A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
title_full A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
title_fullStr A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
title_full_unstemmed A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
title_sort A multi-objective model for the day-ahead energy resource scheduling of a smart grid with high penetration of sensitive loads
author Soares, João
author_facet Soares, João
Ghazvini, Mohammad Ali Fotouhi
Vale, Zita
Oliveira, P.B. de Moura
author_role author
author2 Ghazvini, Mohammad Ali Fotouhi
Vale, Zita
Oliveira, P.B. de Moura
author2_role author
author
author
dc.contributor.none.fl_str_mv Repositório Científico do Instituto Politécnico do Porto
dc.contributor.author.fl_str_mv Soares, João
Ghazvini, Mohammad Ali Fotouhi
Vale, Zita
Oliveira, P.B. de Moura
dc.subject.por.fl_str_mv Electric vehicles
Multi-objective optimization
Parallel computing
Pareto front
Particle swarm optimization
Smart grid
topic Electric vehicles
Multi-objective optimization
Parallel computing
Pareto front
Particle swarm optimization
Smart grid
description In this paper, a multi-objective framework is proposed for the daily operation of a Smart Grid (SG) with high penetration of sensitive loads. The Virtual Power Player (VPP) manages the day-ahead energy resource scheduling in the smart grid, considering the intensive use of Distributed Generation (DG) and Vehicle-To-Grid (V2G), while maintaining a highly reliable power for the sensitive loads. This work considers high penetration of sensitive loads, i.e. loads such as some industrial processes that require high power quality, high reliability and few interruptions. The weighted-sum approach is used with the distributed and parallel computing techniques to efficiently solve the multi-objective problem. A two-stage optimization method is proposed using a Particle Swarm Optimization (PSO) and a determin-istic technique based on Mixed-Integer Linear Programming (MILP). A realistic mathematical formulation considering the electric network constraints for the day-ahead scheduling model is described. The execu-tion time of the large-scale problem can be reduced by using a parallel and distributed computing plat-form. A Pareto front algorithm is applied to determine the set of non-dominated solutions. The maximization of the minimum available reserve is incorporated in the mathematical formulation in addi-tion to the cost minimization, to take into account the reliability requirements of sensitive and vulnerable loads. A case study with a 180-bus distribution network and a fleet of 1000 gridable Electric Vehicles (EVs) is used to illustrate the performance of the proposed method. The execution time to solve the opti-mization problem is reduced by using distributed computing.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.22/9392
url http://hdl.handle.net/10400.22/9392
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1016/j.apenergy.2015.10.181
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799131395832938496