【MVRP问题】基于遗传算法求解多配送中心车辆路径规划问题附matlab代码

1 简介

车辆调度是物流系统优化中关键 的一环 。对配送车辆 的调度进行科学优化．可以降低运输成本．提高物流企业经济效益。根据配送中心数目的多少．配送车辆优化调度问题有单配送中心车辆调度问题和多配送中心车辆调度 问题之分。 目前 ．我 国一些大中型城市 的物流体系中存在有多个配送 中心的情况。因此，对多配送中心车辆调度问题的研究有重要的现实意义。本文提出了用最近距离分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略．利用求解单配送中心车辆调度问题的遗传算法．设计了求解多配送中心车辆调度问题的算法 ．最后通过案例计算验 证了该算法的 良好性能 。

2 部分代码

%遗传算法 VRP 问题 Matlab实现​%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%tic%计时器clear;clc​%W=80; %每辆车的载重量%Citynum=50; %客户数量%Stornum=4;%仓库个数%C     %%第二三列 客户坐标，第四列 客户需求   51,52,53,54为四个仓库​%load('p01-n50-S4-w80.mat');  %载入测试数据，n客户服务点数，S仓库个数,w车辆载重量%load('p02-n50-S4-w160.mat');%load('p04-n100-S2-w100.mat');%load('p05-n100-S2-w200.mat');load('p06-n100-S3-w100.mat');%load('p12-n80-S2-w60.mat');% load('ppp-n30-s3-w-60.mat')%load('ppp-n25-s3-w-50.mat')​w=[];%存储每代的最短总路径G=100;%种群大小v1=60;v2=300;​​[dislist,Clist]=vrp(C);%dislist为距离矩阵 ，Clist为点坐标矩阵及客户需L=[];%存每个种群的回路长度​for i=1:G    Parent(i,:)=randperm(Citynum);%随机产生路径    L(i,1)=curlist(Citynum,Clist(:,4),W,Parent(i,:),Stornum,dislist);end​Pc=0.8;%交叉比率Pm=0.3;%变异比率species=Parent;%种群children=[];%子代%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%disp('正在运行，时间比较长，请稍等.........')g=50;for generation=1:g %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%ticfver        end    endend​   L_best    w=[w,L_best];toc%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%end%%​Rbest%最优线路L_best%最优解​%%画图plot(1:g,(w(1:g)/v1+sum(Clist(:,4))/v2),'-*')hold on;xlabel('generation');ylabel('mintime');​[m n]=size(Rbest);start=1;temp=[];i=2;while(i<=n)    if(Rbest(i)>Citynum)        temp=Rbest(start:i);        figure(2);plot(Clist(temp,2),Clist(temp,3),'-*')        xlabel('x');ylabel('y');        hold on;        start=i+1;        i=i+2;    else        i=i+1;    endendplot(Clist(Citynum+1:Citynum+Stornum,2),Clist(Citynum+1:Citynum+Stornum,3),'or')​%toc

3 仿真结果

4 参考文献

[1]田秋荣, 李仲兴. 基于遗传算法的无时限多配送中心车辆调度问题研究[J]. 商场现代化, 2008(11):2.

博主简介：擅长智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、路径规划、无人机等多种领域的Matlab仿真，相关matlab代码问题可私信交流。

部分理论引用网络文献，若有侵权联系博主删除。