China
Africa
Explore chapters and articles related to this topic
Modeling for Project Optimization
Published in Adedeji B. Badiru, Project Management, 2019
The transshipment problem is a general model of the transportation problem. In this model, there can be pure sources, pure destinations, and transshipment points that can serve as both sources and destinations. It is possible for any source or destination to ship to any other source or destination. Thus, there may be many different ways of shipping from point i to point j in addition to the direct route. In the transportation problem, the way in which units are distributed from source i to destination j must be known in advance so that the corresponding cost per unit, cij, can be determined ahead of time. In the transshipment problem, units may go through intermediate points that offer lower total shipment cost. For example, instead of shipping units directly from source 2 to destination 3, it may be cheaper to include the units going to destination 3 with the units going to destination 4 and then ship those units from destination 4, which now serves as a source, to destination 3. A mathematical formulation of the transshipment problem is as follows. Let xij be the amount shipped from point i to point j, i, j = 1, 2,…, n; i ≠jcij be the cost of shipping from point i to point j, cij ≥ 0ri be the net requirement at point i (negative for demand point, positive for supply point)
Transshipment problems
Published in V. K. Balakrishnan, Network Optimization, 2019
Thus we have a constrained linear optimization problem (involving a linear objective function of m nonnegative variables and a set of n − 1 linear equality constraints) which is a special case of a standard linear programming (LP) problem. A powerful and popular algorithm to solve the LP problem is the simplex method of Dantzig (1963). In this chapter we develop a network-based specialization of the simplex method, known as the network simplex method, to solve the transshipment problem.
Network Analysis
Published in Michael W. Carter, Camille C. Price, Ghaith Rabadi, Operations Research, 2018
Michael W. Carter, Camille C. Price, Ghaith Rabadi
Most introductory textbooks that describe the transshipment problem, explain how it can be modeled as an expanded transportation problem with dummy demands and supplies for each intermediate node. The two models are, in fact, equivalent. And although that approach will work for small problems, it is not recommended for any applications of practical size.
Allocation flexibility for agribusiness supply chains under market demand disruption
Published in International Journal of Production Research, 2018
G. Behzadi, M.J. O’Sullivan, T.L. Olsen, A. Zhang
This subsection develops a two-stage SP model for analysing the usefulness of allocation flexibility for mitigating demand disruption risk. The problem is modelled as a transshipment problem to allow the utilisation of a flexible rerouting strategy. Note that the flexible rerouting strategy is important in our problem when a demand disruption occurs and some products are still in transit to the disrupted market. The flexible rerouting strategy enables in-transit commodities to be rerouted from an intermediary node depending on the type and severity of the disruption. The involved supply chain network is generated according to the network generation algorithm provided in Section 3.3.
Mining fleet management systems: a review of models and algorithms
Published in International Journal of Mining, Reclamation and Environment, 2019
Ali Moradi Afrapoli, Hooman Askari-Nasab
In dispatching procedure, it is recommended to implement a transshipment problem strategy instead of transportation or assignment approaches. In a transshipment problem, in addition to supplier and demand points, there exist transshipment points through which materials are transported from suppliers to demand points. In mining, system stockpiles or intersection nodes in the network can be assumed as transshipment points.