{"title":"输电网扩容规划非凸优化方法的比较研究","authors":"R. Gallego, A. Monticelli, Ruben Romero","doi":"10.1109/PICA.1997.599370","DOIUrl":null,"url":null,"abstract":"We have investigated and extensively tested three families of nonconvex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.","PeriodicalId":383749,"journal":{"name":"Proceedings of the 20th International Conference on Power Industry Computer Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"136","resultStr":"{\"title\":\"Comparative studies on nonconvex optimization methods for transmission network expansion planning\",\"authors\":\"R. Gallego, A. Monticelli, Ruben Romero\",\"doi\":\"10.1109/PICA.1997.599370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have investigated and extensively tested three families of nonconvex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.\",\"PeriodicalId\":383749,\"journal\":{\"name\":\"Proceedings of the 20th International Conference on Power Industry Computer Applications\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"136\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Conference on Power Industry Computer Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICA.1997.599370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Conference on Power Industry Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICA.1997.599370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparative studies on nonconvex optimization methods for transmission network expansion planning
We have investigated and extensively tested three families of nonconvex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.