%-----------------------------------------------------------------------------%
% Vehicle Routing problem
% very simple hand-made problem
%-----------------------------------------------------------------------------%

N = 7;
Capacity = 6;
Demand = [4,1,5,2,2,4,3];

Distance = [| 0, 5, 3, 2, 6, 4, 1, 5
            | 5, 0, 4, 3, 7, 6, 4, 6
            | 3, 4, 0, 2, 1, 3, 8, 3
            | 2, 3, 2, 0, 5, 7, 2, 3
            | 6, 7, 1, 5, 0, 7, 1, 4
            | 4, 6, 3, 7, 7, 0, 8, 7
            | 1, 4, 8, 2, 1, 8, 0, 2
            | 5, 6, 3, 3, 4, 7, 2, 0
            |];