Time minimizing transshipment problem (Q1061614)

The paper presents a two-phase computational procedure to solve the problem of minimizing the duration of transportation with transshipment, between m origins and n destinations. In the first phase, a set of \(m\cdot n\) problems, each seeking to determine the minimum time routing from an origin to a destination through \((m+n-2)\) intermediate nodes is solved. In the second phase, a time minimizing transportation problem involving m origins and n destinations, without transshipment, is solved. A \(2\times 3\) numerical problem is also solved by the proposed method.