H. Sasaki, J. Kubokawa, M. Watanabe, R. Yokoyama, R. Tanabe
{"title":"A solution of generation expansion problem by means of neutral network","authors":"H. Sasaki, J. Kubokawa, M. Watanabe, R. Yokoyama, R. Tanabe","doi":"10.1109/ANN.1991.213474","DOIUrl":null,"url":null,"abstract":"The authors present how to solve power system generation expansion planning by artificial neutral networks, especially the Hopfield type network. In the first place, generation expansion planning is formulated as a 0-1 integer programming problem and then mapped onto the modified Hopfield neural network that can handle a large number of inequality constraints. The neural network simulated on a digital computer can solve a fairly large problem of 20 units over 10 periods. Although the network cannot give the optimal solution, the results obtained are quite promising.<<ETX>>","PeriodicalId":119713,"journal":{"name":"Proceedings of the First International Forum on Applications of Neural Networks to Power Systems","volume":"183 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First International Forum on Applications of Neural Networks to Power Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANN.1991.213474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
The authors present how to solve power system generation expansion planning by artificial neutral networks, especially the Hopfield type network. In the first place, generation expansion planning is formulated as a 0-1 integer programming problem and then mapped onto the modified Hopfield neural network that can handle a large number of inequality constraints. The neural network simulated on a digital computer can solve a fairly large problem of 20 units over 10 periods. Although the network cannot give the optimal solution, the results obtained are quite promising.<>