摘要
配电系统母线槽的布线问题是一个典型的NP完全的组合最优化问题,随着问题规模的增大,求解时间按指数规模增长。本文提出一种新的基于蚁群系统的布线算法,通过模拟蚁群寻找从蚁巢到食物最短路径的过程来求解最优布线路径。试验结果表明:该算法能够在整个解空间求解布线问题,时间复杂度相对较低,易于和约束条件结合,且有很好的鲁棒性。
Busbar routing of power distribution system is a NPComplete combinatorial optimization problem, in which timeconsuming increases in exponent as dimension does. In this paper, a new approach to busbar routing is developed which simulates the process that ant colony system find the shortest path from nest to food sources. Experiments showed satisfied results: it is robust, easy to combine with constraints, low timeconsuming and search in the whole solution space.
出处
《电工电能新技术》
CSCD
2003年第2期56-59,80,共5页
Advanced Technology of Electrical Engineering and Energy
基金
陕西省自然科学基金基础研究基金资助项目(2000C20)
