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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hirsch, W. M., andDantzig, G. B.,The Fixed Charge Problem, The Rand Corporation, Report No. RM-1383, 1954.
Balinski, M. L.,Fixed Cost Transportation Problems, Naval Research Logistics Quarterly, Vol. 8, No. 1, 1961.
Kuhn, H. W., andBaumol, W. J.,An Approximation Algorithm for the Fixed Charge Transportation Problem, Naval Research Logistics Quarterly, Vol. 9, No. 1, 1962.
Cooper, L., andDrebes, C.,An Approximate Solution Method for the Fixed Charge Problem, Naval Research Logistics Quarterly, Vol. 14, No. 1, 1967.
Denzler, D. R.,An Approximate Algorithm for the Fixed Charge Problem, Naval Research Logistics Quarterly, Vol. 16, No. 3, 1969.
Steinberg, D. I.,The Fixed Charge Problem, Naval Research Logistics Quarterly, Vol. 17, No. 2, 1970.
Walker, W. E.,A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem, Management Science, Vol. 22, No. 5, 1976.
Murty, K. G.,Solving the Fixed Charge Problem by Ranking the Extreme Points, Operations Research, Vol. 16, pp. 268–279, 1968.
Gray, P.,Exact Solution to the Fixed Charge Problem, Operations Research, Vol. 19, pp. 1529–1538, 1971.
Kennington, J.,The Fixed Charge Transportation Problem: A Computational Study with a Branch-and-Bound Code, AIIE Transactions, Vol. 8, No. 2, 1976.
Kennington, J., andUnger, E.,A New Branch-and-Bound Algorithm for the Fixed Charge Transportation Problem, Management Science, Vol. 22, No. 10, 1976.
Sadagopan, S.,On Ranking the Extreme Points of Convex Polyhedra, Purdue University, MS Thesis, 1977.
McKeown, P. G., Private Communication, 1978.
McKeown, P. G.,A Vertex Ranking Procedure for Solving the Linear Fixed Charge Problem, Operations Research, Vol. 23, No. 6, 1975.
Author information
Authors and Affiliations
Additional information
Communicated by C. T. Leondes
Rights and permissions
About this article
Cite this article
Sadagopan, S., Ravindran, A. A vertex ranking algorithm for the fixed-charge transportation problem. J Optim Theory Appl 37, 221–230 (1982). https://doi.org/10.1007/BF00934768
Issue Date:
DOI: https://doi.org/10.1007/BF00934768