OFSTF Method- An Optimal Solution for Transportation Problem

To manage the unbalance between the needs in expensive containers (such as refrigerated containers or 'reefers') in some places, and the fact that the available empty containers of this kind are in another place, it is necessary to move these empty containers efficiently between places. In this paper, we use the empty carriers during their return trips after a delivery, to move the empty containers from the locations where they are, to the locations were they are needed. First, we use a method based on the Stepping Stone algorithm to compute a minimal cost list of moves in the associated transportation problem. Second, we use a heuristic to choose carriers during their return trips, and compute low cost possible path deviations that needed to accomplish these moves. A numerical example is presented at the end.

show abstract

“…• The Stepping-Stone [2] method is very old, so newer versions that are more efficient can be used [12].…”

Section: Discussionmentioning

confidence: 99%

Studying the Rerouting of Empty Carriers during their Return Trips to Manage Rare Mobile Resources in a Physical Internet

Nakechbandi

Colin

2020

2020 5th International Conference on Logistics Operations Management (GOL)

View full text Add to dashboard Cite

show abstract

“…Step 5: Here the Maximum cost is 10 in (3, 1) is a Pivot Element in the table 1.5; it is highlighted with Violet Colour. Supply the maximum possible supply 85 units in (3, 1) and 5 units in (3,4) which leads to the solution satisfying all the conditions.…”

Section: Table 14mentioning

confidence: 99%

Right Maximum Minimum Budget Ultimate Procedure for Protected and Crazy Rectangular Network

B.Mahalakshmi¹

2021

TURCOMAT

View full text Add to dashboard Cite

show abstract

“…The discrepancies in managing logistics can be resolved by a unique kind of linear programming problem [5]. The solution for the discrepancies can be aimed at bringing down/diminishing the exceeding revenue expenses in logistics that are related to transportation of goods.…”

Section: Introductionmentioning

confidence: 99%

Optimization of VAM as Pattern – Connected Edge Weighed Graph

Et. al.

2021

TURCOMAT

View full text Add to dashboard Cite

The main objective of this approach is to find the optimal cost of the transportation grid in Balanced and unbalanced ways of the TPM derived from the edge weighted connected non-complete graph. The proposed approach of this article is in a particular path representation of the given transportation problem to ensure the Optimal Basic Feasible Solution by Vogel’s Approximation Method for the derived TPM from the edge weighted connected non-complete graph. Optimal Basic Feasible Solution is also provided with the existed methods in operation research field with particular pattern at some extent

show abstract

OFSTF Method- An Optimal Solution for Transportation Problem

Cited by 13 publications

References 0 publications

Studying the Rerouting of Empty Carriers during their Return Trips to Manage Rare Mobile Resources in a Physical Internet

Studying the Rerouting of Empty Carriers during their Return Trips to Manage Rare Mobile Resources in a Physical Internet

Right Maximum Minimum Budget Ultimate Procedure for Protected and Crazy Rectangular Network

Optimization of VAM as Pattern – Connected Edge Weighed Graph

Contact Info

Product

Resources

About