Understanding Transportation and Trans-shipment Problems

Operations Research deals with optimizing resource allocation. Two common problems in this field are the transportation problem and the trans-shipment problem. While they both involve moving goods from supply points to demand points, they differ in their structure and the types of nodes involved.

What is a Transportation Problem?

A standard transportation problem involves minimizing the cost of shipping goods directly from a set of origins (supply points) to a set of destinations (demand points). There are no intermediate stops or transfer points allowed in the basic formulation. In a transportation problem with \(m\) origins and \(n\) destinations:

• There are \(m\) nodes that can only supply goods (sources).
• There are \(n\) nodes that can only receive goods (destinations).
• Goods flow directly from an origin to a destination.

What is a Trans-shipment Problem?

A trans-shipment problem is a variation where goods can flow through intermediate nodes before reaching their final destination. These intermediate nodes are called trans-shipment points. At a trans-shipment point, goods can be received from a source or another trans-shipment point and then reshipped to a destination or another trans-shipment point. This makes the network more flexible.

In a trans-shipment problem, a node can potentially act as:

• A pure source (only supplies).
• A pure destination (only receives).
• A trans-shipment point (can receive and supply).

Converting a Transportation Problem to a Trans-shipment Problem

Any transportation problem can be reformulated as a trans-shipment problem. To do this, we consider all original origins and all original destinations as potential trans-shipment nodes. In the context of the trans-shipment formulation:

• The original \(m\) origins can now potentially supply goods and also receive goods (from themselves or other points if needed in a larger network, though typically they only supply initially in this conversion).
• The original \(n\) destinations can now potentially receive goods and also supply goods (to themselves or other points if needed, though typically they only receive finally).

When converting, all \(m\) origins and all \(n\) destinations become nodes in the new trans-shipment network. Each of these \(m+n\) nodes can now potentially act as both a source and a destination within the framework of a trans-shipment model. This means the model will consider potential flow between any pair of these \(m+n\) nodes (including from a node back to itself, although flow is usually assumed to be non-negative). For the purpose of setting up the trans-shipment problem structure, we need to account for potential shipments originating from any of these \(m+n\) points and potentially arriving at any of these \(m+n\) points.

Therefore, in the converted trans-shipment problem representation:

• The total number of potential sources is the total number of nodes: \(m + n\).
• The total number of potential destinations is the total number of nodes: \(m + n\).

Each of these \(m+n\) nodes can have a supply capacity (if it was an original origin or has inventory) or a demand requirement (if it was an original destination). The model then finds the optimal flow among all these \(m+n\) nodes.

Based on this conversion, a transportation problem with \(m\) origins and \(n\) destinations becomes a trans-shipment problem with \(m+n\) sources and \(m+n\) destinations in terms of the number of nodes that can potentially initiate or receive flow in the general trans-shipment structure.

Analyzing the Options

Let's look at the given options for a transportation problem with \(m\) origins and \(n\) destinations becoming a trans-shipment problem:

1. (m+n) sources and (m+ n) destinations: This matches our understanding that all original origins and destinations become nodes capable of being both sources and destinations in the trans-shipment formulation, leading to \(m+n\) potential sources and \(m+n\) potential destinations.
2. (m+n-1) sources and equal number of destinations: This number arises in some network flow contexts but not typically for the straightforward conversion of a transportation problem to a trans-shipment problem regarding the number of nodes acting as sources/destinations.
3. (m-n) sources and (m-n) destinations: This is incorrect as the number of nodes increases, not decreases, and involves both m and n positively.
4. (m+n-2) sources and (m+n-2) destinations: This number also doesn't align with the standard conversion approach where all original nodes become potential trans-shipment points.

Thus, the correct option is that the problem becomes a trans-shipment problem with \((m+n)\) sources and \((m+n)\) destinations.

Revision Table: Transportation vs. Trans-shipment

Additional Information: Nodes in Trans-shipment Problems

In a general trans-shipment problem, the nodes can be categorized based on their net flow:

• Pure Source Nodes: Nodes with a net outflow (supply > demand).
• Pure Destination Nodes: Nodes with a net inflow (demand > supply).
• Trans-shipment Nodes: Nodes where inflow equals outflow (supply = demand at the node itself, although they act as conduits). These nodes can receive from other nodes and send to other nodes.

When converting a transportation problem, the original origins are like pure sources (initially), and original destinations are like pure destinations (finally). However, in the trans-shipment model structure, links can exist between any pair of the \(m+n\) nodes, allowing intermediate flow, making all of them potential trans-shipment points depending on the optimal solution.