Xun C. Huang, Z. Liu, X. Huo, Jian Tang, Zhi-An Yan, Huan Qi
{"title":"基于蚁群算法的电网规划","authors":"Xun C. Huang, Z. Liu, X. Huo, Jian Tang, Zhi-An Yan, Huan Qi","doi":"10.1109/BICTA.2009.5338087","DOIUrl":null,"url":null,"abstract":"At present, mathematic model for power grid program has more requirement, traditional method can't fulfil it. Ant colony algorithm has been successfully used to solve NP problem in many fields. In this paper, a new ant colony algorithm of improving key parameters to solve power network planning is presented. For a given power network model, this algorithm will find out the best routing path only if it exits. Some examples show that this algorithm is more intelligent and efficient than other ones.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Power network planning with ant colony algorithm\",\"authors\":\"Xun C. Huang, Z. Liu, X. Huo, Jian Tang, Zhi-An Yan, Huan Qi\",\"doi\":\"10.1109/BICTA.2009.5338087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"At present, mathematic model for power grid program has more requirement, traditional method can't fulfil it. Ant colony algorithm has been successfully used to solve NP problem in many fields. In this paper, a new ant colony algorithm of improving key parameters to solve power network planning is presented. For a given power network model, this algorithm will find out the best routing path only if it exits. Some examples show that this algorithm is more intelligent and efficient than other ones.\",\"PeriodicalId\":161787,\"journal\":{\"name\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2009.5338087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International on Conference on Bio-Inspired Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2009.5338087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
At present, mathematic model for power grid program has more requirement, traditional method can't fulfil it. Ant colony algorithm has been successfully used to solve NP problem in many fields. In this paper, a new ant colony algorithm of improving key parameters to solve power network planning is presented. For a given power network model, this algorithm will find out the best routing path only if it exits. Some examples show that this algorithm is more intelligent and efficient than other ones.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
