利用遗传算法用于分销中心选址.doc

利用遗传算法程序：这个程序是用于分销中心选址（利用遗传算法）#include stdio.h#include math.h#include stdlib.h#define PopSize?????48#define Cmax????????10000#define MaxGeneration???400const double??PI=3.1415926;const double??Pcmax=1.0;//最大交叉率const double??Pcrnin=0.5;//最小交叉率const double??Pm=0.30;//变异率const double??b=10;//变异操作系统系数const double??TO=1.5;????????????JJ罚函数法初始系数//定义物流配送中心选址模型的己知参数，根据模型数据不同，可修改#define PROVIDER??4//工厂个数#define CENTER??? 4//被选物流配送中心个数#define USER??????8//用户个数const int CHROMLENGTHCEN=CENTER;//二进制变量的编码串长度const int CHROMLENGTHPROCEN//一级运输中变量的编码串长度????????? =PROVIDER*CENTER;const int CHROMLENGTHCENUSE//二级运输中变量的编码串长度????????? =CENTER*USER;double A[PROVIDER]={29200,14000,28000,13700};//工厂生产能力double M[CENTER]={16200,48000,4500,17200};//配送中心建设容量double D[USER]={500,425,450,473,3000,3400,750,800};//用户需求量double F[CENTER]={26038,17250,225000,16848};//配送中心的固定投资费用double W[PROVIDER][CENTER]={4000,25000,0,200,6000,3000,0,5000,5000,8000,3000,12000,1200,12000,1500,0}; double c[PROVIDER][CENTER]//工厂到配送中心的单位运费??????={34.53,25.9,33.54,36.25,39.37,45,37.5,46.78,18.81,24.18,16.79,20.15,34.18,37.18,34.79,37.18};double h[CENTER][USER]//配送中心到用户的单位运费??????={5,11,3,8,5,10,11,11,14,16,8,9,4,7,4,4,????????? 10,11,3,5,2,5,9,5,15,13, 9,6,7,2,10,2,????????? 9,7,3,2,6,5,12,8,13,15,9,9,5,8,4,6};struct??individualcen{??char???chrom[CHROMLENGTHCEN];//二进制变量编码串??double value;//记录个体目标函数值??double fitness;//记录个体适应度函数值??int??? z[CENTER];//二进制变量值??double s[PROVIDER+CENTER+USER];//记录不等式约束??double t[CENTER];//记录等式约束};struct??individualprocen{??double chrom[CHROMLENGTHPROCEN];//一级运输变量编码串double value;};struct{individualcenusc??????double chrom[CHROMLENGTHCENUSE];//二级运输变量编码串??????double value;????????????????????? //记录个体目标函数部分值??????double X[CENTER][USER];//二级运输中的变量??? };int worst_index;//最差个体序号double dst[PROVIDER+2*CENTER+USER];//记录所有约束struct??individualcen bestindividual;//当前代最优个体struct??individualcen worstindividual;//当前代最差个体struct??individualcen currentbe