救护车模拟调度系统

#include<stdio.h>#include <stdlib.h>#include <time.h>#include<math.h>#include<conio.h>#include<windows.h>#define TRUE 1#define FALSE 0#define OK 1#define OVERFLOW_ -2#define INFINITY_ 9999#define MAX_VERTEX_NUM 52#define Status int#define VertexType int //定点类型//**********************定义结构体**********************// typedef struct //医院{char hospital_name;int hospital_Num;} hospital_stc;hospital_stc hospitals[10];typedef struct //呼救{int Num;int name;} Call_stc;Call_stc call_vex[52];typedef struct //呼救地点与医院距离矩阵{int distance;int Num;int name;} Call_Hos_stc;Call_Hos_stc Hos_Call_matrix[10][52];Call_Hos_stc Call_Hos_matrix[52][10];typedef struct // 地点{char vex_name;int vex_Num;} Node_stc;Node_stc vertices[52];typedef struct //路段{char v1_name;char v2_name;int v1_Num;int v2_Num;int distance_v12;} section_Node;section_Node sections[90];typedef struct ArcCell //路径矩阵{int adj;int w;} ArcCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];typedef struct{VertexType vexs[MAX_VERTEX_NUM];AdjMatrix arcs;int vexnum,arcnum;} MGraph;MGraph G;typedef struct ambulance //救护车{int Num;int NowStatus;char termini_name;int wait_time;} CHE;typedef struct QNode{CHE che;struct QNode *next;} QNode,*QueuePtr;typedef struct //救护车队列{QueuePtr front;QueuePtr rear;} LinkQueue;LinkQueue AmbuQueue[10];typedef struct event //事件{int AidNo;int CallTime;int DealTime;int EventType;char OccurName;int Occur_GNum;int interval;int Hos_Num;int Che_Num;struct event *next;} EVENT;EVENT *EventList;EVENT *CallWaitList;//**********************定义变量**********************//int short_path_matrix[99][99]; //最短路径矩阵int VexNum,HosNum,ArcNum,CheNum,Call_VexNum; // 地点数，医院数，路段数，救护车数，呼救地点数；int num[20];int nearest_Hos[99]; // 最近医院int freqMOD=0,delayMOD=500;int AidEvent_Num=0;int EndTime=999; // 结束时间int CurrentTime; // 当前时间int ServicedNum; //已送达病人数int TotalDelayTime,TotalWaitTime,TotalDealTime,road_length; //总延迟，等待，处理事件，路段长度float DelayAverage,WaitAverage,DealAverage; //平均延迟，等待，处理//**********************定义函数**********************//void start();void ready();int GName_GNum(MGraph,char);void readfile(); //读文件函数void CreateGraph(MGraph *); // 创建矩阵void arrange_ambulances(); // 安排救护车void InitAmbu(); // 初始化救护车队列Status InitQueue(LinkQueue *); // 初始化Status EnQueue(LinkQueue *,CHE);// 进队Status DeQueue(LinkQueue *); // 出队CHE GetAmbu(LinkQueue);Status IsEmptyQueue(LinkQueue); //判断队列是否为空Status Display_Queue(LinkQueue); // 显示队列EVENT * InsertEvent(EVENT *,EVENT); // 插入事件队列EVENT * DeleteEvent(EVENT *); // 删除事件EVENT GetEvent(EVENT *); // 获取事件void Event_Call(); // 事件函数void Event_ArriveHome();void Event_ArriveHos();void Display_WaitingAmbu(); // 显示函数void Display_Patient_Status(EVENT *,EVENT *);void Display_Ambulance_Status(EVENT *);void Display_All();void Short_Path(MGraph G,int v0,int P[MAX_VERTEX_NUM][MAX_VERTEX_NUM],int D[MAX_VERTEX_NUM]);void Ambu_WaitTime(void);int SearchHos(int call_NoinG);int Hos_i_matrix(int call_GNo,int Hos_i);int GNo_CallNo(int g_No);int main() //主函数{system("cls"); // 清屏loop:printf("请输入结束时间（h<=999 ）:\n");scanf("%d",&EndTime);if(EndTime>999){printf("无效输入，请再次输入!\n");goto loop;}ready();InitAmbu();start();return 0;}void ready(){int l,k,i,j,not_hos,temp;int P[MAX_VERTEX_NUM][MAX_VERTEX_NUM],D[MAX_VERTEX_NUM];system("cls");readfile(); //读文件arrange_ambulances(); //安排救护车CreateGraph(&G); //创建矩阵G.vexnum=VexNum;G.arcnum=ArcNum;for(k=0; k<=G.vexnum-1; k++) //最短路径{Short_Path(G,k,P,D);for(i=0; i<=G.vexnum-1; i++){short_path_matrix[k][i]=D[i];}}printf("\nPress any key to continue...\n");getch();system("cls");for(i=0,k=0; i<=G.vexnum-1; i++) // 筛选出呼救地点和医院地点{not_hos=0;for(j=0; j<=HosNum-1; j++){if(i!=hospitals[j].hospital_Num) not_hos++;else break;}if(not_hos==HosNum){call_vex[k].Num=i;call_vex[k].name=vertices[call_vex[k].Num].vex_name;k++;}}for(i=0; i<=HosNum-1; i++) // 医院距离呼救地点距离{for(j=0,l=0; j<=VexNum-1; j++){not_hos=0;for(k=0; k<=HosNum-1; k++){if(j!=hospitals[k].hospital_Num) not_hos++;else break;}if(not_hos==HosNum){Hos_Call_matrix[i][l].distance=short_path_matrix[hospitals[i].hospital_Num][j];Hos_Call_matrix[i][l].name=call_vex[l].name;Hos_Call_matrix[i][l].Num=call_vex[l].Num;l++;}}}for(i=0; i<=Call_VexNum-1; i++) //呼救地点距离医院的距离{for(j=0; j<=HosNum-1; j++){Call_Hos_matrix[i][j].distance=Hos_Call_matrix[j][i].distance;Call_Hos_matrix[i][j].name =hospitals[j].hospital_name;Call_Hos_matrix[i][j].Num =hospitals[j].hospital_Num;}}for(k=0; k<=Call_VexNum-1; k++) //按距离排序{for(i=1; i<=HosNum-1; i++)for(j=0; j<=HosNum-2; j++){if(Call_Hos_matrix[k][j].distance>Call_Hos_matrix[k][j+1].distance){temp=Call_Hos_matrix[k][j].distance;Call_Hos_matrix[k][j].distance=Call_Hos_matrix[k][j+1].distance;Call_Hos_matrix[k][j+1].distance=temp;temp=Call_Hos_matrix[k][j].Num;Call_Hos_matrix[k][j].Num=Call_Hos_matrix[k][j+1].Num;Call_Hos_matrix[k][j+1].Num=temp;temp=Call_Hos_matrix[k][j].name;Call_Hos_matrix[k][j].name=Call_Hos_matrix[k][j+1].name;Call_Hos_matrix[k][j+1].name=temp;}}}}void InitAmbu() //救护车初始化{int i,j,counter=0;CHE che;for(i=0; i<=HosNum-1; i++){InitQueue(&AmbuQueue[i]);for(j=0; j<=num[i]-1; j++){che.wait_time=-1;che.NowStatus=0;che.termini_name=' ';che.Num=counter++;EnQueue(&AmbuQueue[i],che);}}}void start(){EVENT hold;int rand_num,key_num;srand( (unsigned)time( NULL ) ); //初始化随机函数种子rand_num=rand()%(G.vexnum-HosNum); // 随机产生病人srand( (unsigned)time( NULL ) );hold.DealTime=rand()%10;hold.OccurName=call_vex[rand_num].name;hold.Occur_GNum=call_vex[rand_num].Num;hold.AidNo=0;hold.EventType=0;hold.interval=-1;hold.Che_Num=-1;hold.Hos_Num=-1;EventList=InsertEvent(EventList,hold);for(CurrentTime=0; CurrentTime<=EndTime;){while(CurrentTime==GetEvent(EventList).DealTime) {switch(GetEvent(EventList).EventType){case 0:Event_Call();break;case 1:Event_ArriveHome();break;case 2:Event_ArriveHos();break;}}if(!kbhit()){Ambu_WaitTime();Display_All();Sleep((long)(2*delayMOD));CurrentTime++;}elseswitch(getch()){case 'd':if(delayMOD==0);else delayMOD--;break;case 'a':if(delayMOD==1000);else delayMOD++;break;case 27:exit(0);case 's':if(freqMOD==0);else freqMOD--;break;case 'w':if(freqMOD==100);else freqMOD++;break;}}}//********************** ready有关函数**********************// void readfile() //读文件{FILE * fp;int i,j;char ch,* ch_p1,* ch_p2;char str[8]=" ";system("cls");if((fp=fopen("D:\\data.txt","r"))==NULL){printf("cannot open file\n");exit(0);}for(i=0; i<=7; str[i++]=' ');i=0;while(1){ch=getc(fp);if(ch>=48&&ch<=57) str[i++]=ch;else break;}VexNum=atoi(str); //atoi:转化成长整数型printf("给定的地点数是%d\n",VexNum);for(i=0; i<=7; str[i++]=' ');i=0;while(1){ch=getc(fp);if(ch>=48&&ch<=57) str[i++]=ch;else break;}HosNum=atoi(str);printf("给定的医院数是%d\n",HosNum);Call_VexNum=VexNum-HosNum;for(i=0; i<=7; str[i++]=' ');i=0;while(1){ch=getc(fp);if(ch>=48&&ch<=57) str[i++]=ch;else break;}ArcNum=atoi(str);printf("给定的路段数是%d\n",ArcNum);printf("地点：");for(i=0; i<=VexNum-1; i++){ch=getc(fp);vertices[i].vex_name=ch;vertices[i].vex_Num=i;printf("%c ",vertices[i].vex_name);}ch=getc(fp);printf("\n");printf("医院：");for(i=0; i<=HosNum-1; i++){ch=getc(fp);hospitals[i].hospital_name=ch;for(j=0; j<=VexNum-1; j++)if(vertices[j].vex_name==hospitals[i].hospital_name){hospitals[i].hospital_Num=vertices[j].vex_Num;break;}printf("%c ",hospitals[i].hospital_name);}ch=getc(fp);printf("\n");printf("路段：");for(i=0; i<=ArcNum-1; i++){sections[i].v1_name=getc(fp);for(j=0; j<=VexNum-1; j++)if(vertices[j].vex_name==sections[i].v1_name){sections[i].v1_Num=vertices[j].vex_Num;break;}putchar(sections[i].v1_name);sections[i].v2_name=getc(fp);for(j=0; j<=VexNum-1; j++)if(vertices[j].vex_name==sections[i].v2_name){sections[i].v2_Num=vertices[j].vex_Num;break;}putchar(sections[i].v2_name);for(j=0; j<=7; str[j++]=' ');j=0;while(1){ch=getc(fp);if(ch>=48&&ch<=57) str[j++]=ch;else break;}sections[i].distance_v12=atoi(str);printf(":%d ",sections[i].distance_v12);}}void arrange_ambulances() //安排救护车{int i,left;loop1:printf("\n\n请输入所有医院救护车总数量: ");scanf("%d",&CheNum);if(CheNum<HosNum){printf("无效输入，请再次输入!\n");goto loop1;}for(i=0,left=CheNum; i<=HosNum-1; i++){loop2:printf("请输入%c 医院的救护车数量: ",hospitals[i].hospital_name);scanf("%d",&num[i]);left=left-num[i];if(left<=0&&i!=HosNum-1){printf("无效输入，请重新开始!\n");goto loop2;}}printf("\n");}void CreateGraph(MGraph *g) //创建矩阵{int i,j,k;g->vexnum=VexNum;g->arcnum=ArcNum;for(i=0; i<=g->vexnum-1; i++)g->vexs[i]=vertices[i].vex_Num;for(i=0; i<=g->vexnum-1; i++)for(j=0; j<=g->vexnum-1; j++){g->arcs[i][j].adj=0;g->arcs[i][j].w=INFINITY_;}for(k=0; k<=g->arcnum-1; k++){i=sections[k].v1_Num;j=sections[k].v2_Num;g->arcs[i][j].adj=1;g->arcs[j][i].adj=g->arcs[i][j].adj;g->arcs[i][j].w=sections[k].distance_v12;g->arcs[j][i].w=g->arcs[i][j].w;}}void Short_Path(MGraph G,int v0,int P[MAX_VERTEX_NUM][MAX_VERTEX_NUM],int D[MAX_VERTEX_NUM]){//最短路径int v,w,i,j,min;int final[MAX_VERTEX_NUM];for(v=0; v<=G.vexnum-1; v++){final[v]=FALSE;D[v]=G.arcs[v0][v].w;for(w=0; w<=G.vexnum-1; w++)P[v][w]=FALSE;if(D[v]<INFINITY_){P[v][v0]=TRUE;P[v][v]=TRUE;}}D[v0]=0;final[v0]=TRUE;for(i=1; i<=G.vexnum-1; i++){min=INFINITY_;for(w=0; w<=G.vexnum-1; w++)if(!final[w])if(D[w]<min){v=w;min=D[w];}final[v]=TRUE;for(w=0; w<=G.vexnum-1; w++)if(!final[w]&&(min+G.arcs[v][w].w<D[w])){D[w]=min+G.arcs[v][w].w;for(j=0; j<=G.vexnum-1; j++)P[w][j]=P[v][j];P[w][w]=TRUE;}}}//********************** InitAmbu有关函数**********************// Status InitQueue(LinkQueue *Q){(*Q).front=(*Q).rear=(QueuePtr)malloc(sizeof(QNode));if(!(*Q).front) exit(OVERFLOW_);(*Q).front->next=NULL;return OK;}Status EnQueue(LinkQueue *Q,CHE e){QueuePtr p;p=(QueuePtr)malloc(sizeof(QNode));if(!p){printf("Full!");exit(-2);}p->che=e;p->che.NowStatus =e.NowStatus;p->che.termini_name=e.termini_name;p->che.Num=e.Num ;p->next=NULL;(*Q).rear->next=p;(*Q).rear=p;return OK;}Status Display_Queue(LinkQueue Q){QueuePtr p;if(Q.front==Q.rear){printf(" /");}else{p=Q.front->next;while(p){printf("%2d ",p->che.Num);p=p->next;}}return OK;}//********************** start有关函数**********************// EVENT * InsertEvent(EVENT * h,EVENT e){EVENT *s,*p,*q;p=h;s=(EVENT *)malloc(sizeof(EVENT));s->CallTime=e.CallTime;s->AidNo=e.AidNo;s->DealTime=e.DealTime ;s->OccurName=e.OccurName ;s->Occur_GNum=e.Occur_GNum;s->EventType=e.EventType ;s->interval=e.interval;s->Hos_Num=e.Hos_Num;s->Che_Num=e.Che_Num;if(h==NULL){h=s;s->next=NULL;}else{while((s->DealTime>p->DealTime)&&(p->next!=NULL)){q=p;p=p->next;}if(s->DealTime<=p->DealTime){if(h==p)h=s;else q->next=s;s->next=p;}else{p->next=s;s->next=NULL;}}return h;}EVENT GetEvent(EVENT * h){EVENT hold;hold.CallTime=h->CallTime;hold.AidNo=h->AidNo;hold.DealTime=h->DealTime;hold.OccurName=h->OccurName;hold.Occur_GNum=h->Occur_GNum;hold.EventType=h->EventType;hold.interval=h->interval;hold.Che_Num=h->Che_Num;hold.Hos_Num=h->Hos_Num;hold=*h;return hold;}void Event_Call(){EVENT hold;int rand_num,interval,OkHos_i,call_GNo;char call_name;CHE hold_che;hold=GetEvent(EventList);CallWaitList=InsertEvent(CallWaitList,hold);EventList=DeleteEvent(EventList);OkHos_i=SearchHos(GName_GNum(G,hold.OccurName));srand( (unsigned)time( NULL ) );interval=5+rand()%(60/(freqMOD/5+1));srand( (unsigned)time( NULL ) );rand_num=rand()%(G.vexnum-HosNum);call_GNo=call_vex[rand_num].Num;call_name=call_vex[rand_num].name;hold.DealTime= CurrentTime+interval;hold.AidNo=AidEvent_Num++;hold.Occur_GNum=call_GNo;hold.OccurName=call_name;hold.EventType=0;hold.interval=-1;hold.Hos_Num=-1;hold.Che_Num=-1;EventList=InsertEvent(EventList,hold);if(OkHos_i!=-1){hold=GetEvent(CallWaitList);hold_che=GetAmbu(AmbuQueue[OkHos_i]);hold.Che_Num=hold_che.Num;hold.Hos_Num=OkHos_i;hold.DealTime=CurrentTime+Call_Hos_matrix[GNo_CallNo(hold.Occur_GNum)][Hos_i_matrix(ho ld.Occur_GNum,OkHos_i)].distance;hold.EventType=1;hold.interval=Call_Hos_matrix[GNo_CallNo(hold.Occur_GNum)][Hos_i_matrix(hold.Occur_GNum ,OkHos_i)].distance;EventList=InsertEvent(EventList,hold);CallWaitList=DeleteEvent(CallWaitList);DeQueue(&AmbuQueue[OkHos_i]);}else hold.CallTime=CurrentTime;}void Event_ArriveHome(){EVENT hold;hold=GetEvent(EventList);EventList=DeleteEvent(EventList);hold.DealTime=CurrentTime+hold.interval;hold.EventType=2;EventList=InsertEvent(EventList,hold);road_length=2*hold.interval;}void Event_ArriveHos(){CHE che,hold_che;EVENT hold;int interval,OkHos_i;hold=GetEvent(EventList);EventList=DeleteEvent(EventList);che.Num=hold.Che_Num;che.NowStatus=0;EnQueue(&AmbuQueue[hold.Hos_Num],che);ServicedNum++;TotalDealTime+=TotalDelayTime+road_length;DealAverage=(float)TotalDealTime/ServicedNum;if(CallWaitList!=NULL){hold=GetEvent(CallWaitList);TotalDelayTime+=(CurrentTime-hold.DealTime);DelayAverage=(float)TotalDelayTime/ServicedNum;OkHos_i=SearchHos(GName_GNum(G,hold.OccurName));if(OkHos_i!=-1){hold.Hos_Num=OkHos_i;hold_che=GetAmbu(AmbuQueue[OkHos_i]);hold.Che_Num=hold_che.Num;hold.DealTime= CurrentTime+hold.interval;hold.DealTime=CurrentTime+Call_Hos_matrix[GNo_CallNo(hold.Occur_GNum)][Hos_i_matrix(ho ld.Occur_GNum,OkHos_i)].distance;hold.EventType=1;hold.interval=Call_Hos_matrix[GNo_CallNo(hold.Occur_GNum)][Hos_i_matrix(hold.Occur_GNum ,OkHos_i)].distance;EventList=InsertEvent(EventList,hold);CallWaitList=DeleteEvent(CallWaitList);DeQueue(&AmbuQueue[OkHos_i]);}}}void Ambu_WaitTime(void){int i;QueuePtr p;for(i=0; i<=HosNum-1; i++){if(AmbuQueue[i].front==AmbuQueue[i].rear) ;else{p=(AmbuQueue[i].front)->next;while(p){TotalWaitTime++;p=p->next;}}}}void Display_All(){system("cls");printf("\n");printf("\n");printf("\t\t\t当前时间:%4d\n",CurrentTime);printf("\n");printf(" 已送达病人数:%4d\n",ServicedNum);printf("\n");printf(" 平均延迟:% 5.1f ",DelayAverage);printf("平均处理:% 5.1f ",DealAverage);printf("平均等待:% 5.1f\n",WaitAverage=(float)TotalWaitTime/CheNum-1);printf("\n");Display_Patient_Status(CallWaitList,EventList);Display_Ambulance_Status(EventList);Display_WaitingAmbu();printf("\n %c/%c:Frequence:%3d",'W','S',freqMOD);printf(" %c/%c:Delay:%3d",'A','D',delayMOD);printf(" ESC:quit");}EVENT * DeleteEvent(EVENT * h){if(h!=NULL) h=h->next;return h;}int GName_GNum(MGraph g,char ch){int i;for(i=0; i<=g.vexnum-1; i++)if(ch==vertices[i].vex_name) break;return i;}int SearchHos(int call_NoinG){int call_No,i,j,k;call_No=GNo_CallNo(call_NoinG);for(i=0; i<=HosNum-1; i++){for(j=0; j<=HosNum-1; j++){if(Call_Hos_matrix[call_No][i].Num==hospitals[j].hospital_Num)k=j;}if(!IsEmptyQueue(AmbuQueue[k])) return k;}return -1;}CHE GetAmbu(LinkQueue Q){return Q.front->next->che;}int GNo_CallNo(int g_No){int i;for(i=0; i<=Call_VexNum-1; i++)if(g_No==call_vex[i].Num)return i;}int Hos_i_matrix(int call_GNo,int Hos_i){int i,call_No;call_No=GNo_CallNo(call_GNo);for(i=0; i<=HosNum-1; i++)if(Call_Hos_matrix[call_No][i].Num==hospitals[Hos_i].hospital_Num) return i; }Status DeQueue(LinkQueue *Q){QueuePtr p;if((*Q).front==(*Q).rear) ;else{p=(*Q).front->next;(*Q).front->next=p->next;if((*Q).rear==p) (*Q).rear=(*Q).front;free(p);}return OK;}Status IsEmptyQueue(LinkQueue Q){return (Q.front==Q.rear)? TRUE : FALSE;}void Display_Patient_Status(EVENT *h1,EVENT *h2){EVENT *p;printf("\n");printf(" 病人的状态: ");p=h1;if(h1!=NULL){while(p){printf(" %d",p->AidNo);printf(":待派车");p=p->next;}}p=h2;if(h2!=NULL){while(p){printf(" %d",p->AidNo);switch(p->EventType){case 0:printf("\b ");break;case 1:printf(":待接中");break;case 2:printf(":送院中");break;}p=p->next;}printf("\n");}}void Display_Ambulance_Status(EVENT *h) {int i;EVENT *p;printf("\n");printf("\n");printf(" 救护车状态: ");p=h;if(h!=NULL){while(p){switch(p->EventType){case 1:printf(" %2d",p->Che_Num);printf(":往救中");break;case 2:printf(" %2d",p->Che_Num);printf(":送院中");break;}p=p->next;}}printf("\n");}void Display_WaitingAmbu(void){int i;printf("\n");for(i=0; i<HosNum; i++){printf(" %c ",hospitals[i].hospital_name);printf("医院待命救护车: ");Display_Queue(AmbuQueue[i]);printf("\n");}}。