A vertex ranking algorithm for the fixed-charge transportation problem

S. Sadagopan, A. Ravindran

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported, and a variable cost, proportional to the amount shipped. In this paper, we propose an efficient algorithm for solving the fixed-charged transportation problem, based on Murty's extreme point ranking scheme. An improved lower bound on the fixed costs developed in the paper and dynamic updating of upper bound on linear costs and ranking limits are demonstrated to improve the computational requirements of Murty's scheme significantly. The ideas developed are illustrated with the aid of an example. Finally, a stopping criterion with an ∈-optimum solution is introduced using Balinski's approximation scheme.

Original languageEnglish (US)
Pages (from-to)221-230
Number of pages10
JournalJournal of Optimization Theory and Applications
Volume37
Issue number2
DOIs
StatePublished - Jun 1982

Fingerprint

Transportation charges
Transportation Problem
Ranking
Charge
Costs
Vertex of a graph
Stopping Criterion
Extreme Points
Approximation Scheme
Updating
Efficient Algorithms
Directly proportional
Transportation problem
Fixed charge
Fixed costs
Lower bound
Upper bound
Requirements
Variable cost
Transportation costs

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research

Cite this

@article{14b7c5c6a7024d96abe98c812d30a7ec,
title = "A vertex ranking algorithm for the fixed-charge transportation problem",
abstract = "In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported, and a variable cost, proportional to the amount shipped. In this paper, we propose an efficient algorithm for solving the fixed-charged transportation problem, based on Murty's extreme point ranking scheme. An improved lower bound on the fixed costs developed in the paper and dynamic updating of upper bound on linear costs and ranking limits are demonstrated to improve the computational requirements of Murty's scheme significantly. The ideas developed are illustrated with the aid of an example. Finally, a stopping criterion with an ∈-optimum solution is introduced using Balinski's approximation scheme.",
author = "S. Sadagopan and A. Ravindran",
year = "1982",
month = "6",
doi = "10.1007/BF00934768",
language = "English (US)",
volume = "37",
pages = "221--230",
journal = "Journal of Optimization Theory and Applications",
issn = "0022-3239",
publisher = "Springer New York",
number = "2",

}

A vertex ranking algorithm for the fixed-charge transportation problem. / Sadagopan, S.; Ravindran, A.

In: Journal of Optimization Theory and Applications, Vol. 37, No. 2, 06.1982, p. 221-230.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A vertex ranking algorithm for the fixed-charge transportation problem

AU - Sadagopan, S.

AU - Ravindran, A.

PY - 1982/6

Y1 - 1982/6

N2 - In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported, and a variable cost, proportional to the amount shipped. In this paper, we propose an efficient algorithm for solving the fixed-charged transportation problem, based on Murty's extreme point ranking scheme. An improved lower bound on the fixed costs developed in the paper and dynamic updating of upper bound on linear costs and ranking limits are demonstrated to improve the computational requirements of Murty's scheme significantly. The ideas developed are illustrated with the aid of an example. Finally, a stopping criterion with an ∈-optimum solution is introduced using Balinski's approximation scheme.

AB - In many distribution problems, the transportation cost consists of a fixed cost, independent of the amount transported, and a variable cost, proportional to the amount shipped. In this paper, we propose an efficient algorithm for solving the fixed-charged transportation problem, based on Murty's extreme point ranking scheme. An improved lower bound on the fixed costs developed in the paper and dynamic updating of upper bound on linear costs and ranking limits are demonstrated to improve the computational requirements of Murty's scheme significantly. The ideas developed are illustrated with the aid of an example. Finally, a stopping criterion with an ∈-optimum solution is introduced using Balinski's approximation scheme.

UR - http://www.scopus.com/inward/record.url?scp=0020145697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020145697&partnerID=8YFLogxK

U2 - 10.1007/BF00934768

DO - 10.1007/BF00934768

M3 - Article

AN - SCOPUS:0020145697

VL - 37

SP - 221

EP - 230

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

SN - 0022-3239

IS - 2

ER -