More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions

Kavita Gupta () and Ritu Arora ()
Additional contact information
Kavita Gupta: University of Delhi
Ritu Arora: University of Delhi

OPSEARCH, 2017, vol. 54, issue 3, No 2, 460-474

Abstract: Abstract In this paper, an algorithm is developed which determines the minimum per unit transportation cost in a capacitated transportation problem with bounds on rim conditions. At first level, a related transportation problem is formulated to find the minimum cost of transporting goods from different sources to different destinations in a capacitated transportation problem. Then, a unit transportation cost problem subjected to same set of constraints is constructed. Then the optimal solution to this new problem is found which provides a transportation schedule such that its unit shipping cost is less and total number of items shipped is more than the optimal solution of the initial capacitated transportation problem. A real life market situation is considered to illustrate the proposed algorithm.

Keywords: Capacitated; Transportation problem; Optimal solution; Feasible solution; Unit transportation cost; More for less method; MSC 90C08; MSC 90B06 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-016-0288-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:54:y:2017:i:3:d:10.1007_s12597-016-0288-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-016-0288-z

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().