【MVRP问题】基于遗传算法求解多配送中心车辆路径规划问题附matlab代码
时间:2022-09-10 11:30:00
1 简介
车辆调度是物流系统优化的关键 的一环 。对配送车辆 科学优化调度,可降低运输成本,提高物流企业的经济效益。根据配送中心的数量。配送车辆的优化调度包括单配送中心的车辆调度和多配送中心的车辆调度 问题之分。目前 .我 国内一些大中型城市 物流系统中有多个配送 中心情况。因此,研究多配送中心的车辆调度具有重要的现实意义。本文提出了解决多配送中心车辆调度问题的策略。采用解决单配送中心车辆调度问题的遗传算法。设计了解决多配送中心车辆调度问题的算法 最后,通过案例计算检验 该算法的证据 良好性能 。
2 部分代码
%遗传算法 VRP 问题 Matlab实现
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%tic%计时器
clear;
clc
%W=80; 每辆车的载重量为%
%Citynum=50; %客户数量
%Stornum=四、%仓库数量
%C 第二三列%% 客户坐标,第四列 客户需求 五一、五二、五三、五四个仓库
%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.八、%交叉比率
Pm=0.三、%变异率
species=Parent;%种群
children=【】;%子代
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
disp('正在运行较长,请稍等...')
g=50;
for generation=1:g
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
tic
fver
end
end
end
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;
end
end
plot(Clist(Citynum 1:Citynum Stornum,2),Clist(Citynum 1:Citynum Stornum,3),'or')
%toc
3 仿真结果
4 参考文献
[1]田秋荣, 李仲兴. 研究基于遗传算法的无限多配送中心车辆调度问题[J]. 商场现代化, 2008(11):2.
博主简介:擅长智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、路径规划、无人机等领域Matlab仿真,相关matlab私信可以交换代码问题。
如些理论引用网络文献,如有侵权联系博主删除。