{"title":"微电网新型竞价搜索算法开发","authors":"T. Korõtko, A. Rosin","doi":"10.1109/RTUCON.2018.8659820","DOIUrl":null,"url":null,"abstract":"This paper describes the development of a novel search algorithm to be used as a key component inside an electricity auction algorithm for electrical microgrids. Electricity auctions and common search algorithms are reviewed. Since no common search algorithm proves eligible for an optimal solution of the search problem inside the novel electricity auction, a custom two-step search algorithm is developed. The developed search algorithm divides the search into two: first, the search is „arrowed based on simplified assumptions, and second, a filtered search algorithm is used to find the optimal set of bids. Comparative results for different search algorithm variations and insights to future research are presented at the end of this paper.","PeriodicalId":192943,"journal":{"name":"2018 IEEE 59th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Search algorithm development for novel electricity auction in microgrids\",\"authors\":\"T. Korõtko, A. Rosin\",\"doi\":\"10.1109/RTUCON.2018.8659820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the development of a novel search algorithm to be used as a key component inside an electricity auction algorithm for electrical microgrids. Electricity auctions and common search algorithms are reviewed. Since no common search algorithm proves eligible for an optimal solution of the search problem inside the novel electricity auction, a custom two-step search algorithm is developed. The developed search algorithm divides the search into two: first, the search is „arrowed based on simplified assumptions, and second, a filtered search algorithm is used to find the optimal set of bids. Comparative results for different search algorithm variations and insights to future research are presented at the end of this paper.\",\"PeriodicalId\":192943,\"journal\":{\"name\":\"2018 IEEE 59th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 59th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTUCON.2018.8659820\",\"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 59th International Scientific Conference on Power and Electrical Engineering of Riga Technical University (RTUCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTUCON.2018.8659820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Search algorithm development for novel electricity auction in microgrids
This paper describes the development of a novel search algorithm to be used as a key component inside an electricity auction algorithm for electrical microgrids. Electricity auctions and common search algorithms are reviewed. Since no common search algorithm proves eligible for an optimal solution of the search problem inside the novel electricity auction, a custom two-step search algorithm is developed. The developed search algorithm divides the search into two: first, the search is „arrowed based on simplified assumptions, and second, a filtered search algorithm is used to find the optimal set of bids. Comparative results for different search algorithm variations and insights to future research are presented at the end of this paper.