nodeoptimize.cpp

牛顿-拉夫逊法潮流计算的算法实现

//////////////////////////////////////////////////////////////////////////
/////  节点优化编号  静态编号，动态编号，半动态编号                   ////
//////////////////////////////////////////////////////////////////////////

#include "NodeOptimize.h"
#include <iostream.h>
#define RE 10

NodeOptimize::NodeOptimize()
{
	 extern SystemInfo m_SystemInfo;   ///系统信息
	int nodenum=m_SystemInfo.SystemTotalBusNum;
	old_new=new int[nodenum+RE];
	for(int k=1;k<=nodenum;k++)
		old_new[k]=0;
    new_old=new int[nodenum+RE];
	for(k=1;k<=nodenum;k++)
		new_old[k]=0;
}

NodeOptimize::~NodeOptimize()
{
    
}

void NodeOptimize::StaticOptimize()
{
    extern SystemInfo m_SystemInfo;   ///系统信息
    extern LineInfo *m_LineInfo;       ///线路信息
	extern TransformerInfo *m_TransformerInfo;  ///变压器支路 
	extern BusInfo *m_BusInfo;        //// 节点    
	int nodenum=m_SystemInfo.SystemTotalBusNum;
    int linenum=m_SystemInfo.GeneralLineNum;//+m_SystemInfo.LandBranchNum;
	int totallinenum=linenum+m_SystemInfo.TransformerNum;
	int *busIno=new int[totallinenum+RE];  ///记录线路编号较小端点
	int *busJno=new int[totallinenum+RE];  ///记录线路编号较大端点
    for(int i=1;i<=linenum;i++)
	{
		if(m_LineInfo[i].BusINo<=m_LineInfo[i].BusJNo)
		{
		busIno[i]=m_LineInfo[i].BusINo;
		busJno[i]=m_LineInfo[i].BusJNo;
		}
		else
        {
		busJno[i]=m_LineInfo[i].BusINo;
		busIno[i]=m_LineInfo[i].BusJNo;
		}
	}
	for(i=linenum+1;i<=totallinenum;i++)
	{
		if(m_TransformerInfo[i-linenum].BusINo<=m_TransformerInfo[i-linenum].BusJNo)
		{		
		busIno[i]=m_TransformerInfo[i-linenum].BusINo;	
		busJno[i]=m_TransformerInfo[i-linenum].BusJNo;
		}
		else
		{
		busIno[i]=m_TransformerInfo[i-linenum].BusJNo;
        busJno[i]=m_TransformerInfo[i-linenum].BusINo;
		}
	}	
	int *nodedegree=new int[nodenum+RE];   ///节点度
	for(i=1;i<=nodenum;i++)
		nodedegree[i]=0;
    int newbusno=0;  ///新的节点编号
	int oldbusno=0;  ///老编号
	for(i=1;i<=nodenum;i++)
	{
	for(int j=1;j<=totallinenum;j++)
	{
		if(busIno[j]==i) nodedegree[i]++;
		if(busJno[j]==i) nodedegree[i]++;
		/////考虑双回线的影响
		if(busIno[j]==busIno[j-1]&&busJno[j]==busJno[j-1]) nodedegree[i]--;
	} 

	} 
	int maxdegree=0,mindegree=10000; ////记录最大节点度数和最小节点读数
	for(i=1;i<=nodenum;i++)
	{
		if(nodedegree[i]>maxdegree) 
		{
			maxdegree=nodedegree[i];
		}
		if(nodedegree[i]<mindegree)
		{
			mindegree=nodedegree[i];
		}
	}
	
    for(i=mindegree;i<=maxdegree;i++)
	{
		for(int j=1;j<=nodenum;j++)
		{
			if(nodedegree[j]==i) 
			{
				newbusno++;
				old_new[j]=newbusno;				
			}
		}
	}


   for(i=1;i<=nodenum;i++)
	   cout<<i<<old_new[i]<<endl;

   	delete [] nodedegree;
	delete [] busIno;
	delete [] busJno;
}

