Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids

Detalhes bibliográficos
Autor(a) principal: Sousa, Tiago
Data de Publicação: 2016
Outros Autores: Morais, Hugo, Castro, Rui, Vale, Zita
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/9394
Resumo: Over the last years, an increasing number of distributed resources have been connected to the powersystem due to the ambitious environmental targets, which resulted into a more complex operation ofthe power system. In the future, an even larger number of resources is expected to be coupled which willturn the day-ahead optimal resource scheduling problem into an even more difficult optimization prob-lem. Under these circumstances, metaheuristics can be used to address this optimization problem. Anadequate algorithm for generating a good initial solution can improve the metaheuristic’s performanceof finding a final solution near to the optimal than using a random initial solution. This paper proposestwo initial solution algorithms to be used by a metaheuristic technique (simulated annealing). Thesealgorithms are tested and evaluated with other published algorithms that obtain initial solution. Theproposed algorithms have been developed as modules to be more flexible their use by other metaheuris-tics than just simulated annealing. The simulated annealing with different initial solution algorithms hasbeen tested in a 37-bus distribution network with distributed resources, especially electric vehicles. Theproposed algorithms proved to present results very close to the optimal with a small difference between0.1%. A deterministic technique is used as comparison and it took around 26 h to obtain the optimal one.On the other hand, the simulated annealing was able of obtaining results around 1 min.
id RCAP_77735166fe7e114b1f6d94c94bf34984
oai_identifier_str oai:recipp.ipp.pt:10400.22/9394
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 Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart gridsElectric vehiclesHybrid metaheuristicOptimal power schedulingSimulated annealingVirtual power playerOver the last years, an increasing number of distributed resources have been connected to the powersystem due to the ambitious environmental targets, which resulted into a more complex operation ofthe power system. In the future, an even larger number of resources is expected to be coupled which willturn the day-ahead optimal resource scheduling problem into an even more difficult optimization prob-lem. Under these circumstances, metaheuristics can be used to address this optimization problem. Anadequate algorithm for generating a good initial solution can improve the metaheuristic’s performanceof finding a final solution near to the optimal than using a random initial solution. This paper proposestwo initial solution algorithms to be used by a metaheuristic technique (simulated annealing). Thesealgorithms are tested and evaluated with other published algorithms that obtain initial solution. Theproposed algorithms have been developed as modules to be more flexible their use by other metaheuris-tics than just simulated annealing. The simulated annealing with different initial solution algorithms hasbeen tested in a 37-bus distribution network with distributed resources, especially electric vehicles. Theproposed algorithms proved to present results very close to the optimal with a small difference between0.1%. A deterministic technique is used as comparison and it took around 26 h to obtain the optimal one.On the other hand, the simulated annealing was able of obtaining results around 1 min.ElsevierRepositório Científico do Instituto Politécnico do PortoSousa, TiagoMorais, HugoCastro, RuiVale, Zita20162117-01-01T00:00:00Z2016-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/9394eng10.1016/j.asoc.2016.07.028metadata only accessinfo: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:44Zoai:recipp.ipp.pt:10400.22/9394Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:29:59.302908Repositó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 Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
title Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
spellingShingle Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
Sousa, Tiago
Electric vehicles
Hybrid metaheuristic
Optimal power scheduling
Simulated annealing
Virtual power player
title_short Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
title_full Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
title_fullStr Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
title_full_unstemmed Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
title_sort Evaluation of different initial solution algorithms to be used in theheuristics optimization to solve the energy resource scheduling insmart grids
author Sousa, Tiago
author_facet Sousa, Tiago
Morais, Hugo
Castro, Rui
Vale, Zita
author_role author
author2 Morais, Hugo
Castro, Rui
Vale, Zita
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 Sousa, Tiago
Morais, Hugo
Castro, Rui
Vale, Zita
dc.subject.por.fl_str_mv Electric vehicles
Hybrid metaheuristic
Optimal power scheduling
Simulated annealing
Virtual power player
topic Electric vehicles
Hybrid metaheuristic
Optimal power scheduling
Simulated annealing
Virtual power player
description Over the last years, an increasing number of distributed resources have been connected to the powersystem due to the ambitious environmental targets, which resulted into a more complex operation ofthe power system. In the future, an even larger number of resources is expected to be coupled which willturn the day-ahead optimal resource scheduling problem into an even more difficult optimization prob-lem. Under these circumstances, metaheuristics can be used to address this optimization problem. Anadequate algorithm for generating a good initial solution can improve the metaheuristic’s performanceof finding a final solution near to the optimal than using a random initial solution. This paper proposestwo initial solution algorithms to be used by a metaheuristic technique (simulated annealing). Thesealgorithms are tested and evaluated with other published algorithms that obtain initial solution. Theproposed algorithms have been developed as modules to be more flexible their use by other metaheuris-tics than just simulated annealing. The simulated annealing with different initial solution algorithms hasbeen tested in a 37-bus distribution network with distributed resources, especially electric vehicles. Theproposed algorithms proved to present results very close to the optimal with a small difference between0.1%. A deterministic technique is used as comparison and it took around 26 h to obtain the optimal one.On the other hand, the simulated annealing was able of obtaining results around 1 min.
publishDate 2016
dc.date.none.fl_str_mv 2016
2016-01-01T00:00:00Z
2117-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/9394
url http://hdl.handle.net/10400.22/9394
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1016/j.asoc.2016.07.028
dc.rights.driver.fl_str_mv metadata only access
info:eu-repo/semantics/openAccess
rights_invalid_str_mv metadata only access
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_ 1799131395828744192