Hello!
I am working on a SPP(set partitioning problem). My problem is to give every each "set"(vector) a cost(aka distance traveled).
To give you a quick briefing. There are eight customer and one depot. Every customer has a demand which needs to be served. Since there are eight customers there are 2^8=256 different combinations of sets. For instance one set could be the vector (1 0 0 0 0 0 1 0)^T. This vector means that in this set the truck is serving customer 1 and customer 8. So the traveling route of this truck is 0(depot)-1-8-0, which gives the distance 41+32+73=146. I need to do this to all 256 vectors, ergo give them a cost. When I have a cost on all different vectors I will use AMPL/CPLEX to generate the cheapest combination of vectors in order to serve all customers but my problem as I said at the moment is to give all of the 256 vectors a "price" (kilometers traveled).
This is my distance matrix
CUst 0 1 2 3 4 5 6 7 8
0 0 41 9 31 56 61 26 48 73
1 41 0 47 32 73 42 22 13 32
2 9 47 0 30 49 61 34 56 79
3 31 32 30 0 41 30 36 45 58
4 56 73 49 41 0 54 74 86 96
5 61 42 61 30 54 0 58 53 48
6 26 22 34 36 74 58 0 24 52
7 48 13 56 45 86 53 24 0 29
8 73 32 76 58 96 48 58 29 0
I think I managed to attach the whole Excel file. If you have any further questions please ask!!
best rgds
Will
Bookmarks