An efficient heuristic to obtain a better initial feasible solution to the transportation problem

Juman, Z. A. M. S.; Hoque, M. A.

doi:10.1016/j.asoc.2015.05.009

Cited by 54 publications

(27 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several methods to obtain IFS. Among them, Vogel's Approximation Method (1958) and JHM Solution algorithm (2015) can be considered as a state of the art initial solution providers available in the literature (refer to Juman and Hoque, 2015). In this research, a new alternative method is developed to attain an efficient initial feasible solution to the transportation problems.…”

Section: Resultsmentioning

confidence: 99%

See 2 more Smart Citations

An efficient alternative approach to solve a transportation problem

Juman¹,

Nawarathne²

2019

Ceylon J. Sci.

View full text Add to dashboard Cite

Determination of an Initial Feasible Solution (IFS) to a transportation problem plays an important role in obtaining a minimal total transportation cost solution. Better initial feasible solution can result less number of iterations in attaining the minimal total cost solution. Recently, an efficient method denoted by JHM (Juman and Hoque's Method) was proposed to obtain a better initial feasible solution to a transportation problem. In JHM only column penalties are considered. In this paper, a new approach is proposed with row penalties to find an IFS to a transportation problem. The new method is illustrated with a numerical example. A comparative study on a set of benchmark instances shows that the new method provides the same or better initial feasible solution to all the problems except one. Thus, our new method can be considered as an alternative technique of attaining an initial feasible solution to a transportation problem.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Percentage decreases in total cost for IFS by NM over VAM and JHM 7 benchmark instances fromJuman and Hoque (2015).…”

mentioning

confidence: 99%

See 1 more Smart Citation

An efficient alternative approach to solve a transportation problem

Juman¹,

Nawarathne²

2019

Ceylon J. Sci.

View full text Add to dashboard Cite

show abstract

“…Thus the best primal based methods solve un-capacitated min cost flow problem in O(n 3 log (n)). Recently Juman [5] has presented a heuristic with O(n 3 ) running time to solve un-capacitated transportation problem, and is shown to perform better than VAM.…”

Section: Introductionmentioning

confidence: 99%

Dual Based Procedures for Un-Capacitated Minimum Cost Flow Problem

Sinha¹,

Sharma²

2016

AJOR

View full text Add to dashboard Cite

In this article, we devise two dual based methods for obtaining very good solution to a single stage un-capacitated minimum cost flow problem. These methods are an improvement to the methods already developed by Sharma and Saxena [1]. We further develop a method to extract a very good primal solution from a given dual solution. We later demonstrate the efficacies and the significance of these methods on 150 random problems.

show abstract

“…Hence, best primal based approach solves the transshipment problem with the time complexity of O (n 3 log (n)). Recently Juman and Hoque [6] have proposed an efficient heuristic with O (n 3 ) running time to solve uncapacitated balanced transportation problem. Performance of this heuristic is better than Vogel's Approximation Method (VAM), which is one of the most popular primal based methods to obtain a very good initial basic feasible solution.…”

Section: Introductionmentioning

confidence: 99%

Efficient Heuristic Based Methods for Two-Stage Transshipment Problem

Sinha¹,

Sharma²

2018

AJOR

View full text Add to dashboard Cite

In this article, we propose efficient methods for solving two stage transshipment problems. Transshipment problem is the special case of Minimum cost flow problem in which arc capacities are infinite. We start by proposing a novel problem formulation for a two stage transshipment problem. Later, special structure of our problem formulation is utilized to devise two dual based heuristics solutions with computational complexity of O (n 2 ), and O (n 3 ) respectively. These methods are motivated by the methods developed by Sharma and Saxena [1], Sinha and Sharma [2]. Our methods differ in the initialization and the subsequent variation of the dual variables associated with the transshipment nodes along the shortest path. Lastly, a method is proposed to extract a very good primal solution from the given dual solutions with a computational complexity of O (n 2 ). Efficacy of these methods is demonstrated by our numerical analysis on 200 random problems.

show abstract

An efficient heuristic to obtain a better initial feasible solution to the transportation problem

Cited by 54 publications

References 33 publications

An efficient alternative approach to solve a transportation problem

An efficient alternative approach to solve a transportation problem

Dual Based Procedures for Un-Capacitated Minimum Cost Flow Problem

Efficient Heuristic Based Methods for Two-Stage Transshipment Problem

Contact Info

Product

Resources

About