Route optimization or trip optimization is known as a storage or retrieval strategy. It does not take into account any variables that are dependent on items or storage units, but calculates the shortest possible or otherwise optimal route. The problem of calculating the shortest path is also known as the traveling salesman problem. See also Branch and Bound, Greedy method, Meander heuristic, Largest-Gap heuristic. Cf. milk run, route optimization.

Source: logipedia / Fraunhofer IML