|
Title: Brute force traveling salesman Post by: peoplemover on Nov 17, 2022 Explain why using a "brute force" method to identify the shortest route in a traveling salesman problem with 18 cities is problematic.
Title: Re: Brute force traveling salesman Post by: duddy on Nov 17, 2022 I believe that's no different than taking 18!
That amounts to 6.4*10^15 routes; hence, brute force is not practical Title: Re: Brute force traveling salesman Post by: bio_man on Nov 17, 2022 I think you forgot to divide by 2.
\(\frac{n!}{2}\) Title: Re: Brute force traveling salesman Post by: duddy on Nov 17, 2022 Yes, that's the number of route pairs, you divide by n!/2
This is obviously not a practical way, whether it be a computer or a human |