@vv 

What is the role of the node 0? I have replaced node 0 with 1, since as you previously point out 0 is not indexable in a matrix.
- Is it in N? in C? N={1..9}
- What is c[0, j]  ?   Or is it not defined/necessary? I see you are reading this from the .dk insert. c is the distance matrix. I made it c[1,j] for my problem,
- Are (some) (0,j), (i,0) in A? I have changed it to  (1,j), (i,1).

I have reposted the problem (with proper question and answers supplied) at

http://www.mapleprimes.com/questions/220689-How-To-Solve-A-VRP-

@Carl Love thanks for your efforts on my problem.

I wonder if using the DataFrame structure, the 6th index only could be displayed ( minimum of +tour dists which in this case is 98), so it displays [6,[[1,2,3,4,5]],[98],98,[85],85]]] . At the moment I have to guess the range where the mimima of +tour dists is.

I tried

MM[min(MM[`+tour dists`])];

AND/OR

given

MM[MM[`+tour dists`] >=~ 90 and MM[`+tour dists`] <=~ 120];

sort the resulting output in Ascending order of `+tour dists' ie  [6,[[1,2,3,4,5]],[98],98,[85],85]]] is at the top. Thankyou

PS I'm aware if I right click on the DataFrame output I can get Data Manipulation menu, but it doesnt quite do what I want....

@Carl Love Sorry to bother you. I tried to do add an uneven length list but I got this error. I hope you can fix it

Tours_CL_between.mw

@Carl Love thanks, I'll examine it tomorrow. It's bedtime in the antipodes.

@Carl Love Thankyou, it works perfectly. How do you do it?!

This is to reflect that changing the order of the nodes changes the distance traversed. from my previous post:

tour_length([1,2,3,4]),tour_length([1,2,4,3]),tour_length([1,3,2,4])=85,88,73

inspired by:

http://www.mapleprimes.com/questions/220689-How-To-Solve-A-VRP-

where I was unable to write the ILP constraints properly. Hence my need for the sledgehammer exhaustive approach above. With the new distance matrix:

VRP_IP_DC1.mw

You can be the first to answer this question!

@Carl Love thanks for your effort.

Sorry to bug you further. How do I return the row numbers of the matrix <LimitDist(56)[]>;

[[1, 4], [1, 5], [1, 2, 3]] = inds 4

@tomleslieJust what I wanted! I salute you Sir and Carl Love too.

BTW this problem is inspired by an earlier unanswered question,

http://www.mapleprimes.com/questions/220689-How-To-Solve-A-VRP-

where I was unable to write the ILP constraints properly. Hence my need for the sledgehammer approach above.

@rlopez the OP asked specifically about output of Std. Error w.r.t. NonlinearFit.

 "the summarize option is not available when the model expression is not linear in the parameters"

only

?LinearFit

The summarize option returns a summary for the regression:

Edit.
 

@SamuelPita well where is the text or .mw file? Solving 5 equations for 5 unknowns should work...

Try substituting sin for "sen".

I saw this problem a while back on http://www.qbyte.org/puzzles/p004s.html but I couldn't understand their explanation.

I like your explantion better.

using the big green arrow. no-one here is masochistic enough to transribe code from a picture.

@vv how did you derive the expressions for R and d?

@Kitonum . Code with annotations too, bonus!

@tomleslie thanks. And vv.