void NodeOptimize::HalfDymOptimize()
{
    extern SystemInfo m_SystemInfo;   ///系统信息
    extern LineInfo *m_LineInfo;       ///线路信息
	extern TransformerInfo *m_TransformerInfo;  ///变压器支路 
	extern BusInfo *m_BusInfo;        //// 节点    
//    
	int nodenum=m_SystemInfo.SystemTotalBusNum;
//	old_new=new int[nodenum+RE];
//	for(int k=1;k<=nodenum;k++)
//		old_new[k]=0;
//    new_old=new int[nodenum+RE];
//	for(k=1;k<=nodenum;k++)
//		new_old[k]=0;

	int linenum=m_SystemInfo.GeneralLineNum;//+m_SystemInfo.LandBranchNum;
	int totallinenum=linenum+m_SystemInfo.TransformerNum;
	int *busIno=new int[totallinenum+RE];  ///记录线路编号较小端点
	int *busJno=new int[totallinenum+RE];  ///记录线路编号较大端点
    for(int i=1;i<=linenum;i++)
	{
		if(m_LineInfo[i].BusINo<=m_LineInfo[i].BusJNo)
		{
		busIno[i]=m_LineInfo[i].BusINo;
		busJno[i]=m_LineInfo[i].BusJNo;
		}
		else
        {
		busJno[i]=m_LineInfo[i].BusINo;
		busIno[i]=m_LineInfo[i].BusJNo;
		}
	}
	for(i=linenum+1;i<=totallinenum;i++)
	{
		if(m_TransformerInfo[i-linenum].BusINo<=m_TransformerInfo[i-linenum].BusJNo)
		{		
		busIno[i]=m_TransformerInfo[i-linenum].BusINo;	
		busJno[i]=m_TransformerInfo[i-linenum].BusJNo;
		}
		else
		{
		busIno[i]=m_TransformerInfo[i-linenum].BusJNo;
        busJno[i]=m_TransformerInfo[i-linenum].BusINo;
		}
	}	
	int *nodedegree=new int[nodenum+RE];   ///节点度
	for(i=1;i<=nodenum;i++)
		nodedegree[i]=0;
    int newbusno=0;  ///新的节点编号
	int oldbusno=0;  ///老编号
	while(newbusno<nodenum)
	{
		for(i=1;i<=nodenum;i++)
		{
		for(int j=1;j<=totallinenum;j++)
		{
			if(busIno[j]==i) nodedegree[i]++;
			if(busJno[j]==i) nodedegree[i]++;
			/////考虑双回线的影响
			if(busIno[j]==busIno[j-1]&&busJno[j]==busJno[j-1]) nodedegree[i]--;
		}
// 		cout<<nodedegree[i]<<endl;
		}
//     cout<<"------------------"<<endl;
		int max=nodedegree[1];
        for(i=1;i<=nodenum;i++)    ///找到这轮循环中,节点度数最小的节点
		{
			if(nodedegree[i]<=max)
			{ 
				max=nodedegree[i];  
	            oldbusno=i;   		    	
			} 
		}
		newbusno++;
//		cout<<oldbusno<<endl;
//		cout<<"-------------------"<<endl;
		old_new[oldbusno]=newbusno;
		new_old[newbusno]=oldbusno;
		/////////////////////////
//		for(int j=1;j<=totallinenum;j++)
//			cout<<busIno[j]<<"  "<<busJno[j]<<endl;
//		cout<<"-------------------"<<endl;
        //////////////////////////////
		for(i=1;i<=nodenum;i++)
	    {
			nodedegree[i]=0;	
		}
		for(i=1;i<=nodenum;i++)
		{
			nodedegree[new_old[i]]=100000;
		}
		for(int j=1;j<=totallinenum;j++)
		{
			if(busIno[j]==oldbusno) 
			{
				busIno[j]=10000+oldbusno; busJno[j]=20000+oldbusno;
			}
			if(busJno[j]==oldbusno) 
			{
				busIno[j]=10000+oldbusno; busJno[j]=20000+oldbusno;
			}
		}

	}
//   for(i=1;i<=nodenum;i++)
//	   cout<<i<<old_new[i]<<endl;
    ///对没有当作出点的节点编号
	int no_out=0;
   for(i=1;i<=nodenum;i++)
   	   if(old_new[i]<0)  no_out++;
	   newbusno=newbusno-no_out;
	   for(i=1;i<=nodenum;i++)
		   if(old_new[i]<0)
		   {  
			   old_new[i]=newbusno; 
			   newbusno++;
		   }

   for(i=1;i<=nodenum;i++)
	   cout<<i<<old_new[i]<<endl;

	delete [] nodedegree;
	delete [] busIno;
	delete [] busJno;
    
}

