{"title":"Transmission Network Expansion Planning with a Hybrid Meta-heuristic Method of Parallel Tabu Search and Ordinal Optimization","authors":"H. Mori, Y. Iimura","doi":"10.1109/ISAP.2007.4441614","DOIUrl":null,"url":null,"abstract":"This paper proposes a hybrid meta-heuristic method of parallel tabu search (PTS) and ordinal optimization (OO) for transmission network expansion planning in power systems. It determines the optimal structure that keeps the balance between generations and loads. The formulation is expressed as a combinatorial optimization problem that is very hard to solve. PTS is one of meta-heuristics that is useful for solving a combinatorial optimization. To speed up computational time of PTS, OO is used to reduce the number of solution candidates in a probabilistic way. The proposed method with OO-TS is successfully applied to a sample system.","PeriodicalId":320068,"journal":{"name":"2007 International Conference on Intelligent Systems Applications to Power Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Intelligent Systems Applications to Power Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAP.2007.4441614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
This paper proposes a hybrid meta-heuristic method of parallel tabu search (PTS) and ordinal optimization (OO) for transmission network expansion planning in power systems. It determines the optimal structure that keeps the balance between generations and loads. The formulation is expressed as a combinatorial optimization problem that is very hard to solve. PTS is one of meta-heuristics that is useful for solving a combinatorial optimization. To speed up computational time of PTS, OO is used to reduce the number of solution candidates in a probabilistic way. The proposed method with OO-TS is successfully applied to a sample system.