Solving a simole TSP(travelling salesman problem) with R

@mgunal

I can write R code to implement one of the heuristics of TSP called nearest neighborhood algorithm. You must define x-y coodrinates and price for each location. From x-y I will first calculate euclidiean distance. Is there a starting point (location)? If there is a starting location then I will assume our vehicle starts from that location and travels to the nearest one. My other question is does the vehicle have a capacty?