void NodeOptimize::DynamicOptimize()
{
     extern SystemInfo m_SystemInfo;   ///系统信息
    extern LineInfo *m_LineInfo;       ///线路信息
	extern TransformerInfo *m_TransformerInfo;  ///变压器支路 
	extern BusInfo *m_BusInfo;        //// 节点    
//    
	int nodenum=m_SystemInfo.SystemTotalBusNum;
//	old_new=new int[nodenum+RE];
//	for(int k=1;k<=nodenum;k++)
//		old_new[k]=0;
//    new_old=new int[nodenum+RE];
//	for(k=1;k<=nodenum;k++)
//		new_old[k]=0;

	int linenum=m_SystemInfo.GeneralLineNum;//+m_SystemInfo.LandBranchNum;
	int totallinenum=linenum+m_SystemInfo.TransformerNum;
	int *busIno=new int[totallinenum+RE];  ///记录线路编号较小端点
	int *busJno=new int[totallinenum+RE];  ///记录线路编号较大端点
    for(int i=1;i<=linenum;i++)
	{
		if(m_LineInfo[i].BusINo<=m_LineInfo[i].BusJNo)
		{
		busIno[i]=m_LineInfo[i].BusINo;
		busJno[i]=m_LineInfo[i].BusJNo;
		}
		else
        {
		busJno[i]=m_LineInfo[i].BusINo;
		busIno[i]=m_LineInfo[i].BusJNo;
		}
	}
	for(i=linenum+1;i<=totallinenum;i++)
	{
		if(m_TransformerInfo[i-linenum].BusINo<=m_TransformerInfo[i-linenum].BusJNo)
		{		
		busIno[i]=m_TransformerInfo[i-linenum].BusINo;	
		busJno[i]=m_TransformerInfo[i-linenum].BusJNo;
		}
		else
		{
		busIno[i]=m_TransformerInfo[i-linenum].BusJNo;
        busJno[i]=m_TransformerInfo[i-linenum].BusINo;
		}
	}	
	int *nodedegree=new int[nodenum+RE];   ///节点度
	for(i=1;i<=nodenum;i++)
		nodedegree[i]=0;
    int newbusno=0;  ///新的节点编号
	int oldbusno=0;  ///老编号
	int *tempnode=new int[nodenum+RE];///用来记录与某个某个节点相连的所有节点
	while(newbusno<nodenum)
	{
		for(i=1;i<=nodenum;i++)
		{
		for(int j=1;j<=nodenum;j++)
		{
           tempnode[j]=0;
		}
		int k=0;
		for( j=1;j<=totallinenum;j++)
		{
			if(busIno[j]==i) 
			{
				nodedegree[i]++;
				k++;
				tempnode[k]=busJno[j];
			}
			if(busJno[j]==i) 
			{
				nodedegree[i]++;
				k++;
               tempnode[k]=busIno[j];
			}
			/////考虑双回线的影响
        	if(busIno[j]==busIno[j-1]&&busJno[j]==busJno[j-1]) nodedegree[i]--;			
		}
		int Dk=0;/// 用来计算节点之间已有的支路数
		for(j=1;j<=k;j++)
		{
			for(int n=j+1;n<=k;n++)
			{
				for(int m=1;m<=totallinenum;m++)
				{
					if(busIno[m]==tempnode[j]&&busJno[m]==tempnode[n])
					{
                      Dk++;
					}
				}
			}
		}
		nodedegree[i]=nodedegree[i]*(nodedegree[i]-1)/2-Dk;
// 		cout<<nodedegree[i]<<endl;
		}
//     cout<<"------------------"<<endl;
		int max=nodedegree[1];
        for(i=1;i<=nodenum;i++)    ///找到这轮循环中,节点度数最小的节点
		{
			if(nodedegree[i]<=max)
			{ 
				max=nodedegree[i];  
	            oldbusno=i;   		    	
			} 
		}
		newbusno++;
//		cout<<oldbusno<<endl;
//		cout<<"-------------------"<<endl;
		old_new[oldbusno]=newbusno;
		new_old[newbusno]=oldbusno;
		/////////////////////////
//		for(int j=1;j<=totallinenum;j++)
//			cout<<busIno[j]<<"  "<<busJno[j]<<endl;
//		cout<<"-------------------"<<endl;
        //////////////////////////////
		for(i=1;i<=nodenum;i++)
	    {
			nodedegree[i]=0;	
		}
		for(i=1;i<=nodenum;i++)
		{
			nodedegree[new_old[i]]=100000;
		}
		for(int j=1;j<=totallinenum;j++)
		{
			if(busIno[j]==oldbusno) 
			{
				busIno[j]=10000+oldbusno; busJno[j]=20000+oldbusno;
			}
			if(busJno[j]==oldbusno) 
			{
				busIno[j]=10000+oldbusno; busJno[j]=20000+oldbusno;
			}
		}

	}

cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
	for(i=1;i<=nodenum;i++)
	  cout<<i<<old_new[i]<<endl;
cout<<"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"<<endl;
	delete [] nodedegree;
	delete [] busIno;
	delete [] busJno;

}

