We view each storage area to be scanned as a vertex
in a complete graph (the reader can move to any storage area),
and then find the minimum-weight Hamiltonian cycle in the
graph.
Suppose that vertex i, vi, has predetermined entry and
exit where the reader enters and leaves vi.