@Carl Love 

Thank you. It is solved.

Thank you @Carl Love
Now, it is clear and thank you for the explanation. it is very helpful.
One more question. Is it possible to give the different color for the edges?

Yes, this what I want, thank you very much @tomleslie
One more question. Is it possible to give the different color for the edges?

Yes that one of what I want to achieve. Thank you. It is working @tomleslie
The other target what I want to achieve is the value of x. When I type of any variable of x, let say x[1,4], the output is should be taken from LPSolve. For example, Since in LPSolve, x[1,4]=1, when I type x[1,4], the output is should be 1.

@tomleslie 
Thank you @tomleslie, It is working, but I could not get the value of x. I need the x's for my following constraints.

constr:= seq(y[j]+v[j] = d[j]*(x[i,j],i=N), j = N) for any i,j.

For example
x[1,7]=0, then I have y[7]+v[7] =0.

And anyway, for this part
"ans:=[convert(select( i->has(i,x),[Sol[1][2][],Sol[2][2][]] ),set)[]];"

Assume we have n solution lpsolve, Is there any looping procedure to combine all of them ?.
Of course I can use that code (ans) from your suggestion, but it is manual.
 

Thank you @tomleslie. you are right. I have to use list.

Now I have new problm

Is it possible to combine more than 1 list array? Like the following example

given A:= [1,5,7]

B:[23,56,12]

C:=[1,3]

Then I have

[1,56,1]

[5,12,3]

[7,23,1] and so on.

I have tried to use combinate. But I still have problem.

I am sorry i am not so expert in maple, But I am learning to be expert

@tomleslie 

Thank you for helping @tomleslie. I have tried those ways (your seggestion) but still doesn't work if I generate it for more nodes.
Actually, what I want to achieve is take an order of the solution. As you see in my code, I try to solve TSP by using linear programming nested in loop. I can solve it, but I was stuck in how to bring the solution into a matrix and then take an order from it.

Now, I used another way. I modified code from thread "https://www.mapleprimes.com/questions/220689-How-To-Solve-A-VRP-" and put it in the loop.
But, Honestly, I still curious about how to bring the solution of LPSolve (like in my case) into a matrix and then take an order from it.

So, is it possible to rewrite solution from LPSolve in matrix form in this case?

 

Dear @tomleslie

Try to rerun it. 

It is error since in the clustering part, you get A:=(2, 2,2, 2,p). 

If this happen, try to rerun it the program until There is no variable in A.

If in the part A (for example) you get A=(1,1,2,2,2) the program will be okay and the error only in the looping Matrix X

@Carl Love This one is my code.

Honestly, I am working in CVRP. After clustering by using FCM (Fuzzy Clustering) (using your code), i am going to solve it in TSP way, 1 by 1. In other word, I have to involve looping statement.

And that one is the output.
Hopefully you can help me to fix it in that error

Thank you @Carl Love

Fuzzy_clusters_subtour.mw

Hi @Carl Love 

I need your help again. How to solve the order in the following picture. I got repetition only 1 5 15
Actually, I want to compute the total of capacity of every vertice. Before that, I have to get the vertice. How to get the vertice from r?

Thank you anywayVRPSD2.mw

@Carl Love Thank you anyway for the solution, I have retyped it.

Now I got new problem, the problem is how to force x[i,j] when i=j such that the value = 0.

I have added the constraints for x[2,1],x[3,1],...,x[5,1].

The result is so strange. I get value 1 for x[i,j] when i=j.

This is the worksheet @Carl Love VRPSD1.mw
 

Download VRPSD1.mw

I got problem again, the result is following, to be unbounded. I want to solve system  with 3,4,6,7 and 8 constraints as my master problem for L integer method. Is there any mistake in my code?Hopefully you could help me.

Thank you