traveling-salesman - w3toppers.com

What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?

I’ve found the answer to my question in this book. It is the same with Computer wiring problem which occurs repeatedly in the design of computers and other digital systems. The purpose is to minimize the total wire length. So, it is indeed a minimum length Hamiltonian path. What the book suggests is to create … Read more

Travelling Salesman with multiple salesmen?

TSP is a difficult problem. Multi-TSP is probably much worse. I’m not sure you can find good solutions with ad-hoc methods like this. Have you tried meta-heuristic methods ? I’d try using the Cross Entropy method first : it shouldn’t be too hard to use it for your problem. Otherwise look for Generic Algorithms, Ant … Read more