Three dimensional fixed charge bi-criterion indefinite quadratic transportation problem
DOI:
https://doi.org/10.2298/YJOR0401083AKeywords:
three dimensional quadratic transportation problem, cost-time trade-off pairs, fixed charge, bi-criterion indefinite quadratic transportation problemAbstract
The three-dimensional fixed charge transportation problem is an extension of the classical three-dimensional transportation problem in which a fixed cost is incurred for every origin. In the present paper three-dimensional fixed charge bi-criterion indefinite quadratic transportation problem, giving the same priority to cost as well as time, is studied. An algorithm to find the efficient cost-time trade off pairs in a three dimensional fixed charge bi-criterion indefinite quadratic transportation problem is developed. The algorithm is illustrated with the help of a numerical example.References
Ahuja, A., Arora, S.R. (2001) Multi index fixed charge bicriterion transportation problem. Indian Journal of Pure and Applied Mathematics, 32, 5, 739-746
Basu, M., Pal, B.B., Kundu, A. (1994) An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem. Optimization, Berlin, 30, 1, 53-68
Basu, M., Pal, B.B., Kundu, A. (1994) An algorithm for finding the optimum solution of solid fixed-charge transportation problem. 31, 283-291
Bhatia, H.L., Swaroop, K., Puri, M.C. (1976) Time-cost trade-off in a transportation problem. Opsearch, 13, 4, 129-142
Bhatia, H.L., Swaroop, K., Puri, M.C. (1977) A procedure for time minimization transportation problem. Indian Journal of Pure and Applied Mathematics, 8, 8, 920-929
Haley, K. (1962) The solid transportation problem. Operations Research, 448-463
Haley, K.B. (1963) The multi-index problem. Operations Research, 368-379
Hammer, P.L. (1969) Time-minimizing transportation problems. Naval Research Logistics Quarterly, 16, 345-357
Hirsch, W.M., Dantzig, G.B. (1954) Notes on linear programming. Santa Monica, CA, Part XIX: The fixed charge problem, Rand Research Memorandum br. 1383
Kuhn, H., Baumol, W. (1962) An approximate algorithm for the fixed-charges transportation problem. Naval Research Logistics Quarterly, 9, 1-15
Murty, K.G. (1968) Solving the fixed-charge problem by ranking the extreme points. Operations Research, 16, 268-279
Ramakrishnan, C. (1977) A note on the time minimising transportation problem. Opsearch, 14, 3, 207-209
Sadagopan, S., Ravindran, A. (1982) A vertex ranking algorithm for the fixed-charge transportation problem. Journal of Optimization Theory and Applications, 37, 2, 221-230
Sandrock, K. (1988) A simple algorithm for solving small fixed-charge transportation problems. Journal of the Operational Research Society, 39, 467-475
Steinberg, D.I. (1970) The fixed charge problem. Naval Research Logistics Quarterly, 17, 217-235
Szwarc, W. (1971) Some remarks on the time transportation problem. Naval Research Logistics Quarterly, 18, 473-485
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
