摘要
本文基于图论中的最短路径算法 ,提出了一种求解前 n条最短路径的小偏差量 δ算法。该方法有效地解决了含有多条相同长度路径的联合电力网的前 n条最短路径的求解问题。与图论中常用最短路径算法相比 ,本文提出的小偏差量δ算法具有计算工作量小。
The paper proposes a slim deviation δ method based on the algorithm for finding the n shortest paths in graph theory.This method solves the problem effectively in united power network which includes serveral routes with the same length.Compared with the algorithm in graph theory,the slim deviation δ method has advantages of less caculation and more practicability.
出处
《电力系统及其自动化学报》
CSCD
2000年第6期26-29,共4页
Proceedings of the CSU-EPSA
关键词
图论
最短路径算法
小偏差量δ算法
联合电力网
graph theory,algorithm of the shortest path,slim deviation δ method,united power netwo