void NodeOptimize::AdjustNodeNo()
{
    if(OptimizeType==1)  StaticOptimize();
	else if (OptimizeType==2) HalfDymOptimize();
	else if(OptimizeType==3) DynamicOptimize();

    extern SystemInfo m_SystemInfo;   ///系统信息
    extern LineInfo *m_LineInfo;       ///线路信息
	extern TransformerInfo *m_TransformerInfo;  ///变压器支路 
	extern BusInfo *m_BusInfo;        //// 节点   
	
	int linenum,transformernum,nodenum;///支路数，变压器数，节点数
	linenum=m_SystemInfo.GeneralLineNum+m_SystemInfo.LandBranchNum;
    transformernum=m_SystemInfo.TransformerNum;
	nodenum=m_SystemInfo.SystemTotalBusNum;
	for(int k=1;k<=linenum;k++)
	{
		int i=m_LineInfo[k].BusINo;
		int j=m_LineInfo[k].BusJNo;
        m_LineInfo[k].BusINo=old_new[i];
        m_LineInfo[k].BusJNo=old_new[j]; 
//	  cout<<m_LineInfo[k].BusINo<<"  "<<m_LineInfo[k].BusJNo<<endl;
	}
    for(k=1;k<=transformernum;k++)
	{
		int i=m_TransformerInfo[k].BusINo;
		int j=m_TransformerInfo[k].BusJNo;
		m_TransformerInfo[k].BusINo=old_new[i];
	    m_TransformerInfo[k].BusJNo=old_new[j];
//		cout<<m_TransformerInfo[k].BusINo<<"  "<<m_TransformerInfo[k].BusJNo<<endl;
	}
	///////////对节点重新编号，并且按照编号大小顺序在数组中顺次排列
	BusInfo *businfo;    
	businfo=new BusInfo[nodenum+RE];   
	for(k=1;k<=nodenum;k++)
	{
		int i=m_BusInfo[k].BusNo;
		m_BusInfo[k].BusNo=old_new[i];	
        businfo[old_new[i]].BusNo=m_BusInfo[k].BusNo;
        businfo[old_new[i]].BusType=m_BusInfo[k].BusType;
		businfo[old_new[i]].PG=m_BusInfo[k].PG;
		businfo[old_new[i]].QG=m_BusInfo[k].QG;
		businfo[old_new[i]].PD=m_BusInfo[k].PD;
		businfo[old_new[i]].QD=m_BusInfo[k].QD;
		businfo[old_new[i]].Voltage_e=m_BusInfo[k].Voltage_e;  
		businfo[old_new[i]].Voltage_f=m_BusInfo[k].Voltage_f;  
//		cout<<k<<" "<<m_BusInfo[k].BusNo<<endl;		
	}
   	for(k=1;k<=nodenum;k++)
	{
     m_BusInfo[k].BusNo=businfo[k].BusNo;
	 m_BusInfo[k].BusType=businfo[k].BusType;
	 m_BusInfo[k].PG=businfo[k].PG;
	 m_BusInfo[k].QG=businfo[k].QG;
	 m_BusInfo[k].PD=businfo[k].PD;
	 m_BusInfo[k].QD=businfo[k].QD;
	 m_BusInfo[k].Voltage_e=businfo[k].Voltage_e;
	 m_BusInfo[k].Voltage_f=businfo[k].Voltage_f;
	 if(m_BusInfo[k].BusType==0) m_SystemInfo.SwingBusNo=m_BusInfo[k].BusNo; 
	}

//	   for(int i=1;i<=m_SystemInfo.SystemTotalBusNum;i++)
//		m_BusInfo[i].VolMod=m_BusInfo[i].Voltage_e*m_BusInfo[i].Voltage_e+
//		                    m_BusInfo[i].Voltage_f*m_BusInfo[i].Voltage_f;

//for(int i=1;i<=m_SystemInfo.SystemTotalBusNum;i++)
//   cout<<m_BusInfo[i].BusNo<<"	"<<m_BusInfo[i].BusType<<"	"
//	 <<m_BusInfo[i].PG<<"	"<<m_BusInfo[i].QG<<"	"<<m_BusInfo[i].PD
// 	 <<"	"<<m_BusInfo[i].QD<<"	"<<"--"<<m_BusInfo[i].Voltage_e<<endl;
}