Jump to content

bluemoon7

New Members
  • Posts

    1
  • Joined

  • Last visited

bluemoon7's Achievements

Lepton

Lepton (1/13)

0

Reputation

  1. 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
×
×
  • Create New...

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.