Do we have a math guru here?

For a single traveling salesman, the calculation is easy: (N-1)! / 2

/2 becaues X,A,B,C,XX,A,B,C,X; X,C,B,A,XX,C,B,A,X are considered as "the same"

Now, I have 5 Technicians that must visit 10 customers each. Above is 1 tech visiting.

How do I figure out this? I need to prove a machine is better than a human.

Disregarding time windows:

Number of techs to exponent (N-1)!/2 ?

I'm lost - brain freeze.

https://en.wikipedia.org/wiki/Vehicle_routing_problem

https://en.wikipedia.org/wiki/Travel...lesman_problem

For a single traveling salesman, the calculation is easy: (N-1)! / 2

/2 becaues X,A,B,C,XX,A,B,C,X; X,C,B,A,XX,C,B,A,X are considered as "the same"

Now, I have 5 Technicians that must visit 10 customers each. Above is 1 tech visiting.

How do I figure out this? I need to prove a machine is better than a human.

*If there are 12 cities to visit, how many possible routes are?*

Are there (11*10*9*8*7*6*5*4*3*2*1)/2 = 19,958,400 routes?Are there (11*10*9*8*7*6*5*4*3*2*1)/2 = 19,958,400 routes?

Disregarding time windows:

Number of techs to exponent (N-1)!/2 ?

I'm lost - brain freeze.

https://en.wikipedia.org/wiki/Vehicle_routing_problem

https://en.wikipedia.org/wiki/Travel...lesman_problem

Last edited: