Route between A and B with stations between

Question

i´m obviously missing the forest through the trees ...

i know about the traveling salesman problem, but is there any other algorithm/problem which better fits my needs/description? I need to describe my problem with the help of such a mathematical description.

I have up to five points with known start- and endpoint. So i just need to calculate the shortest way to visit all the three points between that two. Dijkstra and similar algorithms try to find the shortest path between two points, so here they probably won´t visit all points between. Or is there a algorithm which finds shortest way and visit all points between two points?

It's TSP, and a NP-complete problem (although there are some approximation algorithms) — Rafi Kamal, Sep 24 '13 at 19:22
See http://stackoverflow.com/questions/3072809/adding-waypoints-to-a-graph-search — lreeder, Sep 24 '13 at 19:24

NPE · Accepted Answer · 2013-09-24T19:34:31.103

You are overthinking it. There are only six (3*2*1) possible paths through the three intermediate nodes. Just check them all.

For larger instances, you could reduce your problem to the TSP as follows:

If s is the starting node and t is the final node, add a zero-weight edge between s and t and an infinitely-heavy edge between s and every other node, and between t and every other node.

The problem is NP-hard, but is extremely well-researched. There is a plethora of exact and approximate algorithms that you could explore.

Route between A and B with stations between

1 Answers1