Decode Function for Vehicle Routing Problem with Constraints

% 鍑芥暟鍚嶄笉鍒犻櫎鐩墠鐨勫嚑涓殢渚垮姞鐨勩€?
function [VC, NV, TD, violate_num, violate_cus] = decode(chrom, customer_number, a, b, L, service_time, dist)
  violate_num = 0;
  violate_cus = 0;
  VC = cell (customer_number, 1);
  count = 1;
  % 閫夊彇鏈?悗鐨勫嚑涓偣锛屼綔涓哄垎鍓蹭綅缃?  % 鏈?悗鍑犱釜浣嶇疆鏄殢渚垮姞鐨勶紝鍦╟hange.m涓?  
  location0 = find(chrom > customer_number); % 鎵惧埌杩欏嚑涓殢渚垮姞鐨勭偣
  for i = 1:length(location0)
    if i == 1
      % create a new route, include the number of depot
      route = chrom(1:location0(i));
      % delete the number of depot at the end
      route(route == chrom(location0(i))) = [];
    else
      route = chrom(location0(i - 1):location0(i));
      route(route == chrom(location0(i - 1))) = [];
      route(route == chrom(location0(i))) = [];
    end
    VC{count} = route; % add the route to set
    count = count + 1;
  end
  % for the last route
  if isempty(location0)
      route = chrom;
  else
      route = chrom(location0(end) : end);
      route(route == chrom(location0(end))) = [];
  end
  VC{count} = route;
  % delete empty routes, and get the number of vehicles
  [VC,NV]=deleteEmptyRoutes(VC);          
  for j=1:NV
    route = cell(1,1);                                
    route{1} = VC{j}; % pick up one route
    % check the violated 
    flag = Judge(route,a,b,L,service_time,dist);
    if flag == 1
        % if one customer in this route is violated, then all customer in
        % this route is violated
        violate_cus = violate_cus + length(route{1});   
        violate_num = violate_num + 1;                  
    end
  end
  TD=travel_distance(VC,dist);                        

end

% 鍑芥暟鍚嶄笉鍒犻櫎鐩墠鐨勫嚑涓殢渚垮姞鐨勩€?
function [VC,NV]=deleteEmptyRoutes(VC)
  NV = length(VC);
  i = 1;
  while i <= NV
    if isempty(VC{i})
      VC(i) = [];
      NV = NV - 1;
    else
      i = i + 1;
    end
  end
end

% 鏃犲嚭depot鐨勫嵆婧愶紝鍔犲叆鎸囧畾绾跨▼鐨勬暟鎹? 
function [dist] = add_depot(dist, customer_number)
  dist = [dist(1:customer_number),zeros(1,customer_number);zeros(1,customer_number+1)];
end

% 鐢熸垚鐐圭殑璺濈鏁?
function [dist] = generate_distance(customer_number,a,b)
  dist = zeros(customer_number,customer_number);
  for i = 1:customer_number
    for j = i+1:customer_number
      dist(i,j) = sqrt((a(i)-a(j))^2+(b(i)-b(j))^2);
      dist(j,i) = dist(i,j);
    end
  end
end

% 鏌ヨ鏄惁瓒呭嚭璺濈闂撮殧
function [flag] = Judge(route,a,b,L,service_time,dist)
  flag = 0;
  cus_num = length(route{1});
  t = 0;
  for i = 1:cus_num
    t = t + dist(route{1}(i),route{1}(i+1)) + service_time(route{1}(i+1));
    if t > L(route{1}(i+1))
      flag = 1;
      break;
    end
  end
end

% 鐢熸垚鏃犲嚭depot鐨勬暟瀛?
function [service_time] = generate_service_time(customer_number)
  service_time = zeros(1,customer_number+1);
  service_time(2:end) = randperm(10,customer_number)+10;
end

% 鑾峰彇璺濈璺濈
function [TD] = travel_distance(VC,dist)
  NV = length(VC);
  TD = 0;
  for i=1:NV
    route = VC{i};
    cus_num = length(route);
    for j=1:cus_num+1
      if j == 1
        TD = TD + dist(1,route(j));
      elseif j == cus_num+1
        TD = TD + dist(route(j-1),1);
      else
        TD = TD + dist(route(j-1),route(j));
      end
    end
  end
end