Jump to content

The Solution to the Travelling Salesman Problem

bluemoon7
in Computer Science

Featured Replies

The solution to this problem is not very hard : you just use a combination of two kinds of technique

 

You use a combination of search and non search , the idea is to limit the search to a managable level, a clever technique of limiting the search by using a convex hull is applied, and you do partition the search space in to a set of layered convex hulls where the computation to find the optimisation is done one step at a time,

please see my algorithm description :



or just type NEW ALGORITHM FOR THE TSP in youtube search

 

 

 

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.