Sign in to follow this  
Eralp

Travelling Salesman Problem with Convex Hull

Recommended Posts

Hello, I want to implement a TSP solver method with using convex hull. I have been told that convex hulls can be used for this problem, I coded the convex hull creation algorithm and how should I visit the towns inside? I couldn't find any document about this, can anyone push me to the right direction?

Thanks.

Share this post


Link to post
Share on other sites
This [url="http://pami.uwaterloo.ca/%7Emventres/MTE140/a3/Assignment%203.pdf"]seems to describe[/url] one solution.

General strategy is always mostly the same. First, find the hull, then try to connect remaining points.

It does however work just for Euclidean problem, which, if I'm not mistaken, have some better solutions available, although most of them are efficient ways of calculating approximations.

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this