Hi, I've been reading up a bit on the shortest path problem in graph theory and was wondering if the problem I'm trying to solve is a variation of the same graph theory problem.(adsbygoogle = window.adsbygoogle || []).push({});

Say you have a grid of vertices and edges representing aisles and cross-aisles in a warehouse. In a standard picking problem, you will have to go and pick items up in various locations throughout the warehouse.

The algorithm that I found is for single pair shortest path meaning that there is one source and one goal. Am I right in thinking that what I need is an algorithm that takes a single source with multiple goals (pick locations) and then finds the shortest path from the source that goes through all the goals? Is there such an algorithm?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Shortest path problem with multiple goals on a grid

Loading...

Similar Threads - Shortest path problem | Date |
---|---|

I Finding shortest distance between skew lines, checking work. | Aug 4, 2016 |

A check: shortest distance from point to line | Jan 19, 2016 |

Proof the shortest path on a sphere is the great circle. | May 10, 2015 |

Certifying shortest vector in a lattice | Jul 17, 2010 |

Shortest path on dynamic graph | Mar 17, 2008 |

**Physics Forums - The Fusion of Science and Community**