On Sharma-Swarup algorithm for time minimising transportation problems

Seshan, C. R.; Tikekar, V. G.

doi:10.1007/bf02837265

Cited by 13 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TP has been paid much attention to and classified into several types of transmutations since it was first proposed by Hitchcock [1]. In the recent past, TP with a different single objective to minimize the duration of a transportation has been studied by many researchers such as Sharma and Swarup [13], Seshan and Tikekar [12], Prakash [7], Papamanthou [5], Sonia [15], Sonia et al [14] etc. TP with multiple objectives has also been discussed by Prakash [6], Purushotam et al [11], Prakash et al [8] etc.…”

Section: Introductionmentioning

confidence: 98%

An efficient heuristic for multi-objective bulk transportation problem

Prakash¹,

Sharma

Singh

2009

2009 International Conference on Computers &Amp; Industrial Engineering

View full text Add to dashboard Cite

A cost-time trade-off bulk transportation problem (BTP) with the objectives to minimize the total cost and duration of the bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from a single source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. The Extremum Difference Method (EDM) is applied to obtain the set of Pareto optimal solutions of this problem. This work provides an alternate procedure to obtain the solutions obtained by Prakash et al. [9].

show abstract

Section: Introductionmentioning

confidence: 98%

An efficient heuristic for multi-objective bulk transportation problem

Prakash¹,

Sharma

Singh

2009

2009 International Conference on Computers &Amp; Industrial Engineering

View full text Add to dashboard Cite

show abstract

“…The aim is to find the minimum cost routing of products from supply point to destination, this problem is widely known as the cost minimizing transportation problem. The transportation problem with a single objective to minimize the duration of transportation has been studied in detail by many researchers [19]- [22]. And also with multiple objectives has been discussed in [15]- [17].…”

Section: Introductionmentioning

confidence: 99%

A method for solving bi-objective transportation problem under fuzzy environment

Singh¹,

Singh²

2022

Meta-Heuristic Optimization Techniques

View full text Add to dashboard Cite

A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem.

show abstract

“…Transportation problem is one of the fundamental problems of network flow problem which is usually use to minimize the transportation cost for industries with number of sources and number of destination while satisfying the supply limit and demand requirement. In the recent past, Transportation problem with a different single objective to minimize the duration of transportation has been studied by many researchers such as Sharma and Swarup [2007], Sonia et al [2008], Seshan and Tikekar [2010] and Prakash and Papmanthou [2012].…”

Section: Introductionmentioning

confidence: 99%

Application of Linear Programming to Minimize Transportation Cost in Nigeria Breweries Plc, Ibadan, Oyo State, Nigeria

A.S.¹,

O.A.²,

J.A.³

et al. 2022

African Journal of Mathematics and Statistics Studies

View full text Add to dashboard Cite

This research paper work analyzed the transportation cost of Nigeria Breweries Plc, Ibadan in Oyo State in relation to the units of its products demanded at the various deports and the capacity of the factories. Five origins which are Ibadan, Osogbo, Ikeja, Oyo and Ondo as well as twelve destinations (warehouses): Gbagi, Dugbe, Oje, Ikorodu, Mowe, Ife, Ilesa, Iseyin, Ogbomosho, Owode, Akure and Ore were examined. The data also include the requirements at each destination and capacity at each source. The costs represent the average transportation cost from June to December 2019. Initial feasible solution was obtained for the secondary data collected by using North-West corner Method, and Vogel Approximation Method. The result of the analysis showed that the allocations of Vogel Approximation Method will give the optimal transportation cost of the company and is recommended to the company for reduction in transportation with a minimum transportation cost of ₦1,168,431.

show abstract

On Sharma-Swarup algorithm for time minimising transportation problems

Cited by 13 publications

References 5 publications

An efficient heuristic for multi-objective bulk transportation problem

An efficient heuristic for multi-objective bulk transportation problem

A method for solving bi-objective transportation problem under fuzzy environment

Application of Linear Programming to Minimize Transportation Cost in Nigeria Breweries Plc, Ibadan, Oyo State, Nigeria

Contact Info

Product

Resources

About