Travelling salesman algorithm in Java Fork/Join Framework

CostX and CostY – are the axle weight.

E.g .: maximum axis velocity of the robot.

An edge is calculated by the TSPAction class. The recursive function returns no results , so TSPAction inherits the RecursiveAction class. You just have to implement the function TSPAction.compute ( ) , which is responsible for the whole logic and heuristics.

Heuristics:

  • the getNextNearestPoint function selects the minimal weighted, adjacent edge to the next available node (local free points list ) .
  • in lines 19-23 the path with the minimal weight is searched first . All longer pathes are thrown away ( lines 4-7 )

This is how it looks like in real life:

If you have found a spelling error, please, notify us by selecting that text and pressing Ctrl+Enter.

You may also like...

1 Response

  1. home page says:

    I have been exploring for a little bit for any high-quality articles or weblog posts on this kind of area . Exploring in Yahoo I finally stumbled upon this website. Studying this info So i am happy to express that I have a very good uncanny feeling I found out just what I needed. I most indubitably will make sure to do not put out of your mind this web site and provides it a glance on a constant basis.

Spelling error report

The following text will be sent to our editors: