This allows users to define temporal, spatial, and destination constraints which have to hold for single items.
We consider a generalization of the standard transshipment model in which the origin and destination constraints take not only the equality form but also of inequality.
In case of an unbalanced transportation problem, the total availability is not equal to total demand, thus some of the source and/or destination constraints are satisfied as inequalities.
If in a given problem, the total availability ( {displaystyle sum_{i=1}^{m+n}{a}_i} ) is not equal to the total demand ( {displaystyle sum_{j=1}^{m+n}{b}_j} ), then some of the source and/or destination constraints are satisfied as inequalities.
The author has considered generalization of the standard transshipment model in which the origin and destination constraints take not only the equality form but also of inequality which is not covered in literature.
Similar to the single destination case, constraints (12), (13), (14), and (15) specify legitimate per-destination traffic flow on all links, relay nodes, source nodes, and destinations.
State efforts to control movement across borders effectively confine irregular migrants to the territory of the destination country; this constraint on physical mobility entails the progressive attenuation of the social ties that nourish cross-border engagement (Waldinger, 2008, 2015).
While the second is optimal path selection mechanism, which is designed to route a single path from the new "source" to the new "destination" under the constraints of Problem 1 and nodes independence.
Constraint (15) ensures only one path exists between any source and destination pair in, and constraint (16) guarantees that the flow will be routed along the path.
The network was optimized using MMSE criterion at the destination subject to power constraint on relays.
