Time minimizing transshipment problem
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.
- The dynamic transshipment problem
- Capacitated two-stage time minimization transportation problem
- scientific article; zbMATH DE number 1221857 (Why is no real title available?)
- scientific article; zbMATH DE number 2099673 (Why is no real title available?)
- scientific article; zbMATH DE number 911855 (Why is no real title available?)
- An improvement to one's BCM for the balanced and unbalanced transshipment problems by using fuzzy numbers
- Multi-index fixed charge bi-criterion transshipment problem
- Total time minimizing transportation problem
- Three-phase time minimization transportation problem
- A technique to solve transshipment problem with asymmetric pentagonal fuzzy numbers
This page was built for publication: Time minimizing transshipment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061614)
