{"title":"考虑代表性日需求曲线的偶然性约束输电扩张规划","authors":"J. Isai Garcia-Mercado, G. Gutiérrez-Alcaraz","doi":"10.1109/TDC-LA.2018.8511668","DOIUrl":null,"url":null,"abstract":"The Transmission Expansion Planning (TEP) problem determines the optimal investments for certain candidates’ transmission lines in an electric power system. The TEP problem considers and implements the N-1 security criterion in all periods of planning and operation. This paper introduces a novel approach to reduce the computation time and memory used when modeling the TEP problem considering the security criterion N-1. Several popular commercial solvers are used to evaluate the computational efficiency of the proposed TEP approach.","PeriodicalId":267301,"journal":{"name":"2018 IEEE PES Transmission & Distribution Conference and Exhibition - Latin America (T&D-LA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Contingency-Constrained Transmission Expansion Planning Considering a Representative Daily Demand Curve\",\"authors\":\"J. Isai Garcia-Mercado, G. Gutiérrez-Alcaraz\",\"doi\":\"10.1109/TDC-LA.2018.8511668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Transmission Expansion Planning (TEP) problem determines the optimal investments for certain candidates’ transmission lines in an electric power system. The TEP problem considers and implements the N-1 security criterion in all periods of planning and operation. This paper introduces a novel approach to reduce the computation time and memory used when modeling the TEP problem considering the security criterion N-1. Several popular commercial solvers are used to evaluate the computational efficiency of the proposed TEP approach.\",\"PeriodicalId\":267301,\"journal\":{\"name\":\"2018 IEEE PES Transmission & Distribution Conference and Exhibition - Latin America (T&D-LA)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE PES Transmission & Distribution Conference and Exhibition - Latin America (T&D-LA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TDC-LA.2018.8511668\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE PES Transmission & Distribution Conference and Exhibition - Latin America (T&D-LA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TDC-LA.2018.8511668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Contingency-Constrained Transmission Expansion Planning Considering a Representative Daily Demand Curve
The Transmission Expansion Planning (TEP) problem determines the optimal investments for certain candidates’ transmission lines in an electric power system. The TEP problem considers and implements the N-1 security criterion in all periods of planning and operation. This paper introduces a novel approach to reduce the computation time and memory used when modeling the TEP problem considering the security criterion N-1. Several popular commercial solvers are used to evaluate the computational efficiency of the proposed TEP approach.