Mostrar el registro sencillo del ítem
Cost-driven screening of network constraints for the unit commitment problem
dc.contributor.author | Porras, Álvaro | |
dc.contributor.author | Pineda-Morente, Salvador | |
dc.contributor.author | Morales-González, Juan Miguel | |
dc.contributor.author | Jiménez-Cordero, María Asunción | |
dc.date.accessioned | 2022-04-05T07:41:34Z | |
dc.date.available | 2022-04-05T07:41:34Z | |
dc.date.created | 2022-04-04 | |
dc.date.issued | 2022-03-16 | |
dc.identifier.citation | Porras, A., Pineda, S., Morales, J. M. & Jiménez Cordero, A. Cost-driven screening of network constraints for the unit commitment problem. En IEEE Transactions on Power Systems.https://dx.doi.org/10.1109/TPWRS.2022.3160016 | es_ES |
dc.identifier.uri | https://hdl.handle.net/10630/23914 | |
dc.description.abstract | In an attempt to speed up the solution of the unit commitment (UC) problem, both machine-learning and optimization-based methods have been proposed to lighten the full UC formulation by removing as many superfluous line-flow constraints as possible. While the elimination strategies based on machine learning are fast and typically delete more constraints, they may be over-optimistic and result in infeasible UC solutions. For their part, optimization-based methods seek to identify redundant constraints in the full UC formulation by exploring the feasibility region of an LP-relaxation. In doing so, these methods only get rid of line-flow constraints whose removal leaves the feasibility region of the original UC problem unchanged. In this paper, we propose a procedure to substantially increase the line-flow constraints that are filtered out by optimization-based methods without jeopardizing their appealing ability of preserving feasibility. Our approach is based on tightening the LP-relaxation that the optimization-based method uses with a valid inequality related to the objective function of the UC problem and hence, of an economic nature. The result is that the so strengthened optimization-based method identifies not only redundant line-flow constraints but also inactive ones, thus leading to more reduced UC formulations. | es_ES |
dc.description.sponsorship | The work of Álvaro Porras was supported in part by the Spanish Ministry of Science, Innovation and Universities through the university teacher training program with Fellowship under Grant FPU19/03053. This work was supported in part by the Spanish Ministry of Science and Innovation under Grant AEI/10.13039/501100011033 through project PID2020-115460GB-I00, in part by the European Research Council (ERC) through the European Union’s Horizon 2020 Research and Innovation Programme under Grant 755705, in part by the Junta de Andalucía (JA), and in part by the European Regional Development Fund (FEDER) through the research project under Grant P20_00153. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | The Institute of Electrical and Electronics Engineers (IEEE) | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | * |
dc.subject | Circuitos de interfaces | es_ES |
dc.subject | Circuitos lógicos | es_ES |
dc.subject | Ingeniería - Estimación de costes | es_ES |
dc.subject | Optimización combinatoria | es_ES |
dc.subject | Energía - Consumo | es_ES |
dc.subject.other | Bounding | es_ES |
dc.subject.other | Constraint screening | es_ES |
dc.subject.other | Cost-driven approach | es_ES |
dc.subject.other | Optimization-based method | es_ES |
dc.subject.other | Unit commitment | es_ES |
dc.title | Cost-driven screening of network constraints for the unit commitment problem | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.centro | Escuela de Ingenierías Industriales | es_ES |
dc.identifier.doi | 10.1109/TPWRS.2022.3160016 | |
dc.rights.cc | Atribución 4.0 Internacional | * |
dc.type.hasVersion | info:eu-repo/semantics/acceptedVersion | es_ES |